Difference between revisions of "cpp/algorithm/is partitioned"
From cppreference.com
m (Use since= and until= params of {{dcl}} template.) |
m (seealso par) |
||
| Line 73: | Line 73: | ||
{{dsc inc | cpp/algorithm/dsc partition}} | {{dsc inc | cpp/algorithm/dsc partition}} | ||
{{dsc inc | cpp/algorithm/dsc partition_point}} | {{dsc inc | cpp/algorithm/dsc partition_point}} | ||
| + | {{dsc inc | cpp/experimental/parallelism/dsc algorithm | is_partitioned}} | ||
{{dsc end}} | {{dsc end}} | ||
Revision as of 05:19, 28 July 2015
| Defined in header <algorithm>
|
||
| template< class InputIt, class UnaryPredicate > bool is_partitioned( InputIt first, InputIt last, UnaryPredicate p ); |
(since C++11) | |
Returns true if all elements in the range [first, last) that satisfy the predicate p appear before all elements that don't. Also returns true if [first, last) is empty.
Contents |
Parameters
| first, last | - | the range of elements to check |
| p | - | unary predicate which returns true for the elements expected to be found in the beginning of the range. The expression p(v) must be convertible to bool for every argument |
| Type requirements | ||
Return value
true if the range [first, last) is empty or is partitioned by p. false otherwise.
Complexity
At most std::distance(first, last) applications of p.
Possible implementation
template< class InputIt, class UnaryPredicate > bool is_partitioned(InputIt first, InputIt last, UnaryPredicate p) { for (; first != last; ++first) if (!p(*first)) break; for (; first != last; ++first) if (p(*first)) return false; return true; } |
Example
Run this code
#include <algorithm> #include <array> #include <iostream> int main() { std::array<int, 9> v = { 1, 2, 3, 4, 5, 6, 7, 8, 9 }; auto is_even = [](int i){ return i % 2 == 0; }; std::cout.setf(std::ios_base::boolalpha); std::cout << std::is_partitioned(v.begin(), v.end(), is_even) << ' '; std::partition(v.begin(), v.end(), is_even); std::cout << std::is_partitioned(v.begin(), v.end(), is_even) << ' '; std::reverse(v.begin(), v.end()); std::cout << std::is_partitioned(v.begin(), v.end(), is_even); }
Output:
false true false
See also
| divides a range of elements into two groups (function template) | |
| (C++11) |
locates the partition point of a partitioned range (function template) |
| (parallelism TS) |
parallelized version of std::is_partitioned (function template) |
