/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/multiset/ |
H A D | main.cpp | 28 ii.insert(0); 29 ii.insert(1); 30 ii.insert(2); 31 ii.insert(3); 32 ii.insert(4); 33 ii.insert(5); 36 ii.insert(6); 45 ss.insert("a"); 46 ss.insert("a very long string is right here"); 49 ss.insert(" [all...] |
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/set/ |
H A D | main.cpp | 28 ii.insert(0); 29 ii.insert(1); 30 ii.insert(2); 31 ii.insert(3); 32 ii.insert(4); 33 ii.insert(5); 36 ii.insert(6); 45 ss.insert("a"); 46 ss.insert("a very long string is right here"); 49 ss.insert(" [all...] |
/external/llvm/test/MC/Mips/msa/ |
H A D | test_elm_insert.s | 3 # CHECK: insert.b $w23[3], $sp # encoding: [0x79,0x03,0xed,0xd9] 4 # CHECK: insert.h $w20[2], $5 # encoding: [0x79,0x22,0x2d,0x19] 5 # CHECK: insert.w $w8[2], $15 # encoding: [0x79,0x32,0x7a,0x19] 7 insert.b $w23[3], $sp 8 insert.h $w20[2], $5 9 insert.w $w8[2], $15
|
H A D | test_elm_insert_msa64.s | 3 # CHECK: insert.d $w1[1], $sp # encoding: [0x79,0x39,0xe8,0x59] 5 insert.d $w1[1], $sp
|
/external/v8/test/mjsunit/tools/ |
H A D | splaytree.js | 35 tree.insert(0, 'value'); 43 tree.insert(0, 'value'); 45 tree.insert(0, 'value'); 62 // We can't use the 'insert' method because it also uses 'splay_'. 97 tree.insert(5, 'root'); 98 tree.insert(3, 'left'); 100 tree.insert(7, 'right'); 107 tree.insert(5, 'root'); 108 tree.insert(3, 'left'); 109 tree.insert( [all...] |
/external/strace/ |
H A D | xlate.el | 56 "Build and insert an strace xlat table based on the last grab." 62 (insert "static struct xlat ?[] = {\n") 64 (insert "\t{ " (car list) ",\n") 68 (insert "\"" (car list) "\"") 71 (insert "},") 74 (insert " { 0, NULL },\n") 75 (insert "};\n") 76 (insert "\n"))
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | insert_rvalue.pass.cpp | 16 // iterator insert(value_type&& x); 31 R r = c.insert(P(3.5)); 35 r = c.insert(P(3.5)); 39 r = c.insert(P(4.5)); 43 r = c.insert(P(5.5)); 53 R r = c.insert(P(3)); 57 r = c.insert(P(3)); 61 r = c.insert(P(4)); 65 r = c.insert(P(5)); 77 R r = c.insert( [all...] |
H A D | insert_const_lvalue.pass.cpp | 16 // iterator insert(const value_type& x); 30 R r = c.insert(P(3.5)); 34 r = c.insert(P(3.5)); 38 r = c.insert(P(4.5)); 42 r = c.insert(P(5.5)); 53 R r = c.insert(P(3.5)); 57 r = c.insert(P(3.5)); 61 r = c.insert(P(4.5)); 65 r = c.insert(P(5.5));
|
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)); 39 r = c.insert(c.end(), P(3.5)); 43 r = c.insert(c.end(), P(4.5)); 47 r = c.insert(c.end(), P(5.5)); 59 R r = c.insert(e, P(3.5)); 63 r = c.insert(c.end(), P(3.5)); 67 r = c.insert(c.end(), P(4.5)); 71 r = c.insert(c.end(), P(5.5)); 85 R r = c.insert( [all...] |
H A D | insert_hint_rvalue.pass.cpp | 16 // iterator insert(const_iterator p, value_type&& x); 36 R r = c.insert(e, P(3.5)); 40 r = c.insert(r, P(3.5)); 44 r = c.insert(c.end(), P(4.5)); 48 r = c.insert(c.end(), P(5.5)); 59 R r = c.insert(e, P(3)); 63 r = c.insert(r, P(3)); 67 r = c.insert(c.end(), P(4)); 71 r = c.insert(c.end(), P(5)); 84 R r = c.insert( [all...] |
/external/llvm/unittests/ADT/ |
H A D | SmallPtrSetTest.cpp | 25 s1.insert(&buf[0]); 26 s1.insert(&buf[1]); 29 (s2 = s1).insert(&buf[2]); 32 (s2 = s2).insert(&buf[3]); 52 s.insert(&buf[0]); 53 s.insert(&buf[1]); 54 s.insert(&buf[2]); 55 s.insert(&buf[3]); 65 s.insert(&buf[4]); 66 s.insert( [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
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)); 39 r = c.insert(e, P(3.5)); 43 r = c.insert(e, P(4.5)); 47 r = c.insert(e, P(5.5)); 59 R r = c.insert(e, P(3.5)); 63 r = c.insert(e, P(3.5)); 67 r = c.insert(e, P(4.5)); 71 r = c.insert(e, P(5.5)); 85 R r = c.insert( [all...] |
H A D | insert_hint_rvalue.pass.cpp | 16 // iterator insert(const_iterator p, value_type&& x); 36 R r = c.insert(e, P(3.5)); 40 r = c.insert(r, P(3.5)); 44 r = c.insert(e, P(4.5)); 48 r = c.insert(e, P(5.5)); 59 R r = c.insert(e, P(3)); 63 r = c.insert(r, P(3)); 67 r = c.insert(e, P(4)); 71 r = c.insert(e, P(5)); 84 R r = c.insert( [all...] |
H A D | insert_rvalue.pass.cpp | 16 // pair<iterator, bool> insert(value_type&& x); 31 R r = c.insert(P(3.5)); 36 r = c.insert(P(3.5)); 41 r = c.insert(P(4.5)); 46 r = c.insert(P(5.5)); 57 R r = c.insert(P(3)); 62 r = c.insert(P(3)); 67 r = c.insert(P(4)); 72 r = c.insert(P(5)); 85 R r = c.insert( [all...] |
/external/chromium-trace/trace-viewer/third_party/Paste/tests/ |
H A D | __init__.py | 4 sys.path.insert(0, os.path.dirname(os.path.dirname(__file__)))
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_rvalue.pass.cpp | 18 // iterator insert(P&& x); 33 R r = c.insert(P(3.5, 3)); 38 r = c.insert(P(3.5, 4)); 43 r = c.insert(P(4.5, 4)); 48 r = c.insert(P(5.5, 4)); 59 R r = c.insert(P(3, 3)); 64 r = c.insert(P(3, 4)); 69 r = c.insert(P(4, 4)); 74 r = c.insert(P(5, 4)); 87 R r = c.insert( [all...] |
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));
|
/external/selinux/sepolgen/tests/ |
H A D | run-tests.py | 4 sys.path.insert(0, "../src/.")
|
/external/clang/unittests/AST/ |
H A D | ASTVectorTest.cpp | 49 V.insert(Ctxt, V.begin(), 0); 56 auto I = V.insert(Ctxt, V.begin(), 5, 1.0); 60 I = V.insert(Ctxt, V.begin() + 1, 5, 1.0); 63 // And insert-at-end 64 I = V.insert(Ctxt, V.end(), 5, 1.0); 74 auto I = V.insert(Ctxt, V.begin(), IntVec.begin(), IntVec.begin()); 79 I = V.insert(Ctxt, V.begin(), IntVec.begin(), IntVec.end()); 83 I = V.insert(Ctxt, V.end(), IntVec.begin(), IntVec.begin()); 87 I = V.insert(Ctxt, V.end(), IntVec.begin(), IntVec.end());
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | insert_cv.pass.cpp | 14 // iterator insert(const value_type& v); 27 R r = m.insert(M::value_type(2)); 32 r = m.insert(M::value_type(1)); 37 r = m.insert(M::value_type(3)); 42 r = m.insert(M::value_type(3)); 52 R r = m.insert(M::value_type(2)); 57 r = m.insert(M::value_type(1)); 62 r = m.insert(M::value_type(3)); 67 r = m.insert(M::value_type(3));
|
H A D | insert_iter_cv.pass.cpp | 14 // iterator insert(const_iterator position, const value_type& v); 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
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)); 55 R r = m.insert(m.cend(), M::value_type(2)); 60 r = m.insert(m.cend(), M::value_type(1)); 65 r = m.insert(m.cend(), M::value_type(3)); 70 r = m.insert(m.cend(), M::value_type(3));
|
H A D | insert_rv.pass.cpp | 14 // iterator insert(value_type&& v); 29 R r = m.insert(M::value_type(2)); 34 r = m.insert(M::value_type(1)); 39 r = m.insert(M::value_type(3)); 44 r = m.insert(M::value_type(3)); 55 R r = m.insert(M::value_type(2)); 60 r = m.insert(M::value_type(1)); 65 r = m.insert(M::value_type(3)); 70 r = m.insert(M::value_type(3));
|
/external/libcxx/test/std/containers/associative/set/ |
H A D | insert_iter_cv.pass.cpp | 14 // iterator insert(const_iterator position, const value_type& v); 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
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));
|