libstdc++
|
Go to the source code of this file.
Namespaces | |
std | |
Enumerations | |
enum | _Rb_tree_color { _S_red, _S_black } |
Functions | |
else return __position | std::_M_const_cast () |
return | std::_M_insert_ (__x, __y, std::forward< _Arg >(__v)) |
return | std::_M_insert_ (0, _M_rightmost(), std::forward< _Arg >(__v)) |
else return | std::_M_insert_equal (std::forward< _Arg >(__v)) |
else return | std::_M_insert_equal_lower (std::forward< _Arg >(__v)) |
return | std::_M_insert_lower (__x, __y, std::forward< _Arg >(__v)) |
else return | std::_M_insert_unique (std::forward< _Arg >(__v)).first |
_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > ::iterator | std::_M_rightmost () |
template<typename _Arg > | |
_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > ::iterator | std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >if (size() > 0 &&_M_impl._M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__v))) return _M_insert_(0 |
template<typename _Arg > | |
_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > ::iterator | std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >if (size() > 0 &&!_M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(_M_rightmost()))) return _M_insert_(0 |
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, const_cast< _Base_ptr >(__p), this->_M_impl._M_header) | |
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 () |
std::bool (_M_insert_(__x, __y, std::forward< _Arg >(__v)), true) | |
std::if (__comp) | |
std::if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v))) return pair< iterator | |
else | std::if (_M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__position._M_node))) |
else | std::if (_M_impl._M_key_compare(_S_key(__position._M_node), _KeyOfValue()(__v))) |
else | std::if (!_M_impl._M_key_compare(_S_key(__position._M_node), _KeyOfValue()(__v))) |
else | std::if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), _KeyOfValue()(__v))) |
return | std::iterator (__z) |
template<typename _Val > | |
bool | std::operator!= (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator!= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator< (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator<= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Val > | |
bool | std::operator== (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator== (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator> (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | std::operator>= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
return | std::pair< iterator, bool > (__j, false) |
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) | |
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.