| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| insert_iter_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.insert(l1.cend(), MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.insert(l1.cbegin(), MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(2));
32 assert(l1.back() == MoveOnly(1))
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
[all...] |
| erase_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3);
24 std::list<int>::const_iterator i = l1.begin();
26 std::list<int>::iterator j = l1.erase(i);
27 assert(l1.size() == 2);
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
32 j = l1.erase(j);
33 assert(j == l1.end())
[all...] |
| erase_iter_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3);
24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
25 assert(l1.size() == 3);
26 assert(distance(l1.cbegin(), l1.cend()) == 3);
27 assert(i == l1.begin());
30 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
[all...] |
| push_back_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.push_back(MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.push_back(MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(1));
32 assert(l1.back() == MoveOnly(2));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_back(MoveOnly(1))
[all...] |
| push_front_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.push_front(MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.push_front(MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(2));
32 assert(l1.back() == MoveOnly(1));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_front(MoveOnly(1))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| insert_iter_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.insert(l1.cend(), MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.insert(l1.cbegin(), MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(2));
32 assert(l1.back() == MoveOnly(1))
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
[all...] |
| erase_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3);
24 std::list<int>::const_iterator i = l1.begin();
26 std::list<int>::iterator j = l1.erase(i);
27 assert(l1.size() == 2);
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
32 j = l1.erase(j);
33 assert(j == l1.end())
[all...] |
| erase_iter_iter.pass.cpp | 23 std::list<int> l1(a1, a1+3);
24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
25 assert(l1.size() == 3);
26 assert(distance(l1.cbegin(), l1.cend()) == 3);
27 assert(i == l1.begin());
30 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
[all...] |
| push_back_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.push_back(MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.push_back(MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(1));
32 assert(l1.back() == MoveOnly(2));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_back(MoveOnly(1))
[all...] |
| push_front_rvalue.pass.cpp | 25 std::list<MoveOnly> l1; local
26 l1.push_front(MoveOnly(1));
27 assert(l1.size() == 1);
28 assert(l1.front() == MoveOnly(1));
29 l1.push_front(MoveOnly(2));
30 assert(l1.size() == 2);
31 assert(l1.front() == MoveOnly(2));
32 assert(l1.back() == MoveOnly(1));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_front(MoveOnly(1))
[all...] |
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| erase_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3);
25 std::vector<bool>::const_iterator i = l1.begin();
27 std::vector<bool>::iterator j = l1.erase(i);
28 assert(l1.size() == 2);
29 assert(distance(l1.begin(), l1.end()) == 2);
31 assert(*l1.begin() == 1);
32 assert(*next(l1.begin()) == true);
33 j = l1.erase(j);
34 assert(j == l1.end())
[all...] |
| erase_iter_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3);
25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
26 assert(l1.size() == 3);
27 assert(distance(l1.cbegin(), l1.cend()) == 3);
28 assert(i == l1.begin());
31 std::vector<bool> l1(a1, a1+3);
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector.bool/ |
| erase_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3);
25 std::vector<bool>::const_iterator i = l1.begin();
27 std::vector<bool>::iterator j = l1.erase(i);
28 assert(l1.size() == 2);
29 assert(distance(l1.begin(), l1.end()) == 2);
31 assert(*l1.begin() == 1);
32 assert(*next(l1.begin()) == true);
33 j = l1.erase(j);
34 assert(j == l1.end())
[all...] |
| erase_iter_iter.pass.cpp | 24 std::vector<bool> l1(a1, a1+3);
25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
26 assert(l1.size() == 3);
27 assert(distance(l1.cbegin(), l1.cend()) == 3);
28 assert(i == l1.begin());
31 std::vector<bool> l1(a1, a1+3);
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
[all...] |
| /external/clang/test/CodeGen/ |
| const-label-addr.c | 10 // CHECK: @b.ar = internal global {{.*}} sub (i{{..}} ptrtoint (i8* blockaddress(@b, %l2) to i{{..}}), i{{..}} ptrtoint (i8* blockaddress(@b, %l1) to i{{..}}))
12 static int ar = &&l2 - &&l1;
13 l1:
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3);
41 assert(is_contiguous_container_asan_correct(l1));
42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
43 assert(l1.size() == 3);
44 assert(distance(l1.cbegin(), l1.cend()) == 3);
45 assert(i == l1.begin());
46 assert(is_contiguous_container_asan_correct(l1));
[all...] |
| erase_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3);
41 std::vector<int>::const_iterator i = l1.begin();
42 assert(is_contiguous_container_asan_correct(l1));
44 std::vector<int>::iterator j = l1.erase(i);
45 assert(l1.size() == 2);
46 assert(distance(l1.begin(), l1.end()) == 2);
48 assert(*l1.begin() == 1);
49 assert(*next(l1.begin()) == 3);
50 assert(is_contiguous_container_asan_correct(l1));
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3);
41 assert(is_contiguous_container_asan_correct(l1));
42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
43 assert(l1.size() == 3);
44 assert(distance(l1.cbegin(), l1.cend()) == 3);
45 assert(i == l1.begin());
46 assert(is_contiguous_container_asan_correct(l1));
[all...] |
| erase_iter.pass.cpp | 40 std::vector<int> l1(a1, a1+3);
41 std::vector<int>::const_iterator i = l1.begin();
42 assert(is_contiguous_container_asan_correct(l1));
44 std::vector<int>::iterator j = l1.erase(i);
45 assert(l1.size() == 2);
46 assert(distance(l1.begin(), l1.end()) == 2);
48 assert(*l1.begin() == 1);
49 assert(*next(l1.begin()) == 3);
50 assert(is_contiguous_container_asan_correct(l1));
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter.pass.cpp | 25 std::list<int> l1; local
27 l1.splice(l1.end(), l2, l2.begin());
28 assert(l1.size() == 1);
29 assert(distance(l1.begin(), l1.end()) == 1);
32 std::list<int>::const_iterator i = l1.begin();
36 std::list<int> l1; local
38 l1.splice(l1.end(), l2, l2.begin())
49 std::list<int> l1; local
62 std::list<int> l1; local
77 std::list<int> l1; local
92 std::list<int> l1; local
162 l1.splice(next(l1.begin()), l1, l1.begin()); local
172 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
182 std::list<int, min_allocator<int>> l1; local
193 std::list<int, min_allocator<int>> l1; local
206 std::list<int, min_allocator<int>> l1; local
219 std::list<int, min_allocator<int>> l1; local
234 std::list<int, min_allocator<int>> l1; local
249 std::list<int, min_allocator<int>> l1; local
319 l1.splice(next(l1.begin()), l1, l1.begin()); local
329 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
[all...] |
| splice_pos_list_iter_iter.pass.cpp | 25 std::list<int> l1(a1, a1+3);
26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
27 assert(l1.size() == 3);
28 assert(distance(l1.begin(), l1.end()) == 3);
29 std::list<int>::const_iterator i = l1.begin()
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter.pass.cpp | 25 std::list<int> l1; local
27 l1.splice(l1.end(), l2, l2.begin());
28 assert(l1.size() == 1);
29 assert(distance(l1.begin(), l1.end()) == 1);
32 std::list<int>::const_iterator i = l1.begin();
36 std::list<int> l1; local
38 l1.splice(l1.end(), l2, l2.begin())
49 std::list<int> l1; local
62 std::list<int> l1; local
77 std::list<int> l1; local
92 std::list<int> l1; local
162 l1.splice(next(l1.begin()), l1, l1.begin()); local
172 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
182 std::list<int, min_allocator<int>> l1; local
193 std::list<int, min_allocator<int>> l1; local
206 std::list<int, min_allocator<int>> l1; local
219 std::list<int, min_allocator<int>> l1; local
234 std::list<int, min_allocator<int>> l1; local
249 std::list<int, min_allocator<int>> l1; local
319 l1.splice(next(l1.begin()), l1, l1.begin()); local
329 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
[all...] |
| splice_pos_list_iter_iter.pass.cpp | 25 std::list<int> l1(a1, a1+3);
26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
27 assert(l1.size() == 3);
28 assert(distance(l1.begin(), l1.end()) == 3);
29 std::list<int>::const_iterator i = l1.begin()
[all...] |
| /external/libcxx/test/libcxx/containers/sequences/list/list.cons/ |
| db_copy.pass.cpp | 25 std::list<int> l1; local
26 l1.push_back(1); l1.push_back(2); l1.push_back(3);
27 std::list<int>::iterator i = l1.begin();
28 std::list<int> l2 = l1;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/sequences/list/list.cons/ |
| db_copy.pass.cpp | 25 std::list<int> l1; local
26 l1.push_back(1); l1.push_back(2); l1.push_back(3);
27 std::list<int>::iterator i = l1.begin();
28 std::list<int> l2 = l1;
|
