| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 62 std::list<int> l2(a2, a2+3);
63 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
76 assert(l2.size() == 1);
77 i = l2.begin();
82 std::list<int> l2(a2, a2+3);
83 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()) local
180 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()); local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 65 std::list<int> l2(a2, a2+3);
66 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
79 assert(l2.size() == 1);
80 i = l2.begin();
85 std::list<int> l2(a2, a2+3);
86 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()) local
191 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()); local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 65 std::list<int> l2(a2, a2+3);
66 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
79 assert(l2.size() == 1);
80 i = l2.begin();
85 std::list<int> l2(a2, a2+3);
86 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()) local
191 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end()); local
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| move_alloc.pass.cpp | 31 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
32 assert(l2 == lo);
34 assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
44 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5));
45 assert(l2 == lo);
47 assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
57 std::list<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4));
58 assert(l2 == lo);
60 assert(l2.get_allocator() == other_allocator<MoveOnly>(4));
71 std::list<MoveOnly, min_allocator<MoveOnly> > l2(std::move(l), min_allocator<MoveOnly>())
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /libcore/luni/src/main/java/org/xml/sax/ext/ |
| Locator2Impl.java | 52 Locator2 l2 = (Locator2) locator; local
54 version = l2.getXMLVersion ();
55 encoding = l2.getEncoding ();
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| move_alloc.pass.cpp | 31 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
32 assert(l2 == lo);
34 assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
44 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5));
45 assert(l2 == lo);
47 assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
57 std::list<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4));
58 assert(l2 == lo);
60 assert(l2.get_allocator() == other_allocator<MoveOnly>(4));
71 std::list<MoveOnly, min_allocator<MoveOnly> > l2(std::move(l), min_allocator<MoveOnly>())
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| move_alloc.pass.cpp | 31 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
32 assert(l2 == lo);
34 assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
44 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5));
45 assert(l2 == lo);
47 assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
57 std::list<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4));
58 assert(l2 == lo);
60 assert(l2.get_allocator() == other_allocator<MoveOnly>(4));
71 std::list<MoveOnly, min_allocator<MoveOnly> > l2(std::move(l), min_allocator<MoveOnly>())
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db3.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| elf-rel13-mips16.s | 6 lw $4,%got(l2)($2)
13 addiu $4,%lo(l2)
20 .lcomm l2, 4
|
| elf-rel13.s | 4 lw $4,%got(l2)($gp)
11 addiu $4,$4,%lo(l2)
18 .lcomm l2, 4
|
| /external/clang/test/CodeGen/ |
| le32-libcall-pow.c | 21 long double l2 = powl(a2, a2); local
|
| /external/clang/test/Sema/ |
| switch-1.c | 58 unsigned long long l2 = 65536 * (unsigned)65536; variable
|
| /external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
| move_alloc.pass.cpp | 36 std::vector<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
37 assert(l2 == lo);
39 assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
40 assert(is_contiguous_container_asan_correct(l2));
54 std::vector<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5));
55 assert(l2 == lo);
57 assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
58 assert(is_contiguous_container_asan_correct(l2));
72 std::vector<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4));
73 assert(l2 == lo)
[all...] |
| /external/llvm/test/MC/AArch64/ |
| optional-hash.s | 17 l2: label
|
| /external/r8/src/test/examples/rewrite/ |
| LongCompare.java | 8 public static int simpleCompare(long l1, long l2) {
10 return Long.compare(l1, l2);
25 public static boolean complexCompare(long l1, long l2) {
26 return Long.compare(getValue1(), l1) == 0 && Long.compare(l2, getValue2()) > 0;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 30 std::list<int> l2(a1, a1+3);
31 std::list<int>::const_iterator i = l2.begin();
39 std::list<int, min_allocator<int>> l2(a1, a1+3);
40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| move_alloc.pass.cpp | 36 std::vector<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
37 assert(l2 == lo);
39 assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
40 assert(is_contiguous_container_asan_correct(l2));
54 std::vector<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5));
55 assert(l2 == lo);
57 assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
58 assert(is_contiguous_container_asan_correct(l2));
72 std::vector<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4));
73 assert(l2 == lo)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db2.pass.cpp | 30 std::vector<int> l2(a1, a1+3);
31 std::vector<int>::const_iterator i = l2.begin();
39 std::vector<int, min_allocator<int>> l2(a1, a1+3);
40 std::vector<int, min_allocator<int>>::const_iterator i = l2.begin();
|
