| /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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[all...] |
| _algo.h | 59 for_each(_InputIter __first, _InputIter __last, _Function __f) {
60 for ( ; __first != __last; ++__first)
61 __f(*__first);
68 count_if(_InputIter __first, _InputIter __last, _Predicate __pred) {
69 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
71 for ( ; __first != __last; ++__first) {
72 if (__pred(*__first))
82 adjacent_find(_ForwardIter __first, _ForwardIter __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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[all...] |
| _algo.h | 59 for_each(_InputIter __first, _InputIter __last, _Function __f) {
60 for ( ; __first != __last; ++__first)
61 __f(*__first);
68 count_if(_InputIter __first, _InputIter __last, _Predicate __pred) {
69 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
71 for ( ; __first != __last; ++__first) {
72 if (__pred(*__first))
82 adjacent_find(_ForwardIter __first, _ForwardIter __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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[all...] |
| _algo.h | 59 for_each(_InputIter __first, _InputIter __last, _Function __f) {
60 for ( ; __first != __last; ++__first)
61 __f(*__first);
68 count_if(_InputIter __first, _InputIter __last, _Predicate __pred) {
69 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
71 for ( ; __first != __last; ++__first) {
72 if (__pred(*__first))
82 adjacent_find(_ForwardIter __first, _ForwardIter __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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __first;
[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...] |
| _algo.c | 42 void __merge_without_buffer(_BidirectionalIter __first,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
164 for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
226 _ForwardIter __i = __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-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/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...] |
