std::rb_tree(3)

NAME

std::Rb_tree

SYNOPSIS

Public Types
    typedef Key key_type
    typedef Val 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 const Rb_tree_node * ConstLink_type
    typedef size_t size_type
    typedef ptrdiff_t difference_type
    typedef Alloc allocator_type
    typedef Rb_tree_iterator< value_type > iterator
    typedef     Rb_tree_const_iterator<      value_type      >
const_iterator
    typedef std::reverse_iterator< iterator > reverse_iterator
    typedef    std::reverse_iterator<     const_iterator     >
const_reverse_iterator
Public Member Functions
    allocator_type get_allocator () const
    Rb_tree ()
    Rb_tree (const Compare &comp)
    Rb_tree (const Compare &comp, const allocator_type &a)
    Rb_tree (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x)
    ~Rb_tree ()
    Rb_tree<  Key,  Val,  KeyOfValue,  Compare,  Alloc   >   &
operator=  (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >
&x)
    Compare key_comp () const
    iterator begin ()
    const_iterator begin () const
    iterator end ()
    const_iterator end () const
    reverse_iterator rbegin ()
    const_reverse_iterator rbegin () const
    reverse_iterator rend ()
    const_reverse_iterator rend () const
    bool empty () const
    size_type size () const
    size_type max_size () const
    void swap (Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >
&__t)
    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)
    template<typename InputIterator> void  insert_unique  (InputIterator first, InputIterator last)
    template<typename  InputIterator>  void  insert_equal (InputIterator first, InputIterator last)
    void erase (iterator position)
    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 ()
    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
Protected Types
    typedef Rb_tree_node_base * Base_ptr
    typedef const Rb_tree_node_base * ConstBase_ptr
    typedef Rb_tree_node< Val > Rb_tree_node
Protected Member Functions
    Rb_tree_node * M_get_node ()
    void M_put_node (Rb_tree_node *__p)
    Link_type M_create_node (const value_type &x)
    Link_type M_clone_node (ConstLink_type x)
    void destroy_node (Link_type __p)
    Base_ptr & M_root ()
    ConstBase_ptr M_root () const
    Base_ptr & M_leftmost ()
    ConstBase_ptr M_leftmost () const
    Base_ptr & M_rightmost ()
    ConstBase_ptr M_rightmost () const
    Link_type M_begin ()
    ConstLink_type M_begin () const
    Link_type M_end ()
    ConstLink_type M_end () const
Static Protected Member Functions
    static const_reference S_value (ConstLink_type x)
    static const Key & S_key (ConstLink_type x)
    static Link_type S_left (Base_ptr x)
    static ConstLink_type S_left (ConstBase_ptr x)
    static Link_type S_right (Base_ptr x)
    static ConstLink_type S_right (ConstBase_ptr x)
    static const_reference S_value (ConstBase_ptr x)
    static const Key & S_key (ConstBase_ptr x)
    static Base_ptr S_minimum (Base_ptr x)
    static ConstBase_ptr S_minimum (ConstBase_ptr x)
    static Base_ptr S_maximum (Base_ptr x)
    static ConstBase_ptr S_maximum (ConstBase_ptr x)
Protected Attributes
    Rb_tree_impl< Compare > M_impl
Private Types
    typedef  Alloc::template  rebind<  Rb_tree_node<   Val   >
>::other Node_allocator
Private Member Functions
    iterator   M_insert   (Base_ptr   x,   Base_ptr  y,  const
value_type &__v)
    Link_type M_copy (ConstLink_type x, Link_type __p)
    void M_erase (Link_type x)
Classes
    struct Rb_tree_impl
    struct Rb_tree_impl< Key_compare, true >

Detailed Description

template<typename Key, typename Val, typename KeyOfValue,

typename Compare, typename Alloc = allocator<Val>> class

std::Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >

Definition at line 326 of file stl_tree.h.

Author

Generated automatically by Doxygen for libstdc++-v3 Source

from the source code.

libstdc++-v3 Source 1 Jan 2007

std::Rb_tree(3)