| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_vector.h | 375 * @param __first An input iterator.
392 vector(_InputIterator __first, _InputIterator __last,
395 { _M_initialize_dispatch(__first, __last, __false_type()); }
398 vector(_InputIterator __first, _InputIterator __last,
404 _M_initialize_dispatch(__first, __last, _Integral());
484 * @param __first An input iterator.
488 * range [__first,__last).
498 assign(_InputIterator __first, _InputIterator __last)
499 { _M_assign_dispatch(__first, __last, __false_type()); }
503 assign(_InputIterator __first, _InputIterator __last
[all...] |
| stl_deque.h | 370 copy(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
373 { return std::copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
385 copy_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
389 const _Tp&, const _Tp*>(__first),
403 move(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
406 { return std::move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
418 move_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
422 const _Tp&, const _Tp*>(__first),
880 * @param __first An input iterator.
884 * Create a %deque consisting of copies of the elements from [__first,
[all...] |
| stl_multiset.h | 152 * @param __first An input iterator.
157 * and NlogN otherwise (where N is distance(__first,__last)).
160 multiset(_InputIterator __first, _InputIterator __last)
162 { _M_t._M_insert_equal(__first, __last); }
166 * @param __first An input iterator.
172 * [__first,__last). This is linear in N if the range is already sorted,
173 * and NlogN otherwise (where N is distance(__first,__last)).
176 multiset(_InputIterator __first, _InputIterator __last,
180 { _M_t._M_insert_equal(__first, __last); }
495 * @param __first Iterator pointing to the start of the range to b
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_vector.h | 375 * @param __first An input iterator.
392 vector(_InputIterator __first, _InputIterator __last,
395 { _M_initialize_dispatch(__first, __last, __false_type()); }
398 vector(_InputIterator __first, _InputIterator __last,
404 _M_initialize_dispatch(__first, __last, _Integral());
484 * @param __first An input iterator.
488 * range [__first,__last).
498 assign(_InputIterator __first, _InputIterator __last)
499 { _M_assign_dispatch(__first, __last, __false_type()); }
503 assign(_InputIterator __first, _InputIterator __last
[all...] |
| stl_deque.h | 370 copy(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
373 { return std::copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
385 copy_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
389 const _Tp&, const _Tp*>(__first),
403 move(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
406 { return std::move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
418 move_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
422 const _Tp&, const _Tp*>(__first),
880 * @param __first An input iterator.
884 * Create a %deque consisting of copies of the elements from [__first,
[all...] |
| stl_multiset.h | 152 * @param __first An input iterator.
157 * and NlogN otherwise (where N is distance(__first,__last)).
160 multiset(_InputIterator __first, _InputIterator __last)
162 { _M_t._M_insert_equal(__first, __last); }
166 * @param __first An input iterator.
172 * [__first,__last). This is linear in N if the range is already sorted,
173 * and NlogN otherwise (where N is distance(__first,__last)).
176 multiset(_InputIterator __first, _InputIterator __last,
180 { _M_t._M_insert_equal(__first, __last); }
495 * @param __first Iterator pointing to the start of the range to b
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_vector.h | 375 * @param __first An input iterator.
392 vector(_InputIterator __first, _InputIterator __last,
395 { _M_initialize_dispatch(__first, __last, __false_type()); }
398 vector(_InputIterator __first, _InputIterator __last,
404 _M_initialize_dispatch(__first, __last, _Integral());
484 * @param __first An input iterator.
488 * range [__first,__last).
498 assign(_InputIterator __first, _InputIterator __last)
499 { _M_assign_dispatch(__first, __last, __false_type()); }
503 assign(_InputIterator __first, _InputIterator __last
[all...] |
| stl_deque.h | 370 copy(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
373 { return std::copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
385 copy_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
389 const _Tp&, const _Tp*>(__first),
403 move(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
406 { return std::move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),
418 move_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,
422 const _Tp&, const _Tp*>(__first),
880 * @param __first An input iterator.
884 * Create a %deque consisting of copies of the elements from [__first,
[all...] |
| stl_multiset.h | 152 * @param __first An input iterator.
157 * and NlogN otherwise (where N is distance(__first,__last)).
160 multiset(_InputIterator __first, _InputIterator __last)
162 { _M_t._M_insert_equal(__first, __last); }
166 * @param __first An input iterator.
172 * [__first,__last). This is linear in N if the range is already sorted,
173 * and NlogN otherwise (where N is distance(__first,__last)).
176 multiset(_InputIterator __first, _InputIterator __last,
180 { _M_t._M_insert_equal(__first, __last); }
495 * @param __first Iterator pointing to the start of the range to b
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_list.h | 86 _M_transfer(_List_node_base* const __first,
626 * @param __first An input iterator.
631 * [@a __first,@a __last). This is linear in N (where N is
632 * distance(@a __first,@a __last)).
637 list(_InputIterator __first, _InputIterator __last,
640 { _M_initialize_dispatch(__first, __last, __false_type()); }
643 list(_InputIterator __first, _InputIterator __last,
649 _M_initialize_dispatch(__first, __last, _Integral());
720 * @param __first An input iterator.
724 * range [@a __first,@a __last)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
| stl_multiset.h | 154 multiset(_InputIterator __first, _InputIterator __last)
156 { _M_t._M_insert_equal(__first, __last); }
170 multiset(_InputIterator __first, _InputIterator __last,
174 { _M_t._M_insert_equal(__first, __last); }
447 insert(_InputIterator __first, _InputIterator __last)
448 { _M_t._M_insert_equal(__first, __last); }
530 erase(const_iterator __first, const_iterator __last)
531 { return _M_t.erase(__first, __last); }
546 erase(iterator __first, iterator __last)
547 { _M_t.erase(__first, __last);
[all...] |
| stl_set.h | 161 set(_InputIterator __first, _InputIterator __last)
163 { _M_t._M_insert_unique(__first, __last); }
177 set(_InputIterator __first, _InputIterator __last,
181 { _M_t._M_insert_unique(__first, __last); }
464 insert(_InputIterator __first, _InputIterator __last)
465 { _M_t._M_insert_unique(__first, __last); }
546 erase(const_iterator __first, const_iterator __last)
547 { return _M_t.erase(__first, __last); }
561 erase(iterator __first, iterator __last)
562 { _M_t.erase(__first, __last);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_multiset.h | 154 multiset(_InputIterator __first, _InputIterator __last)
156 { _M_t._M_insert_equal(__first, __last); }
170 multiset(_InputIterator __first, _InputIterator __last,
174 { _M_t._M_insert_equal(__first, __last); }
447 insert(_InputIterator __first, _InputIterator __last)
448 { _M_t._M_insert_equal(__first, __last); }
530 erase(const_iterator __first, const_iterator __last)
531 { return _M_t.erase(__first, __last); }
546 erase(iterator __first, iterator __last)
547 { _M_t.erase(__first, __last);
[all...] |
| stl_set.h | 161 set(_InputIterator __first, _InputIterator __last)
163 { _M_t._M_insert_unique(__first, __last); }
177 set(_InputIterator __first, _InputIterator __last,
181 { _M_t._M_insert_unique(__first, __last); }
464 insert(_InputIterator __first, _InputIterator __last)
465 { _M_t._M_insert_unique(__first, __last); }
546 erase(const_iterator __first, const_iterator __last)
547 { return _M_t.erase(__first, __last); }
561 erase(iterator __first, iterator __last)
562 { _M_t.erase(__first, __last);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 148 * @param __first An input iterator.
153 * and NlogN otherwise (where N is distance(__first,__last)).
156 multiset(_InputIterator __first, _InputIterator __last)
158 { _M_t._M_insert_equal(__first, __last); }
162 * @param __first An input iterator.
168 * [__first,__last). This is linear in N if the range is already sorted,
169 * and NlogN otherwise (where N is distance(__first,__last)).
172 multiset(_InputIterator __first, _InputIterator __last,
176 { _M_t._M_insert_equal(__first, __last); }
443 * @param __first Iterator pointing to the start of the range to b
[all...] |
| stl_set.h | 155 * @param __first An input iterator.
159 * [__first,__last). This is linear in N if the range is
161 * distance(__first,__last)).
164 set(_InputIterator __first, _InputIterator __last)
166 { _M_t._M_insert_unique(__first, __last); }
170 * @param __first An input iterator.
176 * [__first,__last). This is linear in N if the range is
178 * distance(__first,__last)).
181 set(_InputIterator __first, _InputIterator __last,
185 { _M_t._M_insert_unique(__first, __last);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_multiset.h | 154 multiset(_InputIterator __first, _InputIterator __last)
156 { _M_t._M_insert_equal(__first, __last); }
170 multiset(_InputIterator __first, _InputIterator __last,
174 { _M_t._M_insert_equal(__first, __last); }
447 insert(_InputIterator __first, _InputIterator __last)
448 { _M_t._M_insert_equal(__first, __last); }
530 erase(const_iterator __first, const_iterator __last)
531 { return _M_t.erase(__first, __last); }
546 erase(iterator __first, iterator __last)
547 { _M_t.erase(__first, __last);
[all...] |
| stl_set.h | 161 set(_InputIterator __first, _InputIterator __last)
163 { _M_t._M_insert_unique(__first, __last); }
177 set(_InputIterator __first, _InputIterator __last,
181 { _M_t._M_insert_unique(__first, __last); }
464 insert(_InputIterator __first, _InputIterator __last)
465 { _M_t._M_insert_unique(__first, __last); }
546 erase(const_iterator __first, const_iterator __last)
547 { return _M_t.erase(__first, __last); }
561 erase(iterator __first, iterator __last)
562 { _M_t.erase(__first, __last);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 148 * @param __first An input iterator.
153 * and NlogN otherwise (where N is distance(__first,__last)).
156 multiset(_InputIterator __first, _InputIterator __last)
158 { _M_t._M_insert_equal(__first, __last); }
162 * @param __first An input iterator.
168 * [__first,__last). This is linear in N if the range is already sorted,
169 * and NlogN otherwise (where N is distance(__first,__last)).
172 multiset(_InputIterator __first, _InputIterator __last,
176 { _M_t._M_insert_equal(__first, __last); }
443 * @param __first Iterator pointing to the start of the range to b
[all...] |
| stl_set.h | 155 * @param __first An input iterator.
159 * [__first,__last). This is linear in N if the range is
161 * distance(__first,__last)).
164 set(_InputIterator __first, _InputIterator __last)
166 { _M_t._M_insert_unique(__first, __last); }
170 * @param __first An input iterator.
176 * [__first,__last). This is linear in N if the range is
178 * distance(__first,__last)).
181 set(_InputIterator __first, _InputIterator __last,
185 { _M_t._M_insert_unique(__first, __last);
[all...] |
| /external/stlport/stlport/stl/ |
| _hashtable.h | 500 _ElemsIte __first(_M_buckets[__n]);
502 for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first);
503 if (__first != __last)
504 return __first;
538 for (_ElemsIte __first(_M_buckets[__n]), __last(_M_buckets[__n + 1]);
539 __first != __last; ++__first) {
540 if (_M_equals(_M_get_key(*__first), __key))
[all...] |
| _monetary.c | 51 pair<_InIt1, bool> __get_string( _InIt1 __first, _InIt1 __last,
53 while ( __first != __last && __str_first != __str_last && *__first == *__str_first ) {
54 ++__first;
57 return make_pair(__first, __str_first == __str_last);
62 __get_monetary_value(_InIt& __first, _InIt __last, _OuIt __out_ite,
66 if (__first == __last || !_c_type.is(ctype_base::digit, *__first))
73 while (__first != __last) {
74 if (_c_type.is(ctype_base::digit, *__first)) {
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 500 _ElemsIte __first(_M_buckets[__n]);
502 for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first);
503 if (__first != __last)
504 return __first;
538 for (_ElemsIte __first(_M_buckets[__n]), __last(_M_buckets[__n + 1]);
539 __first != __last; ++__first) {
540 if (_M_equals(_M_get_key(*__first), __key))
[all...] |
| _monetary.c | 51 pair<_InIt1, bool> __get_string( _InIt1 __first, _InIt1 __last,
53 while ( __first != __last && __str_first != __str_last && *__first == *__str_first ) {
54 ++__first;
57 return make_pair(__first, __str_first == __str_last);
62 __get_monetary_value(_InIt& __first, _InIt __last, _OuIt __out_ite,
66 if (__first == __last || !_c_type.is(ctype_base::digit, *__first))
73 while (__first != __last) {
74 if (_c_type.is(ctype_base::digit, *__first)) {
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 500 _ElemsIte __first(_M_buckets[__n]);
502 for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first);
503 if (__first != __last)
504 return __first;
538 for (_ElemsIte __first(_M_buckets[__n]), __last(_M_buckets[__n + 1]);
539 __first != __last; ++__first) {
540 if (_M_equals(_M_get_key(*__first), __key))
[all...] |
