/external/libchrome/base/ |
H A D | stl_util_unittest.cc | 39 set.insert(24); 40 set.insert(1); 41 set.insert(12); 47 set.insert(ComparableValue(24)); 48 set.insert(ComparableValue(1)); 49 set.insert(ComparableValue(12)); 68 a1.insert(1); 69 a1.insert(2); 70 a1.insert(3); 71 a1.insert( [all...] |
/external/webrtc/webrtc/system_wrappers/source/ |
H A D | stl_util_unittest.cc | 46 set.insert(24); 47 set.insert(1); 48 set.insert(12); 54 set.insert(ComparableValue(24)); 55 set.insert(ComparableValue(1)); 56 set.insert(ComparableValue(12)); 75 a1.insert(1); 76 a1.insert(2); 77 a1.insert(3); 78 a1.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/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/llvm/unittests/ADT/ |
H A D | PriorityWorklistTest.cpp | 32 EXPECT_TRUE(W.insert(21)); 33 EXPECT_TRUE(W.insert(42)); 34 EXPECT_TRUE(W.insert(17)); 53 EXPECT_TRUE(W.insert(21)); 54 EXPECT_TRUE(W.insert(42)); 55 EXPECT_TRUE(W.insert(12)); 56 EXPECT_TRUE(W.insert(17)); 67 EXPECT_FALSE(W.insert(42)); 77 W.insert(23); 78 W.insert(1 [all...] |
H A D | SetVectorTest.cpp | 21 S.insert(0); 22 S.insert(1); 23 S.insert(2);
|
/external/eigen/doc/snippets/ |
H A D | SparseMatrix_coeffs.cpp | 2 A.insert(1,2) = 0; 3 A.insert(0,1) = 1; 4 A.insert(2,0) = 2;
|
/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/libyuv/files/ |
H A D | download_vs_toolchain.py | 21 sys.path.insert(0, os.path.join(checkout_root, 'build')) 22 sys.path.insert(0, os.path.join(checkout_root, 'tools', 'find_depot_tools'))
|
/external/swiftshader/third_party/LLVM/unittests/ADT/ |
H A D | DenseSetTest.cpp | 24 set.insert(0); 25 set.insert(1);
|
/external/llvm/include/llvm/ADT/ |
H A D | StringSet.h | 29 insert(X); 32 std::pair<typename base::iterator, bool> insert(StringRef Key) { function in class:llvm::StringSet 34 return base::insert(std::make_pair(Key, '\0')); 38 void insert(const InputIt &Begin, const InputIt &End) { function in class:llvm::StringSet 40 base::insert(std::make_pair(*It, '\0'));
|
/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/toolchain-utils/automation/ |
H A D | all_tests.py | 5 sys.path.insert(0, 'server') 6 sys.path.insert(0, 'clients') 7 sys.path.insert(0, 'common')
|
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | insert_iter_rvalue.pass.cpp | 14 // iterator insert(const_iterator position, value_type&& x); 26 l1.insert(l1.cend(), MoveOnly(1)); 29 l1.insert(l1.cbegin(), MoveOnly(2)); 36 l1.insert(l1.cend(), MoveOnly(1)); 39 l1.insert(l1.cbegin(), MoveOnly(2));
|
/external/selinux/python/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));
|