Queue
Object Hierarchy:
Description:
[ Compact ]
[ CCode ( dup_function = "g_queue_copy" , free_function = "g_queue_free" ) ]
public class Queue<G>
Content:
Creation methods:
Methods:
- public void clear ()
- public void clear_full (DestroyNotify? free_func)
- public Queue<G> copy ()
- public void delete_link (List<G> link)
- public unowned List<G> find (G data)
- public unowned List<G> find_custom (G data, CompareFunc<G> func)
- public uint get_length ()
- public int index (G data)
- public void insert_after (List<G> sibling, owned G data)
- public void insert_after_link (List<G> sibling, owned List<G> link_)
- public void insert_before (List<G> sibling, owned G data)
- public void insert_before_link (List<G> sibling, owned List<G> link_)
- public void insert_sorted (owned G data, CompareDataFunc<G> func)
- public bool is_empty ()
- public unowned G peek_head ()
- public unowned G peek_nth (uint n)
- public unowned G peek_tail ()
- public G pop_head ()
- public G pop_nth (uint n)
- public G pop_tail ()
- public void push_head (owned G data)
- public void push_nth (owned G data, int n)
- public void push_tail (owned G data)
- public bool remove (G data)
- public uint remove_all (G data)
- public uint remove_all_full (G data, FreeFunc? func)
- public bool remove_full (G data, FreeFunc? func)
- public void reverse ()
- public unowned List<G> search<T> (T data, SearchFunc<G,T> func)
- public void sort (CompareDataFunc<G> compare_func)
- public void unlink (List<G> link)
Fields: