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::transform_exclusive_scan
std::transform_exclusive_scan
| å®ä¹äºå¤´æä»¶ <numeric>
|
||
| (1) | ||
| template< class InputIt, class OutputIt, class T, Â Â Â Â Â class BinaryOperation, class UnaryOperation> |
(C++17 èµ·) (C++20 å) |
|
| template< class InputIt, class OutputIt, class T, Â Â Â Â Â class BinaryOperation, class UnaryOperation> |
(C++20 èµ·) | |
| template< class ExecutionPolicy, Â Â Â Â Â class ForwardIt1, class ForwardIt2, |
(2) | (C++17 èµ·) |
以 unary_op 忢èå´ [first, last) ä¸çæ¯ä¸ªå
ç´ ï¼ç¶åå¨ç»æèå´ä¸ç¨ binary_op 以 init 为åå¼è®¡ç®æé¤åç¼åï¼å¹¶åå
¥ç»æå°å§äº d_first çèå´ãâæé¤â表示第 i 个å
ç´ ä¸å
å«äºç¬¬ i 个åã
å½¢å¼ä¸ï¼å¯¹äºæ¯ä¸ª [first, first + (i - d_first)) ä¸ç j ï¼éè¿ [d_first, d_first + (last - first)) 䏿¯ä¸ª i èµ init, unary_op(*j)... å¨ binary_op ä¸ç广ä¹é交æ¢åçå¼ï¼
å
¶ä¸å¹¿ä¹é交æ¢å GNSUM(op, a
1, ..., a
N) å®ä¹å¦ä¸ï¼
- è¥ N=1 ï¼å为 a
1 - è¥ N > 1 ï¼å为 op(GNSUM(op, a
1, ..., a
K), GNSUM(op, a
M, ..., a
N)) å¯¹äº 1 < K+1 = M ⤠N ä¸çä»»ä½ K
æ¢è¨ä¹ï¼åè¿ç®è½ä»¥ä»»æé¡ºåºè¿è¡ï¼ä¸è¥ binary_op éç»åï¼åè¡ä¸ºæ¯éç¡®å®çã
éè½½ (2) æç
§ policy æ§è¡ï¼ä¸ä»
è¥ std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> 为 true æåä¸éè½½å³è®®ã
unary_op ä¸ binary_op ä¸åºéæ³åèå´ [first, last) æ [d_first, d_first + (last - first)) ä¸çè¿ä»£å¨ï¼å
å«å°¾è¿ä»£å¨ï¼æåèå´ï¼æä¿®æ¹å
¶ä¸çå
ç´ ãå¦åè¡ä¸ºæªå®ä¹ã
åæ°
| first, last | - | è¦æ±åçèå´ |
| d_first | - | ç®æ èå´çèµ·å§ï¼å¯ä»¥çäº first
|
| policy | - | æç¨çæ§è¡çç¥ãç»èè§æ§è¡çç¥ã |
| init | - | åå¼ |
| unary_op | - | ä¸å
彿°å¯¹è±¡ (FunctionObject) ï¼å°è¦è¢«åºç¨å°è¾å
¥èå´ä¸çæ¯ä¸ªå
ç´ ãè¿åç±»åå¿
须坿¥å为 binary_op çè¾å
¥ã
|
| binary_op | - | äºå
彿°å¯¹è±¡ (FunctionObject) ï¼å°åºç¨äº unary_op çç»æãå
¶ä» binary_op çç»æï¼è¿æ init ã
|
| ç±»åè¦æ± | ||
-InputIt å¿
须满足éçè¾å
¥è¿ä»£å¨ (LegacyInputIterator) çè¦æ±ã
| ||
-OutputIt å¿
须满足éçè¾åºè¿ä»£å¨ (LegacyOutputIterator) çè¦æ±ã
| ||
-ForwardIt1, ForwardIt2 å¿
须满足éçååè¿ä»£å¨ (LegacyForwardIterator) çè¦æ±ã
| ||
-T å¿
须满足å¯ç§»å¨æé (MoveConstructible) çè¦æ±ãbinary_op(init, unary_op(*first)) ã binary_op(init, init) å binary_op(unary_op(*first), unary_op(*first)) é½å¿
é¡»å¯è½¬æ¢ä¸º T ã
| ||
è¿åå¼
æåæååå ¥å ç´ åä¸ä½ç½®å ç´ çè¿ä»£å¨ã
å¤æåº¦
åºç¨ O(last - first) 次 binary_op å unary_op ã
å¼å¸¸
æ¥æå为 ExecutionPolicy çæ¨¡æ¿å½¢åçéè½½æä¸åæ¹å¼æ¥åé误ï¼
- è¥ä½ä¸ºç®æ³ä¸é¨åè°ç¨ç彿°çæ§è¡æåºå¼å¸¸ï¼ä¸
ExecutionPolicy为æ åçç¥ä¹ä¸ï¼åè°ç¨ std::terminate ã对äºä»»ä½å ¶ä»ExecutionPolicyï¼è¡ä¸ºæ¯å®ç°å®ä¹çã - è¥ç®æ³æ æ³åé å åï¼åæåº std::bad_alloc ã
注解
ä¸åºç¨ unary_op å° init ã
示ä¾
#include <functional> #include <iostream> #include <iterator> #include <numeric> #include <vector> Â int main() { auto times_10 = [](int x) { return x * 10; }; std::vector data {3, 1, 4, 1, 5, 9, 2, 6}; Â std::cout << "10 times exclusive sum: "; std::transform_exclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " "), 0, std::plus<int>{}, times_10); std::cout << "\n10 times inclusive sum: "; std::transform_inclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " "), std::plus<int>{}, times_10); }
è¾åºï¼
10 times exclusive sum: 0 30 40 80 90 140 230 250 10 times inclusive sum: 30 40 80 90 140 230 250 310
åé
| 计ç®èå´å
å
ç´ çé¨åå (彿°æ¨¡æ¿) | |
| (C++17) |
类似 std::partial_sumï¼ç¬¬ i 个å䏿é¤ç¬¬ i 个è¾å
¥ (彿°æ¨¡æ¿) |
| (C++17) |
åºç¨ä¸ä¸ªå½æ°å¯¹è±¡ï¼ç¶åè¿è¡å
嫿«æ (彿°æ¨¡æ¿) |