Home | Libraries | People | FAQ | More |
boost::algorithm::is_partitioned_until — Tests to see if a sequence is partitioned according to a predicate. In other words, all the items in the sequence that satisfy the predicate are at the beginning of the sequence.
// In header: <boost/algorithm/is_partitioned_until.hpp> template<typename InputIterator, typename UnaryPredicate> InputIterator is_partitioned_until(InputIterator first, InputIterator last, UnaryPredicate p);
Note | |
---|---|
Returns the first iterator 'it' in the sequence [first, last) for which is_partitioned(first, it, p) is false. Returns last if the entire sequence is partitioned. Complexity: O(N). |
Parameters: |
|