| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::list<int> l1(a1, a1+3);
32 l1.erase(i);
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
41 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
32 l1.erase(i);
38 std::vector<int, min_allocator<int>> l1(a1, a1+3);
41 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /external/llvm/test/MC/AArch64/ |
| optional-hash.s | 16 l1: label
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::list<int> l1(a1, a1+3);
32 l1.erase(i);
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
41 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db2.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
32 l1.erase(i);
38 std::vector<int, min_allocator<int>> l1(a1, a1+3);
41 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| elf-rel12.d | 7 0+0004 * 0+..05 * R_MIPS_HI16 * 0+0000 * l1
8 0+0008 * 0+..06 * R_MIPS_LO16 * 0+0000 * l1
|
| elf-rel.s | 8 lui $at,%hi(l1)
9 lui $at,%hi(l1+4)
10 lui $at,%hi(l1+0x10000)
11 lui $at,%hi(l1+0x10004)
13 lui $at,%hi(l1+0x8000)
14 l1: label
15 addi $at,$at,%lo(l1)
16 addi $at,$at,%lo(l1+0x10004)
17 addi $at,$at,%lo(l1+0x10000)
18 addi $at,$at,%lo(l1+4
[all...] |
| mips16-f.s | 4 l1: nop label
10 .word l1+3
|
| /external/autotest/contrib/ |
| servo-inventory | 17 ' | sort | ./haveservo | xargs -l1 ./servo-stat
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
31 l1.erase(i);
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
31 l1.erase(i);
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| erase_iter_db2.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
30 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
30 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
31 l1.erase(i);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db2.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
31 l1.erase(i);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| erase_iter_db2.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
30 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
30 l1.erase(i);
|
| erase_iter_iter_db3.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
