|EAPI Cmaid_Set *||cmaid_tree_set_new (const Cmaid_Value *key)|
|Creates a new set using the tree implementation. |
|EAPI Cmaid_Map *||cmaid_tree_map_new (const Cmaid_Value *key, const Cmaid_Value *val)|
|Creates a new map using the tree implementation. |
|EAPI const Cmaid_Set_Interface||cmaid_tree_set_if|
|EAPI const Cmaid_Map_Interface||cmaid_tree_map_if|
|EAPI const Cmaid_Iter_Interface||cmaid_tree_key_iter_if|
|EAPI const Cmaid_Iter_Interface||cmaid_tree_value_iter_if|
The tree implementation is a red-black tree. It is lexically ordered. The operations for insertion, removes and look-ups, is guaranteed to be O(log N). The average memory usage is higher then for hash table. Hence it is preferable in most cases to use a hash table, as long as you don't need the lexically order or a good hash function is hard to figure out.
Creates a new map using the tree implementation.
|key||The value structure defining the type of the objects used for the key object.|
|value||The value structure defining the type of the objects used for the value object.|