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 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, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
35 #include "gtestutils.h"
39 * SECTION:linked_lists_single
40 * @title: Singly-Linked Lists
41 * @short_description: linked lists that can be iterated in one direction
43 * The #GSList structure and its associated functions provide a
44 * standard singly-linked list data structure.
46 * Each element in the list contains a piece of data, together with a
47 * pointer which links to the next element in the list. Using this
48 * pointer it is possible to move through the list in one direction
49 * only (unlike the <link
50 * linkend="glib-Doubly-Linked-Lists">Doubly-Linked Lists</link> which
51 * allow movement in both directions).
53 * The data contained in each element can be either integer values, by
54 * using one of the <link linkend="glib-Type-Conversion-Macros">Type
55 * Conversion Macros</link>, or simply pointers to any type of data.
57 * List elements are allocated from the <link
58 * linkend="glib-Memory-Slices">slice allocator</link>, which is more
59 * efficient than allocating elements individually.
61 * Note that most of the #GSList functions expect to be passed a
62 * pointer to the first element in the list. The functions which insert
63 * elements return the new start of the list, which may have changed.
65 * There is no function to create a #GSList. %NULL is considered to be
66 * the empty list so you simply set a #GSList* to %NULL.
68 * To add elements, use g_slist_append(), g_slist_prepend(),
69 * g_slist_insert() and g_slist_insert_sorted().
71 * To remove elements, use g_slist_remove().
73 * To find elements in the list use g_slist_last(), g_slist_next(),
74 * g_slist_nth(), g_slist_nth_data(), g_slist_find() and
75 * g_slist_find_custom().
77 * To find the index of an element use g_slist_position() and
80 * To call a function for each element in the list use
83 * To free the entire list, use g_slist_free().
88 * @data: holds the element's data, which can be a pointer to any kind
89 * of data, or any integer value using the <link
90 * linkend="glib-Type-Conversion-Macros">Type Conversion
92 * @next: contains the link to the next element in the list.
94 * The #GSList struct is used for each element in the singly-linked
100 * @slist: an element in a #GSList.
101 * @Returns: the next element, or %NULL if there are no more elements.
103 * A convenience macro to get the next element in a #GSList.
106 #define _g_slist_alloc0() g_slice_new0 (GSList)
107 #define _g_slist_alloc() g_slice_new (GSList)
108 #define _g_slist_free1(slist) g_slice_free (GSList, slist)
112 * @Returns: a pointer to the newly-allocated #GSList element.
114 * Allocates space for one #GSList element. It is called by the
115 * g_slist_append(), g_slist_prepend(), g_slist_insert() and
116 * g_slist_insert_sorted() functions and so is rarely used on its own.
121 return _g_slist_alloc0 ();
128 * Frees all of the memory used by a #GSList.
129 * The freed elements are returned to the slice allocator.
132 * If list elements contain dynamically-allocated memory,
133 * you should either use g_slist_free_full() or free them manually
138 g_slist_free (GSList *list)
140 g_slice_free_chain (GSList, list, next);
145 * @list: a #GSList element
147 * Frees one #GSList element.
148 * It is usually used after g_slist_remove_link().
153 * A macro which does the same as g_slist_free_1().
158 g_slist_free_1 (GSList *list)
160 _g_slist_free1 (list);
165 * @list: a pointer to a #GSList
166 * @free_func: the function to be called to free each element's data
168 * Convenience method, which frees all the memory used by a #GSList, and
169 * calls the specified destroy function on every element's data.
174 g_slist_free_full (GSList *list,
175 GDestroyNotify free_func)
177 g_slist_foreach (list, (GFunc) free_func, NULL);
184 * @data: the data for the new element
186 * Adds a new element on to the end of the list.
189 * The return value is the new start of the list, which may
190 * have changed, so make sure you store the new value.
194 * Note that g_slist_append() has to traverse the entire list
195 * to find the end, which is inefficient when adding multiple
196 * elements. A common idiom to avoid the inefficiency is to prepend
197 * the elements and reverse the list when all elements have been added.
201 * /* Notice that these are initialized to the empty list. */
202 * GSList *list = NULL, *number_list = NULL;
204 * /* This is a list of strings. */
205 * list = g_slist_append (list, "first");
206 * list = g_slist_append (list, "second");
208 * /* This is a list of integers. */
209 * number_list = g_slist_append (number_list, GINT_TO_POINTER (27));
210 * number_list = g_slist_append (number_list, GINT_TO_POINTER (14));
213 * Returns: the new start of the #GSList
216 g_slist_append (GSList *list,
222 new_list = _g_slist_alloc ();
223 new_list->data = data;
224 new_list->next = NULL;
228 last = g_slist_last (list);
229 /* g_assert (last != NULL); */
230 last->next = new_list;
241 * @data: the data for the new element
243 * Adds a new element on to the start of the list.
246 * The return value is the new start of the list, which
247 * may have changed, so make sure you store the new value.
251 * /* Notice that it is initialized to the empty list. */
252 * GSList *list = NULL;
253 * list = g_slist_prepend (list, "last");
254 * list = g_slist_prepend (list, "first");
257 * Returns: the new start of the #GSList
260 g_slist_prepend (GSList *list,
265 new_list = _g_slist_alloc ();
266 new_list->data = data;
267 new_list->next = list;
275 * @data: the data for the new element
276 * @position: the position to insert the element.
277 * If this is negative, or is larger than the number
278 * of elements in the list, the new element is added on
279 * to the end of the list.
281 * Inserts a new element into the list at the given position.
283 * Returns: the new start of the #GSList
286 g_slist_insert (GSList *list,
295 return g_slist_append (list, data);
296 else if (position == 0)
297 return g_slist_prepend (list, data);
299 new_list = _g_slist_alloc ();
300 new_list->data = data;
304 new_list->next = NULL;
311 while ((position-- > 0) && tmp_list)
313 prev_list = tmp_list;
314 tmp_list = tmp_list->next;
317 new_list->next = prev_list->next;
318 prev_list->next = new_list;
324 * g_slist_insert_before:
326 * @sibling: node to insert @data before
327 * @data: data to put in the newly-inserted node
329 * Inserts a node before @sibling containing @data.
331 * Returns: the new head of the list.
334 g_slist_insert_before (GSList *slist,
340 slist = _g_slist_alloc ();
343 g_return_val_if_fail (sibling == NULL, slist);
348 GSList *node, *last = NULL;
350 for (node = slist; node; last = node, node = last->next)
355 node = _g_slist_alloc ();
363 node = _g_slist_alloc ();
365 node->next = last->next;
376 * @list2: the #GSList to add to the end of the first #GSList
378 * Adds the second #GSList onto the end of the first #GSList.
379 * Note that the elements of the second #GSList are not copied.
380 * They are used directly.
382 * Returns: the start of the new #GSList
385 g_slist_concat (GSList *list1, GSList *list2)
390 g_slist_last (list1)->next = list2;
401 * @data: the data of the element to remove
403 * Removes an element from a #GSList.
404 * If two elements contain the same data, only the first is removed.
405 * If none of the elements contain the data, the #GSList is unchanged.
407 * Returns: the new start of the #GSList
410 g_slist_remove (GSList *list,
413 GSList *tmp, *prev = NULL;
418 if (tmp->data == data)
421 prev->next = tmp->next;
425 g_slist_free_1 (tmp);
436 * g_slist_remove_all:
438 * @data: data to remove
440 * Removes all list nodes with data equal to @data.
441 * Returns the new head of the list. Contrast with
442 * g_slist_remove() which removes only the first node
443 * matching the given data.
445 * Returns: new head of @list
448 g_slist_remove_all (GSList *list,
451 GSList *tmp, *prev = NULL;
456 if (tmp->data == data)
458 GSList *next = tmp->next;
465 g_slist_free_1 (tmp);
478 static inline GSList*
479 _g_slist_remove_link (GSList *list,
493 prev->next = tmp->next;
509 * g_slist_remove_link:
511 * @link_: an element in the #GSList
513 * Removes an element from a #GSList, without
514 * freeing the element. The removed element's next
515 * link is set to %NULL, so that it becomes a
516 * self-contained list with one element.
518 * <note>Removing arbitrary nodes from a singly-linked list
519 * requires time that is proportional to the length of the list
520 * (ie. O(n)). If you find yourself using g_slist_remove_link()
521 * frequently, you should consider a different data structure, such
522 * as the doubly-linked #GList.</note>
524 * Returns: the new start of the #GSList, without the element
527 g_slist_remove_link (GSList *list,
530 return _g_slist_remove_link (list, link_);
534 * g_slist_delete_link:
536 * @link_: node to delete
538 * Removes the node link_ from the list and frees it.
539 * Compare this to g_slist_remove_link() which removes the node
540 * without freeing it.
542 * <note>Removing arbitrary nodes from a singly-linked list
543 * requires time that is proportional to the length of the list
544 * (ie. O(n)). If you find yourself using g_slist_delete_link()
545 * frequently, you should consider a different data structure, such
546 * as the doubly-linked #GList.</note>
548 * Returns: the new head of @list
551 g_slist_delete_link (GSList *list,
554 list = _g_slist_remove_link (list, link_);
555 _g_slist_free1 (link_);
567 * Note that this is a "shallow" copy. If the list elements
568 * consist of pointers to data, the pointers are copied but
569 * the actual data isn't. See g_slist_copy_deep() if you need
570 * to copy the data as well.
573 * Returns: a copy of @list
576 g_slist_copy (GSList *list)
578 return g_slist_copy_deep (list, NULL, NULL);
584 * @func: a copy function used to copy every element in the list
585 * @user_data: user data passed to the copy function @func, or #NULL
587 * Makes a full (deep) copy of a #GSList.
589 * In contrast with g_slist_copy(), this function uses @func to make a copy of
590 * each list element, in addition to copying the list container itself.
592 * @func, as a #GCopyFunc, takes two arguments, the data to be copied and a user
593 * pointer. It's safe to pass #NULL as user_data, if the copy function takes only
596 * For instance, if @list holds a list of GObjects, you can do:
598 * another_list = g_slist_copy_deep (list, (GCopyFunc) g_object_ref, NULL);
601 * And, to entirely free the new list, you could do:
603 * g_slist_free_full (another_list, g_object_unref);
606 * Returns: a full copy of @list, use #g_slist_free_full to free it
611 g_slist_copy_deep (GSList *list, GCopyFunc func, gpointer user_data)
613 GSList *new_list = NULL;
619 new_list = _g_slist_alloc ();
621 new_list->data = func (list->data, user_data);
623 new_list->data = list->data;
628 last->next = _g_slist_alloc ();
631 last->data = func (list->data, user_data);
633 last->data = list->data;
646 * Reverses a #GSList.
648 * Returns: the start of the reversed #GSList
651 g_slist_reverse (GSList *list)
657 GSList *next = list->next;
671 * @n: the position of the element, counting from 0
673 * Gets the element at the given position in a #GSList.
675 * Returns: the element, or %NULL if the position is off
676 * the end of the #GSList
679 g_slist_nth (GSList *list,
682 while (n-- > 0 && list)
691 * @n: the position of the element
693 * Gets the data of the element at the given position.
695 * Returns: the element's data, or %NULL if the position
696 * is off the end of the #GSList
699 g_slist_nth_data (GSList *list,
702 while (n-- > 0 && list)
705 return list ? list->data : NULL;
711 * @data: the element data to find
713 * Finds the element in a #GSList which
714 * contains the given data.
716 * Returns: the found #GSList element,
717 * or %NULL if it is not found
720 g_slist_find (GSList *list,
725 if (list->data == data)
735 * g_slist_find_custom:
737 * @data: user data passed to the function
738 * @func: the function to call for each element.
739 * It should return 0 when the desired element is found
741 * Finds an element in a #GSList, using a supplied function to
742 * find the desired element. It iterates over the list, calling
743 * the given function which should return 0 when the desired
744 * element is found. The function takes two #gconstpointer arguments,
745 * the #GSList element's data as the first argument and the
748 * Returns: the found #GSList element, or %NULL if it is not found
751 g_slist_find_custom (GSList *list,
755 g_return_val_if_fail (func != NULL, list);
759 if (! func (list->data, data))
770 * @llink: an element in the #GSList
772 * Gets the position of the given element
773 * in the #GSList (starting from 0).
775 * Returns: the position of the element in the #GSList,
776 * or -1 if the element is not found
779 g_slist_position (GSList *list,
799 * @data: the data to find
801 * Gets the position of the element containing
802 * the given data (starting from 0).
804 * Returns: the index of the element containing the data,
805 * or -1 if the data is not found
808 g_slist_index (GSList *list,
816 if (list->data == data)
829 * Gets the last element in a #GSList.
832 * This function iterates over the whole list.
835 * Returns: the last element in the #GSList,
836 * or %NULL if the #GSList has no elements
839 g_slist_last (GSList *list)
854 * Gets the number of elements in a #GSList.
857 * This function iterates over the whole list to
858 * count its elements.
861 * Returns: the number of elements in the #GSList
864 g_slist_length (GSList *list)
881 * @func: the function to call with each element's data
882 * @user_data: user data to pass to the function
884 * Calls a function for each element of a #GSList.
887 g_slist_foreach (GSList *list,
893 GSList *next = list->next;
894 (*func) (list->data, user_data);
900 g_slist_insert_sorted_real (GSList *list,
905 GSList *tmp_list = list;
906 GSList *prev_list = NULL;
910 g_return_val_if_fail (func != NULL, list);
914 new_list = _g_slist_alloc ();
915 new_list->data = data;
916 new_list->next = NULL;
920 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
922 while ((tmp_list->next) && (cmp > 0))
924 prev_list = tmp_list;
925 tmp_list = tmp_list->next;
927 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
930 new_list = _g_slist_alloc ();
931 new_list->data = data;
933 if ((!tmp_list->next) && (cmp > 0))
935 tmp_list->next = new_list;
936 new_list->next = NULL;
942 prev_list->next = new_list;
943 new_list->next = tmp_list;
948 new_list->next = list;
954 * g_slist_insert_sorted:
956 * @data: the data for the new element
957 * @func: the function to compare elements in the list.
958 * It should return a number > 0 if the first parameter
959 * comes after the second parameter in the sort order.
961 * Inserts a new element into the list, using the given
962 * comparison function to determine its position.
964 * Returns: the new start of the #GSList
967 g_slist_insert_sorted (GSList *list,
971 return g_slist_insert_sorted_real (list, data, (GFunc) func, NULL);
975 * g_slist_insert_sorted_with_data:
977 * @data: the data for the new element
978 * @func: the function to compare elements in the list.
979 * It should return a number > 0 if the first parameter
980 * comes after the second parameter in the sort order.
981 * @user_data: data to pass to comparison function
983 * Inserts a new element into the list, using the given
984 * comparison function to determine its position.
986 * Returns: the new start of the #GSList
991 g_slist_insert_sorted_with_data (GSList *list,
993 GCompareDataFunc func,
996 return g_slist_insert_sorted_real (list, data, (GFunc) func, user_data);
1000 g_slist_sort_merge (GSList *l1,
1012 cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data);
1025 l->next= l1 ? l1 : l2;
1031 g_slist_sort_real (GSList *list,
1045 while ((l2 = l2->next) != NULL)
1047 if ((l2 = l2->next) == NULL)
1054 return g_slist_sort_merge (g_slist_sort_real (list, compare_func, user_data),
1055 g_slist_sort_real (l2, compare_func, user_data),
1063 * @compare_func: the comparison function used to sort the #GSList.
1064 * This function is passed the data from 2 elements of the #GSList
1065 * and should return 0 if they are equal, a negative value if the
1066 * first element comes before the second, or a positive value if
1067 * the first element comes after the second.
1069 * Sorts a #GSList using the given comparison function.
1071 * Returns: the start of the sorted #GSList
1074 g_slist_sort (GSList *list,
1075 GCompareFunc compare_func)
1077 return g_slist_sort_real (list, (GFunc) compare_func, NULL);
1081 * g_slist_sort_with_data:
1083 * @compare_func: comparison function
1084 * @user_data: data to pass to comparison function
1086 * Like g_slist_sort(), but the sort function accepts a user data argument.
1088 * Returns: new head of the list
1091 g_slist_sort_with_data (GSList *list,
1092 GCompareDataFunc compare_func,
1095 return g_slist_sort_real (list, (GFunc) compare_func, user_data);