| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/pointers/ |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
164 cast_traits::to_storage_type_cptr(__last));
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_algobase.h | 296 __copy_m(_II __first, _II __last, _OI __result)
298 for (; __first != __last; ++__result, ++__first)
310 __copy_m(_II __first, _II __last, _OI __result)
312 for (; __first != __last; ++__result, ++__first)
324 __copy_m(_II __first, _II __last, _OI __result)
327 for(_Distance __n = __last - __first; __n > 0; --__n)
343 __copy_m(_II __first, _II __last, _OI __result)
346 for(_Distance __n = __last - __first; __n > 0; --__n)
362 __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)
364 const ptrdiff_t _Num = __last - __first
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_bvector.h | 383 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
385 for (; __first != __last; ++__first)
390 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
392 if (__first._M_p != __last._M_p)
394 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
396 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
399 __fill_bvector(__first, __last, __x);
606 vector(_InputIterator __first, _InputIterator __last,
609 { _M_initialize_dispatch(__first, __last, __false_type());
[all...] |
| /external/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _construct.h | 190 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __false_type& /*_Trivial_destructor*/) {
191 for ( ; __first != __last; ++__first) {
202 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __true_type& /*_Trivial_destructor*/) {
203 for ( ; __first != __last; ++__first)
213 __destroy_range(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
215 __destroy_range_aux(__first, __last, __ptr, _Trivial_destructor());
219 inline void _Destroy_Range(_ForwardIterator __first, _ForwardIterator __last) {
220 __destroy_range(__first, __last, _STLP_VALUE_TYPE(__first, _ForwardIterator));
232 __destroy_mv_srcs(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
234 __destroy_range_aux(__first, __last, __ptr, _CompleteMove())
[all...] |
| _string.h | 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
483 uninitialized_copy(__first, __last, this->_M_Finish() + 1);
503 _Self& append(_InputIter __first, _InputIter __last) {
505 return _M_append_dispatch(__first, __last, _Integral())
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _construct.h | 190 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __false_type& /*_Trivial_destructor*/) {
191 for ( ; __first != __last; ++__first) {
202 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __true_type& /*_Trivial_destructor*/) {
203 for ( ; __first != __last; ++__first)
213 __destroy_range(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
215 __destroy_range_aux(__first, __last, __ptr, _Trivial_destructor());
219 inline void _Destroy_Range(_ForwardIterator __first, _ForwardIterator __last) {
220 __destroy_range(__first, __last, _STLP_VALUE_TYPE(__first, _ForwardIterator));
232 __destroy_mv_srcs(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
234 __destroy_range_aux(__first, __last, __ptr, _CompleteMove())
[all...] |
| _string.h | 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
483 uninitialized_copy(__first, __last, this->_M_Finish() + 1);
503 _Self& append(_InputIter __first, _InputIter __last) {
505 return _M_append_dispatch(__first, __last, _Integral())
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _construct.h | 190 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __false_type& /*_Trivial_destructor*/) {
191 for ( ; __first != __last; ++__first) {
202 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __true_type& /*_Trivial_destructor*/) {
203 for ( ; __first != __last; ++__first)
213 __destroy_range(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
215 __destroy_range_aux(__first, __last, __ptr, _Trivial_destructor());
219 inline void _Destroy_Range(_ForwardIterator __first, _ForwardIterator __last) {
220 __destroy_range(__first, __last, _STLP_VALUE_TYPE(__first, _ForwardIterator));
232 __destroy_mv_srcs(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
234 __destroy_range_aux(__first, __last, __ptr, _CompleteMove())
[all...] |
| _string.h | 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
483 uninitialized_copy(__first, __last, this->_M_Finish() + 1);
503 _Self& append(_InputIter __first, _InputIter __last) {
505 return _M_append_dispatch(__first, __last, _Integral())
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _construct.h | 190 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __false_type& /*_Trivial_destructor*/) {
191 for ( ; __first != __last; ++__first) {
202 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __true_type& /*_Trivial_destructor*/) {
203 for ( ; __first != __last; ++__first)
213 __destroy_range(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
215 __destroy_range_aux(__first, __last, __ptr, _Trivial_destructor());
219 inline void _Destroy_Range(_ForwardIterator __first, _ForwardIterator __last) {
220 __destroy_range(__first, __last, _STLP_VALUE_TYPE(__first, _ForwardIterator));
232 __destroy_mv_srcs(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) {
234 __destroy_range_aux(__first, __last, __ptr, _CompleteMove())
[all...] |
| _string.h | 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
483 uninitialized_copy(__first, __last, this->_M_Finish() + 1);
503 _Self& append(_InputIter __first, _InputIter __last) {
505 return _M_append_dispatch(__first, __last, _Integral())
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
