| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _uninitialized.h | 162 __ucopy_n(_InputIter __first, _Size __count, _ForwardIter __result, in __ucopy_n() argument
166 for ( ; __count > 0 ; --__count, ++__first, ++__cur) in __ucopy_n()
177 __ucopy_n(_InputIter __first, _Size __count, in __ucopy_n() argument
180 { return __ucopy_n(__first, __count, __result, input_iterator_tag()); } in __ucopy_n()
184 __ucopy_n(_InputIter __first, _Size __count, in __ucopy_n() argument
187 { return __ucopy_n(__first, __count, __result, input_iterator_tag()); } in __ucopy_n()
192 __ucopy_n(_RandomAccessIter __first, _Size __count, _ForwardIter __result, in __ucopy_n() argument
194 _RandomAccessIter __last = __first + __count; in __ucopy_n()
201 __ucopy_n(_InputIter __first, _Size __count, _ForwardIter __result) in __ucopy_n() argument
202 { return _STLP_PRIV __ucopy_n(__first, __count, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIt… in __ucopy_n()
[all …]
|
| D | _algobase.h | 377 __copy_n(_InputIter __first, _Size __count, _OutputIter __result, in _STLP_DECLARE_COPY_TRIVIAL()
379 for ( ; __count > 0; --__count) { in _STLP_DECLARE_COPY_TRIVIAL()
389 __copy_n(_RAIter __first, _Size __count, _OutputIter __result, in __copy_n() argument
391 _RAIter __last = __first + __count; in __copy_n()
399 copy_n(_InputIter __first, _Size __count, _OutputIter __result) { in copy_n() argument
401 …return _STLP_PRIV __copy_n(__first, __count, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIter… in copy_n()
|
| D | _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred, in __search_n() argument
159 const _Distance __pattSize = __count; in __search_n()
221 _Integer __count, const _Tp& __val, _BinaryPred __pred, in __search_n() argument
225 _Integer __n = __count - 1; in __search_n()
247 _Integer __count, const _Tp& __val) { in search_n() argument
249 if (__count <= 0) in search_n()
251 if (__count == 1) in search_n()
254 return _STLP_PRIV __search_n(__first, __last, __count, __val, equal_to<_Tp>(), in search_n()
261 _Integer __count, const _Tp& __val, in search_n() argument
264 if (__count <= 0) in search_n()
[all …]
|
| D | _algo.h | 130 _Integer __count, const _Tp& __val);
133 _Integer __count, const _Tp& __val, _BinaryPred __binary_pred);
|
| /ndk/sources/cxx-stl/stlport/src/ |
| D | facets_byname.cpp | 410 size_t __count = 0; in do_length() local
418 __count += chars_read; in do_length()
421 return int(__count); in do_length()
|
| /ndk/sources/cxx-stl/llvm-libc++/include/ |
| D | algorithm | 1351 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag)
1353 if (__count <= 0)
1371 …if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
1388 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag)
1390 if (__count <= 0)
1393 if (__len < __count)
1395 …const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyo…
1412 …if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
1429 _Size __count, const _Tp& __value_, _BinaryPredicate __pred)
1432 …(__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_…
[all …]
|
| D | random | 2205 template <size_t __count>
2210 __count < __w,
2213 __lshift(result_type __x) {return (__x << __count) & _Max;}
2215 template <size_t __count>
2220 (__count >= __w),
2225 template <size_t __count>
2230 __count < _Dt,
2233 __rshift(result_type __x) {return __x >> __count;}
2235 template <size_t __count>
2240 (__count >= _Dt),
[all …]
|