| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
30 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
36 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
41 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
46 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
51 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
46 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
51 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
32 forward_iterator<const int*>(ia + sa), in main()
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
40 forward_iterator<const int*>(ia + sa), in main()
47 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
49 forward_iterator<const int*>(ia + sa), in main()
55 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
57 forward_iterator<const int*>(ia + sa), in main()
63 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
65 forward_iterator<const int*>(ia + sa), in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
34 forward_iterator<const int*>(ia + sa), in main()
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
43 forward_iterator<const int*>(ia + sa), in main()
51 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
53 forward_iterator<const int*>(ia + sa), in main()
60 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
62 forward_iterator<const int*>(ia + sa), in main()
69 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
71 forward_iterator<const int*>(ia + sa), in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
| D | partition.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
42 for (int* i = base(r); i < ia+sa; ++i) in test()
48 for (unsigned i = 0; i < sa; ++i) in test()
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
53 for (unsigned i = 0; i < sa; ++i) in test()
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
56 assert(base(r) == ia+sa); in test()
58 for (unsigned i = 0; i < sa; ++i) in test()
60 ia[sa-1] = 10; in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.search/ |
| D | search_pred.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
42 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
43 assert(count_equal::count <= sa); in test()
45 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
46 assert(count_equal::count <= sa); in test()
48 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
51 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
52 assert(count_equal::count <= sa); in test()
54 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
[all …]
|
| D | search.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); in test()
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
36 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); in test()
37 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end_pred.pass.cpp | 38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
41 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
42 assert(count_equal::count <= 1*(sa-1+1)); in test()
45 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
46 assert(count_equal::count <= 2*(sa-2+1)); in test()
49 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
50 assert(count_equal::count <= 3*(sa-3+1)); in test()
53 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
54 assert(count_equal::count <= 4*(sa-4+1)); in test()
57 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
[all …]
|
| D | find_end.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); in test()
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); in test()
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); in test()
35 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); in test()
37 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6)); in test()
39 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia)); in test()
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa)); in test()
42 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b)) == Iter1(ia+sa)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1); in main()
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
42 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| D | random_shuffle.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
26 std::random_shuffle(ia, ia+sa); in main()
27 assert(std::equal(ia, ia+sa, ia1)); in main()
28 std::random_shuffle(ia, ia+sa); in main()
29 assert(std::equal(ia, ia+sa, ia2)); in main()
|
| D | random_shuffle_urng.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
27 std::shuffle(ia, ia+sa, g); in main()
28 assert(std::equal(ia, ia+sa, ia1)); in main()
29 std::shuffle(ia, ia+sa, g); in main()
30 assert(std::equal(ia, ia+sa, ia2)); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.any_of/ |
| D | any_of.pass.cpp | 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
35 input_iterator<const int*>(ia + sa), test1()) == true); in main()
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
43 input_iterator<const int*>(ia + sa), test1()) == true); in main()
49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
51 input_iterator<const int*>(ia + sa), test1()) == false); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.none_of/ |
| D | none_of.pass.cpp | 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
35 input_iterator<const int*>(ia + sa), test1()) == false); in main()
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
43 input_iterator<const int*>(ia + sa), test1()) == false); in main()
49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
51 input_iterator<const int*>(ia + sa), test1()) == true); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
29 input_iterator<const int*>(ia + sa), in main()
35 input_iterator<const int*>(ia + sa), in main()
38 input_iterator<const int*>(ia+sa)); in main()
40 input_iterator<const int*>(ia + sa), in main()
43 input_iterator<const int*>(ia+sa)); in main()
|
| D | find_first_of_pred.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
31 input_iterator<const int*>(ia + sa), in main()
38 input_iterator<const int*>(ia + sa), in main()
42 input_iterator<const int*>(ia+sa)); in main()
44 input_iterator<const int*>(ia + sa), in main()
48 input_iterator<const int*>(ia+sa)); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.remove/ |
| D | remove.pass.cpp | 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2); in test()
33 assert(base(r) == ia + sa-3); in test()
48 const unsigned sa = 9; in test1() local
49 std::unique_ptr<int> ia[sa]; in test1()
56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>()); in test1()
57 assert(base(r) == ia + sa-3); in test1()
|
| D | remove_if.pass.cpp | 32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
33 int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2)); in test()
34 assert(r == ia + sa-3); in test()
54 const unsigned sa = 9; in test1() local
55 std::unique_ptr<int> ia[sa]; in test1()
65 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred()); in test1()
66 assert(base(r) == ia + sa-3); in test1()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2)); in test()
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa)); in test()
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3)); in test()
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa)); in test()
34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3)); in test()
35 assert(!std::lexicographical_compare(ib+1, ib+3, ia, ia+sa)); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c)); in test()
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c)); in test()
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c)); in test()
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c)); in test()
38 assert(!std::lexicographical_compare(ia, ia+sa, ib+1, ib+3, c)); in test()
39 assert(std::lexicographical_compare(ib+1, ib+3, ia, ia+sa, c)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| D | adjacent_find.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
27 forward_iterator<const int*>(ia + sa)) == in main()
33 forward_iterator<const int*>(ia + sa)) == in main()
34 forward_iterator<const int*>(ia+sa)); in main()
|
| D | adjacent_find_pred.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
28 forward_iterator<const int*>(ia + sa), in main()
36 forward_iterator<const int*>(ia + sa), in main()
38 forward_iterator<const int*>(ia+sa)); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
39 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa))); in test()
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb))); in test()
42 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa))); in test()
47 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+1))); in test()
48 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+2))); in test()
49 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+3))); in test()
50 assert(!std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+4))); in test()
|