15 typedef struct girara_tree_node_data_s
37 girara_list_t* list = g_malloc0(
sizeof(girara_list_t));
81 g_return_if_fail(list);
88 if (list == NULL || list->start == NULL) {
93 #if (GLIB_MAJOR_VERSION >= 2) && (GLIB_MINOR_VERSION >= 28)
94 g_list_free_full(list->start, list->free);
96 g_list_foreach(list->start, (GFunc)list->free, NULL);
97 g_list_free(list->start);
100 g_list_free(list->start);
119 g_return_if_fail(list != NULL);
121 if (list->cmp != NULL) {
122 list->start = g_list_insert_sorted(list->start, data, list->cmp);
124 list->start = g_list_append(list->start, data);
131 g_return_if_fail(list != NULL);
133 if (list->cmp != NULL) {
136 list->start = g_list_prepend(list->start, data);
143 g_return_if_fail(list != NULL);
144 if (list->start == NULL) {
148 GList* tmp = g_list_find(list->start, data);
153 if (list->free != NULL) {
154 (list->free)(tmp->data);
156 list->start = g_list_delete_link(list->start, tmp);
162 g_return_val_if_fail(list, NULL);
163 g_return_val_if_fail(!list->start || (n < g_list_length(list->start)), NULL);
165 GList* tmp = g_list_nth(list->start, n);
166 g_return_val_if_fail(tmp, NULL);
174 g_return_val_if_fail(list,
false);
179 GList* tmp = g_list_find(list->start, data);
191 g_return_val_if_fail(list && compare, NULL);
192 if (list->start == NULL) {
196 GList* element = g_list_find_custom(list->start, data, compare);
197 if (element == NULL) {
201 return element->data;
205 girara_list_iterator_t*
208 g_return_val_if_fail(list, NULL);
214 girara_list_iterator_t* iter = g_malloc0(
sizeof(girara_list_iterator_t));
216 iter->element = list->start;
221 girara_list_iterator_t*
223 g_return_val_if_fail(iter, NULL);
224 girara_list_iterator_t* iter2 = g_malloc0(
sizeof(girara_list_iterator_t));
226 iter2->list = iter->list;
227 iter2->element = iter->element;
231 girara_list_iterator_t*
234 if (!iter || !iter->element) {
238 iter->element = g_list_next(iter->element);
240 if (!iter->element) {
250 return iter && iter->element && g_list_next(iter->element);
253 girara_list_iterator_t*
256 if (!iter || !iter->element) {
260 iter->element = g_list_previous(iter->element);
262 if (!iter->element) {
272 return iter && iter->element && g_list_previous(iter->element);
277 if (iter && iter->element) {
278 GList *el = iter->element;
279 if (iter->list && iter->list->free) {
280 (iter->list->free)(iter->element->data);
283 iter->element = el->next;
284 iter->list->start = g_list_delete_link(iter->list->start, el);
291 return iter && iter->element;
297 g_return_val_if_fail(iter && iter->element, NULL);
299 return iter->element->data;
305 g_return_if_fail(iter && iter->element && iter->list && !iter->list->cmp);
307 if (iter->list->free) {
308 (*iter->list->free)(iter->element->data);
311 iter->element->data = data;
327 g_return_val_if_fail(list, 0);
333 return g_list_length(list->start);
339 g_return_val_if_fail(list != NULL, -1);
341 if (list->start == NULL) {
360 g_return_if_fail(list != NULL);
361 if (list->start == NULL || compare == NULL) {
365 list->start = g_list_sort(list->start, compare);
371 g_return_if_fail(list && list->start && callback);
373 g_list_foreach(list->start, callback, data);
386 if (list->free != other->free) {
387 girara_warning(
"girara_list_merge: merging lists with different free functions!");
400 girara_tree_node_t* node = g_malloc0(
sizeof(girara_tree_node_t));
403 nodedata->
data = data;
404 nodedata->
node = node;
405 node->node = g_node_new(nodedata);
419 g_return_if_fail(node);
430 g_return_if_fail(node->node);
432 g_return_if_fail(nodedata);
435 (*node->free)(nodedata->
data);
440 GNode* childnode = node->node->children;
444 childnode = childnode->next;
447 g_node_destroy(node->node);
454 g_return_if_fail(parent && child);
455 g_node_append(parent->node, child->node);
461 g_return_val_if_fail(parent, NULL);
463 g_return_val_if_fail(child, NULL);
464 child->free = parent->free;
473 g_return_val_if_fail(node && node->node, NULL);
475 if (!node->node->parent) {
480 g_return_val_if_fail(nodedata, NULL);
482 return nodedata->
node;
488 g_return_val_if_fail(node && node->node, NULL);
490 if (!node->node->parent) {
494 GNode* root = g_node_get_root(node->node);
495 g_return_val_if_fail(root, NULL);
497 g_return_val_if_fail(nodedata, NULL);
499 return nodedata->
node;
505 g_return_val_if_fail(node, NULL);
507 g_return_val_if_fail(list, NULL);
509 GNode* childnode = node->node->children;
513 childnode = childnode->next;
522 g_return_val_if_fail(node && node->node, 0);
524 return g_node_n_children(node->node);
530 g_return_val_if_fail(node && node->node, NULL);
532 g_return_val_if_fail(nodedata, NULL);
534 return nodedata->
data;
540 g_return_if_fail(node && node->node);
542 g_return_if_fail(nodedata);
545 (*node->free)(nodedata->
data);
548 nodedata->
data = data;