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::copy_backward
std::copy_backward
| å®ä¹äºå¤´æä»¶ <algorithm>
|
||
| template< class BidirIt1, class BidirIt2 > BidirIt2 copy_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); |
(C++20 å) | |
| template< class BidirIt1, class BidirIt2 > constexpr BidirIt2 copy_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); |
(C++20 èµ·) | |
å¤å¶æ¥èª [first, last) æå®ä¹èå´çå
ç´ ï¼å°ç»äº d_last çèå´ã以éåºå¤å¶å
ç´ ï¼é¦å
å¤å¶æ«å
ç´ ï¼ï¼ä½ä¿æå
¶ç¸å¯¹é¡ºåºã
è¥ d_last å¨ (first, last] ä¸åè¡ä¸ºæªå®ä¹ã该æ
åµä¸å¿
é¡»ç¨ std::copy å代 std::copy_backward ã
åæ°
| first, last | - | è¦å¤å¶çå ç´ èå´ |
| d_last | - | ç®æ èå´çç»å°¾ã |
| ç±»åè¦æ± | ||
-BidirIt å¿
须满足éçååè¿ä»£å¨ (LegacyBidirectionalIterator) çè¦æ±ã
| ||
è¿åå¼
æåæåå¤å¶å ç´ çè¿ä»£å¨ã
å¤æåº¦
åç¡®èµå¼ last - first 次ã
注æ
å¤å¶éå çèå´æ¶ï¼ std::copy å¨å¤å¶å°å·¦ä¾§ï¼ç®æ èå´çèµ·å§å¨æºèå´å¤ï¼æ¶éåï¼è std::copy_backward å¨å¤å¶å°å³ä¾§ï¼ç®æ èå´çç»å°¾å¨æºèå´å¤ï¼æ¶éåã
å¯è½çå®ç°
template< class BidirIt1, class BidirIt2 > BidirIt2 copy_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last) { while (first != last) { *(--d_last) = *(--last); } return d_last; } |
示ä¾
è¿è¡æ¤ä»£ç
#include <algorithm> #include <iostream> #include <vector> Â int main() { std::vector<int> from_vector; for (int i = 0; i < 10; i++) { from_vector.push_back(i); } Â std::vector<int> to_vector(15); Â std::copy_backward(from_vector.begin(), from_vector.end(), to_vector.end()); Â std::cout << "to_vector contains: "; for (auto i: to_vector) { std::cout << i << " "; } }
è¾åºï¼
to_vector contains: 0 0 0 0 0 0 1 2 3 4 5 6 7 8 9
åé
| (C++11) |
å°æä¸èå´çå
ç´ å¤å¶å°ä¸ä¸ªæ°çä½ç½® (彿°æ¨¡æ¿) |