| /external/stlport/test/unit/ |
| iota.h | 8 void __iota(_It __first, _It __last, _Tp __val) {
10 iota(__first, __last, __val);
12 while (__first != __last) {
|
| /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) {
|
| /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) {
|
| /external/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| _algo.h | 59 for_each(_InputIter __first, _InputIter __last, _Function __f) {
60 for ( ; __first != __last; ++__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) {
82 adjacent_find(_ForwardIter __first, _ForwardIter __last,
84 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
85 if (__first == __last)
86 return __last;
88 while(++__next != __last) {
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| _algo.h | 59 for_each(_InputIter __first, _InputIter __last, _Function __f) {
60 for ( ; __first != __last; ++__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) {
82 adjacent_find(_ForwardIter __first, _ForwardIter __last,
84 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
85 if (__first == __last)
86 return __last;
88 while(++__next != __last) {
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _algo.c | 44 _BidirectionalIter __last,
154 _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
158 _Distance __tailSize = __last - __first;
170 return __last;
188 return __last; //failure
206 return __last; //failure
215 return __last; //failure
220 _ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
224 while (__first != __last) {
[all...] |
| _heap.h | 39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compare __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_heap.h | 117 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
118 { return std::__is_heap(__first, std::distance(__first, __last)); }
122 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
147 * @param __last End of heap + element.
151 * over the range [__first,__last-1). After completion,
152 * [__first,__last) is a valid heap.
156 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
167 __glibcxx_requires_valid_range(__first, __last);
168 __glibcxx_requires_heap(__first, __last - 1)
[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 | 117 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
118 { return std::__is_heap(__first, std::distance(__first, __last)); }
122 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
147 * @param __last End of heap + element.
151 * over the range [__first,__last-1). After completion,
152 * [__first,__last) is a valid heap.
156 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
167 __glibcxx_requires_valid_range(__first, __last);
168 __glibcxx_requires_heap(__first, __last - 1)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_heap.h | 117 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
118 { return std::__is_heap(__first, std::distance(__first, __last)); }
122 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
147 * @param __last End of heap + element.
151 * over the range [__first,__last-1). After completion,
152 * [__first,__last) is a valid heap.
156 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
167 __glibcxx_requires_valid_range(__first, __last);
168 __glibcxx_requires_heap(__first, __last - 1)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_heap.h | 118 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
119 { return std::__is_heap(__first, std::distance(__first, __last)); }
123 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
148 * @param __last End of heap + element.
152 * over the range [__first,__last-1). After completion,
153 * [__first,__last) is a valid heap.
157 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
168 __glibcxx_requires_valid_range(__first, __last);
169 __glibcxx_requires_heap(__first, __last - 1)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_heap.h | 118 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
119 { return std::__is_heap(__first, std::distance(__first, __last)); }
123 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
148 * @param __last End of heap + element.
152 * over the range [__first,__last-1). After completion,
153 * [__first,__last) is a valid heap.
157 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
168 __glibcxx_requires_valid_range(__first, __last);
169 __glibcxx_requires_heap(__first, __last - 1)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_heap.h | 109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
110 { return std::__is_heap(__first, std::distance(__first, __last)); }
114 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
116 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
141 * @param __last End of heap + element.
145 * over the range [__first,__last-1). After completion,
146 * [__first,__last) is a valid heap.
150 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
161 __glibcxx_requires_valid_range(__first, __last);
162 __glibcxx_requires_heap(__first, __last - 1)
[all...] |
