| /external/antlr/antlr-3.4/runtime/Perl5/examples/tweak/ |
| T.g | 18 $input->insert_after($method.stop, "\n}\n");
42 $tokens->insert_after($lcurly, "\nint $id;");
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| insert_after_init.pass.cpp | 12 // iterator insert_after(const_iterator p, initializer_list<value_type> il);
27 I i = c.insert_after(c.cbefore_begin(), {});
31 i = c.insert_after(c.cbefore_begin(), {0, 1, 2});
38 i = c.insert_after(c.begin(), {3, 4});
53 I i = c.insert_after(c.cbefore_begin(), {});
57 i = c.insert_after(c.cbefore_begin(), {0, 1, 2});
64 i = c.insert_after(c.begin(), {3, 4});
|
| insert_after_range.pass.cpp | 13 // iterator insert_after(const_iterator p,
31 I i = c.insert_after(c.cbefore_begin(), J(t), J(t));
35 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3));
42 i = c.insert_after(c.begin(), J(t+3), J(t+5));
59 I i = c.insert_after(c.cbefore_begin(), J(t), J(t));
63 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3));
70 i = c.insert_after(c.begin(), J(t+3), J(t+5));
|
| insert_after_size_value.pass.cpp | 12 // iterator insert_after(const_iterator p, size_type n, const value_type& v);
26 I i = c.insert_after(c.cbefore_begin(), 0, 0);
30 i = c.insert_after(c.cbefore_begin(), 3, 3);
37 i = c.insert_after(c.begin(), 2, 2);
52 I i = c.insert_after(c.cbefore_begin(), 0, 0);
56 i = c.insert_after(c.cbefore_begin(), 3, 3);
63 i = c.insert_after(c.begin(), 2, 2);
|
| insert_after_const.pass.cpp | 12 // iterator insert_after(const_iterator p, const value_type& v);
26 I i = c.insert_after(c.cbefore_begin(), 0);
32 i = c.insert_after(c.cbegin(), 1);
38 i = c.insert_after(next(c.cbegin()), 2);
45 i = c.insert_after(c.cbegin(), 3);
59 I i = c.insert_after(c.cbefore_begin(), 0);
65 i = c.insert_after(c.cbegin(), 1);
71 i = c.insert_after(next(c.cbegin()), 2);
78 i = c.insert_after(c.cbegin(), 3);
|
| insert_after_rv.pass.cpp | 12 // iterator insert_after(const_iterator p, value_type&& v);
28 I i = c.insert_after(c.cbefore_begin(), 0);
34 i = c.insert_after(c.cbegin(), 1);
40 i = c.insert_after(next(c.cbegin()), 2);
47 i = c.insert_after(c.cbegin(), 3);
61 I i = c.insert_after(c.cbefore_begin(), 0);
67 i = c.insert_after(c.cbegin(), 1);
73 i = c.insert_after(next(c.cbegin()), 2);
80 i = c.insert_after(c.cbegin(), 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| insert_after_init.pass.cpp | 12 // iterator insert_after(const_iterator p, initializer_list<value_type> il);
27 I i = c.insert_after(c.cbefore_begin(), {});
31 i = c.insert_after(c.cbefore_begin(), {0, 1, 2});
38 i = c.insert_after(c.begin(), {3, 4});
53 I i = c.insert_after(c.cbefore_begin(), {});
57 i = c.insert_after(c.cbefore_begin(), {0, 1, 2});
64 i = c.insert_after(c.begin(), {3, 4});
|
| insert_after_range.pass.cpp | 13 // iterator insert_after(const_iterator p,
31 I i = c.insert_after(c.cbefore_begin(), J(t), J(t));
35 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3));
42 i = c.insert_after(c.begin(), J(t+3), J(t+5));
59 I i = c.insert_after(c.cbefore_begin(), J(t), J(t));
63 i = c.insert_after(c.cbefore_begin(), J(t), J(t+3));
70 i = c.insert_after(c.begin(), J(t+3), J(t+5));
|
| insert_after_size_value.pass.cpp | 12 // iterator insert_after(const_iterator p, size_type n, const value_type& v);
26 I i = c.insert_after(c.cbefore_begin(), 0, 0);
30 i = c.insert_after(c.cbefore_begin(), 3, 3);
37 i = c.insert_after(c.begin(), 2, 2);
52 I i = c.insert_after(c.cbefore_begin(), 0, 0);
56 i = c.insert_after(c.cbefore_begin(), 3, 3);
63 i = c.insert_after(c.begin(), 2, 2);
|
| insert_after_const.pass.cpp | 12 // iterator insert_after(const_iterator p, const value_type& v);
26 I i = c.insert_after(c.cbefore_begin(), 0);
32 i = c.insert_after(c.cbegin(), 1);
38 i = c.insert_after(next(c.cbegin()), 2);
45 i = c.insert_after(c.cbegin(), 3);
59 I i = c.insert_after(c.cbefore_begin(), 0);
65 i = c.insert_after(c.cbegin(), 1);
71 i = c.insert_after(next(c.cbegin()), 2);
78 i = c.insert_after(c.cbegin(), 3);
|
| insert_after_rv.pass.cpp | 12 // iterator insert_after(const_iterator p, value_type&& v);
28 I i = c.insert_after(c.cbefore_begin(), 0);
34 i = c.insert_after(c.cbegin(), 1);
40 i = c.insert_after(next(c.cbegin()), 2);
47 i = c.insert_after(c.cbegin(), 3);
61 I i = c.insert_after(c.cbefore_begin(), 0);
67 i = c.insert_after(c.cbegin(), 1);
73 i = c.insert_after(next(c.cbegin()), 2);
80 i = c.insert_after(c.cbegin(), 3);
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/token-rewrite/ |
| via-parser.rb | 15 @input.insert_after($stop, "\n}\n")
36 @input.insert_after($lcurly, "\nint "+it+";")
|
| basic.rb | 34 stream.insert_after( 2, 'x' )
41 stream.insert_after 1, 'x'
130 stream.insert_after( 2, "y" )
144 stream.insert_after( 4, "y" )
312 stream.insert_after( 17, '// comment' )
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _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)) function in class:slist
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) function in class:slist
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x) function in class:slist
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val)
263 void insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:slist
274 void insert_after(iterator __pos, function in class:slist
278 void insert_after(iterator __pos, function in class:slist
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _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)) function in class:slist
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) function in class:slist
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x) function in class:slist
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val)
263 void insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:slist
274 void insert_after(iterator __pos, function in class:slist
278 void insert_after(iterator __pos, function in class:slist
[all...] |
| /external/chromium-trace/catapult/third_party/closure_linter/closure_linter/ |
| requireprovidesorter.py | 144 insert_after = tokens[0].previous
150 tokenutil.InsertTokenAfter(i, insert_after)
151 insert_after = i
|
| /external/mesa3d/src/glsl/ |
| opt_redundant_jumps.cpp | 87 ir->insert_after(then_jump);
|
| lower_discard.cpp | 193 ir->insert_after(discard);
|
| /art/compiler/utils/ |
| intrusive_forward_list_test.cc | 69 ifl.insert_after(ifl.cbefore_begin(), value);
125 auto ref_it = ref.insert_after(ref.before_begin(), 4);
126 auto ifl_it = ifl.insert_after(ifl.before_begin(), value4);
132 ref_it = ref.insert_after(ref.begin(), 8);
133 ifl_it = ifl.insert_after(ifl.begin(), value8);
141 ref_it = ref.insert_after(ref.begin(), 5);
142 ifl_it = ifl.insert_after(ifl.begin(), value5);
146 ref_it = ref.insert_after(ref_it, 3);
147 ifl_it = ifl.insert_after(ifl_it, value3);
156 auto ref_it = ref.insert_after(ref.before_begin(), { 2, 8, 5 })
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _slist.h | 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
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) { function in class:slist
249 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
253 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
256 _M_non_dbg_impl.insert_after(__pos._M_iterator, __n, __x);
281 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
285 _M_non_dbg_impl.insert_after(__pos._M_iterator,
298 void insert_after(iterator __pos function in class:slist
305 void insert_after(iterator __pos, function in class:slist
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _slist.h | 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
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) { function in class:slist
249 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
253 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
256 _M_non_dbg_impl.insert_after(__pos._M_iterator, __n, __x);
281 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
285 _M_non_dbg_impl.insert_after(__pos._M_iterator,
298 void insert_after(iterator __pos function in class:slist
305 void insert_after(iterator __pos, function in class:slist
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 408 // insert_after, erase_after, etc. Note that even for an empty
601 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
603 iterator insert_after(iterator __pos, const value_type& __x) {
609 iterator insert_after(iterator __pos) { function in class:slist
610 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
614 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
622 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
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_node->_M_next))
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 408 // insert_after, erase_after, etc. Note that even for an empty
601 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
603 iterator insert_after(iterator __pos, const value_type& __x) {
609 iterator insert_after(iterator __pos) { function in class:slist
610 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
614 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
622 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
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_node->_M_next))
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| slist_test.cpp | 176 //insert_after
181 //sl.insert_after(sl.begin(), 5);
183 sl.insert_after(sl.before_begin(), 5);
187 sl.insert_after(sl.before_begin(), array, array + 5);
491 slintref.insert_after(slintref.before_begin(), 10, 1);
492 slintref.insert_after(slintref.before_begin(), 10, 0);
510 slintref.insert_after(slintref.before_begin(), 10, 0);
511 slintref.insert_after(slintref.before_begin(), 10, 1);
528 slint1.insert_after(slint1.before_begin(), 10, 0);
|
| /ndk/tests/device/test-stlport/unit/ |
| slist_test.cpp | 176 //insert_after
181 //sl.insert_after(sl.begin(), 5);
183 sl.insert_after(sl.before_begin(), 5);
187 sl.insert_after(sl.before_begin(), array, array + 5);
491 slintref.insert_after(slintref.before_begin(), 10, 1);
492 slintref.insert_after(slintref.before_begin(), 10, 0);
510 slintref.insert_after(slintref.before_begin(), 10, 0);
511 slintref.insert_after(slintref.before_begin(), 10, 1);
528 slint1.insert_after(slint1.before_begin(), 10, 0);
|
