| /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...] |
| /prebuilts/ndk/current/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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-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/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...] |
| /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-linux-glibc2.15-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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/impl/ |
| profiler_algos.h | 84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f)
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last,
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first != __last; ++__first
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/impl/ |
| profiler_algos.h | 84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f)
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last,
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first != __last; ++__first
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/impl/ |
| profiler_algos.h | 84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f)
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last,
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first != __last; ++__first
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/ |
| profiler_algos.h | 84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f)
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last,
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first != __last; ++__first
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_heap.h | 74 __is_heap_until(_RandomAccessIterator __first, _Distance __n,
80 if (__comp(__first + __parent, __first + __child))
92 __is_heap(_RandomAccessIterator __first, _Distance __n)
94 return std::__is_heap_until(__first, __n,
101 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
103 return std::__is_heap_until(__first, __n,
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
110 { return std::__is_heap(__first, std::distance(__first, __last));
[all...] |
| /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++)];
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| functions.h | 106 __valid_range_aux2(const _RandomAccessIterator& __first,
109 { return __last - __first >= 0; }
135 __valid_range_aux(const _InputIterator& __first,
137 { return __valid_range_aux2(__first, __last,
138 std::__iterator_category(__first)); }
147 __valid_range(const _InputIterator& __first, const _InputIterator& __last)
150 return __valid_range_aux(__first, __last, _Integral());
156 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first,
158 { return __first._M_valid_range(__last); }
163 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first,
[all...] |
