__gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >(3cxx) __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >(3cxx)

__gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >

#include <rb_tree>

Inherits std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >.


template<typename _Iter > using __same_value_type = is_same< value_type, typename iterator_traits< _Iter >::value_type >
typedef _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > _Base
typedef _Base::allocator_type allocator_type
typedef _Rb_tree_const_iterator< value_type > const_iterator
typedef const value_type * const_pointer
typedef const value_type & const_reference
typedef std::reverse_iterator< const_iterator > const_reverse_iterator
typedef ptrdiff_t difference_type
typedef _Rb_tree_iterator< value_type > iterator
typedef _Key key_type
typedef value_type * pointer
typedef value_type & reference
typedef std::reverse_iterator< iterator > reverse_iterator
typedef size_t size_type
typedef _Val value_type


rb_tree (const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
bool __rb_verify () const
template<typename _Iterator > void _M_assign_equal (_Iterator, _Iterator)
template<typename _Iterator > void _M_assign_unique (_Iterator, _Iterator)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> size_type _M_count_tr (const _Kt &__k) const
template<typename... _Args> iterator _M_emplace_equal (_Args &&... __args)
template<typename... _Args> iterator _M_emplace_hint_equal (const_iterator __pos, _Args &&... __args)
template<typename... _Args> iterator _M_emplace_hint_unique (const_iterator __pos, _Args &&... __args)
template<typename... _Args> pair< iterator, bool > _M_emplace_unique (_Args &&... __args)
template<typename... _Args> pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, bool > _M_emplace_unique (_Args &&... __args)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> pair< iterator, iterator > _M_equal_range_tr (const _Kt &__k)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> pair< const_iterator, const_iterator > _M_equal_range_tr (const _Kt &__k) const
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> iterator _M_find_tr (const _Kt &__k)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> const_iterator _M_find_tr (const _Kt &__k) const
pair< _Base_ptr, _Base_ptr > _M_get_insert_equal_pos (const key_type &__k)
pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_equal_pos (const_iterator __pos, const key_type &__k)
pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_unique_pos (const_iterator __pos, const key_type &__k)
pair< _Base_ptr, _Base_ptr > _M_get_insert_unique_pos (const key_type &__k)
const _Node_allocator & _M_get_Node_allocator () const noexcept
_Node_allocator & _M_get_Node_allocator () noexcept
template<typename _Arg > iterator _M_insert_equal (_Arg &&__x)
template<typename _Arg > iterator _M_insert_equal_ (const_iterator __pos, _Arg &&__x)
template<typename _Arg , typename _NodeGen > iterator _M_insert_equal_ (const_iterator __pos, _Arg &&__x, _NodeGen &)
template<typename _InputIterator > __enable_if_t< __same_value_type< _InputIterator >::value > _M_insert_range_equal (_InputIterator __first, _InputIterator __last)
template<typename _InputIterator > __enable_if_t<!__same_value_type< _InputIterator >::value > _M_insert_range_equal (_InputIterator __first, _InputIterator __last)
template<typename _InputIterator > __enable_if_t< __same_value_type< _InputIterator >::value > _M_insert_range_unique (_InputIterator __first, _InputIterator __last)
template<typename _InputIterator > __enable_if_t<!__same_value_type< _InputIterator >::value > _M_insert_range_unique (_InputIterator __first, _InputIterator __last)
template<typename _Arg > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, bool > _M_insert_unique (_Arg &&__v)
template<typename _Arg > pair< iterator, bool > _M_insert_unique (_Arg &&__x)
template<typename _Arg > iterator _M_insert_unique_ (const_iterator __pos, _Arg &&__x)
template<typename _Arg , typename _NodeGen > iterator _M_insert_unique_ (const_iterator __pos, _Arg &&__x, _NodeGen &)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> iterator _M_lower_bound_tr (const _Kt &__k)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> const_iterator _M_lower_bound_tr (const _Kt &__k) const
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> iterator _M_upper_bound_tr (const _Kt &__k)
template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> const_iterator _M_upper_bound_tr (const _Kt &__k) const
const_iterator begin () const noexcept
iterator begin () noexcept
void clear () noexcept
size_type count (const key_type &__k) const
_GLIBCXX_NODISCARD bool empty () const noexcept
const_iterator end () const noexcept
iterator end () noexcept
pair< iterator, iterator > equal_range (const key_type &__k)
pair< const_iterator, const_iterator > equal_range (const key_type &__k) const
size_type erase (const key_type &__x)
void erase (const key_type *__first, const key_type *__last)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __first, const_iterator __last)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __position)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (iterator __position)
iterator find (const key_type &__k)
const_iterator find (const key_type &__k) const
allocator_type get_allocator () const noexcept
_Compare key_comp () const
iterator lower_bound (const key_type &__k)
const_iterator lower_bound (const key_type &__k) const
size_type max_size () const noexcept
const_reverse_iterator rbegin () const noexcept
reverse_iterator rbegin () noexcept
const_reverse_iterator rend () const noexcept
reverse_iterator rend () noexcept
size_type size () const noexcept
void swap (_Rb_tree &__t) noexcept(/*conditional */)
iterator upper_bound (const key_type &__k)
const_iterator upper_bound (const key_type &__k) const


typedef _Rb_tree_node_base * _Base_ptr
typedef const _Rb_tree_node_base * _Const_Base_ptr
typedef const _Rb_tree_node< _Val > * _Const_Link_type
typedef _Rb_tree_node< _Val > * _Link_type


_Const_Link_type _M_begin () const noexcept
_Link_type _M_begin () noexcept
template<typename _NodeGen > _Link_type _M_clone_node (_Const_Link_type __x, _NodeGen &__node_gen)
template<typename... _Args> void _M_construct_node (_Link_type __node, _Args &&... __args)
template<typename... _Args> _Link_type _M_create_node (_Args &&... __args)
void _M_destroy_node (_Link_type __p) noexcept
void _M_drop_node (_Link_type __p) noexcept
_Const_Base_ptr _M_end () const noexcept
_Base_ptr _M_end () noexcept
_Link_type _M_get_node ()
_Const_Base_ptr _M_leftmost () const noexcept
_Base_ptr & _M_leftmost () noexcept
void _M_put_node (_Link_type __p) noexcept
_Const_Base_ptr _M_rightmost () const noexcept
_Base_ptr & _M_rightmost () noexcept
_Const_Base_ptr _M_root () const noexcept
_Base_ptr & _M_root () noexcept


static const _Key & _S_key (_Const_Base_ptr __x)
static const _Key & _S_key (_Const_Link_type __x)
static _Link_type _S_left (_Base_ptr __x) noexcept
static _Const_Link_type _S_left (_Const_Base_ptr __x) noexcept
static _Base_ptr _S_maximum (_Base_ptr __x) noexcept
static _Const_Base_ptr _S_maximum (_Const_Base_ptr __x) noexcept
static _Base_ptr _S_minimum (_Base_ptr __x) noexcept
static _Const_Base_ptr _S_minimum (_Const_Base_ptr __x) noexcept
static _Link_type _S_right (_Base_ptr __x) noexcept
static _Const_Link_type _S_right (_Const_Base_ptr __x) noexcept
static const_reference _S_value (_Const_Base_ptr __x)
static const_reference _S_value (_Const_Link_type __x)


_Rb_tree_impl< _Compare > _M_impl

struct __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >"This is an SGI extension.

Todo

\nNeeds documentation! See http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.html

Definition at line 80 of file rb_tree.

Definition at line 1109 of file stl_tree.h.

Definition at line 83 of file rb_tree.

Definition at line 444 of file stl_tree.h.

Definition at line 445 of file stl_tree.h.

Definition at line 447 of file stl_tree.h.

Definition at line 446 of file stl_tree.h.

Definition at line 84 of file rb_tree.

Definition at line 835 of file stl_tree.h.

Definition at line 558 of file stl_tree.h.

Definition at line 560 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> typedef std::reverse_iterator<const_iterator> std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::const_reverse_iterator [inherited]

Definition at line 838 of file stl_tree.h.

Definition at line 562 of file stl_tree.h.

Definition at line 834 of file stl_tree.h.

Definition at line 555 of file stl_tree.h.

Definition at line 557 of file stl_tree.h.

Definition at line 559 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> typedef std::reverse_iterator<iterator> std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::reverse_iterator [inherited]

Definition at line 837 of file stl_tree.h.

Definition at line 561 of file stl_tree.h.

Definition at line 556 of file stl_tree.h.

template<class _Key , class _Value , class _KeyOfValue , class _Compare , class _Alloc = allocator<_Value>> __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::rb_tree (const _Compare & __comp = _Compare(), const allocator_type & __a = allocator_type()) [inline]

Definition at line 86 of file rb_tree.

template<class _Key , class _Value , class _KeyOfValue , class _Compare , class _Alloc = allocator<_Value>> __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::~rb_tree () [inline]

Definition at line 90 of file rb_tree.

Definition at line 2599 of file stl_tree.h.

Definition at line 1749 of file stl_tree.h.

Definition at line 1736 of file stl_tree.h.

Definition at line 753 of file stl_tree.h.

Definition at line 749 of file stl_tree.h.

Definition at line 656 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename... _Args> void std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_construct_node (_Link_type __node, _Args &&... __args) [inline], [protected], [inherited]

Definition at line 609 of file stl_tree.h.

Definition at line 1331 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename... _Args> _Link_type std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_create_node (_Args &&... __args) [inline], [protected], [inherited]

Definition at line 628 of file stl_tree.h.

Definition at line 637 of file stl_tree.h.

Definition at line 648 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > template<typename... _Args> _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_emplace_equal (_Args &&... __args) [inherited]

Definition at line 2436 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > template<typename... _Args> _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_emplace_hint_equal (const_iterator __pos, _Args &&... __args) [inherited]

Definition at line 2483 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > template<typename... _Args> _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_emplace_hint_unique (const_iterator __pos, _Args &&... __args) [inherited]

Definition at line 2457 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename... _Args> pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, bool > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_emplace_unique (_Args &&... __args) [inherited]

Definition at line 2410 of file stl_tree.h.

Definition at line 764 of file stl_tree.h.

Definition at line 760 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> pair< iterator, iterator > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_equal_range_tr (const _Kt & __k) [inline], [inherited]

Definition at line 1394 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _Kt , typename _Req = __has_is_transparent_t<_Compare, _Kt>> pair< const_iterator, const_iterator > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_equal_range_tr (const _Kt & __k) const [inline], [inherited]

Definition at line 1404 of file stl_tree.h.

Definition at line 1311 of file stl_tree.h.

Definition at line 1320 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_get_insert_equal_pos (const key_type & __k) [inherited]

Definition at line 2122 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_get_insert_hint_equal_pos (const_iterator __pos, const key_type & __k) [inherited]

Definition at line 2278 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_get_insert_hint_unique_pos (const_iterator __pos, const key_type & __k) [inherited]

Definition at line 2192 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Base_ptr > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_get_insert_unique_pos (const key_type & __k) [inherited]

Definition at line 2090 of file stl_tree.h.

Definition at line 579 of file stl_tree.h.

Definition at line 570 of file stl_tree.h.

Definition at line 566 of file stl_tree.h.

Definition at line 2172 of file stl_tree.h.

Definition at line 1086 of file stl_tree.h.

Definition at line 2335 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _InputIterator > __enable_if_t< __same_value_type< _InputIterator >::value > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_range_equal (_InputIterator __first, _InputIterator __last) [inline], [inherited]

Definition at line 1131 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _InputIterator > __enable_if_t<!__same_value_type< _InputIterator >::value > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_range_equal (_InputIterator __first, _InputIterator __last) [inline], [inherited]

Definition at line 1140 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _InputIterator > __enable_if_t< __same_value_type< _InputIterator >::value > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_range_unique (_InputIterator __first, _InputIterator __last) [inline], [inherited]

Definition at line 1114 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _InputIterator > __enable_if_t<!__same_value_type< _InputIterator >::value > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_range_unique (_InputIterator __first, _InputIterator __last) [inline], [inherited]

Definition at line 1123 of file stl_tree.h.

Definition at line 2144 of file stl_tree.h.

Definition at line 1074 of file stl_tree.h.

Definition at line 2253 of file stl_tree.h.

Definition at line 737 of file stl_tree.h.

Definition at line 733 of file stl_tree.h.

Definition at line 1340 of file stl_tree.h.

Definition at line 1349 of file stl_tree.h.

Definition at line 583 of file stl_tree.h.

Definition at line 745 of file stl_tree.h.

Definition at line 741 of file stl_tree.h.

Definition at line 729 of file stl_tree.h.

Definition at line 725 of file stl_tree.h.

Definition at line 1367 of file stl_tree.h.

Definition at line 1376 of file stl_tree.h.

Definition at line 814 of file stl_tree.h.

Definition at line 772 of file stl_tree.h.

Definition at line 794 of file stl_tree.h.

Definition at line 798 of file stl_tree.h.

Definition at line 826 of file stl_tree.h.

Definition at line 830 of file stl_tree.h.

Definition at line 818 of file stl_tree.h.

Definition at line 822 of file stl_tree.h.

Definition at line 802 of file stl_tree.h.

Definition at line 806 of file stl_tree.h.

Definition at line 810 of file stl_tree.h.

Definition at line 768 of file stl_tree.h.

Definition at line 1015 of file stl_tree.h.

Definition at line 1011 of file stl_tree.h.

Definition at line 1269 of file stl_tree.h.

Definition at line 2584 of file stl_tree.h.

Definition at line 1043 of file stl_tree.h.

Definition at line 1023 of file stl_tree.h.

Definition at line 1019 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::equal_range (const key_type & __k) [inherited]

Definition at line 1995 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::const_iterator, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::const_iterator > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::equal_range (const key_type & __k) const [inherited]

Definition at line 2027 of file stl_tree.h.

Definition at line 2536 of file stl_tree.h.

Definition at line 2548 of file stl_tree.h.

Definition at line 1251 of file stl_tree.h.

Definition at line 1208 of file stl_tree.h.

Definition at line 1220 of file stl_tree.h.

Definition at line 2559 of file stl_tree.h.

Definition at line 2572 of file stl_tree.h.

Definition at line 574 of file stl_tree.h.

Definition at line 1007 of file stl_tree.h.

Definition at line 1286 of file stl_tree.h.

Definition at line 1290 of file stl_tree.h.

Definition at line 1051 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> const_reverse_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::rbegin () const [inline], [noexcept], [inherited]

Definition at line 1031 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> reverse_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::rbegin () [inline], [noexcept], [inherited]

Definition at line 1027 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> const_reverse_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::rend () const [inline], [noexcept], [inherited]

Definition at line 1039 of file stl_tree.h.

template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> reverse_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::rend () [inline], [noexcept], [inherited]

Definition at line 1035 of file stl_tree.h.

Definition at line 1047 of file stl_tree.h.

Definition at line 2056 of file stl_tree.h.

Definition at line 1294 of file stl_tree.h.

Definition at line 1298 of file stl_tree.h.

Definition at line 721 of file stl_tree.h.

Generated automatically by Doxygen for libstdc++ from the source code.

libstdc++