| /external/llvm/test/Assembler/ |
| 2002-07-31-SlashInString.ll | 4 @Slashtest = internal global [8 x i8] c"\5Cbegin{\00"
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter.pass.cpp | 24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
26 assert(distance(l1.cbegin(), l1.cend()) == 3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
33 assert(distance(l1.cbegin(), l1.cend()) == 2);
39 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
41 assert(distance(l1.cbegin(), l1.cend()) == 1);
47 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| erase_iter_iter_db4.pass.cpp | 30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| erase_iter_iter_db1.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
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_iter.pass.cpp | 24 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
26 assert(distance(l1.cbegin(), l1.cend()) == 3);
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
33 assert(distance(l1.cbegin(), l1.cend()) == 2);
39 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
41 assert(distance(l1.cbegin(), l1.cend()) == 1);
47 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| erase_iter_iter_db4.pass.cpp | 30 std::vector<int>::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin());
37 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin());
|
| erase_iter_iter_db1.pass.cpp | 31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| erase_iter_iter_db3.pass.cpp | 31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| erase_iter_iter.pass.cpp | 25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
27 assert(distance(l1.cbegin(), l1.cend()) == 3);
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
34 assert(distance(l1.cbegin(), l1.cend()) == 2);
40 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
42 assert(distance(l1.cbegin(), l1.cend()) == 1);
48 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4));
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5));
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2));
77 i = m.erase(m.cbegin(), m.cend());
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5))
[all...] |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
51 i = m.erase(next(m.cbegin(), 0));
61 i = m.erase(next(m.cbegin(), 5));
70 i = m.erase(next(m.cbegin(), 1));
78 i = m.erase(next(m.cbegin(), 2));
85 i = m.erase(next(m.cbegin(), 2));
91 i = m.erase(next(m.cbegin(), 0));
96 i = m.erase(m.cbegin());
119 I i = m.erase(next(m.cbegin(), 3));
130 i = m.erase(next(m.cbegin(), 0))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4));
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5));
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2));
77 i = m.erase(m.cbegin(), m.cend());
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5))
[all...] |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
51 i = m.erase(next(m.cbegin(), 0));
61 i = m.erase(next(m.cbegin(), 5));
70 i = m.erase(next(m.cbegin(), 1));
78 i = m.erase(next(m.cbegin(), 2));
85 i = m.erase(next(m.cbegin(), 2));
91 i = m.erase(next(m.cbegin(), 0));
96 i = m.erase(m.cbegin());
119 I i = m.erase(next(m.cbegin(), 3));
130 i = m.erase(next(m.cbegin(), 0))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
| iter_iter_initializer_list.pass.cpp | 24 s.replace(s.cbegin() + 3, s.cbegin() + 6, {'a', 'b', 'c'});
31 s.replace(s.cbegin() + 3, s.cbegin() + 6, {'a', 'b', 'c'});
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 20 // const_local_iterator cbegin(size_type n) const;
162 I i = c.cbegin(b);
167 i = c.cbegin(b);
175 i = c.cbegin(b);
183 i = c.cbegin(b);
189 i = c.cbegin(b);
195 i = c.cbegin(b);
200 i = c.cbegin(b);
220 I i = c.cbegin(b);
225 i = c.cbegin(b)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(m.cbegin(), m.cbegin());
60 i = m.erase(m.cbegin(), next(m.cbegin(), 2));
76 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 6));
84 i = m.erase(m.cbegin(), m.cend());
107 I i = m.erase(m.cbegin(), m.cbegin());
127 i = m.erase(m.cbegin(), next(m.cbegin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(m.cbegin(), m.cbegin());
60 i = m.erase(m.cbegin(), next(m.cbegin(), 2));
76 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 6));
84 i = m.erase(m.cbegin(), m.cend());
107 I i = m.erase(m.cbegin(), m.cbegin());
127 i = m.erase(m.cbegin(), next(m.cbegin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
64 assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end());
66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());
|
| copy_backward.pass.cpp | 55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
63 assert(std::copy_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin());
65 assert(std::copy_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
| move.pass.cpp | 55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
63 assert(std::move(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end());
65 assert(std::move(RACI(c2.cbegin()), RACI(c2.cend()), c1.begin()) == c1.end());
|
| move_backward.pass.cpp | 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
63 assert(std::move_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin());
65 assert(std::move_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| insert_after_const.pass.cpp | 32 i = c.insert_after(c.cbegin(), 1);
38 i = c.insert_after(next(c.cbegin()), 2);
45 i = c.insert_after(c.cbegin(), 3);
65 i = c.insert_after(c.cbegin(), 1);
71 i = c.insert_after(next(c.cbegin()), 2);
78 i = c.insert_after(c.cbegin(), 3);
|
