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/.
34 #include "gtestutils.h"
37 * SECTION:linked_lists_single
38 * @title: Singly-Linked Lists
39 * @short_description: linked lists containing integer values or
40 * pointers to data, limited to iterating over the
41 * list 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.
108 * g_slist_push_allocator:
109 * @dummy: the #GAllocator to use when allocating #GSList elements.
111 * Sets the allocator to use to allocate #GSList elements. Use
112 * g_slist_pop_allocator() to restore the previous allocator.
114 * Note that this function is not available if GLib has been compiled
115 * with <option>--disable-mem-pools</option>
117 * Deprecated: 2.10: It does nothing, since #GSList has been converted
118 * to the <link linkend="glib-Memory-Slices">slice
121 void g_slist_push_allocator (gpointer dummy) { /* present for binary compat only */ }
124 * g_slist_pop_allocator:
126 * Restores the previous #GAllocator, used when allocating #GSList
129 * Note that this function is not available if GLib has been compiled
130 * with <option>--disable-mem-pools</option>
132 * Deprecated: 2.10: It does nothing, since #GSList has been converted
133 * to the <link linkend="glib-Memory-Slices">slice
136 void g_slist_pop_allocator (void) { /* present for binary compat only */ }
138 #define _g_slist_alloc0() g_slice_new0 (GSList)
139 #define _g_slist_alloc() g_slice_new (GSList)
140 #define _g_slist_free1(slist) g_slice_free (GSList, slist)
144 * @Returns: a pointer to the newly-allocated #GSList element.
146 * Allocates space for one #GSList element. It is called by the
147 * g_slist_append(), g_slist_prepend(), g_slist_insert() and
148 * g_slist_insert_sorted() functions and so is rarely used on its own.
153 return _g_slist_alloc0 ();
160 * Frees all of the memory used by a #GSList.
161 * The freed elements are returned to the slice allocator.
164 * If list elements contain dynamically-allocated memory,
165 * you should either use g_slist_free_full() or free them manually
170 g_slist_free (GSList *list)
172 g_slice_free_chain (GSList, list, next);
177 * @list: a #GSList element
179 * Frees one #GSList element.
180 * It is usually used after g_slist_remove_link().
185 * A macro which does the same as g_slist_free_1().
190 g_slist_free_1 (GSList *list)
192 _g_slist_free1 (list);
197 * @list: a pointer to a #GSList
198 * @free_func: the function to be called to free each element's data
200 * Convenience method, which frees all the memory used by a #GSList,
201 * and calls the specified destroy function on every element's data.
206 g_slist_free_full (GSList *list,
207 GDestroyNotify free_func)
211 GSList *next = list->next;
212 (*free_func) (list->data);
213 _g_slist_free1 (list);
221 * @data: the data for the new element
223 * Adds a new element on to the end of the list.
226 * The return value is the new start of the list, which may
227 * have changed, so make sure you store the new value.
231 * Note that g_slist_append() has to traverse the entire list
232 * to find the end, which is inefficient when adding multiple
233 * elements. A common idiom to avoid the inefficiency is to prepend
234 * the elements and reverse the list when all elements have been added.
238 * /* Notice that these are initialized to the empty list. */
239 * GSList *list = NULL, *number_list = NULL;
241 * /* This is a list of strings. */
242 * list = g_slist_append (list, "first");
243 * list = g_slist_append (list, "second");
245 * /* This is a list of integers. */
246 * number_list = g_slist_append (number_list, GINT_TO_POINTER (27));
247 * number_list = g_slist_append (number_list, GINT_TO_POINTER (14));
250 * Returns: the new start of the #GSList
253 g_slist_append (GSList *list,
259 new_list = _g_slist_alloc ();
260 new_list->data = data;
261 new_list->next = NULL;
265 last = g_slist_last (list);
266 /* g_assert (last != NULL); */
267 last->next = new_list;
278 * @data: the data for the new element
280 * Adds a new element on to the start of the list.
283 * The return value is the new start of the list, which
284 * may have changed, so make sure you store the new value.
288 * /* Notice that it is initialized to the empty list. */
289 * GSList *list = NULL;
290 * list = g_slist_prepend (list, "last");
291 * list = g_slist_prepend (list, "first");
294 * Returns: the new start of the #GSList
297 g_slist_prepend (GSList *list,
302 new_list = _g_slist_alloc ();
303 new_list->data = data;
304 new_list->next = list;
312 * @data: the data for the new element
313 * @position: the position to insert the element.
314 * If this is negative, or is larger than the number
315 * of elements in the list, the new element is added on
316 * to the end of the list.
318 * Inserts a new element into the list at the given position.
320 * Returns: the new start of the #GSList
323 g_slist_insert (GSList *list,
332 return g_slist_append (list, data);
333 else if (position == 0)
334 return g_slist_prepend (list, data);
336 new_list = _g_slist_alloc ();
337 new_list->data = data;
341 new_list->next = NULL;
348 while ((position-- > 0) && tmp_list)
350 prev_list = tmp_list;
351 tmp_list = tmp_list->next;
356 new_list->next = prev_list->next;
357 prev_list->next = new_list;
361 new_list->next = list;
369 * g_slist_insert_before:
371 * @sibling: node to insert @data before
372 * @data: data to put in the newly-inserted node
374 * Inserts a node before @sibling containing @data.
376 * Returns: the new head of the list.
379 g_slist_insert_before (GSList *slist,
385 slist = _g_slist_alloc ();
388 g_return_val_if_fail (sibling == NULL, slist);
393 GSList *node, *last = NULL;
395 for (node = slist; node; last = node, node = last->next)
400 node = _g_slist_alloc ();
408 node = _g_slist_alloc ();
410 node->next = last->next;
421 * @list2: the #GSList to add to the end of the first #GSList
423 * Adds the second #GSList onto the end of the first #GSList.
424 * Note that the elements of the second #GSList are not copied.
425 * They are used directly.
427 * Returns: the start of the new #GSList
430 g_slist_concat (GSList *list1, GSList *list2)
435 g_slist_last (list1)->next = list2;
446 * @data: the data of the element to remove
448 * Removes an element from a #GSList.
449 * If two elements contain the same data, only the first is removed.
450 * If none of the elements contain the data, the #GSList is unchanged.
452 * Returns: the new start of the #GSList
455 g_slist_remove (GSList *list,
458 GSList *tmp, *prev = NULL;
463 if (tmp->data == data)
466 prev->next = tmp->next;
470 g_slist_free_1 (tmp);
481 * g_slist_remove_all:
483 * @data: data to remove
485 * Removes all list nodes with data equal to @data.
486 * Returns the new head of the list. Contrast with
487 * g_slist_remove() which removes only the first node
488 * matching the given data.
490 * Returns: new head of @list
493 g_slist_remove_all (GSList *list,
496 GSList *tmp, *prev = NULL;
501 if (tmp->data == data)
503 GSList *next = tmp->next;
510 g_slist_free_1 (tmp);
523 static inline GSList*
524 _g_slist_remove_link (GSList *list,
538 prev->next = tmp->next;
554 * g_slist_remove_link:
556 * @link_: an element in the #GSList
558 * Removes an element from a #GSList, without
559 * freeing the element. The removed element's next
560 * link is set to %NULL, so that it becomes a
561 * self-contained list with one element.
563 * Returns: the new start of the #GSList, without the element
566 g_slist_remove_link (GSList *list,
569 return _g_slist_remove_link (list, link_);
573 * g_slist_delete_link:
575 * @link_: node to delete
577 * Removes the node link_ from the list and frees it.
578 * Compare this to g_slist_remove_link() which removes the node
579 * without freeing it.
581 * Returns: the new head of @list
584 g_slist_delete_link (GSList *list,
587 list = _g_slist_remove_link (list, link_);
588 _g_slist_free1 (link_);
600 * Note that this is a "shallow" copy. If the list elements
601 * consist of pointers to data, the pointers are copied but
602 * the actual data isn't.
605 * Returns: a copy of @list
608 g_slist_copy (GSList *list)
610 GSList *new_list = NULL;
616 new_list = _g_slist_alloc ();
617 new_list->data = list->data;
622 last->next = _g_slist_alloc ();
624 last->data = list->data;
637 * Reverses a #GSList.
639 * Returns: the start of the reversed #GSList
642 g_slist_reverse (GSList *list)
648 GSList *next = list->next;
662 * @n: the position of the element, counting from 0
664 * Gets the element at the given position in a #GSList.
666 * Returns: the element, or %NULL if the position is off
667 * the end of the #GSList
670 g_slist_nth (GSList *list,
673 while (n-- > 0 && list)
682 * @n: the position of the element
684 * Gets the data of the element at the given position.
686 * Returns: the element's data, or %NULL if the position
687 * is off the end of the #GSList
690 g_slist_nth_data (GSList *list,
693 while (n-- > 0 && list)
696 return list ? list->data : NULL;
702 * @data: the element data to find
704 * Finds the element in a #GSList which
705 * contains the given data.
707 * Returns: the found #GSList element,
708 * or %NULL if it is not found
711 g_slist_find (GSList *list,
716 if (list->data == data)
726 * g_slist_find_custom:
728 * @data: user data passed to the function
729 * @func: the function to call for each element.
730 * It should return 0 when the desired element is found
732 * Finds an element in a #GSList, using a supplied function to
733 * find the desired element. It iterates over the list, calling
734 * the given function which should return 0 when the desired
735 * element is found. The function takes two #gconstpointer arguments,
736 * the #GSList element's data as the first argument and the
739 * Returns: the found #GSList element, or %NULL if it is not found
742 g_slist_find_custom (GSList *list,
746 g_return_val_if_fail (func != NULL, list);
750 if (! func (list->data, data))
761 * @llink: an element in the #GSList
763 * Gets the position of the given element
764 * in the #GSList (starting from 0).
766 * Returns: the position of the element in the #GSList,
767 * or -1 if the element is not found
770 g_slist_position (GSList *list,
790 * @data: the data to find
792 * Gets the position of the element containing
793 * the given data (starting from 0).
795 * Returns: the index of the element containing the data,
796 * or -1 if the data is not found
799 g_slist_index (GSList *list,
807 if (list->data == data)
820 * Gets the last element in a #GSList.
823 * This function iterates over the whole list.
826 * Returns: the last element in the #GSList,
827 * or %NULL if the #GSList has no elements
830 g_slist_last (GSList *list)
845 * Gets the number of elements in a #GSList.
848 * This function iterates over the whole list to
849 * count its elements.
852 * Returns: the number of elements in the #GSList
855 g_slist_length (GSList *list)
872 * @func: the function to call with each element's data
873 * @user_data: user data to pass to the function
875 * Calls a function for each element of a #GSList.
878 g_slist_foreach (GSList *list,
884 GSList *next = list->next;
885 (*func) (list->data, user_data);
891 g_slist_insert_sorted_real (GSList *list,
896 GSList *tmp_list = list;
897 GSList *prev_list = NULL;
901 g_return_val_if_fail (func != NULL, list);
905 new_list = _g_slist_alloc ();
906 new_list->data = data;
907 new_list->next = NULL;
911 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
913 while ((tmp_list->next) && (cmp > 0))
915 prev_list = tmp_list;
916 tmp_list = tmp_list->next;
918 cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data);
921 new_list = _g_slist_alloc ();
922 new_list->data = data;
924 if ((!tmp_list->next) && (cmp > 0))
926 tmp_list->next = new_list;
927 new_list->next = NULL;
933 prev_list->next = new_list;
934 new_list->next = tmp_list;
939 new_list->next = list;
945 * g_slist_insert_sorted:
947 * @data: the data for the new element
948 * @func: the function to compare elements in the list.
949 * It should return a number > 0 if the first parameter
950 * comes after the second parameter in the sort order.
952 * Inserts a new element into the list, using the given
953 * comparison function to determine its position.
955 * Returns: the new start of the #GSList
958 g_slist_insert_sorted (GSList *list,
962 return g_slist_insert_sorted_real (list, data, (GFunc) func, NULL);
966 * g_slist_insert_sorted_with_data:
968 * @data: the data for the new element
969 * @func: the function to compare elements in the list.
970 * It should return a number > 0 if the first parameter
971 * comes after the second parameter in the sort order.
972 * @user_data: data to pass to comparison function
974 * Inserts a new element into the list, using the given
975 * comparison function to determine its position.
977 * Returns: the new start of the #GSList
982 g_slist_insert_sorted_with_data (GSList *list,
984 GCompareDataFunc func,
987 return g_slist_insert_sorted_real (list, data, (GFunc) func, user_data);
991 g_slist_sort_merge (GSList *l1,
1003 cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data);
1016 l->next= l1 ? l1 : l2;
1022 g_slist_sort_real (GSList *list,
1036 while ((l2 = l2->next) != NULL)
1038 if ((l2 = l2->next) == NULL)
1045 return g_slist_sort_merge (g_slist_sort_real (list, compare_func, user_data),
1046 g_slist_sort_real (l2, compare_func, user_data),
1054 * @compare_func: the comparison function used to sort the #GSList.
1055 * This function is passed the data from 2 elements of the #GSList
1056 * and should return 0 if they are equal, a negative value if the
1057 * first element comes before the second, or a positive value if
1058 * the first element comes after the second.
1060 * Sorts a #GSList using the given comparison function.
1062 * Returns: the start of the sorted #GSList
1065 g_slist_sort (GSList *list,
1066 GCompareFunc compare_func)
1068 return g_slist_sort_real (list, (GFunc) compare_func, NULL);
1072 * g_slist_sort_with_data:
1074 * @compare_func: comparison function
1075 * @user_data: data to pass to comparison function
1077 * Like g_slist_sort(), but the sort function accepts a user data argument.
1079 * Returns: new head of the list
1082 g_slist_sort_with_data (GSList *list,
1083 GCompareDataFunc compare_func,
1086 return g_slist_sort_real (list, (GFunc) compare_func, user_data);