| Index: fusl/src/search/insque.c
|
| diff --git a/fusl/src/search/insque.c b/fusl/src/search/insque.c
|
| index b7475d84f31eb442550e5a4197d473ff36bda755..e055a3e6adef54f2fb7b39386f8d1abb5f407bac 100644
|
| --- a/fusl/src/search/insque.c
|
| +++ b/fusl/src/search/insque.c
|
| @@ -1,32 +1,30 @@
|
| #include <search.h>
|
|
|
| struct node {
|
| - struct node *next;
|
| - struct node *prev;
|
| + struct node* next;
|
| + struct node* prev;
|
| };
|
|
|
| -void insque(void *element, void *pred)
|
| -{
|
| - struct node *e = element;
|
| - struct node *p = pred;
|
| +void insque(void* element, void* pred) {
|
| + struct node* e = element;
|
| + struct node* p = pred;
|
|
|
| - if (!p) {
|
| - e->next = e->prev = 0;
|
| - return;
|
| - }
|
| - e->next = p->next;
|
| - e->prev = p;
|
| - p->next = e;
|
| - if (e->next)
|
| - e->next->prev = e;
|
| + if (!p) {
|
| + e->next = e->prev = 0;
|
| + return;
|
| + }
|
| + e->next = p->next;
|
| + e->prev = p;
|
| + p->next = e;
|
| + if (e->next)
|
| + e->next->prev = e;
|
| }
|
|
|
| -void remque(void *element)
|
| -{
|
| - struct node *e = element;
|
| +void remque(void* element) {
|
| + struct node* e = element;
|
|
|
| - if (e->next)
|
| - e->next->prev = e->prev;
|
| - if (e->prev)
|
| - e->prev->next = e->next;
|
| + if (e->next)
|
| + e->next->prev = e->prev;
|
| + if (e->prev)
|
| + e->prev->next = e->next;
|
| }
|
|
|