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

#include <maps.h>

Public Attributes
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))"

Member Data Documentation

◆ item_count

gate_size_t gate_map_class::item_count

Map element counter

◆ key_comparer

gate_comparer_t gate_map_class::key_comparer

Compare function to sort keys

◆ key_constructor

gate_mem_copyctor_t gate_map_class::key_constructor

Constructor of key element types

◆ key_destructor

gate_mem_dtor_t gate_map_class::key_destructor

Destructor of key element types

◆ key_size

gate_size_t gate_map_class::key_size

Size of key element type

◆ root

gate_treenode_t* gate_map_class::root

Pointer to tree root node

◆ value_constructor

gate_mem_copyctor_t gate_map_class::value_constructor

Constructor of value element types

◆ value_destructor

gate_mem_dtor_t gate_map_class::value_destructor

Destructor of value element types

◆ value_size

gate_size_t gate_map_class::value_size

Size of value element type

The documentation for this struct was generated from the following file:

src/gate/maps.h

Public Attributes