| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | partition.pass.cpp | 24 struct is_odd struct
39 assert(is_odd()(*i)); in test()
41 assert(!is_odd()(*i)); in test()
62 assert(is_odd()(*i)); in test()
64 assert(!is_odd()(*i)); in test()
72 assert(is_odd()(*i)); in test()
74 assert(!is_odd()(*i)); in test()
82 assert(is_odd()(*i)); in test()
84 assert(!is_odd()(*i)); in test()
92 assert(is_odd()(*i)); in test()
[all …]
|
| H A D | is_partitioned.pass.cpp | 24 struct is_odd { struct
32 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd()) in test_constexpr() argument
33 && !std::is_partitioned(std::begin(ib), std::end(ib), is_odd()); in test_constexpr()
41 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
50 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
59 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
68 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
77 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
86 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
|
| H A D | ranges_partition_point.pass.cpp | 108 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
111 test_one<Iter, Sent, 0>({}, is_odd, 0); in test_iterators_2()
113 test_one<Iter, Sent, 1>({1}, is_odd, 1); in test_iterators_2()
115 test_one<Iter, Sent, 1>({2}, is_odd, 0); in test_iterators_2()
117 test_one<Iter, Sent, 2>({1, 2}, is_odd, 1); in test_iterators_2()
119 test_one<Iter, Sent, 3>({3, 1, 2}, is_odd, 2); in test_iterators_2()
123 test_one<Iter, Sent, 8>({1, 3, 3, 4, 6, 2, 8, 2}, is_odd, 3); in test_iterators_2()
125 test_one<Iter, Sent, 3>({1, 1, 1}, is_odd, 3); in test_iterators_2()
127 test_one<Iter, Sent, 3>({2, 2, 2}, is_odd, 0); in test_iterators_2()
129 test_one<Iter, Sent, 6>({1, 1, 1, 2, 2, 2}, is_odd, 3); in test_iterators_2()
[all …]
|
| H A D | partition_point.pass.cpp | 21 struct is_odd struct
31 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr() argument
32 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) in test_constexpr()
44 is_odd()) == forward_iterator<const int*>(ia)); in main()
50 is_odd()) == forward_iterator<const int*>(ia + 1)); in main()
56 is_odd()) == forward_iterator<const int*>(ia + 2)); in main()
62 is_odd()) == forward_iterator<const int*>(ia + 3)); in main()
68 is_odd()) == forward_iterator<const int*>(ia + 4)); in main()
74 is_odd()) == forward_iterator<const int*>(ia + 5)); in main()
80 is_odd()) == forward_iterator<const int*>(ia + 6)); in main()
[all …]
|
| H A D | ranges_stable_partition.pass.cpp | 126 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
129 test_one<Iter, Sent, 0>({}, is_odd, 0, {}); in test_iterators_2()
131 test_one<Iter, Sent, 1>({1}, is_odd, 1, {1}); in test_iterators_2()
133 test_one<Iter, Sent, 1>({2}, is_odd, 0, {2}); in test_iterators_2()
135 test_one<Iter, Sent, 2>({2, 1}, is_odd, 1, {1, 2}); in test_iterators_2()
137 test_one<Iter, Sent, 2>({1, 2}, is_odd, 1, {1, 2}); in test_iterators_2()
139 test_one<Iter, Sent, 3>({2, 1, 3}, is_odd, 2, {1, 3, 2}); in test_iterators_2()
145 test_one<Iter, Sent, 3>({1, 1, 1}, is_odd, 3, {1, 1, 1}); in test_iterators_2()
147 test_one<Iter, Sent, 3>({2, 2, 2}, is_odd, 0, {2, 2, 2}); in test_iterators_2()
183 auto is_odd = [](OrderedValue x) { return x.value % 2 != 0; }; in test() local
[all …]
|
| H A D | ranges_partition.pass.cpp | 122 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
125 test_one<Iter, Sent, 0>({}, is_odd, 0); in test_iterators_2()
127 test_one<Iter, Sent, 1>({1}, is_odd, 1); in test_iterators_2()
129 test_one<Iter, Sent, 1>({2}, is_odd, 0); in test_iterators_2()
131 test_one<Iter, Sent, 2>({2, 1}, is_odd, 1); in test_iterators_2()
133 test_one<Iter, Sent, 2>({1, 2}, is_odd, 1); in test_iterators_2()
135 test_one<Iter, Sent, 3>({2, 1, 3}, is_odd, 2); in test_iterators_2()
141 test_one<Iter, Sent, 3>({1, 1, 1}, is_odd, 3); in test_iterators_2()
143 test_one<Iter, Sent, 3>({2, 2, 2}, is_odd, 0); in test_iterators_2()
145 test_one<Iter, Sent, 6>({1, 3, 5, 4, 6, 8}, is_odd, 3); in test_iterators_2()
[all …]
|
| H A D | ranges_partition_copy.pass.cpp | 165 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_in_sent_out1_out2() local
168 test_one<InIter, Sent, Out1, Out2, 0, 0, 0>({}, is_odd, {}, {}); in test_iterators_in_sent_out1_out2()
170 test_one<InIter, Sent, Out1, Out2, 1, 1, 0>({1}, is_odd, {1}, {}); in test_iterators_in_sent_out1_out2()
172 test_one<InIter, Sent, Out1, Out2, 1, 0, 1>({2}, is_odd, {}, {2}); in test_iterators_in_sent_out1_out2()
174 test_one<InIter, Sent, Out1, Out2, 2, 1, 1>({2, 1}, is_odd, {1}, {2}); in test_iterators_in_sent_out1_out2()
176 test_one<InIter, Sent, Out1, Out2, 2, 1, 1>({1, 2}, is_odd, {1}, {2}); in test_iterators_in_sent_out1_out2()
178 test_one<InIter, Sent, Out1, Out2, 3, 2, 1>({2, 1, 3}, is_odd, {1, 3}, {2}); in test_iterators_in_sent_out1_out2()
184 test_one<InIter, Sent, Out1, Out2, 3, 3, 0>({1, 1, 1}, is_odd, {1, 1, 1}, {}); in test_iterators_in_sent_out1_out2()
186 test_one<InIter, Sent, Out1, Out2, 3, 0, 3>({2, 2, 2}, is_odd, {}, {2, 2, 2}); in test_iterators_in_sent_out1_out2()
188 test_one<InIter, Sent, Out1, Out2, 6, 3, 3>({1, 3, 5, 4, 6, 8}, is_odd, {1, 3, 5}, {4, 6, 8}); in test_iterators_in_sent_out1_out2()
[all …]
|
| H A D | partition_copy.pass.cpp | 24 struct is_odd struct
36 std::begin(r1), std::begin(r2), is_odd()); in test_constexpr() argument
38 return std::all_of(std::begin(r1), p.first, is_odd()) in test_constexpr()
40 && std::none_of(std::begin(r2), p.second, is_odd()) in test_constexpr()
55 cpp17_output_iterator<int*>(r1), r2, is_odd()); in main()
|
| H A D | stable_partition.pass.cpp | 24 struct is_odd struct
|