Sets our main struct and passes it to the parent class
Adds a new element on to the end of the list. Note The return value is the new start of the list, which may have changed, so make sure you store the new value. Note Note that g_slist_append() has to traverse the entire list to find the end, which is inefficient when adding multiple elements. A common idiom to avoid the inefficiency is to prepend the elements and reverse the list when all elements have been added.
Adds the second GSList onto the end of the first GSList. Note that the elements of the second GSList are not copied. They are used directly.
Copies a GSList. Note Note that this is a "shallow" copy. If the list elements consist of pointers to data, the pointers are copied but the actual data isn't.
Removes the node link_ from the list and frees it. Compare this to g_slist_remove_link() which removes the node without freeing it.
Finds the element in a GSList which contains the given data.
Finds an element in a GSList, using a supplied function to find the desired element. It iterates over the list, calling the given function which should return 0 when the desired element is found. The function takes two gconstpointer arguments, the GSList element's data as the first argument and the given user data.
Calls a function for each element of a GSList.
Frees all of the memory used by a GSList. The freed elements are returned to the slice allocator. Note If list elements contain dynamically-allocated memory, you should either use g_slist_free_full() or free them manually first.
Frees one GSList element. It is usually used after g_slist_remove_link().
Convenience method, which frees all the memory used by a GSList, and calls the specified destroy function on every element's data. Since 2.28
the main Gtk struct as a void*
Gets the position of the element containing the given data (starting from 0).
Inserts a new element into the list at the given position.
Inserts a node before sibling containing data.
Inserts a new element into the list, using the given comparison function to determine its position.
Inserts a new element into the list, using the given comparison function to determine its position. Since 2.10
Gets the last element in a GSList. Note This function iterates over the whole list.
Gets the number of elements in a GSList. Note This function iterates over the whole list to count its elements.
get the next element
Gets the element at the given position in a GSList.
Gets the data of the element at the given position.
Gets the position of the given element in the GSList (starting from 0).
Adds a new element on to the start of the list. Note The return value is the new start of the list, which may have changed, so make sure you store the new value.
Removes an element from a GSList. If two elements contain the same data, only the first is removed. If none of the elements contain the data, the GSList is unchanged.
Removes all list nodes with data equal to data. Returns the new head of the list. Contrast with g_slist_remove() which removes only the first node matching the given data.
Removes an element from a GSList, without freeing the element. The removed element's next link is set to NULL, so that it becomes a self-contained list with one element.
Reverses a GSList.
Sorts a GSList using the given comparison function.
Like g_slist_sort(), but the sort function accepts a user data argument.
Allocates space for one GSList element. It is called by the g_slist_append(), g_slist_prepend(), g_slist_insert() and g_slist_insert_sorted() functions and so is rarely used on its own.
Warning g_slist_pop_allocator has been deprecated since version 2.10 and should not be used in newly-written code. It does nothing, since GSList has been converted to the slice allocator Restores the previous GAllocator, used when allocating GSList elements. Note that this function is not available if GLib has been compiled with --disable-mem-pools
Warning g_slist_push_allocator has been deprecated since version 2.10 and should not be used in newly-written code. It does nothing, since GSList has been converted to the slice allocator Sets the allocator to use to allocate GSList elements. Use g_slist_pop_allocator() to restore the previous allocator. Note that this function is not available if GLib has been compiled with --disable-mem-pools
the main Gtk struct
Description The GSList structure and its associated functions provide a standard singly-linked list data structure. Each element in the list contains a piece of data, together with a pointer which links to the next element in the list. Using this pointer it is possible to move through the list in one direction only (unlike the Doubly-Linked Lists which allow movement in both directions). The data contained in each element can be either integer values, by using one of the Type Conversion Macros, or simply pointers to any type of data. List elements are allocated from the slice allocator, which is more efficient than allocating elements individually. Note that most of the GSList functions expect to be passed a pointer to the first element in the list. The functions which insert elements return the new start of the list, which may have changed. There is no function to create a GSList. NULL is considered to be the empty list so you simply set a GSList* to NULL. To add elements, use g_slist_append(), g_slist_prepend(), g_slist_insert() and g_slist_insert_sorted(). To remove elements, use g_slist_remove(). To find elements in the list use g_slist_last(), g_slist_next(), g_slist_nth(), g_slist_nth_data(), g_slist_find() and g_slist_find_custom(). To find the index of an element use g_slist_position() and g_slist_index(). To call a function for each element in the list use g_slist_foreach(). To free the entire list, use g_slist_free().