Namespaces
Variants

std:: move_backward

From cppreference.net
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy , ranges::sort , ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
Modifying sequence operations
Copy operations
(C++11)
(C++11)
move_backward
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17) (C++11)
(C++20) (C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
定义于头文件 <algorithm>
template < class BidirIt1, class BidirIt2 >
BidirIt2 move_backward ( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ) ;
(C++11 起)
(C++20 起为 constexpr)

将范围 [ first , last ) 中的元素移动到以 d_last 结尾的另一个范围。元素以逆序方式移动(最后一个元素首先被移动),但它们的相对顺序保持不变。

如果 d_last 位于 ( first , last ] 区间内,则行为未定义。此种情况下,可改用 std::move

目录

参数

first, last - 定义待移动元素源 范围 的迭代器对
d_last - 目标范围的结束位置
类型要求
-
BidirIt1, BidirIt2 必须满足 LegacyBidirectionalIterator 的要求。

返回值

指向目标范围内最后一个被移动元素的迭代器。

复杂度

恰好执行 std:: distance ( first, last ) 次移动赋值操作。

可能的实现

template<class BidirIt1, class BidirIt2>
BidirIt2 move_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last)
{
    while (first != last)
        *(--d_last) = std::move(*(--last));
    return d_last;
}

注释

当移动重叠范围时,若目标范围的起始位置位于源范围之外(向左移动),适合使用 std::move ;若目标范围的结束位置位于源范围之外(向右移动),则适合使用 std::move_backward

示例

#include <algorithm>
#include <iostream>
#include <iterator>
#include <string>
#include <string_view>
#include <vector>
using container = std::vector<std::string>;
void print(std::string_view comment, const container& src, const container& dst = {})
{
    auto prn = [](std::string_view name, const container& cont)
    {
        std::cout << name;
        for (const auto &s : cont)
            std::cout << (s.empty() ? "∙" : s.data()) << ' ';
        std::cout << '\n';
    };
    std::cout << comment << '\n';
    prn("src: ", src);
    if (dst.empty())
        return;
    prn("dst: ", dst);
}
int main()
{
    container src{"foo", "bar", "baz"};
    container dst{"qux", "quux", "quuz", "corge"};
    print("Non-overlapping case; before move_backward:", src, dst);
    std::move_backward(src.begin(), src.end(), dst.end());
    print("After:", src, dst);
    src = {"snap", "crackle", "pop", "lock", "drop"};
    print("Overlapping case; before move_backward:", src);
    std::move_backward(src.begin(), std::next(src.begin(), 3), src.end());
    print("After:", src);
}

输出:

Non-overlapping case; before move_backward:
src: foo bar baz
dst: qux quux quuz corge
After:
src: ∙ ∙ ∙
dst: qux foo bar baz
Overlapping case; before move_backward:
src: snap crackle pop lock drop
After:
src: ∙ ∙ snap crackle pop

参见

(C++11)
将元素范围移动到新位置
(函数模板)
以逆序将元素范围移动到新位置
(算法函数对象)