headers/cpp/stl_tree.h

1028

_Link_type __y =

headers/cpp/stl_tree.h

1029

(_Link_type) _Rb_tree_rebalance_for_erase(__position._M_node,

headers/cpp/stl_tree.h

1050

typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type

headers/cpp/stl_tree.h

1052

::_M_copy(_Link_type __x, _Link_type __p)

headers/cpp/stl_tree.h

1055

_Link_type __top = _M_clone_node(__x);

headers/cpp/stl_tree.h

1065

_Link_type __y = _M_clone_node(__x);

headers/cpp/stl_tree.h

1082

::_M_erase(_Link_type __x)

headers/cpp/stl_tree.h

1087

_Link_type __y = _S_left(__x);

headers/cpp/stl_tree.h

1117

_Link_type __y = _M_header; // Last node which is not less than __k.

headers/cpp/stl_tree.h

1118

_Link_type __x = _M_root(); // Current node.

headers/cpp/stl_tree.h

1136

_Link_type __y = _M_header; /* Last node which is not less than __k. */

headers/cpp/stl_tree.h

1137

_Link_type __x = _M_root(); /* Current node. */

headers/cpp/stl_tree.h

1168

_Link_type __y = _M_header; /* Last node which is not less than __k. */

headers/cpp/stl_tree.h

1169

_Link_type __x = _M_root(); /* Current node. */

headers/cpp/stl_tree.h

1186

_Link_type __y = _M_header; /* Last node which is not less than __k. */

headers/cpp/stl_tree.h

1187

_Link_type __x = _M_root(); /* Current node. */

headers/cpp/stl_tree.h

1204

_Link_type __y = _M_header; /* Last node which is greater than __k. */

headers/cpp/stl_tree.h

1205

_Link_type __x = _M_root(); /* Current node. */

headers/cpp/stl_tree.h

1222

_Link_type __y = _M_header; /* Last node which is greater than __k. */

headers/cpp/stl_tree.h

1223

_Link_type __x = _M_root(); /* Current node. */

headers/cpp/stl_tree.h

1280

_Link_type __x = (_Link_type) __it._M_node;

headers/cpp/stl_tree.h

1281

_Link_type __L = _S_left(__x);

headers/cpp/stl_tree.h

1282

_Link_type __R = _S_right(__x);

headers/cpp/stl_tree.h

164

_Rb_tree_iterator(_Link_type __x) { _M_node = __x; }

headers/cpp/stl_tree.h

167

reference operator*() const { return _Link_type(_M_node)->_M_value_field; }

headers/cpp/stl_tree.h

552

_Link_type _M_create_node(const value_type& __x)

headers/cpp/stl_tree.h

554

_Link_type __tmp = _M_get_node();

headers/cpp/stl_tree.h

562

_Link_type _M_clone_node(_Link_type __x)

headers/cpp/stl_tree.h

564

_Link_type __tmp = _M_create_node(__x->_M_value_field);

headers/cpp/stl_tree.h

571

void destroy_node(_Link_type __p)

headers/cpp/stl_tree.h

581

_Link_type& _M_root() const

headers/cpp/stl_tree.h

582

{ return (_Link_type&) _M_header->_M_parent; }

headers/cpp/stl_tree.h

583

_Link_type& _M_leftmost() const

headers/cpp/stl_tree.h

584

{ return (_Link_type&) _M_header->_M_left; }

headers/cpp/stl_tree.h

585

_Link_type& _M_rightmost() const

headers/cpp/stl_tree.h

586

{ return (_Link_type&) _M_header->_M_right; }

headers/cpp/stl_tree.h

588

static _Link_type& _S_left(_Link_type __x)

headers/cpp/stl_tree.h

589

{ return (_Link_type&)(__x->_M_left); }

headers/cpp/stl_tree.h

590

static _Link_type& _S_right(_Link_type __x)

headers/cpp/stl_tree.h

591

{ return (_Link_type&)(__x->_M_right); }

headers/cpp/stl_tree.h

592

static _Link_type& _S_parent(_Link_type __x)

headers/cpp/stl_tree.h

593

{ return (_Link_type&)(__x->_M_parent); }

headers/cpp/stl_tree.h

594

static reference _S_value(_Link_type __x)

headers/cpp/stl_tree.h

596

static const _Key& _S_key(_Link_type __x)

headers/cpp/stl_tree.h

598

static _Color_type& _S_color(_Link_type __x)

headers/cpp/stl_tree.h

601

static _Link_type& _S_left(_Base_ptr __x)

headers/cpp/stl_tree.h

602

{ return (_Link_type&)(__x->_M_left); }

headers/cpp/stl_tree.h

603

static _Link_type& _S_right(_Base_ptr __x)

headers/cpp/stl_tree.h

604

{ return (_Link_type&)(__x->_M_right); }

headers/cpp/stl_tree.h

605

static _Link_type& _S_parent(_Base_ptr __x)

headers/cpp/stl_tree.h

606

{ return (_Link_type&)(__x->_M_parent); }

headers/cpp/stl_tree.h

608

{ return ((_Link_type)__x)->_M_value_field; }

headers/cpp/stl_tree.h

610

{ return _KeyOfValue()(_S_value(_Link_type(__x)));}

headers/cpp/stl_tree.h

612

{ return (_Color_type&)(_Link_type(__x)->_M_color); }

headers/cpp/stl_tree.h

614

static _Link_type _S_minimum(_Link_type __x)

headers/cpp/stl_tree.h

615

{ return (_Link_type) _Rb_tree_node_base::_S_minimum(__x); }

headers/cpp/stl_tree.h

617

static _Link_type _S_maximum(_Link_type __x)

headers/cpp/stl_tree.h

618

{ return (_Link_type) _Rb_tree_node_base::_S_maximum(__x); }

headers/cpp/stl_tree.h

639

_Link_type _M_copy(_Link_type __x, _Link_type __p);

headers/cpp/stl_tree.h

640

void _M_erase(_Link_type __x);

headers/cpp/stl_tree.h

825

_Link_type __x = (_Link_type) __x_;

headers/cpp/stl_tree.h

826

_Link_type __y = (_Link_type) __y_;

headers/cpp/stl_tree.h

827

_Link_type __z;

headers/cpp/stl_tree.h

861

_Link_type __y = _M_header;

headers/cpp/stl_tree.h

862

_Link_type __x = _M_root();

headers/cpp/stl_tree.h

879

_Link_type __y = _M_header;

headers/cpp/stl_tree.h

880

_Link_type __x = _M_root();