OLD | NEW |
1 #include <search.h> | 1 #include <search.h> |
2 | 2 |
3 struct node { | 3 struct node { |
4 » struct node *next; | 4 struct node* next; |
5 » struct node *prev; | 5 struct node* prev; |
6 }; | 6 }; |
7 | 7 |
8 void insque(void *element, void *pred) | 8 void insque(void* element, void* pred) { |
9 { | 9 struct node* e = element; |
10 » struct node *e = element; | 10 struct node* p = pred; |
11 » struct node *p = pred; | |
12 | 11 |
13 » if (!p) { | 12 if (!p) { |
14 » » e->next = e->prev = 0; | 13 e->next = e->prev = 0; |
15 » » return; | 14 return; |
16 » } | 15 } |
17 » e->next = p->next; | 16 e->next = p->next; |
18 » e->prev = p; | 17 e->prev = p; |
19 » p->next = e; | 18 p->next = e; |
20 » if (e->next) | 19 if (e->next) |
21 » » e->next->prev = e; | 20 e->next->prev = e; |
22 } | 21 } |
23 | 22 |
24 void remque(void *element) | 23 void remque(void* element) { |
25 { | 24 struct node* e = element; |
26 » struct node *e = element; | |
27 | 25 |
28 » if (e->next) | 26 if (e->next) |
29 » » e->next->prev = e->prev; | 27 e->next->prev = e->prev; |
30 » if (e->prev) | 28 if (e->prev) |
31 » » e->prev->next = e->next; | 29 e->prev->next = e->next; |
32 } | 30 } |
OLD | NEW |