Tree

Object Hierarchy:

[ Compact ]
[ Version ( since = "2.22" ) ]
[ CCode ( ref_function = "g_tree_ref" , unref_function = "g_tree_unref" ) ]
public class Tree<K,V>

Namespace: GLib

Package: glib-2.0

public Tree (CompareDataFunc<K> key_compare_func)
public Tree.full (CompareDataFunc<K> key_compare_func, DestroyNotify? key_destroy_func, DestroyNotify? value_destroy_func)
public Tree.with_data (CompareDataFunc<K> key_compare_func)

public void @foreach (TraverseFunc<K,V> traverse_func)
public void foreach_node (TraverseNodeFunc<K,V> traverse_func)
public int height ()
public void insert (owned K key, owned V value)
public unowned TreeNode<K,V> insert_node (owned K key, owned V value)
public unowned V lookup (K key)
public bool lookup_extended (K lookup_key, out unowned K orig_key, out unowned V value)
public unowned TreeNode<K,V> lookup_node (K key)
public unowned TreeNode<K,V>? lower_bound (K key)
public int nnodes ()
public unowned TreeNode<K,V>? node_first ()
public unowned TreeNode<K,V>? node_last ()
public bool remove (K key)
public void remove_all ()
public void replace (owned K key, owned V value)
public unowned TreeNode<K,V> replace_node (owned K key, owned V value)
public unowned V search (TreeSearchFunc<K> search_func)
public unowned V search_key (CompareFunc<K> search_func, K key)
public unowned V search_node (CompareFunc<K> search_func, K key)
public bool steal (K key)
public unowned TreeNode<K,V>? upper_bound (K key)