std::reverse_copy

 

C++

语言

概念

实用工具库

字符串库

集装箱库

算法库

迭代器库

Numerics的图书馆

输入/输出库

本地化库

正则表达式库 （C++11）

原子操作库 （C++11）

线程的支持库 （C++11）

 

算法库

功能 Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
修改序列操作 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of （C++11） （C++11） （C++11） for_each count count_if mismatch equal	find find_if find_if_not （C++11） find_end find_first_of adjacent_find search search_n
修改序列操作 Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if （C++11） copy_n （C++11） copy_backward move （C++11） move_backward （C++11） fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   （C++11） unique unique_copy
分区操作 Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned （C++11） partition partition_copy （C++11）	stable_partition partition_point （C++11）
排序操作（排序的区间） Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted （C++11） is_sorted_until （C++11） sort	partial_sort partial_sort_copy stable_sort nth_element
二进制搜索操作（排序的区间） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
设置操作（排序的区间） Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
堆的操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until （C++11） make_heap	push_heap pop_heap sort_heap
最小/最大操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax （C++11） minmax_element （C++11）	lexicographical_compare is_permutation （C++11） next_permutation prev_permutation
数字操作 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota （C++11） accumulate inner_product	adjacent_difference partial_sum
C库 Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template< class BidirIt, class OutputIt > OutputIt reverse_copy( BidirIt first, BidirIt last, OutputIt d_first );

范围从[first, last)元素，到另一个范围内以这样的方式开始于d_first，新的范围中的元素是在相反的顺序.

Original:

Copies the elements from the range [first, last), to another range beginning at d_first in such a way, that the elements in the new range are in reverse order.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

参数

first, last	-	元素的范围内，要复制的复本 Original: the range of elements to copy The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
d_first	-	的目标范围的开头 Original: the beginning of the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Type requirements
- BidirIt must meet the requirements of BidirectionalIterator.
- OutputIt must meet the requirements of OutputIterator.

返回值

输出迭代器复制过去的最后一个元素的元素

Original:

Output iterator to the element past the last element copied.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

可能的实现

template<class BidirIt, class OutputIt> OutputIt reverse_copy(BidirIt first, BidirIt last, OutputIt d_first) { while (first != last) { *(d_first++) = *(--last); } return d_first; }

为例

#include <vector>
#include <iostream>
#include <algorithm>
 
int main()
{
    std::vector<int> v({1,2,3});
    std::for_each(std::begin(v), std::end(v),
                  [&](int value){ std::cout << value << " "; });
    std::cout << std::endl;
 
    std::vector<int> destiny(3);
    std::reverse_copy(std::begin(v), std::end(v), std::begin(destiny));
    std::for_each(std::begin(destiny), std::end(destiny),
                  [&](int value){ std::cout << value << " "; });
    std::cout << std::endl;
}

Output:

1 2 3 
3 2 1

复杂性

线性first和last之间的距离

Original:

linear in the distance between first and last

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

另请参阅

reverse	在一定范围内的顺序颠倒元素 Original: reverses the order elements in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板）