| /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...] |
| streambuf_iterator.h | 284 istreambuf_iterator<_CharT> __last,
287 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
300 __copy_move_a2(_CharT* __first, _CharT* __last,
303 const streamsize __num = __last - __first;
312 __copy_move_a2(const _CharT* __first, const _CharT* __last,
315 const streamsize __num = __last - __first;
325 istreambuf_iterator<_CharT> __last, _CharT* __result)
332 if (__first._M_sbuf && !__last._M_sbuf)
360 istreambuf_iterator<_CharT> __last, const _CharT& __val)
367 if (__first._M_sbuf && !__last._M_sbuf
[all...] |
| stl_deque.h | 370 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
373 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
385 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
390 const _Tp&, const _Tp*>(__last),
403 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
406 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
418 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
423 const _Tp&, const _Tp*>(__last),
883 deque(_InputIterator __first, _InputIterator __last,
889 _M_initialize_dispatch(__first, __last, _Integral())
1692 insert(end(), __mid, __last); local
[all...] |
| stl_queue.h | 423 priority_queue(_InputIterator __first, _InputIterator __last,
428 __glibcxx_requires_valid_range(__first, __last);
429 c.insert(c.end(), __first, __last);
434 priority_queue(_InputIterator __first, _InputIterator __last,
439 __glibcxx_requires_valid_range(__first, __last);
440 c.insert(c.end(), __first, __last);
445 priority_queue(_InputIterator __first, _InputIterator __last,
450 __glibcxx_requires_valid_range(__first, __last);
451 c.insert(c.end(), __first, __last);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 149 * @param __last 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); }
163 * @param __last 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); }
445 * @param __last Iterator pointing to the end of the range
[all...] |
| stl_set.h | 156 * @param __last 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); }
171 * @param __last 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...] |
| streambuf_iterator.h | 296 istreambuf_iterator<_CharT> __last,
299 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
312 __copy_move_a2(_CharT* __first, _CharT* __last,
315 const streamsize __num = __last - __first;
324 __copy_move_a2(const _CharT* __first, const _CharT* __last,
327 const streamsize __num = __last - __first;
337 istreambuf_iterator<_CharT> __last, _CharT* __result)
344 if (__first._M_sbuf && !__last._M_sbuf)
372 istreambuf_iterator<_CharT> __last, const _CharT& __val)
379 if (__first._M_sbuf && !__last._M_sbuf
[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...] |
| streambuf_iterator.h | 284 istreambuf_iterator<_CharT> __last,
287 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
300 __copy_move_a2(_CharT* __first, _CharT* __last,
303 const streamsize __num = __last - __first;
312 __copy_move_a2(const _CharT* __first, const _CharT* __last,
315 const streamsize __num = __last - __first;
325 istreambuf_iterator<_CharT> __last, _CharT* __result)
332 if (__first._M_sbuf && !__last._M_sbuf)
360 istreambuf_iterator<_CharT> __last, const _CharT& __val)
367 if (__first._M_sbuf && !__last._M_sbuf
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 149 * @param __last 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); }
163 * @param __last 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); }
445 * @param __last Iterator pointing to the end of the range
[all...] |
| stl_set.h | 156 * @param __last 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); }
171 * @param __last 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...] |
| streambuf_iterator.h | 296 istreambuf_iterator<_CharT> __last,
299 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
312 __copy_move_a2(_CharT* __first, _CharT* __last,
315 const streamsize __num = __last - __first;
324 __copy_move_a2(const _CharT* __first, const _CharT* __last,
327 const streamsize __num = __last - __first;
337 istreambuf_iterator<_CharT> __last, _CharT* __result)
344 if (__first._M_sbuf && !__last._M_sbuf)
372 istreambuf_iterator<_CharT> __last, const _CharT& __val)
379 if (__first._M_sbuf && !__last._M_sbuf
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_multiset.h | 153 * @param __last 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); }
167 * @param __last 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); }
497 * @param __last Iterator pointing to the end of the range
[all...] |
| streambuf_iterator.h | 294 istreambuf_iterator<_CharT> __last,
297 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
310 __copy_move_a2(_CharT* __first, _CharT* __last,
313 const streamsize __num = __last - __first;
322 __copy_move_a2(const _CharT* __first, const _CharT* __last,
325 const streamsize __num = __last - __first;
335 istreambuf_iterator<_CharT> __last, _CharT* __result)
342 if (__first._M_sbuf && !__last._M_sbuf)
370 istreambuf_iterator<_CharT> __last, const _CharT& __val)
377 if (__first._M_sbuf && !__last._M_sbuf
[all...] |
| stl_vector.h | 376 * @param __last 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());
485 * @param __last 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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_list.h | 81 _List_node_base * const __last);
571 list(_InputIterator __first, _InputIterator __last,
577 _M_initialize_dispatch(__first, __last, _Integral());
658 assign(_InputIterator __first, _InputIterator __last)
662 _M_assign_dispatch(__first, __last, _Integral());
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 81 _List_node_base * const __last);
571 list(_InputIterator __first, _InputIterator __last,
577 _M_initialize_dispatch(__first, __last, _Integral());
658 assign(_InputIterator __first, _InputIterator __last)
662 _M_assign_dispatch(__first, __last, _Integral());
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 81 _List_node_base * const __last);
571 list(_InputIterator __first, _InputIterator __last,
577 _M_initialize_dispatch(__first, __last, _Integral());
658 assign(_InputIterator __first, _InputIterator __last)
662 _M_assign_dispatch(__first, __last, _Integral());
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 81 _List_node_base * const __last);
571 list(_InputIterator __first, _InputIterator __last,
577 _M_initialize_dispatch(__first, __last, _Integral());
658 assign(_InputIterator __first, _InputIterator __last)
662 _M_assign_dispatch(__first, __last, _Integral());
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_deque.h | 370 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
373 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
385 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
390 const _Tp&, const _Tp*>(__last),
403 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
406 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
418 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
423 const _Tp&, const _Tp*>(__last),
883 deque(_InputIterator __first, _InputIterator __last,
889 _M_initialize_dispatch(__first, __last, _Integral())
1692 insert(end(), __mid, __last); local
[all...] |
| stl_queue.h | 423 priority_queue(_InputIterator __first, _InputIterator __last,
428 __glibcxx_requires_valid_range(__first, __last);
429 c.insert(c.end(), __first, __last);
434 priority_queue(_InputIterator __first, _InputIterator __last,
439 __glibcxx_requires_valid_range(__first, __last);
440 c.insert(c.end(), __first, __last);
445 priority_queue(_InputIterator __first, _InputIterator __last,
450 __glibcxx_requires_valid_range(__first, __last);
451 c.insert(c.end(), __first, __last);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_deque.h | 370 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
373 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
385 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
390 const _Tp&, const _Tp*>(__last),
403 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
406 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
418 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
423 const _Tp&, const _Tp*>(__last),
883 deque(_InputIterator __first, _InputIterator __last,
889 _M_initialize_dispatch(__first, __last, _Integral())
1692 insert(end(), __mid, __last); local
[all...] |
| stl_queue.h | 423 priority_queue(_InputIterator __first, _InputIterator __last,
428 __glibcxx_requires_valid_range(__first, __last);
429 c.insert(c.end(), __first, __last);
434 priority_queue(_InputIterator __first, _InputIterator __last,
439 __glibcxx_requires_valid_range(__first, __last);
440 c.insert(c.end(), __first, __last);
445 priority_queue(_InputIterator __first, _InputIterator __last,
450 __glibcxx_requires_valid_range(__first, __last);
451 c.insert(c.end(), __first, __last);
|
