| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_set.h | 444 insert(const_iterator __position, const value_type& __x)
445 { return _M_t._M_insert_unique_(__position, __x); }
449 insert(const_iterator __position, value_type&& __x)
450 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
497 erase(const_iterator __position)
498 { return _M_t.erase(__position); }
511 erase(iterator __position)
512 { _M_t.erase(__position); }
|
| stl_tree.h | 757 _M_insert_unique_(const_iterator __position, _Arg&& __x);
761 _M_insert_equal_(const_iterator __position, _Arg&& __x);
770 _M_insert_unique_(const_iterator __position, const value_type& __x);
773 _M_insert_equal_(const_iterator __position, const value_type& __x);
786 _M_erase_aux(const_iterator __position);
796 erase(const_iterator __position)
798 const_iterator __result = __position;
800 _M_erase_aux(__position);
806 erase(iterator __position)
808 iterator __result = __position;
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| multiset.h | 193 insert(const_iterator __position, const value_type& __x)
194 { return iterator(_Base::insert(__position, __x)); }
198 insert(const_iterator __position, value_type&& __x)
199 { return iterator(_Base::insert(__position, std::move(__x))); }
215 erase(const_iterator __position)
216 { return iterator(_Base::erase(__position)); }
219 erase(iterator __position)
220 { _Base::erase(__position); }
|
| set.h | 204 insert(const_iterator __position, const value_type& __x)
205 { return iterator(_Base::insert(__position, __x)); }
209 insert(const_iterator __position, value_type&& __x)
210 { return iterator(_Base::insert(__position, std::move(__x))); }
226 erase(const_iterator __position)
227 { return iterator(_Base::erase(__position)); }
230 erase(iterator __position)
231 { _Base::erase(__position); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 413 * @param __position An iterator that serves as a hint as to where the
432 insert(const_iterator __position, const value_type& __x)
433 { return _M_t._M_insert_equal_(__position, __x); }
437 insert(const_iterator __position, value_type&& __x)
438 { return _M_t._M_insert_equal_(__position, std::move(__x)); }
472 * @param __position An iterator pointing to the element to be erased.
484 erase(const_iterator __position)
485 { return _M_t.erase(__position); }
489 * @param __position An iterator pointing to the element to be erased.
498 erase(iterator __position)
[all...] |
| stl_set.h | 431 * @param __position An iterator that serves as a hint as to where the
449 insert(const_iterator __position, const value_type& __x)
450 { return _M_t._M_insert_unique_(__position, __x); }
454 insert(const_iterator __position, value_type&& __x)
455 { return _M_t._M_insert_unique_(__position, std::move(__x)); }
490 * @param __position An iterator pointing to the element to be erased.
492 * @a __position prior to the element being erased. If no such
502 erase(const_iterator __position)
503 { return _M_t.erase(__position); }
516 erase(iterator __position)
[all...] |
| stl_tree.h | 724 _M_insert_unique_(const_iterator __position, _Arg&& __x);
728 _M_insert_equal_(const_iterator __position, _Arg&& __x);
737 _M_insert_unique_(const_iterator __position, const value_type& __x);
740 _M_insert_equal_(const_iterator __position, const value_type& __x);
753 _M_erase_aux(const_iterator __position);
763 erase(const_iterator __position)
765 const_iterator __result = __position;
767 _M_erase_aux(__position);
773 erase(iterator __position)
775 iterator __result = __position;
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| multiset.h | 194 insert(const_iterator __position, const value_type& __x)
195 { return iterator(_Base::insert(__position, __x)); }
199 insert(const_iterator __position, value_type&& __x)
200 { return iterator(_Base::insert(__position, std::move(__x))); }
216 erase(const_iterator __position)
217 { return iterator(_Base::erase(__position)); }
220 erase(iterator __position)
221 { _Base::erase(__position); }
|
| set.h | 205 insert(const_iterator __position, const value_type& __x)
206 { return iterator(_Base::insert(__position, __x)); }
210 insert(const_iterator __position, value_type&& __x)
211 { return iterator(_Base::insert(__position, std::move(__x))); }
227 erase(const_iterator __position)
228 { return iterator(_Base::erase(__position)); }
231 erase(iterator __position)
232 { _Base::erase(__position); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| 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.
536 erase(const_iterator __position)
537 { return _M_t.erase(__position); }
541 * @param __position An iterator pointing to the element to be erased.
550 erase(iterator __position)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_tree.h | 757 _M_insert_unique_(const_iterator __position, _Arg&& __x);
761 _M_insert_equal_(const_iterator __position, _Arg&& __x);
770 _M_insert_unique_(const_iterator __position, const value_type& __x);
773 _M_insert_equal_(const_iterator __position, const value_type& __x);
786 _M_erase_aux(const_iterator __position);
796 erase(const_iterator __position)
798 const_iterator __result = __position;
800 _M_erase_aux(__position);
806 erase(iterator __position)
808 iterator __result = __position;
[all...] |
| stl_vector.h | 939 emplace(iterator __position, _Args&&... __args);
954 insert(iterator __position, const value_type& __x);
969 insert(iterator __position, value_type&& __x)
970 { return emplace(__position, std::move(__x)); }
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_tree.h | 757 _M_insert_unique_(const_iterator __position, _Arg&& __x);
761 _M_insert_equal_(const_iterator __position, _Arg&& __x);
770 _M_insert_unique_(const_iterator __position, const value_type& __x);
773 _M_insert_equal_(const_iterator __position, const value_type& __x);
786 _M_erase_aux(const_iterator __position);
796 erase(const_iterator __position)
798 const_iterator __result = __position;
800 _M_erase_aux(__position);
806 erase(iterator __position)
808 iterator __result = __position;
[all...] |
| stl_vector.h | 939 emplace(iterator __position, _Args&&... __args);
954 insert(iterator __position, const value_type& __x);
969 insert(iterator __position, value_type&& __x)
970 { return emplace(__position, std::move(__x)); }
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_tree.h | 757 _M_insert_unique_(const_iterator __position, _Arg&& __x);
761 _M_insert_equal_(const_iterator __position, _Arg&& __x);
770 _M_insert_unique_(const_iterator __position, const value_type& __x);
773 _M_insert_equal_(const_iterator __position, const value_type& __x);
786 _M_erase_aux(const_iterator __position);
796 erase(const_iterator __position)
798 const_iterator __result = __position;
800 _M_erase_aux(__position);
806 erase(iterator __position)
808 iterator __result = __position;
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_tree.h | 724 _M_insert_unique_(const_iterator __position, _Arg&& __x);
728 _M_insert_equal_(const_iterator __position, _Arg&& __x);
737 _M_insert_unique_(const_iterator __position, const value_type& __x);
740 _M_insert_equal_(const_iterator __position, const value_type& __x);
753 _M_erase_aux(const_iterator __position);
763 erase(const_iterator __position)
765 const_iterator __result = __position;
767 _M_erase_aux(__position);
773 erase(iterator __position)
775 iterator __result = __position;
[all...] |
| /external/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position,
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
54 __position->_M_prev->_M_next = __first;
57 _Node_base* __tmp = __position->_M_prev;
58 __position->_M_prev = __last->_M_prev;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_vector.h | 801 emplace(iterator __position, _Args&&... __args);
816 insert(iterator __position, const value_type& __x);
831 insert(iterator __position, value_type&& __x)
832 { return emplace(__position, std::move(__x)); }
848 insert(iterator __position, initializer_list<value_type> __l)
849 { this->insert(__position, __l.begin(), __l.end()); }
866 insert(iterator __position, size_type __n, const value_type& __x)
867 { _M_fill_insert(__position, __n, __x); }
885 insert(iterator __position, _InputIterator __first,
890 _M_insert_dispatch(__position, __first, __last, _Integral())
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_vector.h | 801 emplace(iterator __position, _Args&&... __args);
816 insert(iterator __position, const value_type& __x);
831 insert(iterator __position, value_type&& __x)
832 { return emplace(__position, std::move(__x)); }
848 insert(iterator __position, initializer_list<value_type> __l)
849 { this->insert(__position, __l.begin(), __l.end()); }
866 insert(iterator __position, size_type __n, const value_type& __x)
867 { _M_fill_insert(__position, __n, __x); }
885 insert(iterator __position, _InputIterator __first,
890 _M_insert_dispatch(__position, __first, __last, _Integral())
[all...] |
