/external/stlport/stlport/stl/ |
H A D | _hashtable.c | 190 _M_elems.insert_after(__pos, __obj)._M_node); 218 __cur = _M_elems.insert_after(_ElemsIte(_M_buckets[__n]), __obj); 242 return _M_elems.insert_after(__cur, __obj);
|
H A D | _slist.c | 174 __i1 = __that.insert_after(__i1, *(__i2++)); 177 __that.insert_after(__i1, __i2, __x.end());
|
H A D | _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(__po [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _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(iterato function in class:slist 305 void insert_after(iterator __pos, function in class:slist [all...] |
/external/stlport/stlport/stl/pointers/ |
H A 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)) 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(_BaseIt 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/stlport/test/unit/ |
H A D | 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);
|
/external/mesa3d/src/glsl/ |
H A D | linker.cpp | 899 last->insert_after(inst);
|
H A D | list.h | 145 void insert_after(exec_node *after) function in struct:exec_node
|
H A D | lower_clip_distance.cpp | 326 this->base_ir->insert_after(new_assignment);
|
H A D | lower_discard.cpp | 193 ir->insert_after(discard);
|
H A D | lower_jumps.cpp | 570 ir->insert_after(new(ir) ir_loop_jump(ir_loop_jump::jump_continue)); 572 ir->insert_after(new(ir) ir_loop_jump(ir_loop_jump::jump_break)); 575 ir->insert_after(new(ir) ir_return(NULL)); 710 ir->insert_after(jumps[move_out]); 820 ir->insert_after(if_execute); 936 ir->insert_after(return_if);
|
H A D | opt_redundant_jumps.cpp | 87 ir->insert_after(then_jump);
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_cse.cpp | 133 entry->generator->insert_after(copy);
|
H A D | brw_fs_reg_allocate.cpp | 435 inst->insert_after(spill_inst);
|
H A D | brw_vec4_visitor.cpp | 2487 inst->insert_after(write);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | 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);
|
H A D | 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});
|
H A D | 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));
|
H A D | 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);
|
H A D | 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);
|
/external/chromium_org/v8/src/ |
H A D | hydrogen.cc | 7225 HInstruction* insert_after = entry; local 7229 push_argument->InsertAfter(insert_after); 7230 insert_after = push_argument; 7235 arguments_elements->InsertAfter(insert_after);
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | linker.cpp | 899 last->insert_after(inst);
|
H A D | list.h | 145 void insert_after(exec_node *after) function in struct:exec_node
|
H A D | lower_clip_distance.cpp | 326 this->base_ir->insert_after(new_assignment);
|
H A D | lower_discard.cpp | 193 ir->insert_after(discard);
|