| /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...] |
| _numeric.c | 40 __partial_sum(_InputIterator __first, _InputIterator __last,
42 _STLP_DEBUG_CHECK(__check_range(__first, __last))
43 if (__first == __last) return __result;
44 *__result = *__first;
46 _Tp __val = *__first;
47 while (++__first != __last) {
48 __val = __binary_op(__val, *__first);
57 __adjacent_difference(_InputIterator __first, _InputIterator __last,
60 _STLP_DEBUG_CHECK(__check_range(__first, __last))
61 if (__first == __last) return __result
[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...] |
| _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...] |
| _uninitialized.h | 52 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
56 for ( ; __first != __last; ++__first, ++__cur)
57 _Param_Construct(&*__cur, *__first);
65 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
67 { return __ucopy(__first, __last, __result, __d); }
71 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
73 { return __ucopy(__first, __last, __result, __d); }
76 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
78 { return __ucopy(__first, __last, __result, __d);
[all...] |
| _algobase.c | 112 _STLP_INLINE_LOOP _RandomAccessIter __find(_RandomAccessIter __first, _RandomAccessIter __last,
115 _STLP_DIFFERENCE_TYPE(_RandomAccessIter) __trip_count = (__last - __first) >> 2;
118 if (*__first == __val) return __first;
119 ++__first;
121 if (*__first == __val) return __first;
122 ++__first;
124 if (*__first == __val) return __first;
[all...] |
| _algobase.h | 184 inline _OutputIter __copy(_InputIter __first, _InputIter __last,
186 for ( ; __first != __last; ++__result, ++__first)
187 *__result = *__first;
193 inline _OutputIter __copy(_InputIter __first, _InputIter __last,
195 for ( ; __first != __last; ++__result, ++__first)
196 *__result = *__first;
201 inline _OutputIter __copy(_InputIter __first, _InputIter __last,
203 for ( ; __first != __last; ++__result, ++__first
[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...] |
| _numeric.c | 40 __partial_sum(_InputIterator __first, _InputIterator __last,
42 _STLP_DEBUG_CHECK(__check_range(__first, __last))
43 if (__first == __last) return __result;
44 *__result = *__first;
46 _Tp __val = *__first;
47 while (++__first != __last) {
48 __val = __binary_op(__val, *__first);
57 __adjacent_difference(_InputIterator __first, _InputIterator __last,
60 _STLP_DEBUG_CHECK(__check_range(__first, __last))
61 if (__first == __last) return __result
[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...] |
| _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...] |
| _uninitialized.h | 52 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
56 for ( ; __first != __last; ++__first, ++__cur)
57 _Param_Construct(&*__cur, *__first);
65 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
67 { return __ucopy(__first, __last, __result, __d); }
71 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
73 { return __ucopy(__first, __last, __result, __d); }
76 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last,
78 { return __ucopy(__first, __last, __result, __d);
[all...] |
| _algobase.c | 112 _STLP_INLINE_LOOP _RandomAccessIter __find(_RandomAccessIter __first, _RandomAccessIter __last,
115 _STLP_DIFFERENCE_TYPE(_RandomAccessIter) __trip_count = (__last - __first) >> 2;
118 if (*__first == __val) return __first;
119 ++__first;
121 if (*__first == __val) return __first;
122 ++__first;
124 if (*__first == __val) return __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 iota(__first, __last, __val);
12 while (__first != __last) {
13 *__first++ = __val++;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_heap.h | 71 __is_heap_until(_RandomAccessIterator __first, _Distance __n)
76 if (__first[__parent] < __first[__child])
87 __is_heap_until(_RandomAccessIterator __first, _Distance __n,
93 if (__comp(__first[__parent], __first[__child]))
105 __is_heap(_RandomAccessIterator __first, _Distance __n)
106 { return std::__is_heap_until(__first, __n) == __n; }
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n;
[all...] |
| stl_construct.h | 90 __destroy(_ForwardIterator __first, _ForwardIterator __last)
92 for (; __first != __last; ++__first)
93 std::_Destroy(&*__first);
112 _Destroy(_ForwardIterator __first, _ForwardIterator __last)
117 __destroy(__first, __last);
130 _Destroy(_ForwardIterator __first, _ForwardIterator __last,
133 for (; __first != __last; ++__first)
134 __alloc.destroy(&*__first);
[all...] |
| stl_algo.h | 181 __find(_InputIterator __first, _InputIterator __last,
184 while (__first != __last && !(*__first == __val))
185 ++__first;
186 return __first;
192 __find_if(_InputIterator __first, _InputIterator __last,
195 while (__first != __last && !bool(__pred(*__first)))
196 ++__first;
197 return __first;
[all...] |
| stl_numeric.h | 80 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
87 __glibcxx_requires_valid_range(__first, __last);
89 for (; __first != __last; ++__first)
91 *__first = __value;
115 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
119 __glibcxx_requires_valid_range(__first, __last);
121 for (; __first != __last; ++__first)
122 __init = __init + *__first;
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/ |
| functions.h | 90 __valid_range_aux2(const _RandomAccessIterator& __first,
93 { return __last - __first >= 0; }
119 __valid_range_aux(const _InputIterator& __first,
124 return __valid_range_aux2(__first, __last, _Category());
134 __valid_range(const _InputIterator& __first, const _InputIterator& __last)
137 return __valid_range_aux(__first, __last, _Integral());
143 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first,
145 { return __first._M_valid_range(__last); }
148 * __first. This routine is useful when we can't use a separate
153 __check_valid_range(const _InputIterator& __first,
[all...] |
| /external/stlport/src/ |
| bitset.cpp | 30 size_t _Bs_G::_S_count(const unsigned char *__first,
89 while ( __first < __last ) {
90 __result += _bit_count[*(__first++)];
|
| /ndk/sources/cxx-stl/stlport/src/ |
| bitset.cpp | 30 size_t _Bs_G::_S_count(const unsigned char *__first,
89 while ( __first < __last ) {
90 __result += _bit_count[*(__first++)];
|
