15 typedef struct girara_tree_node_data_s
37 return g_try_malloc0(
sizeof(girara_list_t));
79 g_return_if_fail(list);
86 if (list == NULL || list->start == NULL) {
91 g_list_free_full(list->start, list->free);
93 g_list_free(list->start);
112 g_return_if_fail(list != NULL);
114 if (list->cmp != NULL) {
115 list->start = g_list_insert_sorted(list->start, data, list->cmp);
117 list->start = g_list_append(list->start, data);
124 g_return_if_fail(list != NULL);
126 if (list->cmp != NULL) {
129 list->start = g_list_prepend(list->start, data);
136 g_return_if_fail(list != NULL);
137 if (list->start == NULL) {
141 GList* tmp = g_list_find(list->start, data);
146 if (list->free != NULL) {
147 (list->free)(tmp->data);
149 list->start = g_list_delete_link(list->start, tmp);
155 g_return_val_if_fail(list, NULL);
156 g_return_val_if_fail(!list->start || (n < g_list_length(list->start)), NULL);
158 GList* tmp = g_list_nth(list->start, n);
159 g_return_val_if_fail(tmp, NULL);
167 g_return_val_if_fail(list,
false);
172 GList* tmp = g_list_find(list->start, data);
184 g_return_val_if_fail(list && compare, NULL);
185 if (list->start == NULL) {
189 GList* element = g_list_find_custom(list->start, data, compare);
190 if (element == NULL) {
194 return element->data;
198 girara_list_iterator_t*
201 g_return_val_if_fail(list != NULL, NULL);
203 if (list->start == NULL) {
207 girara_list_iterator_t* iter = g_try_malloc0(
sizeof(girara_list_iterator_t));
213 iter->element = list->start;
218 girara_list_iterator_t*
221 g_return_val_if_fail(iter != NULL, NULL);
223 girara_list_iterator_t* iter2 = g_try_malloc0(
sizeof(girara_list_iterator_t));
228 iter2->list = iter->list;
229 iter2->element = iter->element;
233 girara_list_iterator_t*
236 if (!iter || !iter->element) {
240 iter->element = g_list_next(iter->element);
242 if (!iter->element) {
252 return iter && iter->element && g_list_next(iter->element);
255 girara_list_iterator_t*
258 if (!iter || !iter->element) {
262 iter->element = g_list_previous(iter->element);
264 if (!iter->element) {
274 return iter && iter->element && g_list_previous(iter->element);
279 if (iter && iter->element) {
280 GList *el = iter->element;
281 if (iter->list && iter->list->free) {
282 (iter->list->free)(iter->element->data);
285 iter->element = el->next;
286 iter->list->start = g_list_delete_link(iter->list->start, el);
293 return iter && iter->element;
299 g_return_val_if_fail(iter && iter->element, NULL);
301 return iter->element->data;
307 g_return_if_fail(iter && iter->element && iter->list && !iter->list->cmp);
309 if (iter->list->free) {
310 (*iter->list->free)(iter->element->data);
313 iter->element->data = data;
329 g_return_val_if_fail(list, 0);
335 return g_list_length(list->start);
341 g_return_val_if_fail(list != NULL, -1);
343 if (list->start == NULL) {
362 g_return_if_fail(list != NULL);
363 if (list->start == NULL || compare == NULL) {
367 list->start = g_list_sort(list->start, compare);
373 g_return_if_fail(list && list->start && callback);
375 g_list_foreach(list->start, callback, data);
388 if (list->free != other->free) {
389 girara_warning(
"girara_list_merge: merging lists with different free functions!");
402 girara_tree_node_t* node = g_try_malloc0(
sizeof(girara_tree_node_t));
408 if (nodedata == NULL) {
413 nodedata->
data = data;
414 nodedata->
node = node;
415 node->node = g_node_new(nodedata);
417 if (node->node == NULL) {
429 g_return_if_fail(node);
440 g_return_if_fail(node->node);
442 g_return_if_fail(nodedata);
445 (*node->free)(nodedata->
data);
450 GNode* childnode = node->node->children;
454 childnode = childnode->next;
457 g_node_destroy(node->node);
464 g_return_if_fail(parent && child);
465 g_node_append(parent->node, child->node);
471 g_return_val_if_fail(parent, NULL);
473 g_return_val_if_fail(child, NULL);
474 child->free = parent->free;
483 g_return_val_if_fail(node && node->node, NULL);
485 if (!node->node->parent) {
490 g_return_val_if_fail(nodedata, NULL);
492 return nodedata->
node;
498 g_return_val_if_fail(node && node->node, NULL);
500 if (!node->node->parent) {
504 GNode* root = g_node_get_root(node->node);
505 g_return_val_if_fail(root, NULL);
507 g_return_val_if_fail(nodedata, NULL);
509 return nodedata->
node;
515 g_return_val_if_fail(node, NULL);
517 g_return_val_if_fail(list, NULL);
519 GNode* childnode = node->node->children;
523 childnode = childnode->next;
532 g_return_val_if_fail(node && node->node, 0);
534 return g_node_n_children(node->node);
540 g_return_val_if_fail(node && node->node, NULL);
542 g_return_val_if_fail(nodedata, NULL);
544 return nodedata->
data;
550 g_return_if_fail(node && node->node);
552 g_return_if_fail(nodedata);
555 (*node->free)(nodedata->
data);
558 nodedata->
data = data;
void girara_list_remove(girara_list_t *list, void *data)
void * girara_list_nth(girara_list_t *list, size_t n)
void girara_list_sort(girara_list_t *list, girara_compare_function_t compare)
girara_free_function_t free
void girara_list_foreach(girara_list_t *list, girara_list_callback_t callback, void *data)
girara_tree_node_t * girara_node_append_data(girara_tree_node_t *parent, void *data)
girara_tree_node_t * girara_node_get_root(girara_tree_node_t *node)
girara_list_t * girara_node_get_children(girara_tree_node_t *node)
void girara_list_append(girara_list_t *list, void *data)
bool girara_list_iterator_has_next(girara_list_iterator_t *iter)
ssize_t girara_list_position(girara_list_t *list, void *data)
void(* girara_free_function_t)(void *data)
size_t girara_list_size(girara_list_t *list)
girara_list_t * girara_list_new2(girara_free_function_t gfree)
void girara_node_set_data(girara_tree_node_t *node, void *data)
size_t girara_node_get_num_children(girara_tree_node_t *node)
void girara_list_free(girara_list_t *list)
void girara_list_iterator_set(girara_list_iterator_t *iter, void *data)
void * girara_list_find(girara_list_t *list, girara_compare_function_t compare, const void *data)
void girara_list_set_free_function(girara_list_t *list, girara_free_function_t gfree)
int(* girara_compare_function_t)(const void *data1, const void *data2)
bool girara_list_iterator_has_previous(girara_list_iterator_t *iter)
void girara_node_append(girara_tree_node_t *parent, girara_tree_node_t *child)
void girara_node_set_free_function(girara_tree_node_t *node, girara_free_function_t gfree)
girara_tree_node_t * girara_node_new(void *data)
girara_tree_node_t * node
girara_list_t * girara_list_new(void)
void(* girara_list_callback_t)(void *data, void *userdata)
girara_list_t * girara_sorted_list_new(girara_compare_function_t cmp)
void girara_list_iterator_free(girara_list_iterator_t *iter)
girara_compare_function_t cmp
girara_free_function_t free
girara_list_t * girara_sorted_list_new2(girara_compare_function_t cmp, girara_free_function_t gfree)
void girara_list_prepend(girara_list_t *list, void *data)
girara_list_iterator_t * girara_list_iterator_copy(girara_list_iterator_t *iter)
#define girara_warning(...)
girara_tree_node_t * girara_node_get_parent(girara_tree_node_t *node)
bool girara_list_contains(girara_list_t *list, void *data)
void * girara_node_get_data(girara_tree_node_t *node)
girara_list_iterator_t * girara_list_iterator(girara_list_t *list)
void * girara_list_iterator_data(girara_list_iterator_t *iter)
girara_list_iterator_t * girara_list_iterator_previous(girara_list_iterator_t *iter)
girara_list_iterator_t * girara_list_iterator_next(girara_list_iterator_t *iter)
girara_list_t * girara_list_merge(girara_list_t *list, girara_list_t *other)
bool girara_list_iterator_is_valid(girara_list_iterator_t *iter)
void girara_list_clear(girara_list_t *list)
void girara_list_iterator_remove(girara_list_iterator_t *iter)
void girara_node_free(girara_tree_node_t *node)
#define GIRARA_LIST_FOREACH_END(list, type, iter, data)
#define GIRARA_LIST_FOREACH(list, type, iter, data)