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 #GList onto the end of the first #GList. Note that the elements of the second #GList are not copied. They are used directly.
Copies a #GList.
Makes a full (deep) copy of a #GList.
Removes the node link_ from the list and frees it. Compare this to g_list_remove_link() which removes the node without freeing it.
Finds the element in a #GList which contains the given data.
Finds an element in a #GList, 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 #GList element's data as the first argument and the given user data.
Gets the first element in a #GList.
Calls a function for each element of a #GList.
Frees all of the memory used by a #GList. The freed elements are returned to the slice allocator.
Frees one #GList element, but does not update links from the next and previous elements in the list, so you should not call this function on an element that is currently part of a list.
Convenience method, which frees all the memory used by a #GList, and calls @free_func 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 new element into the list before the given position.
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 #GList.
Gets the number of elements in a #GList.
Gets the element at the given position in a #GList.
Gets the data of the element at the given position.
Gets the element @n places before @list.
Gets the position of the given element in the #GList (starting from 0).
Prepends a new element on to the start of the list.
Removes an element from a #GList. If two elements contain the same data, only the first is removed. If none of the elements contain the data, the #GList is unchanged.
Removes all list nodes with data equal to @data. Returns the new head of the list. Contrast with g_list_remove() which removes only the first node matching the given data.
Removes an element from a #GList, without freeing the element. The removed element's prev and next links are set to %NULL, so that it becomes a self-contained list with one element.
Reverses a #GList. It simply switches the next and prev pointers of each element.
Sorts a #GList using the given comparison function. The algorithm used is a stable sort.
Like g_list_sort(), but the comparison 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.
get the next element
get the previous element
Allocates space for one #GList element. It is called by g_list_append(), g_list_prepend(), g_list_insert() and g_list_insert_sorted() and so is rarely used on its own.
The #GList struct is used for each element in a doubly-linked list.