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.
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.
Removes @link_ from @queue and frees it.
Finds the first link in @queue which contains @data.
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.
Calls @func for each element in the queue passing @user_data to the function.
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.
Convenience method, which frees all the memory used by a #GQueue, and calls the specified destroy function on every element's data.
Returns the number of items in @queue.
Get the main Gtk struct
the main Gtk struct as a void*
Returns the position of the first element in @queue which contains @data.
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().
Inserts @data into @queue after @sibling.
Inserts @data into @queue before @sibling.
Inserts @data into @queue using @func to determine the new position.
Returns %TRUE if the queue is empty.
Returns the position of @link_ in @queue.
Returns the first element of the queue.
Returns the first link in @queue.
Returns the @n'th element of @queue.
Returns the link at the given position
Returns the last element of the queue.
Returns the last link in @queue.
Removes the first element of the queue and returns its data.
Removes and returns the first element of the queue.
Removes the @n'th element of @queue and returns its data.
Removes and returns the link at the given position.
Removes the last element of the queue and returns its data.
Removes and returns 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.
Inserts @link into @queue at the given position.
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.
Remove all elements whose data equals @data from @queue.
Reverses the order of the items in @queue.
Sorts @queue using @compare_func.
Unlinks @link_ so that it will no longer be part of @queue. The link is not freed.
Contains the public fields of a Queue[glib-Double-ended-Queues].