A destructor is present on this object, but not explicitly documented in the source.
Removes all the elements in queue. 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 provided free_func on each item in the #GQueue.
Calls func for each element in the queue passing user_data to the function.
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.
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 glib.queue.Queue.new_.
Inserts data into queue using func to determine the new position.
Returns true if the queue is empty.
Returns the first element of the queue.
Returns the n'th element of queue.
Returns the last element of the queue.
Removes the first element of the queue and returns its data.
Removes the n'th element of queue and returns its data.
Removes the last element of the queue and returns its data.
Adds a new element at the head of the queue.
Inserts a new element into queue at the given position.
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.
Contains the public fields of a Queue[glib-Double-ended-Queues].