C++ Algorithm is_partitioned()

C++ Algorithm is_partitioned() is used to test to see if a range [first, last) is partitioned according to a predicate. In other words, all the elements in the range that satisfies the predicate are at the beginning of the sequence.

If the range is empty then it returns true.

Syntax

  template <class InputIterator, class UnaryPredicate>    bool is_partitioned (InputIterator first, InputIterator last, UnaryPredicate pred);  

Parameter

first: An input iterator pointing to the first element in the range.

last: An input iterator pointing to the past last element in the range.

pred: A user-defined unary predicate function that returns true for the elements expected to be found in the beginning of the range.

Return value

This function returns true if the range is empty or is partitioned by given predicate pred, otherwise it returns false.

Complexity

Complexity is linear in the range [first, last): calls pred for each element until a mismatch is found.

Data races

The object in the range [first, last) are accessed.

Each element is accessed exactly once.

Exceptions

This function throws an exception if either pred or an operation on iterator throws an exception.

Please note that invalid parameters cause an undefined behavior.

Example 1

Let’s see the simple example to demonstrate the use of is_partitioned():

  #include <iostream>  #include <vector>  #include <algorithm>    using namespace std;    int main()  {    vector<int> v = {1, 2, 3, 4, 5};        cout<<“Before Partition: “;      for_each(v.begin(), v.end(), [](int v) {     cout << v << ” “;    });        auto pred = [](int x) { return x % 2 == 0; };      // Divide it into an even group and an odd group     partition(v.begin(), v.end(), pred);    cout<<“nAfter partition : “;    for_each(v.begin(), v.end(), [](int x) {     cout << x << ” “;    });      cout<<“nnIs it partitioned?”<<endl;    // Is it divided into an even group and an odd group?      if (is_partitioned(v.begin(), v.end(), pred)) {      cout << “Yes,It is Partitioned” << endl;    }    else {      cout << “No,It is not Partitioned” << endl;    }        return 0;  }  

Output:

Before Partition: 1 2 3 4 5   After partition : 4 2 3 1 5     Is it partitioned?  Yes,It is Partitioned

Example 2

Let’s see another simple example:

  #include <iostream>   #include <algorithm>   #include <vector>       // Defining the BinaryFunction   bool pred(int a)   {       return (a % 2 == 0);   }       using namespace std;   int main()   {       // Declaring first vector       vector<int> v1 = { 2, 4, 6, 3, 5, 7, 9 };           // Using std::is_partitioned       bool b = std::is_partitioned(v1.begin(), v1.end(), pred);           if (b == 1) {           cout << “All the even no. are present before odd no.”;       } else {           cout << “All the even no. are not present before odd no.”;       }           // Inserting an even no. at the end of v1       // so std::is_partitioned returns false       v1.push_back(16);           // Now again using std::is_partitioned       b = std::is_partitioned(v1.begin(), v1.end(), pred);           if (b == 1) {           cout << “nAll the even no. are present before odd no.”;       } else {           cout << “nAll the even no. are not present before odd no.”;       }           return 0;   }  

Output:

All the even no. are present before odd no.  All the even no. are not present before odd no.

Example 3

Let’s see another simple example:

  #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

Example 4

Let’s see another simple example:

  #include <iostream>  #include <vector>  #include <algorithm>    using namespace std;    int main()  {    vector<int> v = {11, 2, 3, 4, 15, 12};        cout<<“Before Partition: “;      for_each(v.begin(), v.end(), [](int v) {     cout << v << ” “;    });        auto pred = [](int x) { return x < 10; };       // Divide it into an even group and an odd group     partition(v.begin(), v.end(), pred);    cout<<“nAfter partition: “;    for_each(v.begin(), v.end(), [](int x) {     cout << x << ” “;    });      cout<<“nnIs it partitioned?”<<endl;    // Is it divided into an even group and an odd group?      if (is_partitioned(v.begin(), v.end(), pred)) {      cout << “Yes, It is Partitioned.” << endl;    }    else {      cout << “No, It is not Partitioned.” << endl;    }        return 0;  }  

Output:

Before Partition: 11 2 3 4 15 12   After partition: 4 2 3 11 15 12     Is it partitioned?  Yes, It is Partitioned.

Next TopicC++ Algorithm

adjacent_find()algorithm any_of()beginners copy_if()copy()count_if()count()cpp equal()find_end()find_first_of()find_if_not() for_each()find_if()find()professionals tutorial

C++ algorithm is_partitioned() function

C++ Algorithm is_partitioned()

Syntax

Parameter

Return value

Complexity

Data races

Exceptions

Example 1

Example 2

Example 3

Example 4

Underwriting of Shares

C++ Math abs() Functions

You may also like