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
std::transform
| å®ä¹äºå¤´æä»¶ <algorithm>
|
||
| (1) | ||
| template< class InputIt, class OutputIt, class UnaryOperation > OutputIt transform( InputIt first1, InputIt last1, OutputIt d_first, |
(C++20 å) | |
| template< class InputIt, class OutputIt, class UnaryOperation > constexpr OutputIt transform( InputIt first1, InputIt last1, OutputIt d_first, |
(C++20 èµ·) | |
| template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class UnaryOperation > ForwardIt2 transform( ExecutionPolicy&& policy, ForwardIt1 first1, ForwardIt1 last1, |
(2) | (C++17 èµ·) |
| (3) | ||
| template< class InputIt1, class InputIt2, class OutputIt, class BinaryOperation > OutputIt transform( InputIt1 first1, InputIt1 last1, InputIt2 first2, |
(C++20 å) | |
| template< class InputIt1, class InputIt2, class OutputIt, class BinaryOperation > constexpr OutputIt transform( InputIt1 first1, InputIt1 last1, InputIt2 first2, |
(C++20 èµ·) | |
| template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class ForwardIt3, class BinaryOperation > ForwardIt3 transform( ExecutionPolicy&& policy, ForwardIt1 first1, ForwardIt1 last1, |
(4) | (C++17 èµ·) |
std::transform åºç¨ç»å®ç彿°å°èå´å¹¶åå¨ç»æäºå§äº d_first çå¦ä¸èå´ã
unary_op å° [first1, last1) æå®ä¹çèå´ãbinary_op å°æ¥èªäºä¸ªèå´çå
ç´ å¯¹ï¼ä¸ä¸ªä»¥ [first1, last1) å®ä¹ï¼èå¦ä¸ä¸ªå§äº first2 ãpolicy æ§è¡ãè¿äºéè½½ä»
è¥ std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> 为 true æåä¸éè½½å³è®®ã
|
|
(C++11 å) |
|
|
(C++11 èµ·) |
åæ°
| first1, last1 | - | è¦åæ¢ç第ä¸å ç´ èå´ |
| first2 | - | è¦åæ¢ç第äºå ç´ èå´çèµ·å§ |
| d_first | - | ç®æ èå´çèµ·å§ï¼å¯ä»¥çäº first1 æ first2
|
| policy | - | æç¨çæ§è¡çç¥ãç»èè§æ§è¡çç¥ã |
| unary_op | - | å°è¦åºç¨çä¸å
ç®ç¬¦å½æ°ã 彿°ç¾ååºçä»·äºå¦ä¸è ï¼ Â Ret fun(const Type &a); ç¾åä¸å¿
æ const & ã |
| binary_op | - | 被使ç¨çäºå
彿°å¯¹è±¡ã è¯¥å½æ°çç¾ååºå½çä»·äºï¼  Ret fun(const Type1 &a, const Type2 &b); ç¾åä¸å¹¶ä¸éè¦æ const &ã |
| ç±»åè¦æ± | ||
-InputIt, InputIt1, InputIt2 å¿
须满足éçè¾å
¥è¿ä»£å¨ (LegacyInputIterator) çè¦æ±ã
| ||
-OutputIt å¿
须满足éçè¾åºè¿ä»£å¨ (LegacyOutputIterator) çè¦æ±ã
| ||
-ForwardIt1, ForwardIt2, ForwardIt3 å¿
须满足éçååè¿ä»£å¨ (LegacyForwardIterator) çè¦æ±ã
| ||
è¿åå¼
æåæåä¸ä¸ªåæ¢çå ç´ çè¾åºè¿ä»£å¨ã
å¤æåº¦
å¼å¸¸
æ¥æå为 ExecutionPolicy çæ¨¡æ¿å½¢åçéè½½æä¸åæ¹å¼æ¥åé误ï¼
- è¥ä½ä¸ºç®æ³ä¸é¨åè°ç¨ç彿°çæ§è¡æåºå¼å¸¸ï¼ä¸
ExecutionPolicy为æ åçç¥ä¹ä¸ï¼åè°ç¨ std::terminate ã对äºä»»ä½å ¶ä»ExecutionPolicyï¼è¡ä¸ºæ¯å®ç°å®ä¹çã - è¥ç®æ³æ æ³åé å åï¼åæåº std::bad_alloc ã
å¯è½çå®ç°
| çæ¬ä¸ |
|---|
template<class InputIt, class OutputIt, class UnaryOperation> OutputIt transform(InputIt first1, InputIt last1, OutputIt d_first, UnaryOperation unary_op) { while (first1 != last1) { *d_first++ = unary_op(*first1++); } return d_first; } |
| çæ¬äº |
template<class InputIt1, class InputIt2, class OutputIt, class BinaryOperation> OutputIt transform(InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt d_first, BinaryOperation binary_op) { while (first1 != last1) { *d_first++ = binary_op(*first1++, *first2++); } return d_first; } |
注æ
std::transform ä¸ä¿è¯æé¡ºåºåºç¨ unary_op æ binary_op ã为æé¡ºåºåºç¨å½æ°å°æ°åï¼æåºç¨ä¿®æ¹åºåå
ç´ ç彿°ï¼åºä½¿ç¨ std::for_each ã
示ä¾
ä¸å代ç ç¨ transform ï¼ä»¥ toupper 彿°åä½è½¬æ¢å符串为大åï¼ç¶åè½¬æ¢æ¯ä¸ªåç¬¦ä¸ºå ¶åºæ°å¼ï¼
#include <algorithm> #include <cctype> #include <iostream> #include <string> #include <vector> Â int main() { std::string s("hello"); std::transform(s.begin(), s.end(), s.begin(), [](unsigned char c) -> unsigned char { return std::toupper(c); }); Â std::vector<std::size_t> ordinals; std::transform(s.begin(), s.end(), std::back_inserter(ordinals), [](unsigned char c) -> std::size_t { return c; }); Â std::cout << s << ':'; for (auto ord : ordinals) { std::cout << ' ' << ord; } }
è¾åºï¼
HELLO: 72 69 76 76 79
åé
| åºç¨å½æ°å°èå´ä¸çå
ç´ (彿°æ¨¡æ¿) |