Home
last modified time | relevance | path

Searched defs:is_odd (Results 1 – 9 of 9) sorted by relevance

/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_point.pass.cpp21 struct is_odd struct
31 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr() argument
H A Dpartition_copy.pass.cpp24 struct is_odd struct
36 std::begin(r1), std::begin(r2), is_odd()); in test_constexpr() argument
H A Dis_partitioned.pass.cpp24 struct is_odd { struct
32 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd()) in test_constexpr() argument
H A Dpartition.pass.cpp24 struct is_odd struct
36 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test() argument
[all...]
H A Dranges_partition_point.pass.cpp107 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
154 auto is_odd = [](int x) { return x % 2 != 0; }; in test() local
H A Dstable_partition.pass.cpp26 struct is_odd struct
28 operator ()is_odd operator ()() argument
H A Dranges_stable_partition.pass.cpp125 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
182 auto is_odd = [](OrderedValue x) { return x.value % 2 != 0; }; in test() local
H A Dranges_partition.pass.cpp121 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_2() local
H A Dranges_partition_copy.pass.cpp164 auto is_odd = [](int x) { return x % 2 != 0; }; in test_iterators_in_sent_out1_out2() local