Repository navigation
Expand file tree
/
Copy pathList.c
More file actions
225 lines (200 loc) · 4.63 KB
/
Copy pathList.c
File metadata and controls
225 lines (200 loc) · 4.63 KB
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
#include "Prototypes.h"
//#needs Object
/*{
struct ListItemClass_ {
ObjectClass super;
};
struct ListItem_ {
Object super;
ListItem* prev;
ListItem* next;
List* list;
};
struct List_ {
ListItemClass* type;
ListItem* head;
ListItem* tail;
ListItem* atPtr;
int atCtr;
int size;
void* data;
Pool* pool;
};
extern ListItemClass ListItemType;
}*/
ListItemClass ListItemType = {
.super = {
.size = sizeof(ListItem),
.display = NULL,
.equals = Object_equals,
.delete = Object_delete
}
};
inline void List_reset(List* this) {
this->head = NULL;
this->tail = NULL;
this->size = 0;
this->atPtr = NULL;
this->atCtr = 0;
}
List* List_new(ListItemClass* type, void* data) {
List* this = (List*) malloc(sizeof(List));
this->type = type;
this->data = data;
List_reset(this);
this->pool = Pool_new((ObjectClass*)type);
return this;
}
void List_resetIterator(List* this) {
assert(this->head);
this->atPtr = this->head;
this->atCtr = 0;
}
void List_delete(List* this) {
Pool_initiateDestruction(this->pool);
List_prune(this);
Pool_delete(this->pool);
free(this);
}
void List_prune(List* this) {
ListItem* walk = this->head;
while (walk) {
ListItem* save = walk->next;
Msg0(Object, delete, walk);
walk = save;
}
List_reset(this);
}
void List_add(List* this, ListItem* item) {
assert( Call(Object, instanceOf, item, (ObjectClass*)this->type) );
item->next = NULL;
item->list = this;
if (this->tail) {
item->prev = this->tail;
this->tail->next = item;
this->tail = item;
} else {
item->prev = NULL;
this->head = item;
this->tail = item;
this->atPtr = item;
this->atCtr = 0;
}
this->size++;
}
inline ListItem* List_getLast(List* this) {
return this->tail;
}
ListItem* List_get(List* this, int i) {
assert(this->atPtr);
assert(i >= 0 && i < this->size);
if (i == this->atCtr + 1) {
this->atCtr++;
this->atPtr = this->atPtr->next;
return this->atPtr;
}
int diffAt = i - this->atCtr;
int absDiffAt = abs(diffAt);
int diffHead = i;
int diffTail = abs(i - (this->size - 1));
if (absDiffAt < diffHead && absDiffAt < diffTail) {
if (diffAt > 0) {
while (this->atCtr < i) {
this->atPtr = this->atPtr->next;
this->atCtr++;
}
} else if (diffAt < 0) {
while (this->atCtr > i) {
this->atPtr = this->atPtr->prev;
this->atCtr--;
}
}
} else if (diffHead < diffTail) {
this->atCtr = 0;
this->atPtr = this->head;
while (this->atCtr < i) {
this->atPtr = this->atPtr->next;
this->atCtr++;
}
} else {
this->atCtr = this->size - 1;
this->atPtr = this->tail;
while (this->atCtr > i) {
this->atPtr = this->atPtr->prev;
this->atCtr--;
}
}
return this->atPtr;
}
void List_set(List* this, int i, ListItem* item) {
assert( Call(Object, instanceOf, item, (ObjectClass*)this->type) );
assert (i >= 0 && i <= this->size);
if (i == this->size) {
List_add(this, item);
return;
}
ListItem* old = List_get(this, i);
if (old->prev) {
old->prev->next = item;
} else {
this->head = item;
}
if (old->next) {
old->next->prev = item;
} else {
this->tail = item;
}
item->prev = old->prev;
item->next = old->next;
item->list = this;
Msg0(Object, delete, old);
}
void List_remove(List* this, int i) {
assert (i >= 0 && i < this->size);
ListItem* old = List_get(this, i);
if (old->prev) {
old->prev->next = old->next;
} else {
this->head = old->next;
}
if (old->next) {
old->next->prev = old->prev;
} else {
this->tail = old->prev;
}
Msg0(Object, delete, old);
this->size--;
}
inline int List_size(List* this) {
return this->size;
}
void ListItem_init(ListItem* this) {
this->prev = NULL;
this->next = NULL;
this->list = NULL;
}
void ListItem_addAfter(ListItem* this, ListItem* item) {
item->list = this->list;
if (this->next)
this->next->prev = item;
else
this->list->tail = item;
item->prev = this;
item->next = this->next;
this->next = item;
this->list->size++;
List_resetIterator(this->list);
}
void ListItem_remove(ListItem* this) {
if (this->prev)
this->prev->next = this->next;
else
this->list->head = this->next;
if (this->next)
this->next->prev = this->prev;
else
this->list->tail = this->prev;
this->list->size--;
List_resetIterator(this->list);
Msg0(Object, delete, this);
}