| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_vector.h | 946 * @param __position An iterator into the %vector.
958 emplace(iterator __position, _Args&&... __args);
963 * @param __position An iterator into the %vector.
[all...] |
| deque.tcc | 149 insert(iterator __position, const value_type& __x)
151 if (__position._M_cur == this->_M_impl._M_start._M_cur)
156 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
164 return _M_insert_aux(__position, __x);
172 emplace(iterator __position, _Args&&... __args)
174 if (__position._M_cur == this->_M_impl._M_start._M_cur)
179 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
187 return _M_insert_aux(__position, std::forward<_Args>(__args)...);
194 erase(iterator __position)
196 iterator __next = __position;
[all...] |
| stl_multimap.h | 515 * @param __position An iterator that serves as a hint as to where the
535 insert(const_iterator __position, const value_type& __x)
537 insert(iterator __position, const value_type& __x)
539 { return _M_t._M_insert_equal_(__position, __x); }
546 insert(const_iterator __position, _Pair&& __x)
547 { return _M_t._M_insert_equal_(__position,
583 * @param __position An iterator pointing to the element to be erased.
595 erase(const_iterator __position)
596 { return _M_t.erase(__position); }
601 erase(iterator __position)
[all...] |
| stl_multiset.h | 465 * @param __position An iterator that serves as a hint as to where the
484 insert(const_iterator __position, const value_type& __x)
485 { return _M_t._M_insert_equal_(__position, __x); }
489 insert(const_iterator __position, value_type&& __x)
490 { return _M_t._M_insert_equal_(__position, std::move(__x)); }
524 * @param __position An iterator pointing to the element to be erased.
537 erase(const_iterator __position)
538 { return _M_t.erase(__position); }
542 * @param __position An iterator pointing to the element to be erased.
551 erase(iterator __position)
[all...] |
| stl_set.h | 479 * @param __position An iterator that serves as a hint as to where the
497 insert(const_iterator __position, const value_type& __x)
498 { return _M_t._M_insert_unique_(__position, __x); }
502 insert(const_iterator __position, value_type&& __x)
503 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
538 * @param __position An iterator pointing to the element to be erased.
540 * @a __position prior to the element being erased. If no such
551 erase(const_iterator __position)
552 { return _M_t.erase(__position); }
565 erase(iterator __position)
[all...] |
| stl_map.h | 621 * @param __position An iterator that serves as a hint as to where the
644 insert(const_iterator __position, const value_type& __x)
646 insert(iterator __position, const value_type& __x)
648 { return _M_t._M_insert_unique_(__position, __x); }
655 insert(const_iterator __position, _Pair&& __x)
656 { return _M_t._M_insert_unique_(__position,
678 * @param __position An iterator pointing to the element to be erased.
690 erase(const_iterator __position)
691 { return _M_t.erase(__position); }
696 erase(iterator __position)
[all...] |
| stl_deque.h | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| deque.tcc | 149 insert(iterator __position, const value_type& __x)
151 if (__position._M_cur == this->_M_impl._M_start._M_cur)
156 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
164 return _M_insert_aux(__position, __x);
172 emplace(iterator __position, _Args&&... __args)
174 if (__position._M_cur == this->_M_impl._M_start._M_cur)
179 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
187 return _M_insert_aux(__position, std::forward<_Args>(__args)...);
194 erase(iterator __position)
196 iterator __next = __position;
[all...] |
| stl_multimap.h | 515 * @param __position An iterator that serves as a hint as to where the
535 insert(const_iterator __position, const value_type& __x)
537 insert(iterator __position, const value_type& __x)
539 { return _M_t._M_insert_equal_(__position, __x); }
546 insert(const_iterator __position, _Pair&& __x)
547 { return _M_t._M_insert_equal_(__position,
583 * @param __position An iterator pointing to the element to be erased.
595 erase(const_iterator __position)
596 { return _M_t.erase(__position); }
601 erase(iterator __position)
[all...] |
| stl_multiset.h | 465 * @param __position An iterator that serves as a hint as to where the
484 insert(const_iterator __position, const value_type& __x)
485 { return _M_t._M_insert_equal_(__position, __x); }
489 insert(const_iterator __position, value_type&& __x)
490 { return _M_t._M_insert_equal_(__position, std::move(__x)); }
524 * @param __position An iterator pointing to the element to be erased.
537 erase(const_iterator __position)
538 { return _M_t.erase(__position); }
542 * @param __position An iterator pointing to the element to be erased.
551 erase(iterator __position)
[all...] |
| stl_set.h | 479 * @param __position An iterator that serves as a hint as to where the
497 insert(const_iterator __position, const value_type& __x)
498 { return _M_t._M_insert_unique_(__position, __x); }
502 insert(const_iterator __position, value_type&& __x)
503 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
538 * @param __position An iterator pointing to the element to be erased.
540 * @a __position prior to the element being erased. If no such
551 erase(const_iterator __position)
552 { return _M_t.erase(__position); }
565 erase(iterator __position)
[all...] |
| stl_map.h | 621 * @param __position An iterator that serves as a hint as to where the
644 insert(const_iterator __position, const value_type& __x)
646 insert(iterator __position, const value_type& __x)
648 { return _M_t._M_insert_unique_(__position, __x); }
655 insert(const_iterator __position, _Pair&& __x)
656 { return _M_t._M_insert_unique_(__position,
678 * @param __position An iterator pointing to the element to be erased.
690 erase(const_iterator __position)
691 { return _M_t.erase(__position); }
696 erase(iterator __position)
[all...] |
| stl_deque.h | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| deque.tcc | 149 insert(iterator __position, const value_type& __x)
151 if (__position._M_cur == this->_M_impl._M_start._M_cur)
156 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
164 return _M_insert_aux(__position, __x);
172 emplace(iterator __position, _Args&&... __args)
174 if (__position._M_cur == this->_M_impl._M_start._M_cur)
179 else if (__position._M_cur == this->_M_impl._M_finish._M_cur)
187 return _M_insert_aux(__position, std::forward<_Args>(__args)...);
194 erase(iterator __position)
196 iterator __next = __position;
[all...] |
| stl_multimap.h | 515 * @param __position An iterator that serves as a hint as to where the
535 insert(const_iterator __position, const value_type& __x)
537 insert(iterator __position, const value_type& __x)
539 { return _M_t._M_insert_equal_(__position, __x); }
546 insert(const_iterator __position, _Pair&& __x)
547 { return _M_t._M_insert_equal_(__position,
583 * @param __position An iterator pointing to the element to be erased.
595 erase(const_iterator __position)
596 { return _M_t.erase(__position); }
601 erase(iterator __position)
[all...] |
| stl_multiset.h | 465 * @param __position An iterator that serves as a hint as to where the
484 insert(const_iterator __position, const value_type& __x)
485 { return _M_t._M_insert_equal_(__position, __x); }
489 insert(const_iterator __position, value_type&& __x)
490 { return _M_t._M_insert_equal_(__position, std::move(__x)); }
524 * @param __position An iterator pointing to the element to be erased.
537 erase(const_iterator __position)
538 { return _M_t.erase(__position); }
542 * @param __position An iterator pointing to the element to be erased.
551 erase(iterator __position)
[all...] |
| stl_set.h | 479 * @param __position An iterator that serves as a hint as to where the
497 insert(const_iterator __position, const value_type& __x)
498 { return _M_t._M_insert_unique_(__position, __x); }
502 insert(const_iterator __position, value_type&& __x)
503 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
538 * @param __position An iterator pointing to the element to be erased.
540 * @a __position prior to the element being erased. If no such
551 erase(const_iterator __position)
552 { return _M_t.erase(__position); }
565 erase(iterator __position)
[all...] |
| stl_map.h | 621 * @param __position An iterator that serves as a hint as to where the
644 insert(const_iterator __position, const value_type& __x)
646 insert(iterator __position, const value_type& __x)
648 { return _M_t._M_insert_unique_(__position, __x); }
655 insert(const_iterator __position, _Pair&& __x)
656 { return _M_t._M_insert_unique_(__position,
678 * @param __position An iterator pointing to the element to be erased.
690 erase(const_iterator __position)
691 { return _M_t.erase(__position); }
696 erase(iterator __position)
[all...] |
| stl_deque.h | [all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_multimap.h | 551 * @param __position An iterator that serves as a hint as to where the
571 insert(const_iterator __position, const value_type& __x)
573 insert(iterator __position, const value_type& __x)
575 { return _M_t._M_insert_equal_(__position, __x); }
582 insert(const_iterator __position, _Pair&& __x)
583 { return _M_t._M_insert_equal_(__position,
619 * @param __position An iterator pointing to the element to be erased.
631 erase(const_iterator __position)
632 { return _M_t.erase(__position); }
637 erase(iterator __position)
[all...] |
| stl_multiset.h | 503 * @param __position An iterator that serves as a hint as to where the
522 insert(const_iterator __position, const value_type& __x)
523 { return _M_t._M_insert_equal_(__position, __x); }
527 insert(const_iterator __position, value_type&& __x)
528 { return _M_t._M_insert_equal_(__position, std::move(__x)); }
562 * @param __position An iterator pointing to the element to be erased.
575 erase(const_iterator __position)
576 { return _M_t.erase(__position); }
580 * @param __position An iterator pointing to the element to be erased.
589 erase(iterator __position)
[all...] |
| stl_set.h | 518 * @param __position An iterator that serves as a hint as to where the
536 insert(const_iterator __position, const value_type& __x)
537 { return _M_t._M_insert_unique_(__position, __x); }
541 insert(const_iterator __position, value_type&& __x)
542 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
577 * @param __position An iterator pointing to the element to be erased.
579 * @a __position prior to the element being erased. If no such
590 erase(const_iterator __position)
591 { return _M_t.erase(__position); }
604 erase(iterator __position)
[all...] |
| stl_map.h | 656 * @param __position An iterator that serves as a hint as to where the
679 insert(const_iterator __position, const value_type& __x)
681 insert(iterator __position, const value_type& __x)
683 { return _M_t._M_insert_unique_(__position, __x); }
690 insert(const_iterator __position, _Pair&& __x)
691 { return _M_t._M_insert_unique_(__position,
713 * @param __position An iterator pointing to the element to be erased.
725 erase(const_iterator __position)
726 { return _M_t.erase(__position); }
731 erase(iterator __position)
[all...] |
| /external/clang/www/ |
| libstdc++4.4-clang0x.patch | 170 + splice(iterator __position, list& __x)
171 + { splice(__position, std::move(__x)); }
178 this->_M_transfer(__position, __i, __j);
183 + splice(iterator __position, list& __x, iterator __i)
184 + { splice(__position, std::move(__x), __i); }
196 + splice(iterator __position, list& __x, iterator __first,
198 + { splice(__position, std::move(__x), __first, __last); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| for_each_selectors.h | 245 typename std::iterator_traits<_It>::difference_type __position local
247 return __mult(*__current, *(__begin2_iterator + __position));
|
