| /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...] |
| _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...] |
| _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...] |
| _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...] |
| _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...] |
| /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...] |
| _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...] |
| _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...] |
| _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...] |
| _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...] |
| /prebuilt/ndk/android-ndk-r5/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...] |
| _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...] |
| _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...] |
| _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...] |
| _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...] |
| /prebuilt/ndk/android-ndk-r6/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...] |
| _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...] |
| _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...] |
| _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...] |
| _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...] |
| /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++;
|
