Home
last modified time | relevance | path

Searched refs:partition_point (Results 1 – 3 of 3) sorted by relevance

/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
Dpartition_point.pass.cpp32 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr()
33 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) in test_constexpr()
43 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
49 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
55 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
61 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
67 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
73 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
79 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
85 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
/external/libcxx/fuzzing/
Dfuzzing.cpp269 const size_t partition_point = data[0] % size; in nth_element() local
271 const auto partition_iter = working.begin() + partition_point; in nth_element()
/external/libcxx/include/
Dalgorithm326 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
3221 // partition_point
3225 partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)