AVL Tree Index
AVL Tree Index — AVL tree index.
|
|
Synopsis
#include <libhrel/relation.h>
HAvlTreeIndex;
HAvlTreeIndex* h_avl_tree_index_new_l (GCompareDataFunc compare_func,
gpointer compare_func_data,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func,
GSList *list);
void h_avl_tree_index_free (HAvlTreeIndex *index);
void h_avl_tree_index_insert (HAvlTreeIndex *index,
HTuple *tuple,
gpointer value);
gboolean h_avl_tree_index_remove (HAvlTreeIndex *index,
HTuple *tuple);
gpointer h_avl_tree_index_lookup (HAvlTreeIndex *index,
HTuple *tuple);
void h_avl_tree_index_foreach (HAvlTreeIndex *index,
HIndexFunc func,
gpointer user_data);
Details
HAvlTreeIndex
typedef struct _HAvlTreeIndex HAvlTreeIndex;
h_avl_tree_index_new_l ()
HAvlTreeIndex* h_avl_tree_index_new_l (GCompareDataFunc compare_func,
gpointer compare_func_data,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func,
GSList *list);
compare_func : |
|
compare_func_data : |
|
key_destroy_func : |
|
value_destroy_func : |
|
list : |
|
Returns : |
|
h_avl_tree_index_free ()
void h_avl_tree_index_free (HAvlTreeIndex *index);
h_avl_tree_index_insert ()
void h_avl_tree_index_insert (HAvlTreeIndex *index,
HTuple *tuple,
gpointer value);
h_avl_tree_index_remove ()
gboolean h_avl_tree_index_remove (HAvlTreeIndex *index,
HTuple *tuple);
index : |
|
tuple : |
|
Returns : |
|
h_avl_tree_index_lookup ()
gpointer h_avl_tree_index_lookup (HAvlTreeIndex *index,
HTuple *tuple);
index : |
|
tuple : |
|
Returns : |
|
h_avl_tree_index_foreach ()
void h_avl_tree_index_foreach (HAvlTreeIndex *index,
HIndexFunc func,
gpointer user_data);
index : |
|
func : |
|
user_data : |
|