/external/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
_heap.c | 42 __push_heap(_RandomAccessIterator __first, 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 47 *(__first + __holeIndex) = *(__first + __parent); 51 *(__first + __holeIndex) = __val; 56 __push_heap_aux(_RandomAccessIterator __first, 59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0), 65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 67 __push_heap_aux(__first, __last [all...] |
_heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 49 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, 57 *__result = *__first; 58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); 62 void pop_heap(_RandomAccessIterator __first, 68 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/ |
functions.h | 90 __valid_range_aux2(const _RandomAccessIterator& __first, 93 { return __last - __first >= 0; } 119 __valid_range_aux(const _InputIterator& __first, 121 { return __valid_range_aux2(__first, __last, 122 std::__iterator_category(__first)); } 131 __valid_range(const _InputIterator& __first, const _InputIterator& __last) 134 return __valid_range_aux(__first, __last, _Integral()); 140 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, 142 { return __first._M_valid_range(__last); } 147 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first, [all...] |
/external/stlport/test/unit/ |
iota.h | 8 void __iota(_It __first, _It __last, _Tp __val) { 10 iota(__first, __last, __val); 12 while (__first != __last) { 13 *__first++ = __val++;
|
/ndk/tests/device/test-gnustl-full/unit/ |
iota.h | 8 void __iota(_It __first, _It __last, _Tp __val) { 10 iota(__first, __last, __val); 12 while (__first != __last) { 13 *__first++ = __val++;
|
/ndk/tests/device/test-stlport/unit/ |
iota.h | 8 void __iota(_It __first, _It __last, _Tp __val) { 10 std::iota(__first, __last, __val); 12 while (__first != __last) { 13 *__first++ = __val++;
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_heap.h | 72 __is_heap_until(_RandomAccessIterator __first, _Distance __n) 77 if (__first[__parent] < __first[__child]) 88 __is_heap_until(_RandomAccessIterator __first, _Distance __n, 94 if (__comp(__first[__parent], __first[__child])) 106 __is_heap(_RandomAccessIterator __first, _Distance __n) 107 { return std::__is_heap_until(__first, __n) == __n; } 112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) 113 { return std::__is_heap_until(__first, __n, __comp) == __n; [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
functions.h | 90 __valid_range_aux2(const _RandomAccessIterator& __first, 93 { return __last - __first >= 0; } 119 __valid_range_aux(const _InputIterator& __first, 121 { return __valid_range_aux2(__first, __last, 122 std::__iterator_category(__first)); } 131 __valid_range(const _InputIterator& __first, const _InputIterator& __last) 134 return __valid_range_aux(__first, __last, _Integral()); 140 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, 142 { return __first._M_valid_range(__last); } 147 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first, [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
stl_heap.h | 72 __is_heap_until(_RandomAccessIterator __first, _Distance __n) 77 if (__first[__parent] < __first[__child]) 88 __is_heap_until(_RandomAccessIterator __first, _Distance __n, 94 if (__comp(__first[__parent], __first[__child])) 106 __is_heap(_RandomAccessIterator __first, _Distance __n) 107 { return std::__is_heap_until(__first, __n) == __n; } 112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) 113 { return std::__is_heap_until(__first, __n, __comp) == __n; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
stl_heap.h | 72 __is_heap_until(_RandomAccessIterator __first, _Distance __n) 77 if (__first[__parent] < __first[__child]) 88 __is_heap_until(_RandomAccessIterator __first, _Distance __n, 94 if (__comp(__first[__parent], __first[__child])) 106 __is_heap(_RandomAccessIterator __first, _Distance __n) 107 { return std::__is_heap_until(__first, __n) == __n; } 112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) 113 { return std::__is_heap_until(__first, __n, __comp) == __n; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/debug/ |
functions.h | 90 __valid_range_aux2(const _RandomAccessIterator& __first, 93 { return __last - __first >= 0; } 119 __valid_range_aux(const _InputIterator& __first, 121 { return __valid_range_aux2(__first, __last, 122 std::__iterator_category(__first)); } 131 __valid_range(const _InputIterator& __first, const _InputIterator& __last) 134 return __valid_range_aux(__first, __last, _Integral()); 140 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, 142 { return __first._M_valid_range(__last); } 147 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first, [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_heap.h | 73 __is_heap_until(_RandomAccessIterator __first, _Distance __n) 78 if (__first[__parent] < __first[__child]) 89 __is_heap_until(_RandomAccessIterator __first, _Distance __n, 95 if (__comp(__first[__parent], __first[__child])) 107 __is_heap(_RandomAccessIterator __first, _Distance __n) 108 { return std::__is_heap_until(__first, __n) == __n; } 113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) 114 { return std::__is_heap_until(__first, __n, __comp) == __n; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_heap.h | 73 __is_heap_until(_RandomAccessIterator __first, _Distance __n) 78 if (__first[__parent] < __first[__child]) 89 __is_heap_until(_RandomAccessIterator __first, _Distance __n, 95 if (__comp(__first[__parent], __first[__child])) 107 __is_heap(_RandomAccessIterator __first, _Distance __n) 108 { return std::__is_heap_until(__first, __n) == __n; } 113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) 114 { return std::__is_heap_until(__first, __n, __comp) == __n; [all...] |