HomeSort by relevance Sort by last modified time
    Searched full:__parent (Results 1 - 4 of 4) sorted by null

  /external/stlport/stlport/stl/
_heap.c 45 _Distance __parent = (__holeIndex - 1) / 2; local
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) {
47 *(__first + __holeIndex) = *(__first + __parent);
48 __holeIndex = __parent;
49 __parent = (__holeIndex - 1) / 2;
79 _Distance __parent = (__holeIndex - 1) / 2; local
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
82 *(__first + __holeIndex) = *(__first + __parent);
83 __holeIndex = __parent;
195 _Distance __parent = (__len - 2)\/2; local
221 _Distance __parent = (__len - 2)\/2; local
    [all...]
_tree.c 350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent,
358 if ( __parent == &this->_M_header._M_data ) {
360 _S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
368 _S_left(__parent) = __new_node;
369 if (__parent == _M_leftmost())
374 _S_right(__parent) = __new_node;
375 if (__parent == _M_rightmost())
378 _S_parent(__new_node) = __parent;
_algo.c 1970 _Distance __parent = 0; local
    [all...]
_tree.h 376 iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr __on_right = 0);

Completed in 767 milliseconds