Sets our main struct and passes it to the parent class.
Adds a new element on to the end of the list.
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.
Makes a full (deep) copy of a #GSList.
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.
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.
Get the main Gtk struct
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.
Gets the last element in a #GSList.
Gets the number of elements in a #GSList.
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.
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. The algorithm used is a stable sort.
Like g_slist_sort(), but the sort function accepts a user data argument.
Turn the list into a D array of the desiered type. Type T wraps should match the type of the data.
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.
The #GSList struct is used for each element in the singly-linked list.