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

1 2 3 4 5 6 7 8 9

  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.modifiers/
push_back_rvalue.pass.cpp 22 std::list<MoveOnly> l1; local
23 l1.push_back(MoveOnly(1));
24 assert(l1.size() == 1);
25 assert(l1.front() == MoveOnly(1));
26 l1.push_back(MoveOnly(2));
27 assert(l1.size() == 2);
28 assert(l1.front() == MoveOnly(1));
29 assert(l1.back() == MoveOnly(2));
push_front_rvalue.pass.cpp 22 std::list<MoveOnly> l1; local
23 l1.push_front(MoveOnly(1));
24 assert(l1.size() == 1);
25 assert(l1.front() == MoveOnly(1));
26 l1.push_front(MoveOnly(2));
27 assert(l1.size() == 2);
28 assert(l1.front() == MoveOnly(2));
29 assert(l1.back() == MoveOnly(1));
erase_iter.pass.cpp 20 std::list<int> l1(a1, a1+3);
21 std::list<int>::const_iterator i = l1.begin();
23 std::list<int>::iterator j = l1.erase(i);
24 assert(l1.size() == 2);
25 assert(distance(l1.begin(), l1.end()) == 2);
27 assert(*l1.begin() == 1);
28 assert(*next(l1.begin()) == 3);
29 j = l1.erase(j);
30 assert(j == l1.end())
    [all...]
insert_iter_rvalue.pass.cpp 22 std::list<MoveOnly> l1; local
23 l1.insert(l1.cend(), MoveOnly(1));
24 assert(l1.size() == 1);
25 assert(l1.front() == MoveOnly(1));
26 l1.insert(l1.cbegin(), MoveOnly(2));
27 assert(l1.size() == 2);
28 assert(l1.front() == MoveOnly(2));
29 assert(l1.back() == MoveOnly(1))
    [all...]
erase_iter_iter.pass.cpp 21 std::list<int> l1(a1, a1+3);
22 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
23 assert(l1.size() == 3);
24 assert(distance(l1.cbegin(), l1.cend()) == 3);
25 assert(i == l1.begin());
28 std::list<int> l1(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
    [all...]
insert_iter_iter_iter.pass.cpp 40 std::list<int> l1; local
41 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3);
42 assert(i == l1.begin());
43 assert(l1.size() == 3);
44 assert(distance(l1.begin(), l1.end()) == 3);
45 i = l1.begin();
52 i = l1.insert(i, a2, a2+3);
54 assert(l1.size() == 6)
    [all...]
insert_iter_size_value.pass.cpp 40 std::list<int> l1(a1, a1+3);
41 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
42 assert(i == next(l1.begin()));
43 assert(l1 == std::list<int>(a2, a2+8));
48 i = l1.insert(i, 5, 5);
56 assert(l1 == std::list<int>(a2, a2+8));
insert_iter_value.pass.cpp 40 std::list<int> l1(a1, a1+3);
41 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 4);
42 assert(i == next(l1.begin()));
43 assert(l1.size() == 4);
44 assert(distance(l1.begin(), l1.end()) == 4);
45 assert(l1 == std::list<int>(a2, a2+4));
50 i = l1.insert(i, 5);
58 assert(l1 == std::list<int>(a2, a2+4))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 20 std::vector<int> l1(a1, a1+3);
21 std::vector<int>::const_iterator i = l1.begin();
23 std::vector<int>::iterator j = l1.erase(i);
24 assert(l1.size() == 2);
25 assert(distance(l1.begin(), l1.end()) == 2);
27 assert(*l1.begin() == 1);
28 assert(*next(l1.begin()) == 3);
29 j = l1.erase(j);
30 assert(j == l1.end())
    [all...]
erase_iter_iter.pass.cpp 21 std::vector<int> l1(a1, a1+3);
22 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
23 assert(l1.size() == 3);
24 assert(distance(l1.cbegin(), l1.cend()) == 3);
25 assert(i == l1.begin());
28 std::vector<int> l1(a1, a1+3);
29 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/
erase_iter.pass.cpp 21 std::vector<bool> l1(a1, a1+3);
22 std::vector<bool>::const_iterator i = l1.begin();
24 std::vector<bool>::iterator j = l1.erase(i);
25 assert(l1.size() == 2);
26 assert(distance(l1.begin(), l1.end()) == 2);
28 assert(*l1.begin() == 1);
29 assert(*next(l1.begin()) == true);
30 j = l1.erase(j);
31 assert(j == l1.end())
    [all...]
erase_iter_iter.pass.cpp 22 std::vector<bool> l1(a1, a1+3);
23 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
24 assert(l1.size() == 3);
25 assert(distance(l1.cbegin(), l1.cend()) == 3);
26 assert(i == l1.begin());
29 std::vector<bool> l1(a1, a1+3);
30 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:
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/
splice_pos_list_iter_iter.pass.cpp 22 std::list<int> l1(a1, a1+3);
23 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
24 assert(l1.size() == 3);
25 assert(distance(l1.begin(), l1.end()) == 3);
26 std::list<int>::const_iterator i = l1.begin()
    [all...]
splice_pos_list_iter.pass.cpp 22 std::list<int> l1; local
24 l1.splice(l1.end(), l2, l2.begin());
25 assert(l1.size() == 1);
26 assert(distance(l1.begin(), l1.end()) == 1);
29 std::list<int>::const_iterator i = l1.begin();
33 std::list<int> l1; local
35 l1.splice(l1.end(), l2, l2.begin())
46 std::list<int> l1; local
59 std::list<int> l1; local
74 std::list<int> l1; local
89 std::list<int> l1; local
159 l1.splice(next(l1.begin()), l1, l1.begin()); local
169 l1.splice(next(l1.begin()), l1, next(l1.begin())); local
    [all...]
splice_pos_list.pass.cpp 22 std::list<int> l1; local
24 l1.splice(l1.end(), l2);
25 assert(l1.size() == 0);
26 assert(distance(l1.begin(), l1.end()) == 0);
31 std::list<int> l1; local
33 l1.splice(l1.end(), l2);
34 assert(l1.size() == 1)
42 std::list<int> l1; local
55 std::list<int> l1; local
    [all...]
  /external/clang/test/Sema/
indirect-goto.c 5 void const* l1_ptr = &&l1;
7 l1:
  /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.lock.algorithm/
try_lock.pass.cpp 12 // template <class L1, class L2, class... L3>
13 // int try_lock(L1&, L2&, L3&...);
36 class L1
41 L1() : locked_(false) {}
76 L0 l1; local
77 assert(std::try_lock(l0, l1) == -1);
79 assert(l1.locked());
83 L1 l1; local
84 assert(std::try_lock(l0, l1) == 1)
90 L0 l1; local
97 L2 l1; local
111 L0 l1; local
126 L0 l1; local
135 L1 l1; local
144 L2 l1; local
160 L1 l1; local
169 L0 l1; local
178 L1 l1; local
187 L0 l1; local
196 L0 l1; local
212 L2 l1; local
228 L0 l1; local
244 L1 l1; local
253 L0 l1; local
262 L1 l1; local
271 L1 l1; local
280 L2 l1; local
289 L1 l1; local
305 L2 l1; local
321 L0 l1; local
337 L2 l1; local
353 L2 l1; local
369 L1 l1; local
385 L2 l1; local
394 L2 l1; local
410 L0 l1; local
419 L2 l1; local
428 L0 l1; local
444 L1 l1; local
460 L0 l1; local
471 L0 l1; local
482 L1 l1; local
493 L0 l1; local
504 L0 l1; local
    [all...]
lock.pass.cpp 12 // template <class L1, class L2, class... L3>
13 // void lock(L1&, L2&, L3&...);
41 class L1
46 L1() : locked_(false) {}
91 L0 l1; local
92 std::lock(l0, l1);
94 assert(l1.locked());
98 L1 l1; local
99 std::lock(l0, l1);
105 L0 l1; local
112 L2 l1; local
126 L0 l1; local
140 L2 l1; local
154 L1 l1; local
168 L2 l1; local
183 L0 l1; local
192 L2 l1; local
208 L0 l1; local
217 L1 l1; local
226 L0 l1; local
235 L0 l1; local
251 L2 l1; local
267 L0 l1; local
283 L2 l1; local
299 L0 l1; local
315 L2 l1; local
331 L2 l1; local
347 L1 l1; local
363 L2 l1; local
379 L0 l1; local
390 L0 l1; local
401 L0 l1; local
412 L1 l1; local
423 L0 l1; local
434 L0 l1; local
452 L0 l1; local
470 L2 l1; local
488 L0 l1; local
    [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
35 auto l1 = [](const T& value = T()) { }; local
36 l1(t);
44 auto l1 = [](const T& value = T()) { }; // expected-error{{no matching constructor for initialization of 'NoDefaultCtor'}} local
45 l1(); // expected-note{{in instantiation of default function argument expression for 'operator()<NoDefaultCtor>' required here}}
  /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...]
  /external/valgrind/main/none/tests/s390x/
clcle.c 13 register unsigned long l1 asm ("3") = *_l1;
23 :"=d" (cc), "+d" (a1),"+d" (l1), "+d" (a3), "+d" (l3)
28 *_l1 = l1;
37 unsigned long a1,a3,l1,l3; local
40 a1 = (unsigned long) _a1; l1 = _l1; a3 = (unsigned long) _a3; l3 = _l3;
41 cc = clcle(&a1, &l1, &a3, &l3, pad);
42 printf("cc: %d, l1: %lu(%lu) l3: %lu(%lu) diff1: %lu diff3: %lu\n",
43 cc, l1, _l1, l3, _l3, a1-(unsigned long) _a1, a3-(unsigned long) _a3);
47 void multiplex(unsigned long l1, unsigned long l3, char pad)
49 testrun(b1, l1, b1, l3, pad)
    [all...]
  /external/libffi/testsuite/libffi.call/
return_sl.c 9 static long return_sl(long l1, long l2)
11 return l1 - l2;
20 unsigned long l1, l2; local
24 values[0] = &l1;
30 l1 = 1073741823L;
34 printf("res: %ld, %ld\n", (long)res, l1 - l2);
  /external/dropbear/libtomcrypt/testprof/
base64_test.c 6 unsigned long x, l1, l2; local
10 l1 = sizeof(out);
11 DO(base64_encode(in, x, out, &l1));
13 DO(base64_decode(out, l1, tmp, &l2));
15 fprintf(stderr, "base64 failed %lu %lu %lu", x, l1, l2);
  /external/openssl/crypto/des/
ecb3_enc.c 66 register DES_LONG l0,l1; local
72 c2l(in,l1);
74 ll[1]=l1;
80 l1=ll[1];
82 l2c(l1,out);

Completed in 6599 milliseconds

1 2 3 4 5 6 7 8 9