| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 30 int ib[s] = {0, 1, 2, 5, 4, 5}; local
46 input_iterator<const int*>(ib)));
50 input_iterator<const int*>(ib),
51 input_iterator<const int*>(ib+s)));
54 random_access_iterator<const int*>(ib),
55 random_access_iterator<const int*>(ib+s)));
|
| equal_pred.pass.cpp | 39 int ib[s] = {0, 1, 2, 5, 4, 5}; local
73 input_iterator<const int*>(ib),
78 input_iterator<const int*>(ib),
79 input_iterator<const int*>(ib+s),
83 random_access_iterator<const int*>(ib),
84 random_access_iterator<const int*>(ib+s),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| is_permutation.pass.cpp | 30 const int ib[] = {0}; local
34 forward_iterator<const int*>(ib)) == true);
38 forward_iterator<const int*>(ib),
39 forward_iterator<const int*>(ib + 0)) == true);
43 forward_iterator<const int*>(ib)) == true);
47 forward_iterator<const int*>(ib),
48 forward_iterator<const int*>(ib + sa)) == true);
51 forward_iterator<const int*>(ib),
52 forward_iterator<const int*>(ib + sa - 1)) == false);
57 const int ib[] = {1} local
72 const int ib[] = {0, 0}; local
90 const int ib[] = {0, 1}; local
104 const int ib[] = {1, 0}; local
118 const int ib[] = {1, 1}; local
132 const int ib[] = {0, 0}; local
146 const int ib[] = {0, 1}; local
164 const int ib[] = {1, 0}; local
178 const int ib[] = {1, 1}; local
192 const int ib[] = {0, 0}; local
206 const int ib[] = {0, 1}; local
220 const int ib[] = {1, 0}; local
234 const int ib[] = {1, 1}; local
248 const int ib[] = {0, 0}; local
262 const int ib[] = {0, 1}; local
276 const int ib[] = {1, 0}; local
290 const int ib[] = {1, 1}; local
305 const int ib[] = {1, 0, 0}; local
319 const int ib[] = {1, 0, 1}; local
333 const int ib[] = {1, 0, 2}; local
347 const int ib[] = {1, 1, 0}; local
361 const int ib[] = {1, 1, 1}; local
375 const int ib[] = {1, 1, 2}; local
389 const int ib[] = {1, 2, 0}; local
403 const int ib[] = {1, 2, 1}; local
417 const int ib[] = {1, 2, 2}; local
431 const int ib[] = {1, 0, 0}; local
449 const int ib[] = {1, 0, 1}; local
463 const int ib[] = {1, 0, 2}; local
481 const int ib[] = {1, 2, 0}; local
499 const int ib[] = {2, 1, 0}; local
517 const int ib[] = {2, 0, 1}; local
535 const int ib[] = {1, 0, 1}; local
549 const int ib[] = {1, 0, 0}; local
571 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
593 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 30 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
33 input_iterator<const int*>(ib)) ==
37 input_iterator<const int*>(ib+3))));
42 input_iterator<const int*>(ib),
43 input_iterator<const int*>(ib + sa)) ==
47 input_iterator<const int*>(ib+3))));
51 input_iterator<const int*>(ib),
52 input_iterator<const int*>(ib + 2)) ==
56 input_iterator<const int*>(ib+2))));
|
| mismatch_pred.pass.cpp | 33 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
36 input_iterator<const int*>(ib),
41 input_iterator<const int*>(ib+3))));
45 input_iterator<const int*>(ib),
46 input_iterator<const int*>(ib + sa),
51 input_iterator<const int*>(ib+3))));
54 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
55 (std::pair<int*,int*>(ia+3,ib+3)));
57 assert(std::mismatch(ia, ia + sa, ib, ib + sa, std::equal_to<int>()) =
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 29 int ib[] = {1, 2, 3}; local
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa));
34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3))
[all...] |
| lexicographical_compare_comp.pass.cpp | 31 int ib[] = {1, 2, 3}; local
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c));
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c));
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c));
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c));
38 assert(!std::lexicographical_compare(ia, ia+sa, ib+1, ib+3, c))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
| copy.pass.cpp | 29 int ib[N] = {0}; local
31 OutIter r = std::copy(InIter(ia), InIter(ia+N), OutIter(ib));
32 assert(base(r) == ib+N);
34 assert(ia[i] == ib[i]);
|
| copy_backward.pass.cpp | 30 int ib[N] = {0}; local
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
33 assert(base(r) == ib);
35 assert(ia[i] == ib[i]);
|
| copy_n.pass.cpp | 29 int ib[N] = {0}; local
31 OutIter r = std::copy_n(InIter(ia), N/2, OutIter(ib));
32 assert(base(r) == ib+N/2);
34 assert(ia[i] == ib[i]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
| move.pass.cpp | 33 int ib[N] = {0}; local
35 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
36 assert(base(r) == ib+N);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
54 assert(base(r) == ib+N);
56 assert(*ib[i] == i);
|
| move_backward.pass.cpp | 33 int ib[N] = {0}; local
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
36 assert(base(r) == ib);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
54 assert(base(r) == ib);
56 assert(*ib[i] == i);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy.pass.cpp | 28 int ib[sa]; local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
31 assert(ib[0] == 0);
32 assert(ib[1] == 1);
33 assert(ib[2] == 3);
34 assert(ib[3] == 4);
35 assert(ib[4] == 3);
36 assert(ib[5] == 4);
|
| remove_copy_if.pass.cpp | 30 int ib[sa]; local
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa-3);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 3);
39 assert(ib[5] == 4);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace_copy.pass.cpp | 31 int ib[sa] = {0}; local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 5);
37 assert(ib[3] == 3);
38 assert(ib[4] == 4);
|
| replace_copy_if.pass.cpp | 32 int ib[sa] = {0}; local
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
35 assert(base(r) == ib + sa);
36 assert(ib[0] == 0);
37 assert(ib[1] == 1);
38 assert(ib[2] == 5);
39 assert(ib[3] == 3);
40 assert(ib[4] == 4);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate_copy.pass.cpp | 27 int ib[sa] = {0}; local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
30 assert(base(r) == ib);
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
33 assert(base(r) == ib+1);
34 assert(ib[0] == 0);
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib));
37 assert(base(r) == ib+1);
38 assert(ib[0] == 0);
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib));
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.transform/ |
| binary_transform.pass.cpp | 30 int ib[sa] = {1, 2, 3, 4, 5}; local
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
32 OutIter(ib), std::minus<int>());
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 1);
36 assert(ib[2] == 1);
37 assert(ib[3] == 1);
38 assert(ib[4] == 1)
[all...] |
| unary_transform.pass.cpp | 30 int ib[sa] = {0}; local
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 2);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 26 int ib[] = {1, 3, 5, 7}; local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
30 forward_iterator<const int*>(ib),
31 forward_iterator<const int*>(ib + sb)) ==
|
| find_first_of_pred.pass.cpp | 28 int ib[] = {1, 3, 5, 7}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
32 forward_iterator<const int*>(ib),
33 forward_iterator<const int*>(ib + sb),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| merge.pass.cpp | 31 int* ib = new int[N]; local
36 ib[i] = 2*i+1;
38 InIter2(ib), InIter2(ib+N), OutIter(ic));
44 delete [] ib;
50 int* ib = new int[N]; local
56 std::copy(ic+N, ic+2*N, ib);
58 std::sort(ib, ib+N);
60 InIter2(ib), InIter2(ib+N), OutIter(ic))
[all...] |
| merge_comp.pass.cpp | 34 int* ib = new int[N]; local
39 ib[i] = 2*i+1;
41 std::reverse(ib, ib+N);
43 InIter2(ib), InIter2(ib+N), OutIter(ic), std::greater<int>());
49 delete [] ib;
55 int* ib = new int[N]; local
61 std::copy(ic+N, ic+2*N, ib);
63 std::sort(ib, ib+N, std::greater<int>())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| compare.pass.cpp | 26 const char ib[] = "123"; local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1)
39 const wchar_t ib[] = L"123"; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference.pass.cpp | 34 int ib[s] = {0}; local
35 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
36 assert(base(r) == ib + s);
38 assert(ib[i] == ir[i]);
|
