C++ åèæå
- C++11
- C++14
- C++17
- C++20
- C++ ç¼è¯å¨æ¯ææ åµè¡¨
- ç¬ç«ä¸å®¿ä¸»å®ç°
- C++ è¯è¨
- C++ å ³é®è¯
- é¢å¤çå¨
- C++ æ ååºå¤´æä»¶
- å ·åè¦æ±
- åè½ç¹æ§æµè¯ (C++20)
- å·¥å ·åº
- ç±»åæ¯æï¼åºæ¬ç±»åãRTTIãç±»åç¹æ§ï¼
- æ¦å¿µåº (C++20)
- é误å¤ç
- 卿å å管ç
- æ¥æåæ¶é´å·¥å ·
- å符串åº
- 容å¨åº
- è¿ä»£å¨åº
- èå´åº (C++20)
- ç®æ³åº
- std::execution::sequenced_policy, std::execution::parallel_policy, std::execution::parallel_unsequenced_policy, std::execution::unsequenced_policy
- æå¶çº¦ç®æ³ (C++20 èµ·)
- std::sort
- std::reduce
- std::inclusive_scan
- std::exclusive_scan
- std::random_shuffle, std::shuffle
- std::clamp
- std::equal
- std::is_permutation
- std::mismatch
- std::swap
- std::search
- std::transform
- std::for_each
- std::make_heap
- std::ranges::all_of, std::ranges::any_of, std::ranges::none_of
- std::ranges::for_each
- std::ranges::count, std::ranges::count_if
- std::ranges::mismatch, std::ranges::mismatch_result
- std::ranges::find, std::ranges::find_if, std::ranges::find_if_not
- std::ranges::adjacent_find
- std::is_execution_policy
- std::execution::seq, std::execution::par, std::execution::par_unseq, std::execution::unseq
- std::all_of, std::any_of, std::none_of
- std::for_each_n
- std::count, std::count_if
- std::adjacent_find
- std::find, std::find_if, std::find_if_not
- std::find_end
- std::find_first_of
- std::search_n
- std::lexicographical_compare
- std::lexicographical_compare_three_way
- std::copy, std::copy_if
- std::copy_n
- std::copy_backward
- std::move
- std::move_backward
- std::shift_left, std::shift_right
- std::fill
- std::fill_n
- std::generate
- std::generate_n
- std::iter_swap
- std::swap_ranges
- std::sample
- std::remove, std::remove_if
- std::replace, std::replace_if
- std::reverse
- std::rotate
- std::unique
- std::remove_copy, std::remove_copy_if
- std::replace_copy, std::replace_copy_if
- std::reverse_copy
- std::rotate_copy
- std::unique_copy
- std::is_partitioned
- std::partition_point
- std::partition
- std::partition_copy
- std::stable_partition
- std::is_sorted
- std::is_sorted_until
- std::stable_sort
- std::partial_sort
- std::partial_sort_copy
- std::nth_element
- std::lower_bound
- std::upper_bound
- std::binary_search
- std::equal_range
- std::merge
- std::inplace_merge
- std::set_difference
- std::set_intersection
- std::set_symmetric_difference
- std::set_union
- std::includes
- std::is_heap
- std::is_heap_until
- std::sort_heap
- std::push_heap
- std::pop_heap
- std::max
- std::max_element
- std::min
- std::min_element
- std::minmax
- std::minmax_element
- std::next_permutation
- std::prev_permutation
- std::iota
- std::inner_product
- std::adjacent_difference
- std::accumulate
- std::transform_reduce
- std::partial_sum
- std::transform_inclusive_scan
- std::transform_exclusive_scan
- std::qsort
- std::bsearch
- 注é
- æ°å¼åº
- è¾å ¥/è¾åºåº
- æä»¶ç³»ç»åº
- æ¬å°ååº
- æ£å表达å¼åº
- ååæä½åº
- çº¿ç¨æ¯æåº
- å®éªæ§ C++ ç¹æ§
- æç¨çèµæº
- ç´¢å¼
- std 符å·ç´¢å¼
- åç¨æ¯æ (C++20)
- C++ å ³é®è¯
ä½ç½®ï¼é¦é¡µ > C++ åèæå >ç®æ³åº >æå¶çº¦ç®æ³ (C++20 èµ·) > std::ranges::count, std::ranges::count_if
std::ranges::count, std::ranges::count_if
class T, class Proj = std::identity >
requires std::indirect_binary_predicate<ranges::equal_to, std::projected<I, Proj>,
const T*>
constexpr std::iter_difference_t<I>
requires std::indirect_binary_predicate<ranges::equal_to,
std::projected<ranges::iterator_t<R>, Proj>,
const T*>
class Proj = std::identity,
std::indirect_unary_predicate<std::projected<I, Proj>> Pred >
constexpr std::iter_difference_t<I>
std::indirect_unary_predicate<std::projected<ranges::iterator_t<R>, Proj>> Pred >
constexpr ranges::range_difference_t<R>
è¿åèå´ [first, last) 䏿»¡è¶³ç¹å®å¤å«æ åççå
ç´ æ°ã
value çå
ç´ æ°ãp 对å
¶è¿å true çå
ç´ æ°ãr 为æºèå´ï¼å¦å以 ranges::begin(r) 为 first 并以 ranges::end(r) 为 last ãæ¤é¡µé¢ä¸æè¿°çä»¿å½æ°å®ä½æ¯ niebloid ï¼å³ï¼
- è°ç¨å®ä»¬ä¸çä»»ä½ä¸è æ¶ä¸å¯æå®æ¾å¼æ¨¡æ¿å®åã
- å®ä»¬æ ä¸å¯¹å®åä¾èµæ¥æ¾å¯è§ã
- å¨é常æ é宿¥æ¾å¯»æ¾å½æ°è°ç¨è¿ç®ç¬¦å·¦ä¾§çåç§°æ¾å°å®ä»¬ä¹ä¸æ¶ï¼å®ç¦æ¢å®åä¾èµæ¥æ¾ã
å®é ä¸ï¼å®ä»¬è½ä»¥å½æ°å¯¹è±¡ï¼æä»¥æäºç¹æ®ç¼è¯å¨æ©å±å®ç°ã
åæ°
| first, last | - | è¦æ£éªçå ç´ èå´ |
| r | - | è¦æ£éªçå ç´ èå´ |
| value | - | è¦æç´¢çå¼ |
| pred | - | åºç¨å°è¢«æå½±å ç´ çè°è¯ |
| proj | - | åºç¨å°å ç´ çæå½± |
è¿åå¼
èå´ä¸æ»¡è¶³æ¡ä»¶çå ç´ æ°ã
å¤æåº¦
åç¡®æ¯è¾ååºç¨æå½± last - first 次ã
注解
å¯¹äºæ ä»»ä½å¤å«æ åçèå´ä¸çå ç´ æ°ï¼è§ std::ranges::distance ã
å¯è½çå®ç°
| çæ¬ä¸ |
|---|
struct count_fn { template< std::input_iterator I, std::sentinel_for<I> S, class T, class Proj = std::identity > 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 T, class Proj = std::identity > 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; |
| çæ¬äº |
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 <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 << "number: " << target1 << " count: " << num_items1 << '\n'; std::cout << "number: " << target2 << " count: " << num_items2 << '\n'; // ç¨ lambda 表达å¼è®¡æ°è¢« 3 æ´é¤çå ç´ ã int num_items3 = ranges::count_if(v.begin(), v.end(), [](int i){return i % 3 == 0;}); std::cout << "number divisible by three: " << num_items3 << '\n'; // ç¨ lambda 表达å¼è®¡æ°è¢« 11 æ´é¤çå ç´ ã int num_items11 = ranges::count_if(v, [](int i){return i % 11 == 0;}); std::cout << "number divisible by eleven: " << num_items11 << '\n'; }
è¾åºï¼
number: 3 count: 2 number: 5 count: 0 number divisible by three: 3 number divisible by eleven: 0
