map.h File Reference

#include "base/memory.h"

Go to the source code of this file.

Classes
class	less< T >
class	pair< T1, T2 >
	no dependences from STL containers stores a pair of values More...
class	base_map< K, T, Pr, M >
	implements binary tree More...
class	base_map< K, T, Pr, M >::_node_
	base node More...
class	base_map< K, T, Pr, M >::_node
	node with template key and value More...
class	base_map< K, T, Pr, M >::const_iterator
	const iterator More...
class	base_map< K, T, Pr, M >::iterator
	non const iterator More...
class	_map< K, T, A, Pr, M >
	all memory allocations are on the external allocators More...
class	map< K, T, Pr, M >
	impelments map with internal node allocator More...
Defines
#define	c_red   true
	read is true
#define	c_black   false
	black is false
#define	t_head   true
	head is true
#define	t_leaf   false
	leaf is false

---

Define Documentation

#define c_black   false

black is false

Definition at line 96 of file map.h.

Referenced by base_map< K, T, Pr, M >::_insert(), and base_map< K, T, Pr, M >::clear().

#define c_red   true

read is true

Definition at line 94 of file map.h.

Referenced by map< K, T, Pr, M >::_insert(), _map< K, T, A, Pr, M >::_insert(), and base_map< K, T, Pr, M >::_insert().

#define t_head   true

head is true

Definition at line 103 of file map.h.

Referenced by base_map< K, T, Pr, M >::const_iterator::_dec(), map< K, T, Pr, M >::_erase(), _map< K, T, A, Pr, M >::_erase(), base_map< K, T, Pr, M >::const_iterator::_inc(), base_map< K, T, Pr, M >::_lbound(), base_map< K, T, Pr, M >::_lrotate(), base_map< K, T, Pr, M >::_node::_max(), base_map< K, T, Pr, M >::_node::_min(), base_map< K, T, Pr, M >::_rrotate(), base_map< K, T, Pr, M >::_ubound(), base_map< K, T, Pr, M >::clear(), map< K, T, Pr, M >::insert(), and _map< K, T, A, Pr, M >::insert().

#define t_leaf   false

leaf is false

Definition at line 105 of file map.h.

Referenced by map< K, T, Pr, M >::_insert(), and _map< K, T, A, Pr, M >::_insert().