__gnu_cxx::rb_tree3cxx
Usage
Inherits std::_Rb_tree<
_Key,
_Val,
_KeyOfValue,
_Compare,
_Alloc
>.
Public Types
typedef std::_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
using insert_return_type
=
_Node_insert_return<
__conditional_t<
is_same_v<
_Key,
_Val
>,
const_iterator,
iterator
>,
node_type
>
typedef _Rb_tree_iterator<
value_type
>
iterator
typedef _Key
key_type
using node_type
=
_Node_handle<
_Key,
_Val,
_Node_allocator
>
typedef value_type
*
pointer
typedef value_type
&
reference
typedef std::reverse_iterator<
iterator
>
reverse_iterator
typedef size_t
size_type
typedef _Val
value_type
Public Member Functions
rb_tree (const
_Compare
&__comp=_Compare(),
const
allocator_type
&__a=allocator_type())
bool __rb_verify
()
const
const _Node_allocator
&
_M_get_Node_allocator
()
const
noexcept
_Node_allocator &
_M_get_Node_allocator
()
noexcept
const_iterator begin
()
const
noexcept
iterator begin
()
noexcept
void clear
()
noexcept
size_type count
(const
key_type
&__k)
const
bool empty
()
const
noexcept
const_iterator end
()
const
noexcept
iterator end
()
noexcept
size_type erase
(const
key_type
&__x)
_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)
node_type extract
(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
Protected Types
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
Protected Member Functions
_Const_Link_type _M_begin
()
const
noexcept
_Link_type _M_begin
()
noexcept
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
_Link_type _M_mbegin
()
const
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 Protected Member Functions
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
Detailed Description
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = std::allocator<_Value>>
struct __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >"This is an SGI extension.
Todo
Needs documentation! See http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.html
Member Function Documentation
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _Compare2 > void std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_merge_equal (_Compatible_tree< _Compare2 > & __src) [inline], [noexcept], [inherited]
Merge from a compatible container into one with equivalent keys.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> template<typename _Compare2 > void std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_merge_unique (_Compatible_tree< _Compare2 > & __src) [inline], [noexcept], [inherited]
Merge from a compatible container into one with unique keys.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_reinsert_node_equal (node_type && __nh) [inline], [inherited]
Re-insert an extracted node.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_reinsert_node_hint_equal (const_iterator __hint, node_type && __nh) [inline], [inherited]
Re-insert an extracted node.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_reinsert_node_hint_unique (const_iterator __hint, node_type && __nh) [inline], [inherited]
Re-insert an extracted node.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> insert_return_type std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_reinsert_node_unique (node_type && __nh) [inline], [inherited]
Re-insert an extracted node.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> node_type std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::extract (const key_type & __k) [inline], [inherited]
Extract a node.
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc = allocator<_Val>> node_type std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::extract (const_iterator __pos) [inline], [inherited]
Extract a node.
History
- Debian 13 (Trixie): the text shown here
- Debian 12 (Bookworm)
- Debian 11 (Bullseye)
- Debian 10 (Buster)
- Debian 9 (Stretch)
- Debian 7 (Wheezy)
- Debian 6.0 (Squeeze)