| /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) {
|
| /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...] |
| _heap.c | 57 _RandomAccessIterator __last, _Distance*, _Tp*)
59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
60 _Tp(*(__last - 1)));
65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
67 __push_heap_aux(__first, __last,
93 _RandomAccessIterator __last, _Compare __comp,
96 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
97 _Tp(*(__last - 1)), __comp);
102 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
105 __push_heap_aux(__first, __last, __comp
[all...] |
| _set.h | 102 set(_InputIterator __first, _InputIterator __last)
104 { _M_t.insert_unique(__first, __last); }
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
116 set(const value_type* __first, const value_type* __last)
118 { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
123 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
[all...] |
| /prebuilts/ndk/current/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...] |
| _heap.c | 57 _RandomAccessIterator __last, _Distance*, _Tp*)
59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
60 _Tp(*(__last - 1)));
65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
67 __push_heap_aux(__first, __last,
93 _RandomAccessIterator __last, _Compare __comp,
96 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
97 _Tp(*(__last - 1)), __comp);
102 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
105 __push_heap_aux(__first, __last, __comp
[all...] |
| _set.h | 102 set(_InputIterator __first, _InputIterator __last)
104 { _M_t.insert_unique(__first, __last); }
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
116 set(const value_type* __first, const value_type* __last)
118 { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
123 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
[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...] |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
158 __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
162 __trip_count = (__last - __first) >> 2;
183 switch (__last - __first)
199 return __last;
206 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
210 __trip_count = (__last - __first) >> 2
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-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...] |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
158 __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
162 __trip_count = (__last - __first) >> 2;
183 switch (__last - __first)
199 return __last;
206 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
210 __trip_count = (__last - __first) >> 2
[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...] |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
158 __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
162 __trip_count = (__last - __first) >> 2;
183 switch (__last - __first)
199 return __last;
206 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
210 __trip_count = (__last - __first) >> 2
[all...] |
| /prebuilts/ndk/current/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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
| functions.h | 91 const _RandomAccessIterator& __last,
93 { return __last - __first >= 0; }
120 const _InputIterator& __last, std::__false_type)
121 { return __valid_range_aux2(__first, __last,
131 __valid_range(const _InputIterator& __first, const _InputIterator& __last)
134 return __valid_range_aux(__first, __last, _Integral());
141 const _Safe_iterator<_Iterator, _Sequence>& __last)
142 { return __first._M_valid_range(__last); }
148 const _Safe_local_iterator<_Iterator, _Sequence>& __last)
149 { return __first._M_valid_range(__last); }
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _slist.h | 101 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
102 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
138 slist(_InputIterator __first, _InputIterator __last,
140 : _ConstructCheck(__first, __last),
141 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
145 slist(_InputIterator __first, _InputIterator __last)
146 : _ConstructCheck(__first, __last),
147 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
152 slist(const value_type* __first, const value_type* __last,
154 : _ConstructCheck(__first, __last),
443 iterator __last = __before_last; ++__last; local
503 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
515 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
552 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
566 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| _deque.h | 82 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
161 deque(_InputIterator __first, _InputIterator __last,
163 : _ConstructCheck(__first, __last),
164 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
169 deque(_InputIterator __first, _InputIterator __last)
170 : _ConstructCheck(__first, __last),
171 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
176 deque(const value_type* __first, const value_type* __last,
178 : _ConstructCheck(__first, __last),
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _slist.h | 101 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
102 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
138 slist(_InputIterator __first, _InputIterator __last,
140 : _ConstructCheck(__first, __last),
141 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
145 slist(_InputIterator __first, _InputIterator __last)
146 : _ConstructCheck(__first, __last),
147 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
152 slist(const value_type* __first, const value_type* __last,
154 : _ConstructCheck(__first, __last),
443 iterator __last = __before_last; ++__last; local
503 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
515 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
552 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
566 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| _deque.h | 82 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
161 deque(_InputIterator __first, _InputIterator __last,
163 : _ConstructCheck(__first, __last),
164 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
169 deque(_InputIterator __first, _InputIterator __last)
170 : _ConstructCheck(__first, __last),
171 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
176 deque(const value_type* __first, const value_type* __last,
178 : _ConstructCheck(__first, __last),
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| algorithm | 809 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
811 for (; __first != __last; ++__first)
822 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
824 for (; __first != __last; ++__first)
835 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
837 for (; __first != __last; ++__first)
848 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
850 for (; __first != __last; ++__first)
860 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_)
862 for (; __first != __last; ++__first
[all...] |
