/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...] |
insert_iter_value.pass.cpp | 27 List l1(a1, a1+3); 28 typename List::iterator i = l1.insert(next(l1.cbegin()), 4); 29 assert(i == next(l1.begin())); 30 assert(l1.size() == 4); 31 assert(distance(l1.begin(), l1.end()) == 4); 32 assert(l1 == List(a2, a2+4)); 39 i = l1.insert(i, 5); 46 assert(l1 == List(a2, a2+4)) [all...] |
insert_iter_iter_iter.pass.cpp | 27 List l1; local 28 typename List::iterator i = l1.insert(l1.begin(), a1, a1+3); 29 assert(i == l1.begin()); 30 assert(l1.size() == 3); 31 assert(distance(l1.begin(), l1.end()) == 3); 32 i = l1.begin(); 39 i = l1.insert(i, a2, a2+3); 41 assert(l1.size() == 6) [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...] |
/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...] |
/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...] |
splice_pos_list.pass.cpp | 25 std::list<int> l1; local 27 l1.splice(l1.end(), l2); 28 assert(l1.size() == 0); 29 assert(distance(l1.begin(), l1.end()) == 0); 34 std::list<int> l1; local 36 l1.splice(l1.end(), l2); 37 assert(l1.size() == 1) 45 std::list<int> l1; local 58 std::list<int> l1; local 405 std::list<int, min_allocator<int>> l1; local 414 std::list<int, min_allocator<int>> l1; local 425 std::list<int, min_allocator<int>> l1; local 438 std::list<int, min_allocator<int>> l1; local [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;
|
/external/clang/test/Sema/ |
indirect-goto.c | 5 void const* l1_ptr = &&l1; 7 l1:
|
/external/libcxx/test/libcxx/strings/basic.string/string.modifiers/ |
erase_iter_iter_db4.pass.cpp | 29 std::string l1("123"); 30 std::string::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin()); 36 S l1("123"); 37 S::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin());
|
/external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
erase_iter_iter_db4.pass.cpp | 27 std::list<int> l1(a1, a1+3); 28 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
erase_iter_iter_db4.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3); 28 std::unordered_multiset<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
/external/libcxx/test/std/containers/unord/unord.set/ |
erase_iter_iter_db4.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3); 28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
/external/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/ |
try_lock.pass.cpp | 14 // template <class L1, class L2, class... L3> 15 // int try_lock(L1&, L2&, L3&...); 40 class L1 45 L1() : locked_(false) {} 80 L0 l1; local 81 assert(std::try_lock(l0, l1) == -1); 83 assert(l1.locked()); 87 L1 l1; local 88 assert(std::try_lock(l0, l1) == 1) 94 L0 l1; local 102 L2 l1; local 116 L0 l1; local 132 L0 l1; local 141 L1 l1; local 151 L2 l1; local 167 L1 l1; local 177 L0 l1; local 186 L1 l1; local 195 L0 l1; local 205 L0 l1; local 221 L2 l1; local 237 L0 l1; local 254 L1 l1; local 263 L0 l1; local 272 L1 l1; local 282 L1 l1; local 291 L2 l1; local 300 L1 l1; local 316 L2 l1; local 332 L0 l1; local 348 L2 l1; local 364 L2 l1; local 380 L1 l1; local 396 L2 l1; local 405 L2 l1; local 421 L0 l1; local 430 L2 l1; local 439 L0 l1; local 455 L1 l1; local 472 L0 l1; local 483 L0 l1; local 494 L1 l1; local 505 L0 l1; local 516 L0 l1; local [all...] |
/external/clang/test/CodeGenCXX/ |
exceptions-seh-filter-captures.cpp | 9 int l1 = 13; local 13 } __except(basic_filter(p1, l1, s1)) { 30 // CHECK: %[[l1:[^ ]*]] = load i32, i32* %[[l1_ptr]] 32 // CHECK: call i32 (i32, ...) @basic_filter(i32 %[[p1]], i32 %[[l1]], i32 %[[s1]]) 40 int l1 = 13; local 43 } __except(basic_filter(l1)) { 57 // CHECK: %[[l1:[^ ]*]] = load i32, i32* %[[l1_ptr]] 58 // CHECK: call i32 (i32, ...) @basic_filter(i32 %[[l1]]) 61 int l1 = 13; local 67 // FIXME: Test 'l1' when we can capture the lambda's 'this' decl [all...] |
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
default-arguments.cpp | 4 auto l1 = [](int i, int j = 17, int k = 18) { return i + j + k; }; local 5 int i1 = l1(1); 6 int i2 = l1(1, 2); 7 int i3 = l1(1, 2, 3); 12 auto l1 = [](int i, local 36 auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initialization of 'NoDefaultCtor'}} local 37 l1(t); 45 auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initialization of 'NoDefaultCtor'}} \ local 48 l1(); // expected-error{{no matching function for call to object of type '(lambda at }}
|
/dalvik/dx/tests/044-dex-math-ops/ |
Blort.java | 40 public void blort(long l1, long l2) { 41 l = -l1; 42 l = ~l1; 43 l = l1 + l2; 44 l = l1 - l2; 45 l = l1 * l2; 46 l = l1 / l2; 47 l = l1 % l2; 48 l = l1 & l2; 49 l = l1 | l2 [all...] |