Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members  

std::_Rb_tree Class Template Reference

#include <stl_tree.h>

Inherits std::_Rb_tree_base< _Value, _Alloc >.

Inherited by std::rb_tree.

List of all members.

Public Types


Public Methods


Protected Types


Protected Methods


Protected Attributes


Static Protected Methods

template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>> class std::_Rb_tree


Member Typedef Documentation

typedef _Rb_tree_node_base* _Base_ptr [protected]
 

typedef _Rb_tree_node<_Value> _Rb_tree_node [protected]
 

typedef _Rb_tree_Color_type _Color_type [protected]
 

typedef _Key key_type
 

typedef _Value value_type
 

typedef value_type* pointer
 

typedef const value_type* const_pointer
 

typedef value_type& reference
 

typedef const value_type& const_reference
 

typedef _Rb_tree_node* _Link_type
 

typedef size_t size_type
 

typedef ptrdiff_t difference_type
 

typedef _Base::allocator_type allocator_type
 

Reimplemented from std::_Rb_tree_base.

Reimplemented in std::rb_tree.

typedef _Rb_tree_iterator<value_type, reference, pointer> iterator
 

typedef _Rb_tree_iterator<value_type, const_reference, const_pointer> const_iterator
 

typedef reverse_iterator<const_iterator> const_reverse_iterator
 

typedef reverse_iterator<iterator> reverse_iterator
 


Constructor & Destructor Documentation

_Rb_tree ( ) [inline]
 

_Rb_tree ( const _Compare & __comp ) [inline]
 

_Rb_tree ( const _Compare & __comp,
const allocator_type & __a ) [inline]
 

_Rb_tree ( const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > & __x ) [inline]
 

~_Rb_tree ( ) [inline]
 


Member Function Documentation

allocator_type get_allocator ( ) const [inline]
 

Reimplemented from std::_Rb_tree_alloc_base.

_Link_type _M_create_node ( const value_type & __x ) [inline, protected]
 

_Link_type _M_clone_node ( _Link_type __x ) [inline, protected]
 

void destroy_node ( _Link_type __p ) [inline, protected]
 

_Link_type & _M_root ( ) const [inline, protected]
 

_Link_type & _M_leftmost ( ) const [inline, protected]
 

_Link_type & _M_rightmost ( ) const [inline, protected]
 

_Link_type& _S_left ( _Link_type __x ) [inline, static, protected]
 

_Link_type& _S_right ( _Link_type __x ) [inline, static, protected]
 

_Link_type& _S_parent ( _Link_type __x ) [inline, static, protected]
 

reference _S_value ( _Link_type __x ) [inline, static, protected]
 

const _Key& _S_key ( _Link_type __x ) [inline, static, protected]
 

_Color_type& _S_color ( _Link_type __x ) [inline, static, protected]
 

_Link_type& _S_left ( _Base_ptr __x ) [inline, static, protected]
 

_Link_type& _S_right ( _Base_ptr __x ) [inline, static, protected]
 

_Link_type& _S_parent ( _Base_ptr __x ) [inline, static, protected]
 

reference _S_value ( _Base_ptr __x ) [inline, static, protected]
 

const _Key& _S_key ( _Base_ptr __x ) [inline, static, protected]
 

_Color_type& _S_color ( _Base_ptr __x ) [inline, static, protected]
 

_Link_type _S_minimum ( _Link_type __x ) [inline, static, protected]
 

_Link_type _S_maximum ( _Link_type __x ) [inline, static, protected]
 

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& operator= ( const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > & __x )
 

_Compare key_comp ( ) const [inline]
 

iterator begin ( ) [inline]
 

const_iterator begin ( ) const [inline]
 

iterator end ( ) [inline]
 

const_iterator end ( ) const [inline]
 

reverse_iterator rbegin ( ) [inline]
 

const_reverse_iterator rbegin ( ) const [inline]
 

reverse_iterator rend ( ) [inline]
 

const_reverse_iterator rend ( ) const [inline]
 

bool empty ( ) const [inline]
 

size_type size ( ) const [inline]
 

size_type max_size ( ) const [inline]
 

void swap ( _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > & __t ) [inline]
 

pair<iterator,bool> insert_unique ( const value_type & __x )
 

iterator insert_equal ( const value_type & __x )
 

iterator insert_unique ( iterator __position,
const value_type & __x )
 

iterator insert_equal ( iterator __position,
const value_type & __x )
 

void insert_unique ( _InputIterator __first,
_InputIterator __last )
 

void insert_equal ( _InputIterator __first,
_InputIterator __last )
 

void erase ( iterator __position ) [inline]
 

size_type erase ( const key_type & __x )
 

void erase ( iterator __first,
iterator __last )
 

void erase ( const key_type * __first,
const key_type * __last )
 

void clear ( ) [inline]
 

iterator find ( const key_type & __x )
 

const_iterator find ( const key_type & __x ) const
 

size_type count ( const key_type & __x ) const
 

iterator lower_bound ( const key_type & __x )
 

const_iterator lower_bound ( const key_type & __x ) const
 

iterator upper_bound ( const key_type & __x )
 

const_iterator upper_bound ( const key_type & __x ) const
 

pair<iterator,iterator> equal_range ( const key_type & __x )
 

pair<const_iterator, const_iterator> equal_range ( const key_type & __x ) const
 

bool __rb_verify ( ) const
 


Member Data Documentation

size_type _M_node_count [protected]
 

_Compare _M_key_compare [protected]
 


The documentation for this class was generated from the following file:
Generated at Fri Apr 6 15:54:33 2001 for libstdc++ by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001