| /external/libcxx/test/std/strings/basic.string/string.modifiers/string_erase/ |
| erase_iter_db2.pass.cpp | 28 std::string l1("123");
31 l1.erase(i);
37 S l1("123");
40 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 28 std::string l1("123");
30 std::string::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
36 S l1("123");
38 S::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_iter_iter.pass.cpp | 47 std::list<int> l1; local
48 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3);
49 assert(i == l1.begin());
50 assert(l1.size() == 3);
51 assert(distance(l1.begin(), l1.end()) == 3);
52 i = l1.begin();
59 i = l1.insert(i, a2, a2+3);
61 assert(l1.size() == 6)
116 std::list<int, min_allocator<int>> l1; local
[all...] |
| insert_iter_size_value.pass.cpp | 47 std::list<int> l1(a1, a1+3);
48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
49 assert(i == next(l1.begin()));
50 assert(l1 == std::list<int>(a2, a2+8));
55 i = l1.insert(i, 5, 5);
63 assert(l1 == std::list<int>(a2, a2+8));
77 std::list<int, min_allocator<int>> l1(a1, a1+3);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_erase/ |
| erase_iter_db2.pass.cpp | 28 std::string l1("123");
31 l1.erase(i);
37 S l1("123");
40 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 28 std::string l1("123");
30 std::string::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
36 S l1("123");
38 S::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /external/llvm/test/MC/ARM/ |
| cmp-immediate-fixup-error.s | 4 cmp r0, #(l1 - unknownLabel + 4) >> 2
7 l1: label
|
| cmp-immediate-fixup-error2.s | 4 cmp r0, #(l1 - unknownLabel)
7 l1: label
|
| cmp-immediate-fixup.s | 7 cmp r2, #(l2 - l1 + 4) >> 2
8 l1: label
|
| cmp-immediate-fixup2.s | 7 cmp r2, #(l2 - l1)
8 l1: label
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 49 std::list<int> l1(a1, a1+3);
50 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
51 assert(i == next(l1.begin()));
52 assert(l1 == std::list<int>(a2, a2+8));
57 i = l1.insert(i, 5, 5);
65 assert(l1 == std::list<int>(a2, a2+8));
79 std::list<int, min_allocator<int>> l1(a1, a1+3);
80 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/net/ |
| LinkAddressTest.java | 194 private void assertIsSameAddressAs(LinkAddress l1, LinkAddress l2) {
195 assertTrue(l1 + " unexpectedly does not have same address as " + l2,
196 l1.isSameAddressAs(l2));
197 assertTrue(l2 + " unexpectedly does not have same address as " + l1,
198 l2.isSameAddressAs(l1));
201 private void assertIsNotSameAddressAs(LinkAddress l1, LinkAddress l2) {
202 assertFalse(l1 + " unexpectedly has same address as " + l2,
203 l1.isSameAddressAs(l2));
204 assertFalse(l2 + " unexpectedly has same address as " + l1,
205 l1.isSameAddressAs(l2))
220 LinkAddress l1, l2, l3; local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 57 l1 = pytree.Leaf(100, "foo")
58 self.assertEqual(l1.type, 100)
59 self.assertEqual(l1.value, "foo")
62 l1 = pytree.Leaf(100, "foo")
63 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
66 l1 = pytree.Leaf(100, "foo")
67 self.assertEqual(str(l1), "foo")
74 l1 = pytree.Leaf(2, 5)
75 l1.prefix = "foo_"
76 self.assertEqual(str(l1), "foo_5"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 57 l1 = pytree.Leaf(100, "foo")
58 self.assertEqual(l1.type, 100)
59 self.assertEqual(l1.value, "foo")
62 l1 = pytree.Leaf(100, "foo")
63 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
66 l1 = pytree.Leaf(100, "foo")
67 self.assertEqual(str(l1), "foo")
74 l1 = pytree.Leaf(2, 5)
75 l1.prefix = "foo_"
76 self.assertEqual(str(l1), "foo_5"
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/selinux/libsepol/include/sepol/policydb/ |
| mls_types.h | 75 static inline int mls_level_eq(const struct mls_level *l1, const struct mls_level *l2)
77 return ((l1->sens == l2->sens) && ebitmap_cmp(&l1->cat, &l2->cat));
80 static inline int mls_level_dom(const struct mls_level *l1, const struct mls_level *l2)
82 return ((l1->sens >= l2->sens) && ebitmap_contains(&l1->cat, &l2->cat));
85 #define mls_level_incomp(l1, l2) \
86 (!mls_level_dom((l1), (l2)) && !mls_level_dom((l2), (l1)))
88 #define mls_level_between(l1, l2, l3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| mips16-e.s | 4 l1: nop label
12 .word l1
13 .word l1+8
|
| /external/clang/test/CodeGen/ |
| le32-libcall-pow.c | 18 double l1 = pow(a1, a1); local
|
