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::iota
std::iota
| å®ä¹äºå¤´æä»¶ <numeric>
|
||
| template< class ForwardIt, class T > void iota( ForwardIt first, ForwardIt last, T value ); |
(C++11 èµ·) (C++20 å) |
|
| template< class ForwardIt, class T > constexpr void iota( ForwardIt first, ForwardIt last, T value ); |
(C++20 èµ·) | |
以å§äº value å¹¶éå¤å°æ±å¼ ++value ç顺åºéå¢å¼å¡«å
èå´ [first, last) ã
çä»·æä½ï¼
*(d_first) = value; *(d_first+1) = ++value; *(d_first+2) = ++value; *(d_first+3) = ++value; ...
åæ°
| first, last | - | 以 value å¼å§ï¼æé¡ºåºéå¢å¡«å çå¼çèå´ |
| value | - | è¦åå¨çåå§å¼ï¼è¡¨è¾¾å¼ ++value å¿ é¡»ä¸ºè¯å¼ |
è¿åå¼
ï¼æ ï¼
å¤æåº¦
æ£å¥½ last - first 次èªå¢ä¸èµå¼ã
å¯è½çå®ç°
template<class ForwardIterator, class T> constexpr // C++20 èµ· void iota(ForwardIterator first, ForwardIterator last, T value) { while(first != last) { *first++ = value; ++value; } } |
注解
æ¤å½æ°å½åæ¥æºäºç¼ç¨è¯è¨ APL ä¸çæ´æ°å½æ° â³ ã宿¯ C++98 æä¸æ¾å å«ç STL ç»ä»¶ä¹ä¸ï¼ä½æç»äº C++11 è¿å ¥äºæ ååºã
示ä¾
ä¸å代ç åºç¨ std::shuffle å° std::list è¿ä»£å¨ç vector ï¼å 为ä¸è½ç´æ¥åºç¨ std::shuffle å° std::list ãç¨ std::iota å¡«å
äºä¸ªå®¹å¨ã
è¿è¡æ¤ä»£ç
#include <algorithm> #include <iostream> #include <list> #include <numeric> #include <random> #include <vector> Â int main() { std::list<int> l(10); std::iota(l.begin(), l.end(), -4); Â std::vector<std::list<int>::iterator> v(l.size()); std::iota(v.begin(), v.end(), l.begin()); Â std::shuffle(v.begin(), v.end(), std::mt19937{std::random_device{}()}); Â std::cout << "Contents of the list: "; for(auto n: l) std::cout << n << ' '; std::cout << '\n'; Â std::cout << "Contents of the list, shuffled: "; for(auto i: v) std::cout << *i << ' '; std::cout << '\n'; }
å¯è½çè¾åºï¼
Contents of the list: -4 -3 -2 -1 0 1 2 3 4 5 Contents of the list, shuffled: 0 -1 3 4 -4 1 -2 -3 2 5
åé
| å°ä¸ä¸ªç»å®å¼å¤å¶èµå¼ç»ä¸ä¸ªèå´å
çæ¯ä¸ªå
ç´ (彿°æ¨¡æ¿) | |
| å°ç¸ç»§ç彿°è°ç¨ç»æèµå¼ç»ä¸ä¸ªèå´ä¸çæ¯ä¸ªå
ç´ (彿°æ¨¡æ¿) |