/external/libcxx/test/std/containers/associative/set/ |
H A D | insert_iter_rv.pass.cpp | 14 // iterator insert(const_iterator position, value_type&& v); 29 R r = m.insert(m.cend(), M::value_type(2)); 34 r = m.insert(m.cend(), M::value_type(1)); 39 r = m.insert(m.cend(), M::value_type(3)); 44 r = m.insert(m.cend(), M::value_type(3)); 54 R r = m.insert(m.cend(), M::value_type(2)); 59 r = m.insert(m.cend(), M::value_type(1)); 64 r = m.insert(m.cend(), M::value_type(3)); 69 r = m.insert(m.cend(), M::value_type(3));
|
H A D | size.pass.cpp | 27 m.insert(M::value_type(2)); 29 m.insert(M::value_type(1)); 31 m.insert(M::value_type(3)); 45 m.insert(M::value_type(2)); 47 m.insert(M::value_type(1)); 49 m.insert(M::value_type(3));
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_const_lvalue.pass.cpp | 16 // iterator insert(const value_type& x); 30 R r = c.insert(P(3.5, 3)); 35 r = c.insert(P(3.5, 4)); 40 r = c.insert(P(4.5, 4)); 45 r = c.insert(P(5.5, 4)); 57 R r = c.insert(P(3.5, 3)); 62 r = c.insert(P(3.5, 4)); 67 r = c.insert(P(4.5, 4)); 72 r = c.insert(P(5.5, 4));
|
H A D | insert_hint_rvalue.pass.cpp | 20 // iterator insert(const_iterator p, P&& x); 40 R r = c.insert(e, P(3.5, static_cast<short>(3))); 45 r = c.insert(r, P(3.5, static_cast<short>(4))); 50 r = c.insert(c.end(), P(4.5, static_cast<short>(4))); 55 r = c.insert(c.end(), P(5.5, static_cast<short>(4))); 66 R r = c.insert(e, P(3, 3)); 71 r = c.insert(r, P(3, 4)); 76 r = c.insert(c.end(), P(4, 4)); 81 r = c.insert(c.end(), P(5, 4)); 93 R r = c.insert( [all...] |
H A D | insert_hint_const_lvalue.pass.cpp | 16 // iterator insert(const_iterator p, const value_type& x); 35 R r = c.insert(e, P(3.5, 3)); 40 r = c.insert(c.end(), P(3.5, 4)); 45 r = c.insert(c.end(), P(4.5, 4)); 50 r = c.insert(c.end(), P(5.5, 4)); 63 R r = c.insert(e, P(3.5, 3)); 68 r = c.insert(c.end(), P(3.5, 4)); 73 r = c.insert(c.end(), P(4.5, 4)); 78 r = c.insert(c.end(), P(5.5, 4)); 93 R r = c.insert( [all...] |
H A D | insert_rvalue.pass.cpp | 20 // iterator insert(P&& x); 35 R r = c.insert(P(3.5, static_cast<short>(3))); 40 r = c.insert(P(3.5, static_cast<short>(4))); 45 r = c.insert(P(4.5, static_cast<short>(4))); 50 r = c.insert(P(5.5, static_cast<short>(4))); 60 R r = c.insert(P(3, 3)); 65 r = c.insert(P(3, 4)); 70 r = c.insert(P(4, 4)); 75 r = c.insert(P(5, 4)); 86 R r = c.insert( [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | insert_const_lvalue.pass.cpp | 16 // pair<iterator, bool> insert(const value_type& x); 30 R r = c.insert(P(3.5)); 35 r = c.insert(P(3.5)); 40 r = c.insert(P(4.5)); 45 r = c.insert(P(5.5)); 57 R r = c.insert(P(3.5)); 62 r = c.insert(P(3.5)); 67 r = c.insert(P(4.5)); 72 r = c.insert(P(5.5));
|
/external/libcxx/test/std/containers/associative/map/map.access/ |
H A D | size.pass.cpp | 27 m.insert(M::value_type(2, 1.5)); 29 m.insert(M::value_type(1, 1.5)); 31 m.insert(M::value_type(3, 1.5)); 45 m.insert(M::value_type(2, 1.5)); 47 m.insert(M::value_type(1, 1.5)); 49 m.insert(M::value_type(3, 1.5));
|
/external/libcxx/test/std/containers/associative/multimap/ |
H A D | size.pass.cpp | 27 m.insert(M::value_type(2, 1.5)); 29 m.insert(M::value_type(1, 1.5)); 31 m.insert(M::value_type(3, 1.5)); 45 m.insert(M::value_type(2, 1.5)); 47 m.insert(M::value_type(1, 1.5)); 49 m.insert(M::value_type(3, 1.5));
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | size.pass.cpp | 27 m.insert(M::value_type(2)); 29 m.insert(M::value_type(1)); 31 m.insert(M::value_type(2)); 45 m.insert(M::value_type(2)); 47 m.insert(M::value_type(1)); 49 m.insert(M::value_type(2));
|
/external/llvm/unittests/ADT/ |
H A D | MapVectorTest.cpp | 21 R = MV1.insert(std::make_pair(1, 2)); 46 R = MV.insert(std::make_pair(1, 2)); 52 R = MV.insert(std::make_pair(1, 3)); 58 R = MV.insert(std::make_pair(4, 5)); 72 R = MV.insert(std::make_pair(4, 7)); 86 MV.insert(std::make_pair(1, 2)); 87 MV.insert(std::make_pair(3, 4)); 88 MV.insert(std::make_pair(5, 6)); 109 MV.insert(std::make_pair(1, 11)); 110 MV.insert(st [all...] |
H A D | SparseMultiSetTest.cpp | 44 USet::iterator I = Set.insert(5); 57 // Extra insert. 58 I = Set.insert(5); 85 Set.insert(5); 86 Set.insert(5); 87 Set.insert(5); 88 Set.insert(3); 89 Set.insert(2); 90 Set.insert(1); 91 Set.insert( [all...] |
H A D | DenseSetTest.cpp | 24 set.insert(0); 25 set.insert(1); 47 set.insert(0); 48 set.insert(1); 49 set.insert(2);
|
/external/python/cpython2/Lib/idlelib/idle_test/ |
H A D | test_text.py | 9 hw = 'hello\nworld' # usual initial insert after initialization 10 hwn = hw+'\n' # \n present at initialization, before insert 24 'insert'): 32 self.text.insert('1.0', self.hw) 46 self.text.insert('1.0', self.hw) 63 insert = self.text.insert 67 insert('1.0', self.hw) 70 insert('1.0', '') # nothing 73 insert('1. [all...] |
H A D | test_rstrip.py | 13 self.assertEqual(text.get('1.0', 'insert'), '') 14 text.insert('1.0', ' ') 16 self.assertEqual(text.get('1.0', 'insert'), '') 17 text.insert('1.0', ' \n') 19 self.assertEqual(text.get('1.0', 'insert'), '\n') 44 text.insert('1.0', original) 46 self.assertEqual(text.get('1.0', 'insert'), stripped)
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
H A D | insert_hint_rvalue.pass.cpp | 20 // iterator insert(const_iterator p, P&& x); 40 R r = c.insert(e, P(3.5, static_cast<short>(3))); 45 r = c.insert(c.end(), P(3.5, static_cast<short>(4))); 50 r = c.insert(c.end(), P(4.5, static_cast<short>(4))); 55 r = c.insert(c.end(), P(5.5, static_cast<short>(4))); 66 R r = c.insert(e, P(3, 3)); 71 r = c.insert(c.end(), P(3, 4)); 76 r = c.insert(c.end(), P(4, 4)); 81 r = c.insert(c.end(), P(5, 4)); 93 R r = c.insert( [all...] |
H A D | insert_hint_const_lvalue.pass.cpp | 16 // iterator insert(const_iterator p, const value_type& x); 35 R r = c.insert(e, P(3.5, 3)); 40 r = c.insert(c.end(), P(3.5, 4)); 45 r = c.insert(c.end(), P(4.5, 4)); 50 r = c.insert(c.end(), P(5.5, 4)); 63 R r = c.insert(e, P(3.5, 3)); 68 r = c.insert(c.end(), P(3.5, 4)); 73 r = c.insert(c.end(), P(4.5, 4)); 78 r = c.insert(c.end(), P(5.5, 4)); 93 R r = c.insert( [all...] |
H A D | insert_rvalue.pass.cpp | 20 // pair<iterator, bool> insert(P&& x); 35 R r = c.insert(P(3.5, static_cast<short>(3))); 41 r = c.insert(P(3.5, static_cast<short>(4))); 47 r = c.insert(P(4.5, static_cast<short>(4))); 53 r = c.insert(P(5.5, static_cast<short>(4))); 64 R r = c.insert(P(3, 3)); 70 r = c.insert(P(3, 4)); 76 r = c.insert(P(4, 4)); 82 r = c.insert(P(5, 4)); 94 R r = c.insert( [all...] |
/external/swiftshader/third_party/subzero/src/ |
H A D | IceTargetLoweringMIPS32.h | 163 // The following are helpers that insert lowered MIPS32 instructions with 167 Context.insert<InstMIPS32Add>(Dest, Src0, Src1); 171 Context.insert<InstMIPS32Addu>(Dest, Src0, Src1); 175 Context.insert<InstMIPS32And>(Dest, Src0, Src1); 179 Context.insert<InstMIPS32Andi>(Dest, Src, Imm); 182 void _br(CfgNode *Target) { Context.insert<InstMIPS32Br>(Target); } 185 Context.insert<InstMIPS32Br>(Target, Label); 190 Context.insert<InstMIPS32Br>(TargetTrue, TargetFalse, Src0, Src1, 196 Context.insert<InstMIPS32Br>(TargetTrue, TargetFalse, Src0, Condition); 202 Context.insert<InstMIPS32B [all...] |
/external/python/cpython2/Demo/tix/samples/ |
H A D | PanedWin.py | 36 group.entry.insert(0,'comp.lang.python') 48 list.listbox.insert(Tix.END, " 12324 Re: Tkinter is good for your health") 49 list.listbox.insert(Tix.END, "+ 12325 Re: Tkinter is good for your health") 50 list.listbox.insert(Tix.END, "+ 12326 Re: Tix is even better for your health (Was: Tkinter is good...)") 51 list.listbox.insert(Tix.END, " 12327 Re: Tix is even better for your health (Was: Tkinter is good...)") 52 list.listbox.insert(Tix.END, "+ 12328 Re: Tix is even better for your health (Was: Tkinter is good...)") 53 list.listbox.insert(Tix.END, " 12329 Re: Tix is even better for your health (Was: Tkinter is good...)") 54 list.listbox.insert(Tix.END, "+ 12330 Re: Tix is even better for your health (Was: Tkinter is good...)") 58 text.text.insert(Tix.END, """
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.cpp | 39 insert(m, 4, 5); 50 s1.insert(2); 51 s1.insert(3); 57 s2.insert(3); 58 s2.insert(5);
|
/external/javassist/src/main/javassist/convert/ |
H A D | TransformAfter.java | 32 iterator.insert(saveCode); 33 iterator.insert(loadCode); 36 iterator.insert(loadCode);
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_insert/ |
H A D | iter_initializer_list.pass.cpp | 12 // iterator insert(const_iterator p, initializer_list<charT> il); 28 std::string::iterator i = s.insert(s.begin() + 3, {'a', 'b', 'c'}); 36 S::iterator i = s.insert(s.begin() + 3, {'a', 'b', 'c'}); 45 s.insert(s2.begin(), {'a', 'b', 'c'});
|
/external/swiftshader/third_party/LLVM/lib/MC/ |
H A D | MCModule.cpp | 25 AtomAllocationTracker.insert(NewAtom); 26 OffsetMap.insert(Begin, End, NewAtom); 39 OffsetMap.insert(NewBegin, NewEnd, Atom);
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | SmallSet.h | 57 /// insert - Insert an element into the set if it isn't already there. 58 bool insert(const T &V) { function in class:llvm::SmallSet 60 return Set.insert(V).second; 72 Set.insert(Vector.back()); 75 Set.insert(V); 80 void insert(IterT I, IterT E) { function in class:llvm::SmallSet 82 insert(*I);
|