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::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::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::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++ åèæå >ç®æ³åº > std::for_each
std::for_each
| å®ä¹äºå¤´æä»¶ <algorithm>
|
||
| (1) | ||
| template< class InputIt, class UnaryFunction > UnaryFunction for_each( InputIt first, InputIt last, UnaryFunction f ); |
(C++20 å) | |
| template< class InputIt, class UnaryFunction > constexpr UnaryFunction for_each( InputIt first, InputIt last, UnaryFunction f ); |
(C++20 èµ·) | |
| template< class ExecutionPolicy, class ForwardIt, class UnaryFunction2 > void for_each( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last, UnaryFunction2 f ); |
(2) | (C++17 èµ·) |
f å°è§£å¼ç¨èå´ [first, last) 䏿¯ä¸ªè¿ä»£å¨çç»æãf å°è§£å¼ç¨èå´ [first, last) 䏿¯ä¸ªè¿ä»£å¨çç»æï¼ä¸å¿
æé¡ºåºï¼ãæç
§ policy æ§è¡ç®æ³ãæ¤éè½½ä»
è¥ std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> 为 true æåä¸éè½½å³è®®ã对äºä¸¤ä¸ªéè½½ï¼è¥è¿ä»£å¨ç±»å为å¯åï¼å f å¯ä»¥éè¿è§£å¼ç¨åçè¿ä»£å¨ä¿®æ¹èå´çå
ç´ ãè¥ f è¿åç»æï¼å忽ç¥ç»æã
ä¸åäºå
¶ä½å¹¶è¡ç®æ³ï¼ä¸å
许 for_each å¤å¶åºåä¸çå
ç´ ï¼å³ä½¿å®ä»¬ä¸ºå¯å¹³å¡å¤å¶ã
åæ°
| first, last | - | è¦åºç¨å½æ°å°çèå´ |
| policy | - | æç¨çæ§è¡çç¥ãç»èè§æ§è¡çç¥ã |
| f | - | 彿°å¯¹è±¡ï¼è¦åºç¨äºè§£å¼ç¨èå´ [first, last) 䏿¯ä¸ªè¿ä»£å¨ç»æç彿°å½æ°ç¾ååºå½çä»·äºå¦ä¸è ï¼ Â void fun(const Type &a); ç¾åä¸å¿
æ¥æ const & ã â |
| ç±»åè¦æ± | ||
-InputIt å¿
须满足éçè¾å
¥è¿ä»£å¨ (LegacyInputIterator) çè¦æ±ã
| ||
-ForwardIt å¿
须满足éçååè¿ä»£å¨ (LegacyForwardIterator) çè¦æ±ã
| ||
-UnaryFunction å¿
须满足å¯ç§»å¨æé (MoveConstructible) çè¦æ±ãä¸å¿
为 å¯å¤å¶æé (CopyConstructible) ã
| ||
-UnaryFunction2 å¿
须满足å¯å¤å¶æé (CopyConstructible) çè¦æ±ã
| ||
è¿åå¼
f (C++11 å) std::move(f) (C++11 èµ·)å¤æåº¦
åç¡®åºç¨ last - first 次 f ã
å¼å¸¸
æ¥æå为 ExecutionPolicy çæ¨¡æ¿å½¢åçéè½½æä¸åæ¹å¼æ¥åé误ï¼
- è¥ä½ä¸ºç®æ³ä¸é¨åè°ç¨ç彿°çæ§è¡æåºå¼å¸¸ï¼ä¸
ExecutionPolicy为æ åçç¥ä¹ä¸ï¼åè°ç¨ std::terminate ã对äºä»»ä½å ¶ä»ExecutionPolicyï¼è¡ä¸ºæ¯å®ç°å®ä¹çã - è¥ç®æ³æ æ³åé å åï¼åæåº std::bad_alloc ã
å¯è½çå®ç°
template<class InputIt, class UnaryFunction> UnaryFunction for_each(InputIt first, InputIt last, UnaryFunction f) { for (; first != last; ++first) { f(*first); } return f; // C++11 èµ·éå¼ç§»å¨ } |
示ä¾
ä¸å代ç ç¨ lambda 彿°èªå¢ vector çææå
ç´ ï¼ç¶åç¨å½æ°å¯¹è±¡ä¸çéè½½ operator() 计ç®å
¶åãæ³¨ææ¨èç¨æ´éåçç®æ³ std::accumulate 计ç®åã
#include <vector> #include <algorithm> #include <iostream>  struct Sum { Sum(): sum{0} { } void operator()(int n) { sum += n; } int sum; };  int main() { std::vector<int> nums{3, 4, 2, 8, 15, 267};  auto print = [](const int& n) { std::cout << " " << n; };  std::cout << "before:"; std::for_each(nums.begin(), nums.end(), print); std::cout << '\n';  std::for_each(nums.begin(), nums.end(), [](int &n){ n++; });  // 对æ¯ä¸ªæ°è°ç¨ Sum::operator() Sum s = std::for_each(nums.begin(), nums.end(), Sum());  std::cout << "after: "; std::for_each(nums.begin(), nums.end(), print); std::cout << '\n'; std::cout << "sum: " << s.sum << '\n'; }
è¾åºï¼
before: 3 4 2 8 15 267 after: 4 5 3 9 16 268 sum: 305
åé
| å°ä¸ä¸ªå½æ°åºç¨äºæä¸èå´çå个å
ç´ ï¼å¹¶å¨ç®æ èå´åå¨ç»æ (彿°æ¨¡æ¿) | |
| èå´ for å¾ªç¯ | æ§è¡èå´ä¸çå¾ªç¯ (C++11 èµ·) |
| (C++17) |
åºç¨ä¸ä¸ªå½æ°å¯¹è±¡å°åºåçå n 个å
ç´ (彿°æ¨¡æ¿) |