|
typedef COMPARE< KEY_TYPE > | Key_compare |
| Type of the comparison functor.
|
typedef KEY_TYPE | Key_type |
| Type of the key values.
|
typedef DATA_TYPE | Data_type |
| Type of the data values.
|
typedef Base_type::Node | Node |
| Return type for find.
|
typedef Base_type::Node_allocator | Node_allocator |
| Type of the allocator.
|
enum | |
| Return status constants. More...
|
typedef Pair< KEY_TYPE, DATA_TYPE > | Item_type |
| Type for the items store in the set.
|
typedef Bits::Avl_map_get_key< KEY_TYPE > | Get_key |
| Key-getter type to derive the sort key of an internal node.
|
typedef Bits::Avl_map_get_key< KEY_TYPE >::Key_type | Key_type |
| Type of the sort key used for the items.
|
typedef Type_traits< Item_type >::Const_type | Const_item_type |
| Type used for const items within the set.
|
typedef Lt_functor< KEY_TYPE > | Item_compare |
| Type for the comparison functor.
|
typedef New_allocator< _Node > | Node_allocator |
| Type for the node allocator.
|
typedef Avl_set_iter< _Node, Item_type, Fwd > | Iterator |
| Forward iterator for the set.
|
typedef Avl_set_iter< _Node, Const_item_type, Fwd > | Const_iterator |
| Constant forward iterator for the set.
|
typedef Avl_set_iter< _Node, Item_type, Rev > | Rev_iterator |
| Backward iterator for the set.
|
typedef Avl_set_iter< _Node, Const_item_type, Rev > | Const_rev_iterator |
| Constant backward iterator for the set.
|
template<typename KEY_TYPE, typename DATA_TYPE, template< typename A > class COMPARE = Lt_functor, template< typename B > class ALLOC = New_allocator>
class cxx::Avl_map< KEY_TYPE, DATA_TYPE, COMPARE, ALLOC >
AVL tree based associative container.
- Template Parameters
-
KEY_TYPE | Type of the key values. |
DATA_TYPE | Type of the data values. |
COMPARE | Type comparison functor for the key values. |
ALLOC | Type of the allocator used for the nodes. |
Definition at line 45 of file avl_map.
template<typename KEY_TYPE, typename DATA_TYPE, template< typename A > class COMPARE = Lt_functor, template< typename B > class ALLOC = New_allocator>
Insert a <key, data> pair into the map.
- Parameters
-
key | The key value. |
data | The data value to insert. |
- Returns
- A pair of iterator (first) and return value (second). second will be 0 if the element was inserted into the set and -#E_exist if the key was already in the set and the set was therefore not updated. In both cases, first contains an iterator that points to the element. second may also be -#E_nomem when memory for the new node could not be allocated. first is then invalid.
Definition at line 99 of file avl_map.
Referenced by cxx::Avl_map< Region, Hdlr, cxx::Lt_functor, Alloc >::operator[]().