/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | merge_pred.pass.cpp | 30 C c2(std::begin(t2), std::end(t2)); 31 c1.merge(c2, std::greater<T>()); 43 C c2(std::begin(t2), std::end(t2)); 44 c1.merge(c2, std::greater<T>());
|
H A D | splice_after_flist.pass.cpp | 51 C c2(t2, t2+l); 53 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2)); 67 C c2(t2, t2+l); 69 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | merge.pass.cpp | 29 C c2(std::begin(t2), std::end(t2)); 30 c1.merge(c2); 42 C c2(std::begin(t2), std::end(t2)); 43 c1.merge(c2);
|
H A D | merge_pred.pass.cpp | 30 C c2(std::begin(t2), std::end(t2)); 31 c1.merge(c2, std::greater<T>()); 43 C c2(std::begin(t2), std::end(t2)); 44 c1.merge(c2, std::greater<T>());
|
H A D | splice_after_flist.pass.cpp | 51 C c2(t2, t2+l); 53 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2)); 67 C c2(t2, t2+l); 69 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
|
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
H A D | test_normalization.py | 57 c1,c2,c3,c4,c5 = [unistr(x) for x in line.split(';')[:-1]] 71 self.assertTrue(c2 == NFC(c1) == NFC(c2) == NFC(c3), line) 73 self.assertTrue(c3 == NFD(c1) == NFD(c2) == NFD(c3), line) 75 self.assertTrue(c4 == NFKC(c1) == NFKC(c2) == \ 78 self.assertTrue(c5 == NFKD(c1) == NFKD(c2) == \
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
H A D | test_normalization.py | 57 c1,c2,c3,c4,c5 = [unistr(x) for x in line.split(';')[:-1]] 71 self.assertTrue(c2 == NFC(c1) == NFC(c2) == NFC(c3), line) 73 self.assertTrue(c3 == NFD(c1) == NFD(c2) == NFD(c3), line) 75 self.assertTrue(c4 == NFKC(c1) == NFKC(c2) == \ 78 self.assertTrue(c5 == NFKD(c1) == NFKD(c2) == \
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
H A D | test_normalization.py | 57 c1,c2,c3,c4,c5 = [unistr(x) for x in line.split(';')[:-1]] 71 self.assertTrue(c2 == NFC(c1) == NFC(c2) == NFC(c3), line) 73 self.assertTrue(c3 == NFD(c1) == NFD(c2) == NFD(c3), line) 75 self.assertTrue(c4 == NFKC(c1) == NFKC(c2) == \ 78 self.assertTrue(c5 == NFKD(c1) == NFKD(c2) == \
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
H A D | test_normalization.py | 57 c1,c2,c3,c4,c5 = [unistr(x) for x in line.split(';')[:-1]] 71 self.assertTrue(c2 == NFC(c1) == NFC(c2) == NFC(c3), line) 73 self.assertTrue(c3 == NFD(c1) == NFD(c2) == NFD(c3), line) 75 self.assertTrue(c4 == NFKC(c1) == NFKC(c2) == \ 78 self.assertTrue(c5 == NFKD(c1) == NFKD(c2) == \
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.cons/ |
H A D | move.pass.cpp | 65 std::vector<int> c2 = std::move(c1); local 66 assert(is_contiguous_container_asan_correct(c2)); 67 std::vector<int>::iterator j = c2.erase(i); 69 assert(is_contiguous_container_asan_correct(c2)); 95 std::vector<int, min_allocator<int>> c2 = std::move(c1); local 96 assert(is_contiguous_container_asan_correct(c2)); 97 std::vector<int, min_allocator<int>>::iterator j = c2.erase(i); 99 assert(is_contiguous_container_asan_correct(c2));
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | move.pass.cpp | 65 std::vector<int> c2 = std::move(c1); local 66 assert(is_contiguous_container_asan_correct(c2)); 67 std::vector<int>::iterator j = c2.erase(i); 69 assert(is_contiguous_container_asan_correct(c2)); 95 std::vector<int, min_allocator<int>> c2 = std::move(c1); local 96 assert(is_contiguous_container_asan_correct(c2)); 97 std::vector<int, min_allocator<int>>::iterator j = c2.erase(i); 99 assert(is_contiguous_container_asan_correct(c2));
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.cons/ |
H A D | move.pass.cpp | 65 std::vector<int> c2 = std::move(c1); local 66 assert(is_contiguous_container_asan_correct(c2)); 67 std::vector<int>::iterator j = c2.erase(i); 69 assert(is_contiguous_container_asan_correct(c2)); 95 std::vector<int, min_allocator<int>> c2 = std::move(c1); local 96 assert(is_contiguous_container_asan_correct(c2)); 97 std::vector<int, min_allocator<int>>::iterator j = c2.erase(i); 99 assert(is_contiguous_container_asan_correct(c2));
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | splice_after_flist.pass.cpp | 51 C c2(t2, t2+l); 53 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2)); 67 C c2(t2, t2+l); 69 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
H A D | emplace.pass.cpp | 57 std::list<A> c2; local 58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 81 std::list<A, min_allocator<A>> c2; local 82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
H A D | insert_iter_size_value.pass.cpp | 71 std::list<int> c2; local 72 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 101 std::list<int, min_allocator<int>> c2; local 102 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | emplace.pass.cpp | 57 std::list<A> c2; local 58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 81 std::list<A, min_allocator<A>> c2; local 82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
H A D | insert_iter_size_value.pass.cpp | 68 std::list<int> c2; local 69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 98 std::list<int, min_allocator<int>> c2; local 99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
H A D | emplace.pass.cpp | 57 std::list<A> c2; local 58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 81 std::list<A, min_allocator<A>> c2; local 82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
H A D | insert_iter_size_value.pass.cpp | 71 std::list<int> c2; local 72 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 101 std::list<int, min_allocator<int>> c2; local 102 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/language.support/support.runtime/ |
H A D | ctime.pass.cpp | 44 const char* c2 = 0; local 46 ((void)c2); // Prevent unused warning 47 static_assert((std::is_same<decltype(std::strftime(c1,s,c2,&tm)), std::size_t>::value), "");
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/numerics/complex.number/complex.members/ |
H A D | real_imag.pass.cpp | 26 constexpr std::complex<T> c2(3); 27 static_assert(c2.real() == 3, ""); 28 static_assert(c2.imag() == 0, "");
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.members/ |
H A D | real_imag.pass.cpp | 26 constexpr std::complex<T> c2(3); 27 static_assert(c2.real() == 3, ""); 28 static_assert(c2.imag() == 0, "");
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/language.support/support.runtime/ |
H A D | ctime.pass.cpp | 44 const char* c2 = 0; local 46 ((void)c2); // Prevent unused warning 47 static_assert((std::is_same<decltype(std::strftime(c1,s,c2,&tm)), std::size_t>::value), "");
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/numerics/complex.number/complex.members/ |
H A D | real_imag.pass.cpp | 26 constexpr std::complex<T> c2(3); 27 static_assert(c2.real() == 3, ""); 28 static_assert(c2.imag() == 0, "");
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
H A D | insert_iter_size_value.pass.cpp | 57 std::vector<int> c2; local 58 std::vector<int>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1); 94 std::vector<int, min_allocator<int>> c2; local 95 std::vector<int, min_allocator<int>>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1);
|