1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
19 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
20 * file for a list of people on the GLib Team. See the ChangeLog
21 * files for a list of changes. These files are distributed with
22 * GLib at ftp://ftp.gtk.org/pub/gtk/.
33 #include "gtestutils.h"
37 * SECTION:linked_lists_single
38 * @title: Singly-Linked Lists
39 * @short_description: linked lists that can be iterated in one direction
41 * The #GSList structure and its associated functions provide a
42 * standard singly-linked list data structure.
44 * Each element in the list contains a piece of data, together with a
45 * pointer which links to the next element in the list. Using this
46 * pointer it is possible to move through the list in one direction
47 * only (unlike the [double-linked lists][glib-Doubly-Linked-Lists],
48 * which allow movement in both directions).
50 * The data contained in each element can be either integer values, by
51 * using one of the [Type Conversion Macros][glib-Type-Conversion-Macros],
52 * or simply pointers to any type of data.
54 * List elements are allocated from the [slice allocator][glib-Memory-Slices],
55 * which is more efficient than allocating elements individually.
57 * Note that most of the #GSList functions expect to be passed a
58 * pointer to the first element in the list. The functions which insert
59 * elements return the new start of the list, which may have changed.
61 * There is no function to create a #GSList. %NULL is considered to be
62 * the empty list so you simply set a #GSList* to %NULL.
64 * To add elements, use g_slist_append(), g_slist_prepend(),
65 * g_slist_insert() and g_slist_insert_sorted().
67 * To remove elements, use g_slist_remove().
69 * To find elements in the list use g_slist_last(), g_slist_next(),
70 * g_slist_nth(), g_slist_nth_data(), g_slist_find() and
71 * g_slist_find_custom().
73 * To find the index of an element use g_slist_position() and
76 * To call a function for each element in the list use
79 * To free the entire list, use g_slist_free().
84 * @data: holds the element's data, which can be a pointer to any kind
85 * of data, or any integer value using the
86 * [Type Conversion Macros][glib-Type-Conversion-Macros]
87 * @next: contains the link to the next element in the list.
89 * The #GSList struct is used for each element in the singly-linked
95 * @slist: an element in a #GSList.
97 * A convenience macro to get the next element in a #GSList.
98 * Note that it is considered perfectly acceptable to access
99 * @slist->next directly.
101 * Returns: the next element, or %NULL if there are no more elements.
104 #define _g_slist_alloc0() g_slice_new0 (GSList)
105 #define _g_slist_alloc() g_slice_new (GSList)
106 #define _g_slist_free1(slist) g_slice_free (GSList, slist)
111 * Allocates space for one #GSList element. It is called by the
112 * g_slist_append(), g_slist_prepend(), g_slist_insert() and
113 * g_slist_insert_sorted() functions and so is rarely used on its own.
115 * Returns: a pointer to the newly-allocated #GSList element.
120 return _g_slist_alloc0 ();
127 * Frees all of the memory used by a #GSList.
128 * The freed elements are returned to the slice allocator.
130 * If list elements contain dynamically-allocated memory,
131 * you should either use g_slist_free_full() or free them manually
135 g_slist_free (GSList *list)
137 g_slice_free_chain (GSList, list, next);
142 * @list: a #GSList element
144 * Frees one #GSList element.
145 * It is usually used after g_slist_remove_link().
150 * A macro which does the same as g_slist_free_1().
155 g_slist_free_1 (GSList *list)
157 _g_slist_free1 (list);
162 * @list: a pointer to a #GSList
163 * @free_func: the function to be called to free each element's data
165 * Convenience method, which frees all the memory used by a #GSList, and
166 * calls the specified destroy function on every element's data.
171 g_slist_free_full (GSList *list,
172 GDestroyNotify free_func)
174 g_slist_foreach (list, (GFunc) free_func, NULL);
181 * @data: the data for the new element
183 * Adds a new element on to the end of the list.
185 * The return value is the new start of the list, which may
186 * have changed, so make sure you store the new value.
188 * Note that g_slist_append() has to traverse the entire list
189 * to find the end, which is inefficient when adding multiple
190 * elements. A common idiom to avoid the inefficiency is to prepend
191 * the elements and reverse the list when all elements have been added.
193 * |[<!-- language="C" -->
194 * // Notice that these are initialized to the empty list.
195 * GSList *list = NULL, *number_list = NULL;
197 * // This is a list of strings.
198 * list = g_slist_append (list, "first");
199 * list = g_slist_append (list, "second");
201 * // This is a list of integers.
202 * number_list = g_slist_append (number_list, GINT_TO_POINTER (27));
203 * number_list = g_slist_append (number_list, GINT_TO_POINTER (14));
206 * Returns: the new start of the #GSList
209 g_slist_append (GSList *list,
215 new_list = _g_slist_alloc ();
216 new_list->data = data;
217 new_list->next = NULL;
221 last = g_slist_last (list);
222 /* g_assert (last != NULL); */
223 last->next = new_list;
234 * @data: the data for the new element
236 * Adds a new element on to the start of the list.
238 * The return value is the new start of the list, which
239 * may have changed, so make sure you store the new value.
241 * |[<!-- language="C" -->
242 * // Notice that it is initialized to the empty list.
243 * GSList *list = NULL;
244 * list = g_slist_prepend (list, "last");
245 * list = g_slist_prepend (list, "first");
248 * Returns: the new start of the #GSList
251 g_slist_prepend (GSList *list,
256 new_list = _g_slist_alloc ();
257 new_list->data = data;
258 new_list->next = list;
266 * @data: the data for the new element
267 * @position: the position to insert the element.
268 * If this is negative, or is larger than the number
269 * of elements in the list, the new element is added on
270 * to the end of the list.
272 * Inserts a new element into the list at the given position.
274 * Returns: the new start of the #GSList
277 g_slist_insert (GSList *list,
286 return g_slist_append (list, data);
287 else if (position == 0)
288 return g_slist_prepend (list, data);
290 new_list = _g_slist_alloc ();
291 new_list->data = data;
295 new_list->next = NULL;
302 while ((position-- > 0) && tmp_list)
304 prev_list = tmp_list;
305 tmp_list = tmp_list->next;
308 new_list->next = prev_list->next;
309 prev_list->next = new_list;
315 * g_slist_insert_before:
317 * @sibling: node to insert @data before
318 * @data: data to put in the newly-inserted node
320 * Inserts a node before @sibling containing @data.
322 * Returns: the new head of the list.
325 g_slist_insert_before (GSList *slist,
331 slist = _g_slist_alloc ();
334 g_return_val_if_fail (sibling == NULL, slist);
339 GSList *node, *last = NULL;
341 for (node = slist; node; last = node, node = last->next)
346 node = _g_slist_alloc ();
354 node = _g_slist_alloc ();
356 node->next = last->next;
367 * @list2: the #GSList to add to the end of the first #GSList
369 * Adds the second #GSList onto the end of the first #GSList.
370 * Note that the elements of the second #GSList are not copied.
371 * They are used directly.
373 * Returns: the start of the new #GSList
376 g_slist_concat (GSList *list1, GSList *list2)
381 g_slist_last (list1)->next = list2;
390 _g_slist_remove_data (GSList *list,
395 GSList **previous_ptr = &list;
397 while (*previous_ptr)
400 if (tmp->data == data)
402 *previous_ptr = tmp->next;
403 g_slist_free_1 (tmp);
409 previous_ptr = &tmp->next;
418 * @data: the data of the element to remove
420 * Removes an element from a #GSList.
421 * If two elements contain the same data, only the first is removed.
422 * If none of the elements contain the data, the #GSList is unchanged.
424 * Returns: the new start of the #GSList
427 g_slist_remove (GSList *list,
430 return _g_slist_remove_data (list, data, FALSE);
434 * g_slist_remove_all:
436 * @data: data to remove
438 * Removes all list nodes with data equal to @data.
439 * Returns the new head of the list. Contrast with
440 * g_slist_remove() which removes only the first node
441 * matching the given data.
443 * Returns: new head of @list
446 g_slist_remove_all (GSList *list,
449 return _g_slist_remove_data (list, data, TRUE);
452 static inline GSList*
453 _g_slist_remove_link (GSList *list,
457 GSList **previous_ptr = &list;
459 while (*previous_ptr)
464 *previous_ptr = tmp->next;
469 previous_ptr = &tmp->next;
476 * g_slist_remove_link:
478 * @link_: an element in the #GSList
480 * Removes an element from a #GSList, without
481 * freeing the element. The removed element's next
482 * link is set to %NULL, so that it becomes a
483 * self-contained list with one element.
485 * Removing arbitrary nodes from a singly-linked list
486 * requires time that is proportional to the length of the list
487 * (ie. O(n)). If you find yourself using g_slist_remove_link()
488 * frequently, you should consider a different data structure,
489 * such as the doubly-linked #GList.
491 * Returns: the new start of the #GSList, without the element
494 g_slist_remove_link (GSList *list,
497 return _g_slist_remove_link (list, link_);
501 * g_slist_delete_link:
503 * @link_: node to delete
505 * Removes the node link_ from the list and frees it.
506 * Compare this to g_slist_remove_link() which removes the node
507 * without freeing it.
509 * Removing arbitrary nodes from a singly-linked list requires time
510 * that is proportional to the length of the list (ie. O(n)). If you
511 * find yourself using g_slist_delete_link() frequently, you should
512 * consider a different data structure, such as the doubly-linked
515 * Returns: the new head of @list
518 g_slist_delete_link (GSList *list,
521 list = _g_slist_remove_link (list, link_);
522 _g_slist_free1 (link_);
533 * Note that this is a "shallow" copy. If the list elements
534 * consist of pointers to data, the pointers are copied but
535 * the actual data isn't. See g_slist_copy_deep() if you need
536 * to copy the data as well.
538 * Returns: a copy of @list
541 g_slist_copy (GSList *list)
543 return g_slist_copy_deep (list, NULL, NULL);
549 * @func: a copy function used to copy every element in the list
550 * @user_data: user data passed to the copy function @func, or #NULL
552 * Makes a full (deep) copy of a #GSList.
554 * In contrast with g_slist_copy(), this function uses @func to make a copy of
555 * each list element, in addition to copying the list container itself.
557 * @func, as a #GCopyFunc, takes two arguments, the data to be copied and a user
558 * pointer. It's safe to pass #NULL as user_data, if the copy function takes only
561 * For instance, if @list holds a list of GObjects, you can do:
562 * |[<!-- language="C" -->
563 * another_list = g_slist_copy_deep (list, (GCopyFunc) g_object_ref, NULL);
566 * And, to entirely free the new list, you could do:
567 * |[<!-- language="C" -->
568 * g_slist_free_full (another_list, g_object_unref);
571 * Returns: a full copy of @list, use #g_slist_free_full to free it
576 g_slist_copy_deep (GSList *list, GCopyFunc func, gpointer user_data)
578 GSList *new_list = NULL;
584 new_list = _g_slist_alloc ();
586 new_list->data = func (list->data, user_data);
588 new_list->data = list->data;
593 last->next = _g_slist_alloc ();
596 last->data = func (list->data, user_data);
598 last->data = list->data;
611 * Reverses a #GSList.
613 * Returns: the start of the reversed #GSList
616 g_slist_reverse (GSList *list)
622 GSList *next = list->next;
636 * @n: the position of the element, counting from 0
638 * Gets the element at the given position in a #GSList.
640 * Returns: the element, or %NULL if the position is off
641 * the end of the #GSList
644 g_slist_nth (GSList *list,
647 while (n-- > 0 && list)
656 * @n: the position of the element
658 * Gets the data of the element at the given position.
660 * Returns: the element's data, or %NULL if the position
661 * is off the end of the #GSList
664 g_slist_nth_data (GSList *list,
667 while (n-- > 0 && list)
670 return list ? list->data : NULL;
676 * @data: the element data to find
678 * Finds the element in a #GSList which
679 * contains the given data.
681 * Returns: the found #GSList element,
682 * or %NULL if it is not found
685 g_slist_find (GSList *list,
690 if (list->data == data)
700 * g_slist_find_custom:
702 * @data: user data passed to the function
703 * @func: the function to call for each element.
704 * It should return 0 when the desired element is found
706 * Finds an element in a #GSList, using a supplied function to
707 * find the desired element. It iterates over the list, calling
708 * the given function which should return 0 when the desired
709 * element is found. The function takes two #gconstpointer arguments,
710 * the #GSList element's data as the first argument and the
713 * Returns: the found #GSList element, or %NULL if it is not found
716 g_slist_find_custom (GSList *list,
720 g_return_val_if_fail (func != NULL, list);
724 if (! func (list->data, data))
735 * @llink: an element in the #GSList
737 * Gets the position of the given element
738 * in the #GSList (starting from 0).
740 * Returns: the position of the element in the #GSList,
741 * or -1 if the element is not found
744 g_slist_position (GSList *list,
764 * @data: the data to find
766 * Gets the position of the element containing
767 * the given data (starting from 0).
769 * Returns: the index of the element containing the data,
770 * or -1 if the data is not found
773 g_slist_index (GSList *list,
781 if (list->data == data)
794 * Gets the last element in a #GSList.
796 * This function iterates over the whole list.
798 * Returns: the last element in the #GSList,
799 * or %NULL if the #GSList has no elements
802 g_slist_last (GSList *list)
817 * Gets the number of elements in a #GSList.
819 * This function iterates over the whole list to
820 * count its elements. To check whether the list is non-empty, it is faster to
821 * check @list against %NULL.
823 * Returns: the number of elements in the #GSList
826 g_slist_length (GSList *list)
843 * @func: the function to call with each element's data
844 * @user_data: user data to pass to the function
846 * Calls a function for each element of a #GSList.
849 g_slist_foreach (GSList *list,
855 GSList *next = list->next;
856 (*func) (list->data, user_data);
862 g_slist_insert_sorted_real (GSList *list,
867 GSList *tmp_list = list;
868 GSList *prev_list = NULL;
872 g_return_val_if_fail (func != NULL, list);
876 new_list = _g_slist_alloc ();
877 new_list->data = data;
878 new_list->next = NULL;
882 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
884 while ((tmp_list->next) && (cmp > 0))
886 prev_list = tmp_list;
887 tmp_list = tmp_list->next;
889 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
892 new_list = _g_slist_alloc ();
893 new_list->data = data;
895 if ((!tmp_list->next) && (cmp > 0))
897 tmp_list->next = new_list;
898 new_list->next = NULL;
904 prev_list->next = new_list;
905 new_list->next = tmp_list;
910 new_list->next = list;
916 * g_slist_insert_sorted:
918 * @data: the data for the new element
919 * @func: the function to compare elements in the list.
920 * It should return a number > 0 if the first parameter
921 * comes after the second parameter in the sort order.
923 * Inserts a new element into the list, using the given
924 * comparison function to determine its position.
926 * Returns: the new start of the #GSList
929 g_slist_insert_sorted (GSList *list,
933 return g_slist_insert_sorted_real (list, data, (GFunc) func, NULL);
937 * g_slist_insert_sorted_with_data:
939 * @data: the data for the new element
940 * @func: the function to compare elements in the list.
941 * It should return a number > 0 if the first parameter
942 * comes after the second parameter in the sort order.
943 * @user_data: data to pass to comparison function
945 * Inserts a new element into the list, using the given
946 * comparison function to determine its position.
948 * Returns: the new start of the #GSList
953 g_slist_insert_sorted_with_data (GSList *list,
955 GCompareDataFunc func,
958 return g_slist_insert_sorted_real (list, data, (GFunc) func, user_data);
962 g_slist_sort_merge (GSList *l1,
974 cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data);
987 l->next= l1 ? l1 : l2;
993 g_slist_sort_real (GSList *list,
1007 while ((l2 = l2->next) != NULL)
1009 if ((l2 = l2->next) == NULL)
1016 return g_slist_sort_merge (g_slist_sort_real (list, compare_func, user_data),
1017 g_slist_sort_real (l2, compare_func, user_data),
1025 * @compare_func: the comparison function used to sort the #GSList.
1026 * This function is passed the data from 2 elements of the #GSList
1027 * and should return 0 if they are equal, a negative value if the
1028 * first element comes before the second, or a positive value if
1029 * the first element comes after the second.
1031 * Sorts a #GSList using the given comparison function.
1033 * Returns: the start of the sorted #GSList
1036 g_slist_sort (GSList *list,
1037 GCompareFunc compare_func)
1039 return g_slist_sort_real (list, (GFunc) compare_func, NULL);
1043 * g_slist_sort_with_data:
1045 * @compare_func: comparison function
1046 * @user_data: data to pass to comparison function
1048 * Like g_slist_sort(), but the sort function accepts a user data argument.
1050 * Returns: new head of the list
1053 g_slist_sort_with_data (GSList *list,
1054 GCompareDataFunc compare_func,
1057 return g_slist_sort_real (list, (GFunc) compare_func, user_data);