-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlist.c
172 lines (147 loc) · 3.02 KB
/
list.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include "list.h"
#include "tools.h"
#ifdef DEBUG
#include <assert.h>
#endif
void sort(ArrayList *list, int (*cmp)(const void *, const void *)) {
unsigned int i = 0;
unsigned int size = getSize(list);
if (size == 0) {
return;
}
for (i = 0; i < size; i++) {
foreach(list) {
object *next = getNext(list, list->obj);
if (next != NULL) {
if (cmp(list->obj, next) > 0) {
swap(list->obj, next);
}
}
}
}
}
void add(ArrayList *list, object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
TAILQ_INSERT_TAIL(list->head, obj, entries);
}
void addOnTop(ArrayList *list, object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
TAILQ_INSERT_HEAD(list->head, obj, entries);
}
void addBefore(ArrayList *list, object *base, object *new) {
#ifdef DEBUG
assert(base != NULL && new != NULL);
#endif
TAILQ_INSERT_BEFORE(base, new, entries);
}
void addAfter(ArrayList *list, object *base, object *new) {
#ifdef DEBUG
assert(base != NULL && new != NULL);
#endif
TAILQ_INSERT_AFTER(list->head, base, new, entries);
}
void rm(ArrayList *list, object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
TAILQ_REMOVE(list->head, obj, entries);
}
object *get(ArrayList *list, unsigned int i) {
foreach (list) {
if (list->obj->id == i) {
return list->obj;
}
}
return NULL;
}
object *getFirst(ArrayList *list) {
return TAILQ_FIRST(list->head);
}
object *getLast(ArrayList *list) {
return TAILQ_LAST(list->head, list_head);
}
object *getPrev(ArrayList *list, object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
object *prev;
prev = TAILQ_PREV(obj, list_head, entries);
return prev;
}
object *getNext(ArrayList *list, object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
object *next;
next = TAILQ_NEXT(obj, entries);
return next;
}
void setPrev(ArrayList *list, object *base, object *obj) {
#ifdef DEBUG
assert(base != NULL && obj != NULL);
#endif
object *prev = getPrev(list, base);
if (prev != NULL) {
set(prev, obj);
}
}
void setNext(ArrayList *list, object *base, object *en) {
#ifdef DEBUG
assert(base != NULL && en != NULL);
#endif
object *next = getNext(list, base);
if (next != NULL) {
set(next, en);
}
}
unsigned int getId(object *obj) {
#ifdef DEBUG
assert(obj != NULL);
#endif
return obj->id;
}
unsigned int getSize(ArrayList *list) {
unsigned int size = 0;
foreach (list) {
size++;
}
return size;
}
int isEmpty(ArrayList *list) {
return TAILQ_EMPTY(list->head);
}
void swap(object *first, object *second) {
#ifdef DEBUG
assert(first != NULL && second != NULL);
#endif
if (first->id != second->id) {
object *temp = NULL;
temp = set(temp, first);
first = set(first, second);
second = set(second, temp);
free(temp);
temp = NULL;
}
}
void swapNext(ArrayList *list, object *base) {
#ifdef DEBUG
assert(base != NULL);
#endif
object *next = getNext(list, base);
if (next != NULL) {
swap(base, next);
}
}
void swapPrev(ArrayList *list, object *base) {
#ifdef DEBUG
assert(base != NULL);
#endif
object *prev = getPrev(list, base);
if (prev != NULL) {
swap(base, prev);
}
}