| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::const_iterator i = l2.begin();
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3);
30 std::unordered_multimap<int, int>::const_iterator i = l2.begin();
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::const_iterator i = l2.begin();
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::unordered_multimap<int, int> l2(a1, a1+3);
30 std::unordered_multimap<int, int>::const_iterator i = l2.begin();
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_multiset<int> l2(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/wpa_supplicant_8/src/l2_packet/ |
| l2_packet.h | 85 * @l2: Pointer to internal l2_packet data from l2_packet_init()
87 void l2_packet_deinit(struct l2_packet_data *l2);
91 * @l2: Pointer to internal l2_packet data from l2_packet_init()
95 int l2_packet_get_own_addr(struct l2_packet_data *l2, u8 *addr);
99 * @l2: Pointer to internal l2_packet data from l2_packet_init()
106 * @len: Length of the buffer (including l2 header only if l2_hdr == 1)
109 int l2_packet_send(struct l2_packet_data *l2, const u8 *dst_addr, u16 proto,
114 * @l2: Pointer to internal l2_packet data from l2_packet_init()
126 int l2_packet_get_ip_addr(struct l2_packet_data *l2, char *buf, size_t len);
131 * @l2: Pointer to internal l2_packet data from l2_packet_init(
[all...] |
| /external/eigen/bench/ |
| check_cache_queries.cpp | 21 cout << "Eigen's L2/L3 = " << internal::queryTopLevelCacheSize() << endl;
22 int l1, l2, l3; local
23 internal::queryCacheSizes(l1, l2, l3);
24 cout << "Eigen's L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
43 internal::queryCacheSizes_intel_codes(l1, l2, l3);
44 cout << "Eigen's intel codes L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
47 internal::queryCacheSizes_intel_direct(l1, l2, l3);
48 cout << "Eigen's intel direct L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-sparc/ |
| tlssunbin32.s | 48 ld [%l4 + %o5], %l2, %tie_ld(bl6)
49 add %g7, %l2, %l2, %tie_add(bl6)
55 ld [%l4 + %o5], %l2, %tie_ld(bl8)
56 ld [%g7 + %l2], %l2, %tie_add(bl8)
62 ld [%l4 + %o5], %l2, %tie_ld(sh6)
63 add %g7, %l2, %l2, %tie_add(sh6)
69 ld [%l4 + %o5], %l2, %tie_ld(bl8
[all...] |
| tlssunpic32.s | 52 add %l1, %tgd_lo10(sg1), %l2
54 add %l7, %l2, %o0, %tgd_add(sg1)
121 add %l1, %tldm_lo10(sl1), %l2
123 add %l7, %l2, %o0, %tldm_add(sl1)
133 sethi %tldo_hix22(sl2 + 2), %l2
135 xor %l2, %tldo_lox10(sl2 + 2), %l3
144 sethi %tldo_hix22(sh2 + 1), %l2
148 xor %l2, %tldo_lox10(sh2 + 1), %l3
157 sethi %tldo_hix22(sH2), %l2
161 xor %l2, %tldo_lox10(sH2), %l
[all...] |
| tlssunpic64.s | 52 add %l1, %tgd_lo10(sg1), %l2
54 add %l7, %l2, %o0, %tgd_add(sg1)
121 add %l1, %tldm_lo10(sl1), %l2
123 add %l7, %l2, %o0, %tldm_add(sl1)
133 sethi %tldo_hix22(sl2 + 2), %l2
135 xor %l2, %tldo_lox10(sl2 + 2), %l3
144 sethi %tldo_hix22(sh2 + 1), %l2
148 xor %l2, %tldo_lox10(sh2 + 1), %l3
157 sethi %tldo_hix22(sH2), %l2
161 xor %l2, %tldo_lox10(sH2), %l
[all...] |
| /external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
| move.pass.cpp | 36 std::vector<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); local
37 assert(l2 == lo);
39 assert(l2.get_allocator() == lo.get_allocator());
40 assert(is_contiguous_container_asan_correct(l2));
54 std::vector<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l); local
55 assert(l2 == lo);
57 assert(l2.get_allocator() == lo.get_allocator());
58 assert(is_contiguous_container_asan_correct(l2));
84 std::vector<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l); local
85 assert(l2 == lo)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| move.pass.cpp | 36 std::vector<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); local
37 assert(l2 == lo);
39 assert(l2.get_allocator() == lo.get_allocator());
40 assert(is_contiguous_container_asan_correct(l2));
54 std::vector<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l); local
55 assert(l2 == lo);
57 assert(l2.get_allocator() == lo.get_allocator());
58 assert(is_contiguous_container_asan_correct(l2));
84 std::vector<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l); local
85 assert(l2 == lo)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.cons/ |
| move.pass.cpp | 36 std::vector<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); local
37 assert(l2 == lo);
39 assert(l2.get_allocator() == lo.get_allocator());
40 assert(is_contiguous_container_asan_correct(l2));
54 std::vector<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l); local
55 assert(l2 == lo);
57 assert(l2.get_allocator() == lo.get_allocator());
58 assert(is_contiguous_container_asan_correct(l2));
84 std::vector<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l); local
85 assert(l2 == lo)
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/tests/ |
| test_pytree.py | 68 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
69 self.assertEqual(str(l2), " foo")
80 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
81 self.assertEqual(l1, l2)
97 l2 = pytree.Leaf(200, "bar")
98 n1 = pytree.Node(1000, [l1, l2])
100 self.assertEqual(n1.children, [l1, l2])
104 l2 = pytree.Leaf(100, "bar", context=(" ", (1, 0)))
105 n1 = pytree.Node(1000, [l1, l2])
107 "Node(1000, [%s, %s])" % (repr(l1), repr(l2)))
[all...] |
