Synopsis
#include <libhrel/relation.h>
HBTree;
HBTree* h_btree_new (GCompareDataFunc key_compare_func,
gpointer key_compare_data);
HBTree* h_btree_new_full (GCompareDataFunc key_compare_func,
gpointer key_compare_data,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func);
void h_btree_destroy (HBTree *tree);
guint h_btree_n_nodes (HBTree *tree,
GTraverseFlags flags);
guint h_btree_height (HBTree *tree);
gpointer h_btree_lookup (HBTree *tree,
gconstpointer key);
void h_btree_insert (HBTree *tree,
gpointer key,
gpointer value);
gboolean h_btree_delete (HBTree *tree,
gconstpointer key);
void h_btree_foreach (HBTree *tree,
GTraverseFunc func,
gpointer user_data);
Description
BTree data type.
Details
HBTree
typedef struct _HBTree HBTree;
h_btree_new ()
HBTree* h_btree_new (GCompareDataFunc key_compare_func,
gpointer key_compare_data);
key_compare_func : |
|
key_compare_data : |
|
Returns : |
|
h_btree_new_full ()
HBTree* h_btree_new_full (GCompareDataFunc key_compare_func,
gpointer key_compare_data,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func);
key_compare_func : |
|
key_compare_data : |
|
key_destroy_func : |
|
value_destroy_func : |
|
Returns : |
|
h_btree_destroy ()
void h_btree_destroy (HBTree *tree);
h_btree_n_nodes ()
guint h_btree_n_nodes (HBTree *tree,
GTraverseFlags flags);
h_btree_height ()
guint h_btree_height (HBTree *tree);
h_btree_lookup ()
gpointer h_btree_lookup (HBTree *tree,
gconstpointer key);
h_btree_insert ()
void h_btree_insert (HBTree *tree,
gpointer key,
gpointer value);
h_btree_delete ()
gboolean h_btree_delete (HBTree *tree,
gconstpointer key);
h_btree_foreach ()
void h_btree_foreach (HBTree *tree,
GTraverseFunc func,
gpointer user_data);
tree : |
|
func : |
|
user_data : |
|