HomeSort by relevance Sort by last modified time
    Searched refs:l1 (Results 1 - 25 of 675) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/containers/sequences/list/list.modifiers/
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 24 std::list<MoveOnly> l1; local
25 l1.push_back(MoveOnly(1));
26 assert(l1.size() == 1);
27 assert(l1.front() == MoveOnly(1));
28 l1.push_back(MoveOnly(2));
29 assert(l1.size() == 2);
30 assert(l1.front() == MoveOnly(1));
31 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 24 std::list<MoveOnly> l1; local
25 l1.push_front(MoveOnly(1));
26 assert(l1.size() == 1);
27 assert(l1.front() == MoveOnly(1));
28 l1.push_front(MoveOnly(2));
29 assert(l1.size() == 2);
30 assert(l1.front() == MoveOnly(2));
31 assert(l1.back() == MoveOnly(1));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_front(MoveOnly(1))
    [all...]
insert_iter_rvalue.pass.cpp 28 std::list<MoveOnly> l1; local
29 l1.insert(l1.cend(), MoveOnly(1));
30 assert(l1.size() == 1);
31 assert(l1.front() == MoveOnly(1));
32 l1.insert(l1.cbegin(), MoveOnly(2));
33 assert(l1.size() == 2);
34 assert(l1.front() == MoveOnly(2));
35 assert(l1.back() == MoveOnly(1))
49 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
    [all...]
erase_iter_iter_db4.pass.cpp 29 std::list<int> l1(a1, a1+3);
30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
  /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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
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 24 std::list<MoveOnly> l1; local
25 l1.push_back(MoveOnly(1));
26 assert(l1.size() == 1);
27 assert(l1.front() == MoveOnly(1));
28 l1.push_back(MoveOnly(2));
29 assert(l1.size() == 2);
30 assert(l1.front() == MoveOnly(1));
31 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 24 std::list<MoveOnly> l1; local
25 l1.push_front(MoveOnly(1));
26 assert(l1.size() == 1);
27 assert(l1.front() == MoveOnly(1));
28 l1.push_front(MoveOnly(2));
29 assert(l1.size() == 2);
30 assert(l1.front() == MoveOnly(2));
31 assert(l1.back() == MoveOnly(1));
35 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
36 l1.push_front(MoveOnly(1))
    [all...]
insert_iter_rvalue.pass.cpp 28 std::list<MoveOnly> l1; local
29 l1.insert(l1.cend(), MoveOnly(1));
30 assert(l1.size() == 1);
31 assert(l1.front() == MoveOnly(1));
32 l1.insert(l1.cbegin(), MoveOnly(2));
33 assert(l1.size() == 2);
34 assert(l1.front() == MoveOnly(2));
35 assert(l1.back() == MoveOnly(1))
49 std::list<MoveOnly, min_allocator<MoveOnly>> l1; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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/libcxx/test/std/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 25 std::vector<int> l1(a1, a1+3);
26 std::vector<int>::const_iterator i = l1.begin();
27 assert(is_contiguous_container_asan_correct(l1));
29 std::vector<int>::iterator j = l1.erase(i);
30 assert(l1.size() == 2);
31 assert(distance(l1.begin(), l1.end()) == 2);
33 assert(*l1.begin() == 1);
34 assert(*next(l1.begin()) == 3);
35 assert(is_contiguous_container_asan_correct(l1));
    [all...]
erase_iter_iter.pass.cpp 25 std::vector<int> l1(a1, a1+3);
26 assert(is_contiguous_container_asan_correct(l1));
27 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
28 assert(l1.size() == 3);
29 assert(distance(l1.cbegin(), l1.cend()) == 3);
30 assert(i == l1.begin());
31 assert(is_contiguous_container_asan_correct(l1));
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 24 std::vector<int> l1(a1, a1+3);
25 std::vector<int>::const_iterator i = l1.begin();
26 assert(is_contiguous_container_asan_correct(l1));
28 std::vector<int>::iterator j = l1.erase(i);
29 assert(l1.size() == 2);
30 assert(distance(l1.begin(), l1.end()) == 2);
32 assert(*l1.begin() == 1);
33 assert(*next(l1.begin()) == 3);
34 assert(is_contiguous_container_asan_correct(l1));
    [all...]
erase_iter_iter.pass.cpp 24 std::vector<int> l1(a1, a1+3);
25 assert(is_contiguous_container_asan_correct(l1));
26 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
27 assert(l1.size() == 3);
28 assert(distance(l1.cbegin(), l1.cend()) == 3);
29 assert(i == l1.begin());
30 assert(is_contiguous_container_asan_correct(l1));
    [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/list/list.ops/
splice_pos_list_iter.pass.cpp 28 std::list<int> l1; local
30 l1.splice(l1.end(), l2, l2.begin());
31 assert(l1.size() == 1);
32 assert(distance(l1.begin(), l1.end()) == 1);
35 std::list<int>::const_iterator i = l1.begin();
39 std::list<int> l1; local
41 l1.splice(l1.end(), l2, l2.begin())
52 std::list<int> l1; local
65 std::list<int> l1; local
80 std::list<int> l1; local
95 std::list<int> l1; local
165 l1.splice(next(l1.begin()), l1, l1.begin()); local
175 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
193 std::list<int, min_allocator<int>> l1; local
204 std::list<int, min_allocator<int>> l1; local
217 std::list<int, min_allocator<int>> l1; local
230 std::list<int, min_allocator<int>> l1; local
245 std::list<int, min_allocator<int>> l1; local
260 std::list<int, min_allocator<int>> l1; local
330 l1.splice(next(l1.begin()), l1, l1.begin()); local
340 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
    [all...]
splice_pos_list_iter_iter.pass.cpp 28 std::list<int> l1(a1, a1+3);
29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
30 assert(l1.size() == 3);
31 assert(distance(l1.begin(), l1.end()) == 3);
32 std::list<int>::const_iterator i = l1.begin()
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
splice_pos_list_iter.pass.cpp 28 std::list<int> l1; local
30 l1.splice(l1.end(), l2, l2.begin());
31 assert(l1.size() == 1);
32 assert(distance(l1.begin(), l1.end()) == 1);
35 std::list<int>::const_iterator i = l1.begin();
39 std::list<int> l1; local
41 l1.splice(l1.end(), l2, l2.begin())
52 std::list<int> l1; local
65 std::list<int> l1; local
80 std::list<int> l1; local
95 std::list<int> l1; local
165 l1.splice(next(l1.begin()), l1, l1.begin()); local
175 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
193 std::list<int, min_allocator<int>> l1; local
204 std::list<int, min_allocator<int>> l1; local
217 std::list<int, min_allocator<int>> l1; local
230 std::list<int, min_allocator<int>> l1; local
245 std::list<int, min_allocator<int>> l1; local
260 std::list<int, min_allocator<int>> l1; local
330 l1.splice(next(l1.begin()), l1, l1.begin()); local
340 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
    [all...]
splice_pos_list_iter_iter.pass.cpp 28 std::list<int> l1(a1, a1+3);
29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
30 assert(l1.size() == 3);
31 assert(distance(l1.begin(), l1.end()) == 3);
32 std::list<int>::const_iterator i = l1.begin()
    [all...]
  /external/clang/test/Sema/
indirect-goto.c 5 void const* l1_ptr = &&l1;
7 l1:

Completed in 301 milliseconds

1 2 3 4 5 6 7 8 91011>>