C++ Algorithm is_partitioned()

2024年8月30日 | 阅读4分钟

C++ Algorithm is_partitioned() 用于测试一个范围 [first, last) 是否根据谓词进行了分区。换句话说，范围中所有满足谓词的元素都位于序列的开头。

如果范围为空，则返回 true。

语法

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

参数

first: 指向范围中第一个元素的输入迭代器。

last: 指向范围中最后一个元素之后的输入迭代器。

pred: 用户定义的一元谓词函数，对于预期位于范围开头的元素返回 true。

返回值

如果范围为空或由给定的谓词 pred 分区，则此函数返回 true，否则返回 false。

复杂度

复杂度与范围 [first, last) 成线性关系：为每个元素调用 pred，直到找到不匹配项。

数据竞争

访问范围 [first, last) 中的对象。

每个元素只访问一次。

异常

如果 pred 或迭代器操作抛出异常，此函数将抛出异常。

请注意，无效参数会导致未定义行为。

示例 1

让我们看一个简单的例子来演示 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<<"\n\nIs 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;
}

输出

Before Partition: 1 2 3 4 5 
After partition : 4 2 3 1 5 

Is it partitioned?
Yes,It is Partitioned

示例 2

让我们看另一个简单示例

#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; 
}

输出

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

示例 3

让我们看另一个简单示例

#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);
}

输出

false true false

示例 4

让我们看另一个简单示例

#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<<"\n\nIs 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;
}

输出

Before Partition: 11 2 3 4 15 12 
After partition: 4 2 3 11 15 12 

Is it partitioned?
Yes, It is Partitioned.

下一主题C++ 算法

C++ Algorithm is_partitioned()

语法

参数

返回值

复杂度

数据竞争

异常

示例 1

示例 2

示例 3

示例 4

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

C++ 教程

C++ 控制语句

C++ 函数

C++ 数组

C++ 类和对象

C++ 构造函数

C++ 继承

C++ 多态

C++ 抽象

C++ 命名空间

C++ 模板

C++ 字符串

C++ 指针

信号处理

C++ 异常

C++ 文件与流

C++ STL 教程

面试题

选择题

C++ 程序

C++ STL Stack

C++ STL Bitset

C++ STL Deque

C++ STL List

C++ STL Map

C++ STL Math

C++ STL priority_queue

C++ STL Queue

C++ STL Multiset

C++ STL Multimap

C++ STL Set

C++ STD Strings

C++ STL Vector

C++ 操纵符

C++ STL Algorithms

C++ Algorithm

C++ Iterators

C++ 杂项

C++ Algorithm is_partitioned()

语法

参数

返回值

复杂度

数据竞争

异常

示例 1

示例 2

示例 3

示例 4

相关帖子

algorithm merge() 函数

algorithm partition() 函数

algorithm partition_point() 函数

algorithm all_of() 函数

algorithm partition_copy() 函数

algorithm rotate() 函数

algorithm replace_copy_if() 函数

algorithm set_union() 函数

algorithm fill_n() 函数

algorithm nth_element() 函数