Home
last modified time | relevance | path

Searched refs:__root (Results 1 – 6 of 6) sorted by relevance

/openbsd-src/gnu/gcc/libstdc++-v3/src/
H A Dtree.cc125 _Rb_tree_node_base*& __root) in _Rb_tree_rotate_left() argument
134 if (__x == __root) in _Rb_tree_rotate_left()
135 __root = __y; in _Rb_tree_rotate_left()
146 _Rb_tree_node_base*& __root) in _Rb_tree_rotate_right() argument
155 if (__x == __root) in _Rb_tree_rotate_right()
156 __root = __y; in _Rb_tree_rotate_right()
171 _Rb_tree_node_base *& __root = __header._M_parent; in _Rb_tree_insert_and_rebalance() local
203 while (__x != __root in _Rb_tree_insert_and_rebalance()
223 _Rb_tree_rotate_left(__x, __root); in _Rb_tree_insert_and_rebalance()
227 _Rb_tree_rotate_right(__xpp, __root); in _Rb_tree_insert_and_rebalance()
[all …]
/openbsd-src/gnu/llvm/libcxx/include/
H A D__tree82 algorithms taking a parameter named __root should assume that __root
85 Each algorithm herein assumes that __root->__parent_ points to a non-null
86 structure which has a member __left_ which points back to __root. No other
87 member is read or written to at __root->__parent_.
89 __root->__parent_ will be referred to below (in comments only) as end_node.
90 end_node->__left_ is an externably accessible lvalue for __root, and can be
94 __root, have a non-null __parent_ field.
143 // Determines if the red black tree rooted at __root is a proper red black tree.
144 // __root == nullptr is a proper tree. Returns true is __root is a proper
148 __tree_invariant(_NodePtr __root)
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_tree.h268 _Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) in _Rb_tree_rotate_left() argument
276 if (__x == __root) in _Rb_tree_rotate_left()
277 __root = __y; in _Rb_tree_rotate_left()
287 _Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) in _Rb_tree_rotate_right() argument
295 if (__x == __root) in _Rb_tree_rotate_right()
296 __root = __y; in _Rb_tree_rotate_right()
306 _Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) in _Rb_tree_rebalance() argument
309 while (__x != __root in _Rb_tree_rebalance()
327 _Rb_tree_rotate_left(__x, __root); in _Rb_tree_rebalance()
331 _Rb_tree_rotate_right(__x->_M_parent->_M_parent, __root); in _Rb_tree_rebalance()
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_tree.h310 _Rb_tree_node_base*& __root);
314 _Rb_tree_node_base*& __root);
1515 const _Rb_tree_node_base* __root);
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dstl_rope.h904 _Rope_iterator_base(_RopeRep* __root, size_t __pos) in _Rope_iterator_base() argument
905 : _M_current_pos(__pos), _M_root(__root), _M_buf_ptr(0) {} in _Rope_iterator_base()
929 _Rope_const_iterator(const _RopeRep* __root, size_t __pos): in _Rope_const_iterator() argument
931 const_cast<_RopeRep*>(__root), __pos) in _Rope_const_iterator()
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/
H A Drope1079 _Rope_iterator_base(_RopeRep* __root, size_t __pos)
1080 : _M_current_pos(__pos), _M_root(__root), _M_buf_ptr(0) { }
1113 _Rope_const_iterator(const _RopeRep* __root, size_t __pos)
1114 : _Rope_iterator_base<_CharT, _Alloc>(const_cast<_RopeRep*>(__root),