std::ranges::count, std::ranges::count_if
在标头 <algorithm> 定义
|
||
调用签名 |
||
(1) | ||
template< std::input_iterator I, std::sentinel_for<I> S, class T, class Proj = std::identity > |
(C++20 起) (C++26 前) |
|
template< std::input_iterator I, std::sentinel_for<I> S, class Proj = std::identity, |
(C++26 起) | |
(2) | ||
template< ranges::input_range R, class T, class Proj = std::identity > requires std::indirect_binary_predicate |
(C++20 起) (C++26 前) |
|
template< ranges::input_range R, class Proj = std::identity, class T = std::projected_value_t<ranges::iterator_t<R>, Proj> > |
(C++26 起) | |
template< std::input_iterator I, std::sentinel_for<I> S, class Proj = std::identity, |
(3) | (C++20 起) |
template< ranges::input_range R, class Proj = std::identity, std::indirect_unary_predicate< |
(4) | (C++20 起) |
返回范围 [
first,
last)
中满足特定判别标准的元素数。
此页面上描述的函数式实体是 niebloid,即:
实践中,可以作为函数对象,或者用某些特殊编译器扩展实现它们。
参数
first, last | - | 要检验的元素范围 |
r | - | 要检验的元素范围 |
value | - | 要搜索的值 |
pred | - | 应用到被投影元素的谓词 |
proj | - | 应用到元素的投影 |
返回值
范围中满足条件的元素数。
复杂度
准确 last - first 次比较和投影。
注解
对于无任何判别标准的范围中的元素数,见 std::ranges::distance 。
功能特性测试宏 | 值 | 标准 | 功能特性 |
---|---|---|---|
__cpp_lib_algorithm_default_value_type |
202403 | (C++26) | 算法中的列表初始化 (1,2) |
可能的实现
count (1) |
---|
struct count_fn { template<std::input_iterator I, std::sentinel_for<I> S, class Proj = std::identity, class T = std::projected_value_t<I, Proj>> requires std::indirect_binary_predicate<ranges::equal_to, std::projected<I, Proj>, const T*> constexpr std::iter_difference_t<I> operator()(I first, S last, const T& value, Proj proj = {}) const { std::iter_difference_t<I> counter = 0; for (; first != last; ++first) if (std::invoke(proj, *first) == value) ++counter; return counter; } template<ranges::input_range R, class Proj = std::identity class T = std::projected_value_t<ranges::iterator_t<R>, Proj>> requires std::indirect_binary_predicate<ranges::equal_to, std::projected<ranges::iterator_t<R>, Proj>, const T*> constexpr ranges::range_difference_t<R> operator()(R&& r, const T& value, Proj proj = {}) const { return (*this)(ranges::begin(r), ranges::end(r), value, std::ref(proj)); } }; inline constexpr count_fn count; |
count_if (3) |
struct count_if_fn { template<std::input_iterator I, std::sentinel_for<I> S, class Proj = std::identity, std::indirect_unary_predicate<std::projected<I, Proj>> Pred> constexpr std::iter_difference_t<I> operator()(I first, S last, Pred pred, Proj proj = {}) const { std::iter_difference_t<I> counter = 0; for (; first != last; ++first) if (std::invoke(pred, std::invoke(proj, *first))) ++counter; return counter; } template<ranges::input_range R, class Proj = std::identity, std::indirect_unary_predicate< std::projected<ranges::iterator_t<R>, Proj>> Pred> constexpr ranges::range_difference_t<R> operator()(R&& r, Pred pred, Proj proj = {}) const { return (*this)(ranges::begin(r), ranges::end(r), std::ref(pred), std::ref(proj)); } }; inline constexpr count_if_fn count_if; |
示例
#include <algorithm> #include <cassert> #include <complex> #include <iostream> #include <vector> int main() { std::vector<int> v{1, 2, 3, 4, 4, 3, 7, 8, 9, 10}; namespace ranges = std::ranges; // 确定 std::vector 中有多少整数匹配目标值。 int target1 = 3; int target2 = 5; int num_items1 = ranges::count(v.begin(), v.end(), target1); int num_items2 = ranges::count(v, target2); std::cout << "数字:" << target1 << " 计数:" << num_items1 << '\n'; std::cout << "数字:" << target2 << " 计数:" << num_items2 << '\n'; // 用 lambda 表达式计数被 3 整除的元素。 int num_items3 = ranges::count_if(v.begin(), v.end(), [](int i){ return i % 3 == 0; }); std::cout << "可以被 3 整除的数字:" << num_items3 << '\n'; // 用 lambda 表达式计数被 11 整除的元素。 int num_items11 = ranges::count_if(v, [](int i){ return i % 11 == 0; }); std::cout << "可以被 11 整除的数字:" << num_items11 << '\n'; std::vector<std::complex<double>> nums{{4, 2}, {1, 3}, {4, 2}}; #ifdef __cpp_lib_algorithm_default_value_type auto c = ranges::count(nums, {4, 2}); #else auto c = ranges::count(nums, std::complex<double>{4, 2}); #endif assert(c == 2); }
输出:
数字:3 计数:2 数字:5 计数:0 可以被 3 整除的数字:3 可以被 11 整除的数字:0
参阅
(C++20) |
返回迭代器与哨位间的距离,或范围起始与结尾间的距离 (niebloid) |
(C++20) |
从迭代器和计数创建子范围 (定制点对象) |
由 range 中满足某个谓词的元素构成的 view (类模板) (范围适配器对象) | |
返回满足指定判别标准的元素数 (函数模板) |