| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| D | insert_after_const.pass.cpp | 26 I i = c.insert_after(c.cbefore_begin(), 0); in main()
32 i = c.insert_after(c.cbegin(), 1); in main()
38 i = c.insert_after(next(c.cbegin()), 2); in main()
45 i = c.insert_after(c.cbegin(), 3); in main()
59 I i = c.insert_after(c.cbefore_begin(), 0); in main()
65 i = c.insert_after(c.cbegin(), 1); in main()
71 i = c.insert_after(next(c.cbegin()), 2); in main()
78 i = c.insert_after(c.cbegin(), 3); in main()
|
| D | insert_after_rv.pass.cpp | 28 I i = c.insert_after(c.cbefore_begin(), 0); in main()
34 i = c.insert_after(c.cbegin(), 1); in main()
40 i = c.insert_after(next(c.cbegin()), 2); in main()
47 i = c.insert_after(c.cbegin(), 3); in main()
61 I i = c.insert_after(c.cbefore_begin(), 0); in main()
67 i = c.insert_after(c.cbegin(), 1); in main()
73 i = c.insert_after(next(c.cbegin()), 2); in main()
80 i = c.insert_after(c.cbegin(), 3); in main()
|
| D | insert_after_size_value.pass.cpp | 26 I i = c.insert_after(c.cbefore_begin(), 0, 0); in main()
30 i = c.insert_after(c.cbefore_begin(), 3, 3); in main()
37 i = c.insert_after(c.begin(), 2, 2); in main()
52 I i = c.insert_after(c.cbefore_begin(), 0, 0); in main()
56 i = c.insert_after(c.cbefore_begin(), 3, 3); in main()
63 i = c.insert_after(c.begin(), 2, 2); in main()
|
| D | insert_after_init.pass.cpp | 27 I i = c.insert_after(c.cbefore_begin(), {}); in main()
31 i = c.insert_after(c.cbefore_begin(), {0, 1, 2}); in main()
38 i = c.insert_after(c.begin(), {3, 4}); in main()
53 I i = c.insert_after(c.cbefore_begin(), {}); in main()
57 i = c.insert_after(c.cbefore_begin(), {0, 1, 2}); in main()
64 i = c.insert_after(c.begin(), {3, 4}); in main()
|
| D | insert_after_range.pass.cpp | 31 I i = c.insert_after(c.cbefore_begin(), J(t), J(t)); in main()
35 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3)); in main()
42 i = c.insert_after(c.begin(), J(t+3), J(t+5)); in main()
59 I i = c.insert_after(c.cbefore_begin(), J(t), J(t)); in main()
63 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3)); in main()
70 i = c.insert_after(c.begin(), J(t+3), J(t+5)); in main()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| D | _slist.h | 112 insert_after(before_begin(), __first, __last);
122 { insert_after(before_begin(), __first, __last); }
226 …iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type…
228 iterator insert_after(iterator __pos, const value_type& __x)
230 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
234 iterator insert_after(iterator __pos) in insert_after() function
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);} in insert_after()
238 void insert_after(iterator __pos, size_type __n, const value_type& __x) in insert_after() function
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } in insert_after()
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); in _M_insert_after_dispatch()
[all …]
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| D | _slist.h | 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) {
240 iterator insert_after(iterator __pos, const value_type& __x) {
244 return iterator(&_M_iter_list,_M_non_dbg_impl.insert_after(__pos._M_iterator, __x));
248 iterator insert_after(iterator __pos) { in insert_after() function
249 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); in insert_after()
253 void insert_after(iterator __pos, size_type __n, const value_type& __x) { in insert_after() function
256 _M_non_dbg_impl.insert_after(__pos._M_iterator, __n, __x); in insert_after()
281 void insert_after(iterator __pos, _InIter __first, _InIter __last) { in insert_after() function
285 _M_non_dbg_impl.insert_after(__pos._M_iterator, in insert_after()
298 void insert_after(iterator __pos, in insert_after() function
[all …]
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | slist_test.cpp | 183 sl.insert_after(sl.before_begin(), 5); in insert()
187 sl.insert_after(sl.before_begin(), array, array + 5); in insert()
491 slintref.insert_after(slintref.before_begin(), 10, 1); in allocator_with_state()
492 slintref.insert_after(slintref.before_begin(), 10, 0); in allocator_with_state()
510 slintref.insert_after(slintref.before_begin(), 10, 0); in allocator_with_state()
511 slintref.insert_after(slintref.before_begin(), 10, 1); in allocator_with_state()
528 slint1.insert_after(slint1.before_begin(), 10, 0); in allocator_with_state()
|
| /ndk/tests/device/test-stlport/unit/ |
| D | slist_test.cpp | 183 sl.insert_after(sl.before_begin(), 5); in insert()
187 sl.insert_after(sl.before_begin(), array, array + 5); in insert()
491 slintref.insert_after(slintref.before_begin(), 10, 1); in allocator_with_state()
492 slintref.insert_after(slintref.before_begin(), 10, 0); in allocator_with_state()
510 slintref.insert_after(slintref.before_begin(), 10, 0); in allocator_with_state()
511 slintref.insert_after(slintref.before_begin(), 10, 1); in allocator_with_state()
528 slint1.insert_after(slint1.before_begin(), 10, 0); in allocator_with_state()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _slist.h | 601 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) {
603 iterator insert_after(iterator __pos, const value_type& __x) {
609 iterator insert_after(iterator __pos) {
610 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
614 void insert_after(iterator __pos, size_type __n, const value_type& __x) {
622 void insert_after(iterator __pos, _InIter __first, _InIter __last) {
624 void insert_after(iterator __pos,
628 void insert_after(iterator __pos,
705 …this->insert_after(__pos, iterator(__before_first._M_node->_M_next), iterator(__before_last._M_nod…
719 this->insert_after(__pos, __STATIC_CAST(_Node*, __prev._M_node->_M_next)->_M_data);
[all …]
|
| D | _slist.c | 174 __i1 = __that.insert_after(__i1, *(__i2++)); in _Slist_merge()
177 __that.insert_after(__i1, __i2, __x.end()); in _Slist_merge()
|
| D | _hashtable.c | 190 _M_elems.insert_after(__pos, __obj)._M_node); in _M_insert_noresize()
218 __cur = _M_elems.insert_after(_ElemsIte(_M_buckets[__n]), __obj); in insert_unique_noresize()
242 return _M_elems.insert_after(__cur, __obj); in insert_equal_noresize()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| D | forward_list | 98 iterator insert_after(const_iterator p, const value_type& v);
99 iterator insert_after(const_iterator p, value_type&& v);
100 iterator insert_after(const_iterator p, size_type n, const value_type& v);
102 iterator insert_after(const_iterator p,
104 iterator insert_after(const_iterator p, initializer_list<value_type> il);
696 iterator insert_after(const_iterator __p, value_type&& __v);
698 iterator insert_after(const_iterator __p, const value_type& __v);
699 iterator insert_after(const_iterator __p, size_type __n, const value_type& __v);
707 insert_after(const_iterator __p, _InputIterator __f, _InputIterator __l);
709 iterator insert_after(const_iterator __p, initializer_list<value_type> __il)
[all …]
|
| D | __hash_table | 1627 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
1788 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
|