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
|
#include <stdio.h>
#include <glib.h>
#include "elist.h"
GEList* g_elist_new()
{
GEList *list = g_malloc(sizeof(GEList));
list->last = NULL;
list->first = NULL;
list->length = 0;
return list;
}
void g_elist_free (GEList *list)
{
g_list_free(list->first);
g_free(list);
}
void g_elist_free_data (GEList *list)
{
GList *next;
GList *p = list->first;
while (p) {
next = p->next;
g_free(p->data);
g_list_free_1(p);
p = next;
}
g_free(list);
}
void g_elist_append (GEList *list, gpointer data)
{
GList *new_node = g_list_alloc();
new_node->data = data;
new_node->next = NULL;
new_node->prev = list->last;
if (list->last != NULL)
list->last->next = new_node;
list->last = new_node;
if (list->first == NULL)
list->first = new_node;
list->length++;
}
void g_elist_prepend (GEList *list, gpointer data)
{
list->first = g_list_prepend(list->first, data);
if (list->last == NULL)
list->last = list->first;
list->length++;
}
void g_elist_insert (GEList *list, gpointer data, gint position)
{
if ((position < 0) || (position >= list->length))
g_elist_append(list, data);
else {
list->first = g_list_insert(list->first, data, position);
if (list->last == NULL)
list->last = list->first;
list->length++;
}
}
void g_elist_insert_sorted (GEList *list, gpointer data, GCompareFunc func)
{
list->first = g_list_insert_sorted(list->first, data, func);
if (list->last == NULL)
list->last = list->first;
else if (list->last->next != NULL)
list->last = list->last->next;
list->length++;
}
void g_elist_clear (GEList *list)
{
g_list_free(list->first);
list->first = NULL;
list->last = NULL;
list->length = 0;
}
void g_elist_remove (GEList *list, gpointer data)
{
GList *llink = g_list_find(list->first, data);
if (llink != NULL) {
g_elist_remove_link(list, llink);
g_list_free_1(llink);
}
}
void g_elist_remove_link (GEList *list, GList *llink)
{
GList *aux = list->first;
if (llink == list->first)
list->first = list->first->next;
if (llink == list->last)
list->last = list->last->prev;
g_list_remove_link(aux, llink);
list->length--;
}
gpointer g_elist_extract (GEList *list, GList *llink)
{
gpointer result = llink->data;
g_elist_remove_link(list, llink);
g_list_free_1(llink);
return result;
}
GEList* g_elist_concat (GEList *list1, GEList *list2)
{
if (list2->length > 0) {
if (list1->length == 0) {
list1->first = list2->first;
} else {
list1->last->next = list2->first;
list2->first->prev = list1->last;
}
list1->last = list2->last;
list1->length += list2->length;
}
g_free(list2);
return list1;
}
GEList* g_elist_copy (GEList *list)
{
GEList *new_list = g_elist_new();
GList *new_node, *last_node, *src_node;
src_node = list->first;
last_node = NULL;
new_node = NULL;
while (src_node) {
new_node = g_list_alloc();
new_node->data = src_node->data;
new_node->next = NULL;
new_node->prev = last_node;
if (last_node != NULL)
last_node->next = new_node;
else
new_list->first = new_node;
last_node = new_node;
src_node = src_node->next;
}
new_list->last = new_node;
new_list->length = list->length;
return new_list;
}
void g_elist_reverse (GEList *list)
{
GList *aux;
aux = list->first;
list->first = g_list_reverse(list->first);
list->last = aux;
}
void g_elist_sort (GEList *list, GCompareFunc compare_func)
{
GList *aux = list->last;
list->first = g_list_sort(list->first, compare_func);
list->last = g_list_last(aux); /* wish we could avoid this... */
}
/*
* the following exist mostly for debugging purposes
*/
void g_elist_print(GEList *list)
{
GList *iter;
for (iter = g_elist_first(list); iter; iter = iter->next)
printf("0x%08X\n", (unsigned int)iter->data);
}
void g_elist_print_str(GEList *list)
{
GList *iter;
for (iter = g_elist_first(list); iter; iter = iter->next)
printf("%s\n", (char *)iter->data);
}
|
