Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_tree.c61 _Rb_tree_node_base*& __root) { in _Rotate_left() argument
68 if (__x == __root) in _Rotate_left()
69 __root = __y; in _Rotate_left()
80 _Rb_tree_node_base*& __root) { in _Rotate_right() argument
87 if (__x == __root) in _Rotate_right()
88 __root = __y; in _Rotate_right()
99 _Rb_tree_node_base*& __root) { in _Rebalance() argument
101 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) { in _Rebalance()
113 _Rotate_left(__x, __root); in _Rebalance()
117 _Rotate_right(__x->_M_parent->_M_parent, __root); in _Rebalance()
[all …]
D_string_operators.h130 …__root_type __root(__rhs, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__lhs.get_allocat…
133 _STLP_PRIV __on_right>(__lhs, __root);
175 …__root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_Cha…
177 … __root_type, _STLP_PRIV __on_right>(__x, __root);
194 …__root_type __root(__y, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__y.get_allocator()…
197 … _STLP_PRIV __on_right>(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), __root);
239 …__root_type __root(__c, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator()…
241 … __root_type, _STLP_PRIV __on_right>(__x, __root);
256 …__root_type __root(__x, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator()…
258 … __root_type, _STLP_PRIV __on_right>(__c, __root);
D_tree.h117 static void _STLP_CALL _Rebalance(_Base_ptr __x, _Base_ptr& __root);
119 _Base_ptr& __root,
126 static void _STLP_CALL _Rotate_left (_Base_ptr __x, _Base_ptr& __root);
127 static void _STLP_CALL _Rotate_right(_Base_ptr __x, _Base_ptr& __root);
D_rope.h818 _Rope_iterator_base(_RopeRep* __root, size_t __pos)
819 : _M_current_pos(__pos),_M_root(__root), _M_buf_ptr(0) {}
881 _Rope_const_iterator(const _RopeRep* __root, size_t __pos):
882 _Rope_iterator_base<_CharT,_Alloc>(__CONST_CAST(_RopeRep*,__root), __pos)
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__tree45 algorithms taking a parameter named __root should assume that __root
48 Each algorithm herein assumes that __root->__parent_ points to a non-null
49 structure which has a member __left_ which points back to __root. No other
50 member is read or written to at __root->__parent_.
52 __root->__parent_ will be referred to below (in comments only) as end_node.
53 end_node->__left_ is an externably accessible lvalue for __root, and can be
57 __root, have a non-null __parent_ field.
106 // Determintes if the red black tree rooted at __root is a proper red black tree.
107 // __root == nullptr is a proper tree. Returns true is __root is a proper
111 __tree_invariant(_NodePtr __root)
[all …]
Dmap1196 __node_pointer __nd = __tree_.__root();
1241 __node_const_pointer __nd = __tree_.__root();