base_map< K, T, Pr, M >::_node_ Class Reference

base node More...

#include <map.h>

Inheritance diagram for base_map< K, T, Pr, M >::_node_:

List of all members.

Public Member Functions
	_node_ ()
	constructor
Public Attributes
_node *	_left
	pointer to left node
_node *	_parent
	pointer to parent node
_node *	_right
	pointer to right node
redblack	_color
	node color
nodetype	_type
	node type

---

Detailed Description

template<class K, class T, class Pr = less< K >, bool M = false>
class base_map< K, T, Pr, M >::_node_

base node

Definition at line 111 of file map.h.

---

Constructor & Destructor Documentation

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::_node_::_node_

(

)

[inline]

constructor

Definition at line 115 of file map.h.

---

Member Data Documentation

template<class K, class T, class Pr = less< K >, bool M = false>

_node* base_map< K, T, Pr, M >::_node_::_left

pointer to left node

Definition at line 124 of file map.h.

Referenced by base_map< K, T, Pr, M >::const_iterator::_dec(), base_map< K, T, Pr, M >::const_iterator::_inc(), base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::_lrotate(), base_map< K, T, Pr, M >::_node::_min(), base_map< K, T, Pr, M >::_rrotate(), base_map< K, T, Pr, M >::begin(), base_map< K, T, Pr, M >::clear(), base_map< K, T, Pr, M >::const_iterator::left(), and base_map< K, T, Pr, M >::lmost().

template<class K, class T, class Pr = less< K >, bool M = false>

_node* base_map< K, T, Pr, M >::_node_::_parent

pointer to parent node

Definition at line 125 of file map.h.

Referenced by map< K, T, Pr, M >::_buynode(), base_map< K, T, Pr, M >::const_iterator::_dec(), base_map< K, T, Pr, M >::const_iterator::_inc(), base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::_lbound(), base_map< K, T, Pr, M >::_lrotate(), 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 >::erase(), _map< K, T, A, Pr, M >::erase(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), base_map< K, T, Pr, M >::const_iterator::parent(), and base_map< K, T, Pr, M >::root().

template<class K, class T, class Pr = less< K >, bool M = false>

_node* base_map< K, T, Pr, M >::_node_::_right

pointer to right node

Definition at line 126 of file map.h.

Referenced by base_map< K, T, Pr, M >::const_iterator::_dec(), base_map< K, T, Pr, M >::const_iterator::_inc(), base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::_lrotate(), base_map< K, T, Pr, M >::_node::_max(), base_map< K, T, Pr, M >::_rrotate(), base_map< K, T, Pr, M >::clear(), base_map< K, T, Pr, M >::const_iterator::right(), and base_map< K, T, Pr, M >::rmost().

template<class K, class T, class Pr = less< K >, bool M = false>

redblack base_map< K, T, Pr, M >::_node_::_color

node color

Definition at line 127 of file map.h.

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

template<class K, class T, class Pr = less< K >, bool M = false>

nodetype base_map< K, T, Pr, M >::_node_::_type

node type

Definition at line 128 of file map.h.

Referenced by base_map< K, T, Pr, M >::const_iterator::_dec(), base_map< K, T, Pr, M >::const_iterator::_inc(), base_map< K, T, Pr, M >::_node::_max(), base_map< K, T, Pr, M >::_node::_min(), and base_map< K, T, Pr, M >::clear().

---

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

• map.h