/external/libcxx/test/containers/unord/unord.multiset/ |
H A D | erase_iter_iter_db4.pass.cpp | 26 int a1[] = {1, 2, 3}; local 27 std::unordered_multiset<int> l1(a1, a1+3);
|
/external/libcxx/test/containers/unord/unord.set/ |
H A D | erase_iter_db1.pass.cpp | 24 int a1[] = {1, 2, 3}; local 25 std::unordered_set<int> l1(a1, a1+3);
|
H A D | erase_iter_iter_db4.pass.cpp | 26 int a1[] = {1, 2, 3}; local 27 std::unordered_set<int> l1(a1, a1+3);
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | elide-double-hole-check-1.js | 34 var a1 = [,,,,,,,,,,,,,,,,,,0.5]; variable 35 assertEquals(undefined, f1(a1, 1)); 36 assertEquals(undefined, f1(a1, 1)); 38 assertEquals(undefined, f1(a1, 1)); 39 assertEquals(undefined, f1(a1, 1));
|
H A D | array-elements-from-array-prototype-chain.js | 162 var a1 = [0, 1, , , 4, 5, , , , 9] 163 var result = a1.splice(4, 0, undefined) 166 assertEquals(0, a1[0]) 167 assertTrue(a1.hasOwnProperty(0)) 168 assertEquals(1, a1[1]) 169 assertTrue(a1.hasOwnProperty(1)) 170 assertEquals(undefined, a1[2]) 171 assertFalse(a1.hasOwnProperty(2)) 172 assertEquals(at3, a1[3]) 173 assertFalse(a1 [all...] |
H A D | array-elements-from-array-prototype.js | 162 var a1 = [0, 1, , , 4, 5, , , , 9] 163 var result = a1.splice(4, 0, undefined) 166 assertEquals(0, a1[0]) 167 assertTrue(a1.hasOwnProperty(0)) 168 assertEquals(1, a1[1]) 169 assertTrue(a1.hasOwnProperty(1)) 170 assertEquals(undefined, a1[2]) 171 assertFalse(a1.hasOwnProperty(2)) 172 assertEquals(at3, a1[3]) 173 assertFalse(a1 [all...] |
H A D | array-elements-from-object-prototype.js | 162 var a1 = [0, 1, , , 4, 5, , , , 9] 163 var result = a1.splice(4, 0, undefined) 166 assertEquals(0, a1[0]) 167 assertTrue(a1.hasOwnProperty(0)) 168 assertEquals(1, a1[1]) 169 assertTrue(a1.hasOwnProperty(1)) 170 assertEquals(undefined, a1[2]) 171 assertFalse(a1.hasOwnProperty(2)) 172 assertEquals(at3, a1[3]) 173 assertFalse(a1 [all...] |
/external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
H A D | erase_iter_iter_db1.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_map<int, int> l1(a1, a1+3); 29 std::unordered_map<int, int> l2(a1, a1+3);
|
H A D | erase_iter_iter_db2.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_map<int, int> l1(a1, a1+3); 29 std::unordered_map<int, int> l2(a1, a1+3);
|
H A D | erase_iter_iter_db3.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_map<int, int> l1(a1, a1+3); 29 std::unordered_map<int, int> l2(a1, a1+3);
|
H A D | erase_iter_db1.pass.cpp | 25 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 26 std::unordered_map<int, int> l1(a1, a1+3);
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | erase_iter_iter_db1.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_multimap<int, int> l1(a1, a1+3); 29 std::unordered_multimap<int, int> l2(a1, a1+3);
|
H A D | erase_iter_iter_db2.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_multimap<int, int> l1(a1, a1+3); 29 std::unordered_multimap<int, int> l2(a1, a1+3);
|
H A D | erase_iter_iter_db3.pass.cpp | 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; local 28 std::unordered_multimap<int, int> l1(a1, a1+3); 29 std::unordered_multimap<int, int> l2(a1, a1+3);
|
/external/libcxx/test/utilities/allocator.adaptor/allocator.adaptor.members/ |
H A D | select_on_container_copy_construction.pass.cpp | 28 A a1(A1<int>(3)); 29 assert(a1.outer_allocator().id() == 3); 30 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); 36 A a1(A3<int>(3)); 37 assert(a1.outer_allocator().id() == 3); 38 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); 44 A a1(A1<int>(1), A2<int>(2), A3<int>(3)); 45 assert(a1.outer_allocator().id() == 1); 46 assert(a1.inner_allocator().outer_allocator().id() == 2); 47 assert(a1 [all...] |
/external/libcxx/test/containers/sequences/deque/deque.special/ |
H A D | swap.pass.cpp | 65 int a1[] = {1, 3, 7, 9, 10}; local 68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 77 int a1[] local 98 int a1[] = {1, 3, 7, 9, 10}; local [all...] |
/external/libcxx/test/containers/sequences/list/list.special/ |
H A D | db_swap_1.pass.cpp | 29 int a1[] = {1, 3, 7, 9, 10}; local 31 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 44 int a1[] = {1, 3, 7, 9, 10}; local 46 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[ [all...] |
/external/libcxx/test/containers/sequences/vector/vector.special/ |
H A D | db_swap_1.pass.cpp | 28 int a1[] = {1, 3, 7, 9, 10}; local 30 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 42 int a1[] = {1, 3, 7, 9, 10}; local 44 std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[ [all...] |
/external/valgrind/main/drd/ |
H A D | drd_suppression.h | 14 void DRD_(start_suppression)(const Addr a1, const Addr a2, 16 void DRD_(finish_suppression)(const Addr a1, const Addr a2); 17 Bool DRD_(is_suppressed)(const Addr a1, const Addr a2); 18 Bool DRD_(is_any_suppressed)(const Addr a1, const Addr a2); 19 void DRD_(mark_hbvar)(const Addr a1); 20 Bool DRD_(range_contains_suppression_or_hbvar)(const Addr a1, const Addr a2); 21 void DRD_(start_tracing_address_range)(const Addr a1, const Addr a2, 23 void DRD_(stop_tracing_address_range)(const Addr a1, const Addr a2); 24 Bool DRD_(is_any_traced)(const Addr a1, const Addr a2); 25 void DRD_(suppression_stop_using_mem)(const Addr a1, cons [all...] |
H A D | drd_clientobj.c | 106 Bool DRD_(clientobj_present)(const Addr a1, const Addr a2) argument 110 tl_assert(a1 <= a2); 114 if (a1 <= p->any.a1 && p->any.a1 < a2) 128 DrdClientobj* DRD_(clientobj_add)(const Addr a1, const ObjType t) argument 132 tl_assert(! DRD_(clientobj_present)(a1, a1 + 1)); 133 tl_assert(VG_(OSetGen_Lookup)(s_clientobj_set, &a1) == 0); 136 DRD_(trace_msg)("Adding client object 0x%lx of type %d", a1, 204 clientobj_stop_using_mem(const Addr a1, const Addr a2) argument [all...] |
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 21 int a1[] = {1, 2, 3}; local 23 std::list<int> l1(a1, a1+3); 30 std::list<int> l1(a1, a1+3); 35 assert(l1 == std::list<int>(a1+1, a1+3)); 38 std::list<int> l1(a1, a1+3); 43 assert(l1 == std::list<int>(a1 [all...] |
/external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 21 int a1[] = {1, 2, 3}; local 23 std::vector<int> l1(a1, a1+3); 30 std::vector<int> l1(a1, a1+3); 35 assert(l1 == std::vector<int>(a1+1, a1+3)); 38 std::vector<int> l1(a1, a1+3); 43 assert(l1 == std::vector<int>(a1 [all...] |
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | erase_iter_iter.pass.cpp | 22 bool a1[] = {1, 0, 1}; local 24 std::vector<bool> l1(a1, a1+3); 31 std::vector<bool> l1(a1, a1+3); 36 assert(l1 == std::vector<bool>(a1+1, a1+3)); 39 std::vector<bool> l1(a1, a1+3); 44 assert(l1 == std::vector<bool>(a1 [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | ptr-to-datamember.cpp | 48 void test_aggr_pdata(A& a1) { argument 50 pr(a1.*af); 52 (a1.*af).iF = 100; 53 (a1.*af).fF = 200.00; 54 printf(" %d %f\n", (a1.*af).iF, (a1.*af).fF); 55 pr(a1.*af); 57 (a1.*af).iF++; 58 (a1.*af).fF--; 59 --(a1 80 A a1; local [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-compare-constant-doubles.js | 37 var a1 = Math.sin(1) + 10; 38 var a2 = a1 + 1; 43 keepalive = [a1, a2, a3, a4, a5, a6];
|