[13:7] extends: object
Contains the public fields of a Queue.
GQueue (Handle = null)
Creates a new
Queueby wrapping a native handle or another wrapper.
Handle is the native handle or another wrapper whose handle to adopt.toNativeHandle (Source)
Normalizes a constructor argument into a raw pointer carrier. Accepts a raw NativeHandle, a raw NativeBuffer returned from
fn.call(...), another generated wrapper exposinghandle(), or null. Returns null when the argument carries no pointer.
Source is the raw handle, raw buffer, wrapper, or null.A raw pointer carrier or null when no pointer is present.getLib ()
Returns the opened native library for this generated wrapper.
The opened native library.handle ()
Returns the wrapped NativeHandle.
The wrapped NativeHandle.isNull ()
Returns true when the wrapped handle is null.
A bool.describe ()
Returns a small string for debugging generated wrappers.
A string.clear ()
Removes all the elements in @queue. If queue elements contain dynamically-allocated memory, they should be freed first.
None.clear_full (object free_func)
Convenience method, which frees all the memory used by a #GQueue, and calls the provided @free_func on each item in the #GQueue.
free_func is the function to be called to free memory allocated.None.copy ()
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.
a copy of @queue.delete_link (list link_)
Removes @link_ from @queue and frees it. @link_ must be part of @queue.
link_ is a #GList link that must be part of @queue.None.find (data)
Finds the first link in @queue which contains @data.
data is data to find.the first link in @queue which contains @data.find_custom (data, object func)
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.
data is user data passed to @func.func is a #GCompareFunc to call for each element. It should return 0 when the desired element is found.the found link, or %NULL if it wasn't found.foreach (user_data)
Calls @func for each element in the queue passing @user_data to the function. It is safe for @func to remove the element from @queue, but it must not modify any part of the queue after that element.
func is the function to call for each element's data.user_data is user data to pass to @func.None.free ()
Frees the memory allocated for the #GQueue. Only call this function if
was created with g_queue_new(). If queue elements contain dynamically-allocated memory, they should be freed first. If queue elements contain dynamically-allocated memory, you should either use g_queue_free_full() or free them manually first.None.free_full (object free_func)
Convenience method, which frees all the memory used by a #GQueue, and calls the specified destroy function on every element's data. @free_func should not modify the queue (eg, by removing the freed element from it).
free_func is the function to be called to free each element's data.None.get_length ()
Returns the number of items in @queue.
the number of items in @queue.index (data)
Returns the position of the first element in @queue which contains @data.
data is the data to find.the position of the first element in @queue which contains @data, or -1 if no element in @queue contains @data.init ()
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().
None.insert_after (list sibling, data)
Inserts @data into @queue after @sibling. @sibling must be part of
Since GLib 2.44 a %NULL sibling pushes the data at the head of the queue.sibling is a #GList link that must be part of @queue, or %NULL to push at the head of the queue..data is the data to insert.None.insert_after_link (list sibling, list link_)
Inserts @link_ into @queue after @sibling. @sibling must be part of
sibling is a #GList link that must be part of @queue, or %NULL to push at the head of the queue..link_ is a #GList link to insert which must not be part of any other list..None.insert_before (list sibling, data)
Inserts @data into @queue before @sibling. @sibling must be part of
Since GLib 2.44 a %NULL sibling pushes the data at the tail of the queue.sibling is a #GList link that must be part of @queue, or %NULL to push at the tail of the queue..data is the data to insert.None.insert_before_link (list sibling, list link_)
Inserts @link_ into @queue before @sibling. @sibling must be part of
sibling is a #GList link that must be part of @queue, or %NULL to push at the tail of the queue..link_ is a #GList link to insert which must not be part of any other list..None.insert_sorted (data, user_data)
Inserts @data into @queue using @func to determine the new position.
data is the data to insert.func is the #GCompareDataFunc used to compare elements in the queue. It is called with two elements of the @queue and @user_data. It should return 0 if the elements are equal, a negative value if the first element comes before the second, and a positive value if the second element comes before the first..user_data is user data passed to @func.None.is_empty ()
Returns %TRUE if the queue is empty.
%TRUE if the queue is empty.link_index (list link_)
Returns the position of @link_ in @queue.
link_ is a #GList link.the position of @link_, or -1 if the link is not part of @queue.peek_head ()
Returns the first element of the queue.
the data of the first element in the queue, or %NULL if the queue is empty.peek_head_link ()
Returns the first link in @queue.
the first link in @queue, or %NULL if @queue is empty.peek_nth (int n)
Returns the @n'th element of @queue.
n is the position of the element.the data for the @n'th element of @queue, or %NULL if @n is off the end of @queue.peek_nth_link (int n)
Returns the link at the given position
n is the position of the link.the link at the @n'th position, or %NULL if @n is off the end of the list.peek_tail ()
Returns the last element of the queue.
the data of the last element in the queue, or %NULL if the queue is empty.peek_tail_link ()
Returns the last link in @queue.
the last link in @queue, or %NULL if @queue is empty.pop_head ()
Removes the first element of the queue and returns its data.
the data of the first element in the queue, or %NULL if the queue is empty.pop_head_link ()
Removes and returns the first element of the queue.
the #GList element at the head of the queue, or %NULL if the queue is empty.pop_nth (int n)
Removes the @n'th element of @queue and returns its data.
n is the position of the element.the element's data, or %NULL if @n is off the end of @queue.pop_nth_link (int n)
Removes and returns the link at the given position.
n is the link's position.the @n'th link, or %NULL if @n is off the end of @queue.pop_tail ()
Removes the last element of the queue and returns its data.
the data of the last element in the queue, or %NULL if the queue is empty.pop_tail_link ()
Removes and returns the last element of the queue.
the #GList element at the tail of the queue, or %NULL if the queue is empty.push_head (data)
Adds a new element at the head of the queue.
data is the data for the new element..None.push_head_link (list link_)
Adds a new element at the head of the queue.
link_ is a single #GList element, not a list with more than one element.None.push_nth (data, int n)
Inserts a new element into @queue at the given position.
data is the data for the new element.n is the position to insert the new element. If @n is negative or larger than the number of elements in the @queue, the element is added to the end of the queue..None.push_nth_link (int n, list link_)
Inserts @link into @queue at the given position.
n is the position to insert the link. If this is negative or larger than the number of elements in @queue, the link is added to the end oflink_ is the link to add to @queue.None.push_tail (data)
Adds a new element at the tail of the queue.
data is the data for the new element.None.push_tail_link (list link_)
Adds a new element at the tail of the queue.
link_ is a single #GList element, not a list with more than one element.None.remove (data)
Removes the first element in @queue that contains @data.
data is the data to remove.%TRUE if @data was found and removed from @queue.remove_all (data)
Remove all elements whose data equals @data from @queue.
data is the data to remove.the number of elements removed from @queue.reverse ()
Reverses the order of the items in @queue.
None.sort (user_data)
Sorts @queue using @compare_func.
compare_func is the #GCompareDataFunc used to sort @queue. This function is passed two elements of the queue and should return 0 if they are equal, a negative value if the first comes before the second, and a positive value if the second comes before the first..user_data is user data passed to @compare_func.None.unlink (list link_)
Unlinks @link_ so that it will no longer be part of @queue. The link is not freed. @link_ must be part of @queue.
link_ is a #GList link that must be part of @queue.None.find_list ()
Returns
findas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usefind()when lazy or change-notify access is required.
An Aussom list of elements.find_custom_list ()
Returns
find_customas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usefind_custom()when lazy or change-notify access is required.
An Aussom list of elements.peek_head_link_list ()
Returns
peek_head_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepeek_head_link()when lazy or change-notify access is required.
An Aussom list of elements.peek_nth_link_list ()
Returns
peek_nth_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepeek_nth_link()when lazy or change-notify access is required.
An Aussom list of elements.peek_tail_link_list ()
Returns
peek_tail_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepeek_tail_link()when lazy or change-notify access is required.
An Aussom list of elements.pop_head_link_list ()
Returns
pop_head_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepop_head_link()when lazy or change-notify access is required.
An Aussom list of elements.pop_nth_link_list ()
Returns
pop_nth_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepop_nth_link()when lazy or change-notify access is required.
An Aussom list of elements.pop_tail_link_list ()
Returns
pop_tail_linkas an Aussom list of wrapper objects. This companion method materializes the full collection up front; usepop_tail_link()when lazy or change-notify access is required.
An Aussom list of elements.
