Sets our main struct and passes it to the parent class
Creates a new GQueue.
Removes all the elements in queue. If queue elements contain dynamically-allocated memory, they should be freed first. Since 2.14
Copies a queue. Note that is a shallow copy. If the elements in the queue consist of pointers to data, the pointers are copied, but the actual data is not. Since 2.4
Removes link_ from queue and frees it. link_ must be part of queue. Since 2.4
Finds the first link in queue which contains data. Since 2.4
Finds an element in a GQueue, using a supplied function to find the desired element. It iterates over the queue, calling the given function which should return 0 when the desired element is found. The function takes two gconstpointer arguments, the GQueue element's data as the first argument and the given user data as the second argument. Since 2.4
Calls func for each element in the queue passing user_data to the function. Since 2.4
Frees the memory allocated for the GQueue. Only call this function if queue was created with g_queue_new(). If queue elements contain dynamically-allocated memory, they should be freed first.
Returns the number of items in queue. Since 2.4
the main Gtk struct as a void*
Returns the position of the first element in queue which contains data. Since 2.4
A statically-allocated GQueue must be initialized with this function before it can be used. Alternatively you can initialize it with G_QUEUE_INIT. It is not necessary to initialize queues created with g_queue_new(). Since 2.14
Inserts data into queue after sibling sibling must be part of queue Since 2.4
Inserts data into queue before sibling. sibling must be part of queue. Since 2.4
Inserts data into queue using func to determine the new position. Since 2.4
Returns TRUE if the queue is empty.
Returns the position of link_ in queue. Since 2.4
Returns the first element of the queue.
Returns the first link in queue Since 2.4
Returns the n'th element of queue. Since 2.4
Returns the link at the given position Since 2.4
Returns the last element of the queue.
Returns the last link queue. Since 2.4
Removes the first element of the queue.
Removes the first element of the queue.
Removes the n'th element of queue. Since 2.4
Removes and returns the link at the given position. Since 2.4
Removes the last element of the queue.
Removes the last element of the queue.
Adds a new element at the head of the queue.
Adds a new element at the head of the queue.
Inserts a new element into queue at the given position Since 2.4
Inserts link into queue at the given position. Since 2.4
Adds a new element at the tail of the queue.
Adds a new element at the tail of the queue.
Removes the first element in queue that contains data. Since 2.4
Remove all elements whose data equals data from queue. Since 2.4
Reverses the order of the items in queue. Since 2.4
Sorts queue using compare_func. Since 2.4
Unlinks link_ so that it will no longer be part of queue. The link is not freed. link_ must be part of queue, Since 2.4
the main Gtk struct
Description The GQueue structure and its associated functions provide a standard queue data structure. Internally, GQueue uses the same data structure as GList to store elements. 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. To create a new GQueue, use g_queue_new(). To initialize a statically-allocated GQueue, use G_QUEUE_INIT or g_queue_init(). To add elements, use g_queue_push_head(), g_queue_push_head_link(), g_queue_push_tail() and g_queue_push_tail_link(). To remove elements, use g_queue_pop_head() and g_queue_pop_tail(). To free the entire queue, use g_queue_free().