Searched refs:__root (Results 1 - 5 of 5) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/src/c++98/
H A Dtree.cc134 _Rb_tree_node_base*& __root)
143 if (__x == __root)
144 __root = __y;
158 _Rb_tree_node_base*& __root)
160 local_Rb_tree_rotate_left (__x, __root);
165 _Rb_tree_node_base*& __root)
174 if (__x == __root)
175 __root = __y;
189 _Rb_tree_node_base*& __root)
191 local_Rb_tree_rotate_right (__x, __root);
133 local_Rb_tree_rotate_left(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument
157 _Rb_tree_rotate_left(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument
164 local_Rb_tree_rotate_right(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument
188 _Rb_tree_rotate_right(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument
200 _Rb_tree_node_base *& __root = __header._M_parent; local
289 _Rb_tree_node_base *& __root = __header._M_parent; local
447 _Rb_tree_black_count(const _Rb_tree_node_base* __node, const _Rb_tree_node_base* __root) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dlosertree.h184 __init_winner(unsigned int __root) argument
186 if (__root >= _M_k)
187 return __root;
190 unsigned int __left = __init_winner(2 * __root);
191 unsigned int __right = __init_winner(2 * __root + 1);
198 _M_losers[__root] = _M_losers[__right];
204 _M_losers[__root] = _M_losers[__left];
277 * Computes the winner of the competition at position "__root".
281 * @param __root __index of the "game" to start.
284 __init_winner(unsigned int __root) argument
423 __init_winner(unsigned int __root) argument
505 __init_winner(unsigned int __root) argument
661 __init_winner(unsigned int __root) argument
749 __init_winner(unsigned int __root) argument
906 __init_winner(unsigned int __root) argument
992 __init_winner(unsigned int __root) argument
[all...]
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_tree.h217 _Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
225 if (__x == __root)
226 __root = __y;
236 _Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
244 if (__x == __root)
245 __root = __y;
255 _Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
258 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) {
270 _Rb_tree_rotate_left(__x, __root);
274 _Rb_tree_rotate_right(__x->_M_parent->_M_parent, __root);
300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z, _Rb_tree_node_base*& __root, _Rb_tree_node_base*& __leftmost, _Rb_tree_node_base*& __rightmost) argument
1257 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument
[all...]
H A Dstl_rope.h910 _Rope_iterator_base(_RopeRep* __root, size_t __pos) argument
911 : _M_root(__root), _M_current_pos(__pos), _M_buf_ptr(0) {}
933 _Rope_const_iterator(const _RopeRep* __root, size_t __pos): argument
935 const_cast<_RopeRep*>(__root), __pos)
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_tree.h2327 const _Rb_tree_node_base* __root) throw ();

Completed in 72 milliseconds