Home
last modified time | relevance | path

Searched refs:__new_node (Results 1 – 4 of 4) sorted by relevance

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_slist_base.h44 _Slist_node_base* __new_node) { in __slist_make_link() argument
45 __new_node->_M_next = __prev_node->_M_next; in __slist_make_link()
46 __prev_node->_M_next = __new_node; in __slist_make_link()
47 return __new_node; in __slist_make_link()
D_tree.c356 _Base_ptr __new_node; in _M_insert() local
359 __new_node = _M_create_node(__val); in _M_insert()
360 _S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node in _M_insert()
361 _M_root() = __new_node; in _M_insert()
362 _M_rightmost() = __new_node; in _M_insert()
367 __new_node = _M_create_node(__val); in _M_insert()
368 _S_left(__parent) = __new_node; in _M_insert()
370 _M_leftmost() = __new_node; // maintain _M_leftmost() pointing to min node in _M_insert()
373 __new_node = _M_create_node(__val); in _M_insert()
374 _S_right(__parent) = __new_node; in _M_insert()
[all …]
D_deque.h155 void _M_set_node(_Map_pointer __new_node) { in _M_set_node()
156 _M_last = (_M_first = *(_M_node = __new_node)) + difference_type(_S_buffer_size()); in _M_set_node()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__tree979 __node_base_pointer __new_node);
1709 __node_base_pointer __new_node)
1711 __new_node->__left_ = nullptr;
1712 __new_node->__right_ = nullptr;
1713 __new_node->__parent_ = __parent;
1714 __child = __new_node;