| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _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...] |
| /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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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); }
150 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first,
152 { return __first._M_valid_range(__last);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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); }
150 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first,
152 { return __first._M_valid_range(__last);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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/5/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/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.6/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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/libcxx/include/ |
| numeric | 72 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
74 for (; __first != __last; ++__first)
75 __init = __init + *__first;
82 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
84 for (; __first != __last; ++__first)
85 __init = __binary_op(__init, *__first);
113 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
115 if (__first != __last
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| numeric | 72 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
74 for (; __first != __last; ++__first)
75 __init = __init + *__first;
82 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
84 for (; __first != __last; ++__first)
85 __init = __binary_op(__init, *__first);
113 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
115 if (__first != __last
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| numeric | 72 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
74 for (; __first != __last; ++__first)
75 __init = __init + *__first;
82 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
84 for (; __first != __last; ++__first)
85 __init = __binary_op(__init, *__first);
113 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
115 if (__first != __last
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
140 ++__first;
141 return __first;
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
151 ++__first;
152 return __first;
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
140 ++__first;
141 return __first;
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
151 ++__first;
152 return __first;
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_algo.h | 136 __find(_InputIterator __first, _InputIterator __last,
139 while (__first != __last && !(*__first == __val))
140 ++__first;
141 return __first;
147 __find_if(_InputIterator __first, _InputIterator __last,
150 while (__first != __last && !bool(__pred(*__first)))
151 ++__first;
152 return __first;
[all...] |
