A gate_map_t structure contains is a sorted tree of key/value pairs. More...

#include <maps.h>

Data Fields
gate_comparer_t	key_comparer

gate_size_t	key_size

gate_mem_copyctor_t	key_constructor

gate_mem_dtor_t	key_destructor

gate_size_t	value_size

gate_mem_copyctor_t	value_constructor

gate_mem_dtor_t	value_destructor

gate_size_t	item_count

gate_treenode_t *	root

Detailed Description

A gate_map_t structure contains is a sorted tree of key/value pairs.

Elements are inserted by comparing their key-part. A key is unique in the map, if the same key is inserted again, it overwrites the content of previous key/value pair. Key searches have a complexity of "O(log(n))"