libstdc++
|
Go to the source code of this file.
Namespaces | |
std | |
Macros | |
#define | __cpp_lib_generic_associative_lookup |
Enumerations | |
enum | _Rb_tree_color { _S_red, _S_black } |
Functions | |
return __z | std::_M_insert (__res) |
return | std::_M_insert_ (__res.first, __res.second, std::forward< _Arg >(__v), __an) |
return __z | std::_M_insert_equal_lower () |
return | std::_M_insert_lower (__y, std::forward< _Arg >(__v)) |
return | std::_M_insert_lower_node (__y, __z) |
unsigned int | std::_Rb_tree_black_count (const _Rb_tree_node_base *__node, const _Rb_tree_node_base *__root) throw () |
_Rb_tree_node_base * | std::_Rb_tree_decrement (_Rb_tree_node_base *__x) throw () |
const _Rb_tree_node_base * | std::_Rb_tree_decrement (const _Rb_tree_node_base *__x) throw () |
_Rb_tree_node_base * | std::_Rb_tree_increment (_Rb_tree_node_base *__x) throw () |
const _Rb_tree_node_base * | std::_Rb_tree_increment (const _Rb_tree_node_base *__x) throw () |
void | std::_Rb_tree_insert_and_rebalance (const bool __insert_left, _Rb_tree_node_base *__x, _Rb_tree_node_base *__p, _Rb_tree_node_base &__header) throw () |
std::_Rb_tree_insert_and_rebalance (__insert_left, __z, __p, this->_M_impl._M_header) | |
_Rb_tree_node_base * | std::_Rb_tree_rebalance_for_erase (_Rb_tree_node_base *const __z, _Rb_tree_node_base &__header) throw () |
return | std::_Res (iterator(__res.first), false) |
std::if (__res.second) | |
return | std::iterator (__z) |
return | std::iterator (__res.first) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
void | std::swap (_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
std::while (__x!=0) | |
Variables | |
template<typename _Arg > | |
_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > ::iterator _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >bool | std::__insert_left |
pair< _Base_ptr, _Base_ptr > | std::__res |
template<typename _Arg > | |
_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > ::iterator _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >_Link_type | std::__x |
_Base_ptr | std::__y |
_Link_type | std::__z |
_M_impl | std::_M_node_count |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
auto | std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >iterator |
template<typename... _Args> | |
auto | std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >pair< iterator, bool > |
template<typename _Arg > | |
pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, bool > _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > typedef pair< iterator, bool > | std::_Res |
std::return | |
This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <map> or <set>.
Definition in file stl_tree.h.