SList
Object Hierarchy:
Description:
[ Compact ]
[ CCode ( dup_function = "g_slist_copy" , free_function = "g_slist_free" ) ]
public class SList<G>
[ CCode ( dup_function = "g_slist_copy" , free_function = "g_slist_free" ) ]
public class SList<G>
Namespace: GLib
Package: glib-2.0
Content:
Creation methods:
- public SList ()
Methods:
- public void @foreach (Func<G> func)
- public void append (owned G data)
- public void concat (owned SList<G> list2)
- public SList<unowned G> copy ()
- public SList<G> copy_deep (CopyFunc<G> func)
- public void delete_link (SList<G> link_)
- public unowned SList<G> find (G data)
- public unowned SList<G> find_custom (G data, CompareFunc<G> func)
- public int index (G data)
- public void insert (owned G data, int position)
- public void insert_before (SList<G> sibling, owned G data)
- public void insert_sorted (owned G data, CompareFunc<G> compare_func)
- public void insert_sorted_with_data (owned G data, CompareDataFunc<G> compare_func)
- public inline bool is_empty ()
- public unowned SList<G> last ()
- public uint length ()
- public unowned SList<G> nth (uint n)
- public unowned G nth_data (uint n)
- public int position (SList<G> llink)
- public void prepend (owned G data)
- public void remove (G data)
- public void remove_all (G data)
- public unowned SList<G> remove_all_full (G data, FreeFunc? func)
- public unowned SList<G> remove_full (G data, FreeFunc? func)
- public void remove_link (SList<G> llink)
- public void reverse ()
- public unowned SList<G> search<T> (T data, SearchFunc<G,T> func)
- public void sort (CompareFunc<G> compare_func)
- public void sort_with_data (CompareDataFunc<G> compare_func)