Searched refs:__parent (Results 1 – 4 of 4) sorted by relevance
/external/stlport/stlport/stl/ |
D | _heap.c | 45 _Distance __parent = (__holeIndex - 1) / 2; in __push_heap() local 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { in __push_heap() 47 *(__first + __holeIndex) = *(__first + __parent); in __push_heap() 48 __holeIndex = __parent; in __push_heap() 49 __parent = (__holeIndex - 1) / 2; in __push_heap() 79 _Distance __parent = (__holeIndex - 1) / 2; in __push_heap() local 80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) { in __push_heap() 81 … _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __push_heap() 82 *(__first + __holeIndex) = *(__first + __parent); in __push_heap() 83 __holeIndex = __parent; in __push_heap() [all …]
|
D | _tree.c | 350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, in _M_insert() argument 358 if ( __parent == &this->_M_header._M_data ) { in _M_insert() 360 _S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node in _M_insert() 366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) { in _M_insert() 368 _S_left(__parent) = __new_node; in _M_insert() 369 if (__parent == _M_leftmost()) in _M_insert() 374 _S_right(__parent) = __new_node; in _M_insert() 375 if (__parent == _M_rightmost()) in _M_insert() 378 _S_parent(__new_node) = __parent; in _M_insert()
|
D | _algo.c | 1970 _Distance __parent = 0; in __is_heap() local 1972 if (__comp(__first[__parent], __first[__child])) { in __is_heap() 1973 …_STLP_VERBOSE_ASSERT(!__comp(__first[__child], __first[__parent]), _StlMsg_INVALID_STRICT_WEAK_PRE… in __is_heap() 1977 ++__parent; in __is_heap()
|
D | _tree.h | 376 …iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr…
|