| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| D | splice_pos_list_iter.pass.cpp | 25 std::list<int> l1; in main() local
27 l1.splice(l1.end(), l2, l2.begin()); in main()
28 assert(l1.size() == 1); in main()
29 assert(distance(l1.begin(), l1.end()) == 1); in main()
32 std::list<int>::const_iterator i = l1.begin(); in main()
36 std::list<int> l1; in main() local
38 l1.splice(l1.end(), l2, l2.begin()); in main()
39 assert(l1.size() == 1); in main()
40 assert(distance(l1.begin(), l1.end()) == 1); in main()
43 std::list<int>::const_iterator i = l1.begin(); in main()
[all …]
|
| D | splice_pos_list.pass.cpp | 25 std::list<int> l1; in main() local
27 l1.splice(l1.end(), l2); in main()
28 assert(l1.size() == 0); in main()
29 assert(distance(l1.begin(), l1.end()) == 0); in main()
34 std::list<int> l1; in main() local
36 l1.splice(l1.end(), l2); in main()
37 assert(l1.size() == 1); in main()
38 assert(distance(l1.begin(), l1.end()) == 1); in main()
41 std::list<int>::const_iterator i = l1.begin(); in main()
45 std::list<int> l1; in main() local
[all …]
|
| D | splice_pos_list_iter_iter.pass.cpp | 25 std::list<int> l1(a1, a1+3); in main() local
26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin())); in main()
27 assert(l1.size() == 3); in main()
28 assert(distance(l1.begin(), l1.end()) == 3); in main()
29 std::list<int>::const_iterator i = l1.begin(); in main()
37 std::list<int> l1(a1, a1+3); in main() local
38 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2)); in main()
39 assert(l1.size() == 3); in main()
40 assert(distance(l1.begin(), l1.end()) == 3); in main()
41 std::list<int>::const_iterator i = l1.begin(); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| D | erase_iter_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3); in main() local
24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
25 assert(l1.size() == 3); in main()
26 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
27 assert(i == l1.begin()); in main()
30 std::list<int> l1(a1, a1+3); in main() local
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
32 assert(l1.size() == 2); in main()
33 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
34 assert(i == l1.begin()); in main()
[all …]
|
| D | erase_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3); in main() local
24 std::list<int>::const_iterator i = l1.begin(); in main()
26 std::list<int>::iterator j = l1.erase(i); in main()
27 assert(l1.size() == 2); in main()
28 assert(distance(l1.begin(), l1.end()) == 2); in main()
30 assert(*l1.begin() == 1); in main()
31 assert(*next(l1.begin()) == 3); in main()
32 j = l1.erase(j); in main()
33 assert(j == l1.end()); in main()
34 assert(l1.size() == 1); in main()
[all …]
|
| D | insert_iter_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; in main() local
26 l1.insert(l1.cend(), MoveOnly(1)); in main()
27 assert(l1.size() == 1); in main()
28 assert(l1.front() == MoveOnly(1)); in main()
29 l1.insert(l1.cbegin(), MoveOnly(2)); in main()
30 assert(l1.size() == 2); in main()
31 assert(l1.front() == MoveOnly(2)); in main()
32 assert(l1.back() == MoveOnly(1)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.insert(l1.cend(), MoveOnly(1)); in main()
[all …]
|
| D | push_front_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; in main() local
26 l1.push_front(MoveOnly(1)); in main()
27 assert(l1.size() == 1); in main()
28 assert(l1.front() == MoveOnly(1)); in main()
29 l1.push_front(MoveOnly(2)); in main()
30 assert(l1.size() == 2); in main()
31 assert(l1.front() == MoveOnly(2)); in main()
32 assert(l1.back() == MoveOnly(1)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.push_front(MoveOnly(1)); in main()
[all …]
|
| D | push_back_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; in main() local
26 l1.push_back(MoveOnly(1)); in main()
27 assert(l1.size() == 1); in main()
28 assert(l1.front() == MoveOnly(1)); in main()
29 l1.push_back(MoveOnly(2)); in main()
30 assert(l1.size() == 2); in main()
31 assert(l1.front() == MoveOnly(1)); in main()
32 assert(l1.back() == MoveOnly(2)); in main()
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; in main() local
36 l1.push_back(MoveOnly(1)); in main()
[all …]
|
| D | insert_iter_iter_iter.pass.cpp | 27 List l1; in test() local
28 typename List::iterator i = l1.insert(l1.begin(), a1, a1+3); in test()
29 assert(i == l1.begin()); in test()
30 assert(l1.size() == 3); in test()
31 assert(distance(l1.begin(), l1.end()) == 3); in test()
32 i = l1.begin(); in test()
39 i = l1.insert(i, a2, a2+3); in test()
41 assert(l1.size() == 6); in test()
42 assert(distance(l1.begin(), l1.end()) == 6); in test()
43 i = l1.begin(); in test()
[all …]
|
| D | insert_iter_value.pass.cpp | 27 List l1(a1, a1+3); in test() local
28 typename List::iterator i = l1.insert(next(l1.cbegin()), 4); in test()
29 assert(i == next(l1.begin())); in test()
30 assert(l1.size() == 4); in test()
31 assert(distance(l1.begin(), l1.end()) == 4); in test()
32 assert(l1 == List(a2, a2+4)); in test()
39 i = l1.insert(i, 5); in test()
46 assert(l1 == List(a2, a2+4)); in test()
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | erase_iter_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3); in main() local
25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
26 assert(l1.size() == 3); in main()
27 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
28 assert(i == l1.begin()); in main()
31 std::vector<bool> l1(a1, a1+3); in main() local
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
33 assert(l1.size() == 2); in main()
34 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
35 assert(i == l1.begin()); in main()
[all …]
|
| D | erase_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3); in main() local
25 std::vector<bool>::const_iterator i = l1.begin(); in main()
27 std::vector<bool>::iterator j = l1.erase(i); in main()
28 assert(l1.size() == 2); in main()
29 assert(distance(l1.begin(), l1.end()) == 2); in main()
31 assert(*l1.begin() == 1); in main()
32 assert(*next(l1.begin()) == true); in main()
33 j = l1.erase(j); in main()
34 assert(j == l1.end()); in main()
35 assert(l1.size() == 1); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3); in main() local
41 assert(is_contiguous_container_asan_correct(l1)); in main()
42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
43 assert(l1.size() == 3); in main()
44 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
45 assert(i == l1.begin()); in main()
46 assert(is_contiguous_container_asan_correct(l1)); in main()
49 std::vector<int> l1(a1, a1+3); in main() local
50 assert(is_contiguous_container_asan_correct(l1)); in main()
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
[all …]
|
| D | erase_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3); in main() local
41 std::vector<int>::const_iterator i = l1.begin(); in main()
42 assert(is_contiguous_container_asan_correct(l1)); in main()
44 std::vector<int>::iterator j = l1.erase(i); in main()
45 assert(l1.size() == 2); in main()
46 assert(distance(l1.begin(), l1.end()) == 2); in main()
48 assert(*l1.begin() == 1); in main()
49 assert(*next(l1.begin()) == 3); in main()
50 assert(is_contiguous_container_asan_correct(l1)); in main()
51 j = l1.erase(j); in main()
[all …]
|
| /external/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/ |
| D | try_lock.pass.cpp | 80 L0 l1; in main() local
81 assert(std::try_lock(l0, l1) == -1); in main()
83 assert(l1.locked()); in main()
87 L1 l1; in main() local
88 assert(std::try_lock(l0, l1) == 1); in main()
90 assert(!l1.locked()); in main()
94 L0 l1; in main() local
95 assert(std::try_lock(l0, l1) == 0); in main()
97 assert(!l1.locked()); in main()
102 L2 l1; in main() local
[all …]
|
| D | lock.pass.cpp | 100 L0 l1; in main() local
101 std::lock(l0, l1); in main()
103 assert(l1.locked()); in main()
107 L1 l1; in main() local
108 std::lock(l0, l1); in main()
110 assert(l1.locked()); in main()
114 L0 l1; in main() local
115 std::lock(l0, l1); in main()
117 assert(l1.locked()); in main()
122 L2 l1; in main() local
[all …]
|
| /external/python/cpython3/Lib/lib2to3/tests/ |
| D | test_pytree.py | 35 l1 = pytree.Leaf(100, "foo")
36 self.assertEqual(l1.type, 100)
37 self.assertEqual(l1.value, "foo")
40 l1 = pytree.Leaf(100, "foo")
41 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
44 l1 = pytree.Leaf(100, "foo")
45 self.assertEqual(str(l1), "foo")
52 l1 = pytree.Leaf(2, 5)
53 l1.prefix = "foo_"
54 self.assertEqual(str(l1), "foo_5")
[all …]
|
| /external/python/cpython2/Lib/lib2to3/tests/ |
| D | test_pytree.py | 57 l1 = pytree.Leaf(100, "foo")
58 self.assertEqual(l1.type, 100)
59 self.assertEqual(l1.value, "foo")
62 l1 = pytree.Leaf(100, "foo")
63 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
66 l1 = pytree.Leaf(100, "foo")
67 self.assertEqual(str(l1), "foo")
74 l1 = pytree.Leaf(2, 5)
75 l1.prefix = "foo_"
76 self.assertEqual(str(l1), "foo_5")
[all …]
|
| /external/wayland/tests/ |
| D | newsignal-test.c | 56 struct wl_listener l1 = {.notify = (wl_notify_func_t) 0x1}; in TEST() local
64 wl_priv_signal_add(&signal, &l1); in TEST()
72 assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x1) == &l1); in TEST()
78 assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x1) == &l1); in TEST()
87 struct wl_listener l1 = {.notify = signal_notify}; in TEST() local
90 wl_priv_signal_add(&signal, &l1); in TEST()
104 struct wl_listener l1 = {.notify = signal_notify}; in TEST() local
109 wl_priv_signal_add(&signal, &l1); in TEST()
122 struct wl_listener l1, l2, l3; member
137 wl_list_init(&signal.l1.link); \
[all …]
|
| /external/python/cpython2/Tools/pybench/ |
| D | Constructs.py | 478 l1 = range(1000)
482 for i in l1:
489 l1 = range(1000)
503 l1 = range(100)
505 for i in l1:
507 for i in l1:
509 for i in l1:
511 for i in l1:
513 for i in l1:
516 for i in l1:
[all …]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | basic.ll | 7 ; CHECK: store i8* blockaddress(@test1, %l1), i8** %P
8 ; CHECK: l1:
13 store i8* blockaddress(@test1, %l1), i8** %P
14 br label %l1
16 l1: ; preds = %l1, %entry
17 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
20 br i1 %exitcond, label %l2, label %l1
22 l2: ; preds = %l1
31 br label %l1
33 l1: ; preds = %l1, %entry
[all …]
|
| /external/apache-harmony/beans/src/test/java/org/apache/harmony/beans/tests/java/beans/ |
| D | PropertyChangeSupportTest.java | 75 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_Normal() local
83 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
86 assertSame(l1, sup.getPropertyChangeListeners()[0]); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
88 sup.removePropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Normal()
124 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate() local
126 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
127 sup.addPropertyChangeListener(l1); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
131 assertSame(l1, listeners[0]); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
132 assertSame(l1, listeners[1]); in testAddPropertyChangeListener_PropertyChangeListener_Duplicate()
142 PropertyChangeListener l1 = new MockPropertyChangeListener(); in testAddPropertyChangeListener_PropertyChangeListener_String_Normal() local
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopUnroll/ |
| D | basic.ll | 8 ; CHECK: store i8* blockaddress(@test1, %l1), i8** %P
9 ; CHECK: l1:
14 store i8* blockaddress(@test1, %l1), i8** %P
15 br label %l1
17 l1: ; preds = %l1, %entry
18 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
21 br i1 %exitcond, label %l2, label %l1
23 l2: ; preds = %l1
32 br label %l1
34 l1: ; preds = %l1, %entry
[all …]
|
| /external/boringssl/src/decrepit/ |
| D | macros.h | 64 #define n2ln(c, l1, l2, n) \ argument
67 l1 = l2 = 0; \
82 l1 = ((unsigned long)(*(--(c)))); \
85 l1 |= ((unsigned long)(*(--(c)))) << 8; \
88 l1 |= ((unsigned long)(*(--(c)))) << 16; \
91 l1 |= ((unsigned long)(*(--(c)))) << 24; \
96 #define l2nn(l1, l2, c, n) \ argument
113 *(--(c)) = (unsigned char)(((l1)) & 0xff); \
116 *(--(c)) = (unsigned char)(((l1) >> 8) & 0xff); \
119 *(--(c)) = (unsigned char)(((l1) >> 16) & 0xff); \
[all …]
|
| /external/compiler-rt/lib/dfsan/ |
| D | dfsan.cc | 129 static atomic_dfsan_label *union_table(dfsan_label l1, dfsan_label l2) { in union_table() argument
130 return &(*(dfsan_union_table_t *) UnionTableAddr())[l1][l2]; in union_table()
144 dfsan_label __dfsan_union(dfsan_label l1, dfsan_label l2) { in __dfsan_union() argument
145 DCHECK_NE(l1, l2); in __dfsan_union()
147 if (l1 == 0) in __dfsan_union()
150 return l1; in __dfsan_union()
152 if (l1 > l2) in __dfsan_union()
153 Swap(l1, l2); in __dfsan_union()
155 atomic_dfsan_label *table_ent = union_table(l1, l2); in __dfsan_union()
167 if (__dfsan_label_info[l2].l1 == l1 || in __dfsan_union()
[all …]
|