/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...] |
/ndk/sources/cxx-stl/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;
|
/prebuilts/ndk/5/sources/cxx-stl/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;
|
/prebuilts/ndk/6/sources/cxx-stl/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;
|
/prebuilts/ndk/7/sources/cxx-stl/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;
|
/prebuilts/ndk/8/sources/cxx-stl/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;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_heap.h | 73 _Distance __parent = 0; local 76 if (__first[__parent] < __first[__child]) 79 ++__parent; 90 _Distance __parent = 0; local 93 if (__comp(__first[__parent], __first[__child])) 96 ++__parent; 133 _Distance __parent = (__holeIndex - 1) / 2; local 134 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 136 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 137 __holeIndex = __parent; 179 _Distance __parent = (__holeIndex - 1) \/ 2; local 390 _DistanceType __parent = (__len - 2) \/ 2; local 430 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
stl_heap.h | 75 _Distance __parent = 0; local 78 if (__first[__parent] < __first[__child]) 81 ++__parent; 92 _Distance __parent = 0; local 95 if (__comp(__first[__parent], __first[__child])) 98 ++__parent; 135 _Distance __parent = (__holeIndex - 1) / 2; local 136 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 138 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 139 __holeIndex = __parent; 181 _Distance __parent = (__holeIndex - 1) \/ 2; local 392 _DistanceType __parent = (__len - 2) \/ 2; local 432 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
stl_heap.h | 75 _Distance __parent = 0; local 78 if (__first[__parent] < __first[__child]) 81 ++__parent; 92 _Distance __parent = 0; local 95 if (__comp(__first[__parent], __first[__child])) 98 ++__parent; 135 _Distance __parent = (__holeIndex - 1) / 2; local 136 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 138 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 139 __holeIndex = __parent; 181 _Distance __parent = (__holeIndex - 1) \/ 2; local 392 _DistanceType __parent = (__len - 2) \/ 2; local 432 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_heap.h | 73 _Distance __parent = 0; local 76 if (__first[__parent] < __first[__child]) 79 ++__parent; 90 _Distance __parent = 0; local 93 if (__comp(__first[__parent], __first[__child])) 96 ++__parent; 133 _Distance __parent = (__holeIndex - 1) / 2; local 134 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 136 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 137 __holeIndex = __parent; 179 _Distance __parent = (__holeIndex - 1) \/ 2; local 390 _DistanceType __parent = (__len - 2) \/ 2; local 430 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_heap.h | 73 _Distance __parent = 0; local 76 if (__first[__parent] < __first[__child]) 79 ++__parent; 90 _Distance __parent = 0; local 93 if (__comp(__first[__parent], __first[__child])) 96 ++__parent; 133 _Distance __parent = (__holeIndex - 1) / 2; local 134 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 136 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 137 __holeIndex = __parent; 179 _Distance __parent = (__holeIndex - 1) \/ 2; local 390 _DistanceType __parent = (__len - 2) \/ 2; local 430 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_heap.h | 73 _Distance __parent = 0; local 76 if (__first[__parent] < __first[__child]) 79 ++__parent; 90 _Distance __parent = 0; local 93 if (__comp(__first[__parent], __first[__child])) 96 ++__parent; 133 _Distance __parent = (__holeIndex - 1) / 2; local 134 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 136 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 137 __holeIndex = __parent; 179 _Distance __parent = (__holeIndex - 1) \/ 2; local 390 _DistanceType __parent = (__len - 2) \/ 2; local 430 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
stl_heap.h | 73 _Distance __parent = 0; local 76 if (__first[__parent] < __first[__child]) 79 ++__parent; 90 _Distance __parent = 0; local 93 if (__comp(__first[__parent], __first[__child])) 96 ++__parent; 133 _Distance __parent = (__holeIndex - 1) / 2; local 134 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 136 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 137 __holeIndex = __parent; 179 _Distance __parent = (__holeIndex - 1) \/ 2; local 390 _DistanceType __parent = (__len - 2) \/ 2; local 430 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_heap.h | 75 _Distance __parent = 0; local 78 if (__first[__parent] < __first[__child]) 81 ++__parent; 92 _Distance __parent = 0; local 95 if (__comp(__first[__parent], __first[__child])) 98 ++__parent; 135 _Distance __parent = (__holeIndex - 1) / 2; local 136 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 138 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 139 __holeIndex = __parent; 181 _Distance __parent = (__holeIndex - 1) \/ 2; local 392 _DistanceType __parent = (__len - 2) \/ 2; local 432 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_heap.h | 75 _Distance __parent = 0; local 78 if (__first[__parent] < __first[__child]) 81 ++__parent; 92 _Distance __parent = 0; local 95 if (__comp(__first[__parent], __first[__child])) 98 ++__parent; 135 _Distance __parent = (__holeIndex - 1) / 2; local 136 while (__holeIndex > __topIndex && *(__first + __parent) < __value) 138 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); 139 __holeIndex = __parent; 182 _Distance __parent = (__holeIndex - 1) \/ 2; local 398 _DistanceType __parent = (__len - 2) \/ 2; local 438 _DistanceType __parent = (__len - 2) \/ 2; local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/ |
libc-lock.h | 466 void (*__parent) (void), 520 void (*__parent) (void),
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
libc-lock.h | 466 void (*__parent) (void), 520 void (*__parent) (void),
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
libc-lock.h | 466 void (*__parent) (void), 520 void (*__parent) (void),
|