Tree
The GTree struct is an opaque data structure representing a glib-Balanced-Binary-Trees. It should be accessed only by using the following functions.
Skipped during bindings generation
method
insert_node
: Return type TreeNode is unsupportedparameter
orig_key
: orig_key: Out parameter is not supportedmethod
lookup_node
: Return type TreeNode is unsupportedmethod
lower_bound
: Return type TreeNode is unsupportedmethod
node_first
: Return type TreeNode is unsupportedmethod
node_last
: Return type TreeNode is unsupportedmethod
replace_node
: Return type TreeNode is unsupportedmethod
search_node
: Return type TreeNode is unsupportedmethod
traverse
: C function g_tree_traverse is ignoredmethod
upper_bound
: Return type TreeNode is unsupportedparameter
key_compare_func
: CompareFuncparameter
key_destroy_func
: DestroyNotify
Constructors
Functions
Removes all keys and values from the #GTree and decreases its reference count by one. If keys and/or values are dynamically allocated, you should either free them first or create the #GTree using g_tree_new_full(). In the latter case the destroy functions you supplied will be called on all keys and values before destroying the #GTree.
Calls the given function for each of the key/value pairs in the #GTree. The function is passed the key and value of each pair, and the given
Calls the given function for each of the nodes in the #GTree. The function is passed the pointer to the particular node, and the given
Gets the value corresponding to the given key. Since a #GTree is automatically balanced as key/value pairs are added, key lookup is O(log n) (where n is the number of key/value pairs in the tree).
Searches a #GTree using @search_func.