Searched refs:_M_right (Results 1 - 3 of 3) sorted by relevance

/freebsd-11.0-release/contrib/libstdc++/src/
H A Dtree.cc65 if (__x->_M_right != 0)
67 __x = __x->_M_right;
74 while (__x == __y->_M_right)
79 if (__x->_M_right != __y)
96 __x = __x->_M_right;
100 while (__y->_M_right != 0)
101 __y = __y->_M_right;
127 _Rb_tree_node_base* const __y = __x->_M_right;
129 __x->_M_right = __y->_M_left;
139 __x->_M_parent->_M_right
[all...]
/freebsd-11.0-release/contrib/libstdc++/include/bits/
H A Dstl_tree.h103 _Base_ptr _M_right; member in struct:_Rb_tree_node_base
122 while (__x->_M_right != 0) __x = __x->_M_right;
129 while (__x->_M_right != 0) __x = __x->_M_right;
395 __tmp->_M_right = 0;
432 this->_M_header._M_right = &this->_M_header;
462 this->_M_header._M_right = &this->_M_header;
487 { return this->_M_impl._M_header._M_right; }
491 { return this->_M_impl._M_header._M_right; }
[all...]
/freebsd-11.0-release/contrib/libstdc++/include/ext/
H A Dropeimpl.h166 __curr_rope = __c->_M_right;
234 __current_node = __c->_M_right;
551 && __detail::_S_leaf == ((_RopeConcatenation*) __r)->_M_right->_M_tag)
554 (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right);
617 __r)->_M_right);
628 ((_RopeConcatenation*)__r)->_M_right = __new_right;
679 __left)->_M_right->_M_tag)
682 (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right);
747 _RopeRep* __right = __c->_M_right;
946 _RopeRep* __right = __conc->_M_right;
[all...]

Completed in 30 milliseconds