std::all_of, std::any_of, std::none_of

 

C++

语言

概念

实用工具库

字符串库

集装箱库

算法库

迭代器库

Numerics库

输入/输出库

本地化库

正则表达式库 （C++11）

原子操作库 （C++11）

线程的支持库 （C++11）

 

算法库

功能 Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
修改序列操作 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of （C++11） （C++11） （C++11） for_each count count_if mismatch equal	find find_if find_if_not （C++11） find_end find_first_of adjacent_find search search_n
修改序列操作 Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if （C++11） copy_n （C++11） copy_backward move （C++11） move_backward （C++11） fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   （C++11） unique unique_copy
分区操作 Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned （C++11） partition partition_copy （C++11）	stable_partition partition_point （C++11）
排序操作（排序的区间） Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted （C++11） is_sorted_until （C++11） sort	partial_sort partial_sort_copy stable_sort nth_element
二进制搜索操作（排序的区间） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
设置操作（排序的区间） Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
堆的操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until （C++11） make_heap	push_heap pop_heap sort_heap
最小/最大操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax （C++11） minmax_element （C++11）	lexicographical_compare is_permutation （C++11） next_permutation prev_permutation
数字操作 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota （C++11） accumulate inner_product	adjacent_difference partial_sum
C库 Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template< class InputIt, class UnaryPredicate > bool all_of( InputIt first, InputIt last, UnaryPredicate p );	(1)	（C++11 起）
template< class InputIt, class UnaryPredicate > bool any_of( InputIt first, InputIt last, UnaryPredicate p );	(2)	（C++11 起）
template< class InputIt, class UnaryPredicate > bool none_of( InputIt first, InputIt last, UnaryPredicate p );	(3)	（C++11 起）

1)

一元谓词检查是否p回报true范围内的所有元素[first, last).

Original:

Checks if unary predicate p returns true for all elements in the range [first, last).

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

2)

一元谓词检查是否p回报true的范围内至少有一个元素[first, last).

Original:

Checks if unary predicate p returns true for at least one element in the range [first, last).

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

3)

一元谓词检查是否p回报true的范围内没有任何元素[first, last).

Original:

Checks if unary predicate p returns true for no elements in the range [first, last).

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

参数

first, last	-	检查的元素 Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
p	-	unary predicate . The signature of the predicate function should be equivalent to the following: bool pred(const Type &a); The signature does not need to have const &, but the function must not modify the objects passed to it. The type Type must be such that an object of type InputIt can be dereferenced and then implicitly converted to Type. ​
Type requirements
- InputIt must meet the requirements of InputIterator.

返回值

1)

true如果一元谓词返回true范围内的所有元素，false不然。返回true的范围内是空

Original:

true if unary predicate returns true for all elements in the range, false otherwise. Returns true if the range is empty.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

2)

true如果一元谓词返回true的范围内至少有一个元素，false不然。返回false的范围内是空

Original:

true if unary predicate returns true for at least one element in the range, false otherwise. Returns false if the range is empty.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

3)

true如果一元谓词返回true的范围内没有任何元素，false不然。返回true的范围内是空

Original:

true if unary predicate returns true for no elements in the range, false otherwise. Returns true if the range is empty.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

复杂性

在最last - first谓词的应用

Original:

At most last - first applications of the predicate

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

可能的实现

First version
template< class InputIt, class UnaryPredicate > bool all_of(InputIt first, InputIt last, UnaryPredicate p) { for (; first != last; ++first) { if (!p(*first)) return false; } return true; }
Second version
template< class InputIt, class UnaryPredicate > bool any_of(InputIt first, InputIt last, UnaryPredicate p) { for (; first != last; ++first) { if (p(*first)) return true; } return false; }
Third version
template< class InputIt, class UnaryPredicate > bool none_of(InputIt first, InputIt last, UnaryPredicate p) { for (; first != last; ++first) { if (p(*first)) return false; } return true; }

为例

#include <vector>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <iostream>
#include <functional>
 
int main()
{
    std::vector<int> v(10, 2);
    std::partial_sum(v.cbegin(), v.cend(), v.begin());
    std::cout << "Among the numbers: ";
    std::copy(v.cbegin(), v.cend(), std::ostream_iterator<int>(std::cout, " "));
    std::cout << '\n';
 
    if (std::all_of(v.cbegin(), v.cend(), [](int i){ return i % 2 == 0; })) {
        std::cout << "All numbers are even\n";
    }
    if (std::none_of(v.cbegin(), v.cend(), std::bind(std::modulus<int>(), 
                                                     std::placeholders::_1, 2))) {
        std::cout << "None of them are odd\n";
    }
    struct DivisibleBy
    {
        const int d;
        DivisibleBy(int n) : d(n) {}
        bool operator()(int n) const { return n % d == 0; }
    };
 
    if (std::any_of(v.cbegin(), v.cend(), DivisibleBy(7))) {
        std::cout << "At least one number is divisible by 7\n";
    }
}

Output:

Among the numbers: 2 4 6 8 10 12 14 16 18 20 
All numbers are even
None of them are odd
At least one number is divisible by 7