Movement Algorithms

Handling Overlapping Ranges

How do you handle overlapping ranges when using std::ranges::move()?

Abstract art representing computer programming

When using std::ranges::move(), handling overlapping ranges can be tricky because it can lead to undefined behavior if not managed correctly.

The key is to ensure that the destination range does not overlap with the source range in a way that would overwrite elements that are yet to be moved.

Using std::ranges::move_backward()

One effective way to handle overlapping ranges is to use std::ranges::move_backward() instead of std::ranges::move().

This algorithm moves elements from right to left, which helps avoid overwriting elements that haven't been moved yet.

Here's an example:

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
  std::vector<int> values{1, 2, 3, 4, 5};

  // Move elements two positions to the right
                             values.begin() + 3,

  for (const auto& value : values) {
    std::cout << value << ", ";
1, 2, 1, 2, 3,

In this example, move_backward() is used to shift elements to the right without causing overlap issues.


If moving left, use std::ranges::move():

  container.begin() + 2,

If moving right, use std::ranges::move_backward():

  container.end() - 2,


When dealing with overlapping ranges, std::ranges::move_backward() is often the safer choice to ensure elements are moved correctly without causing undefined behavior.

By moving elements from right to left, it prevents the overwriting of elements that are yet to be moved.

Answers to questions are automatically generated and may not have been reviewed.

Free, Unlimited Access

Professional C++

Comprehensive course covering advanced concepts, and how to use them on large-scale projects.

Screenshot from Warhammer: Total War
Screenshot from Tomb Raider
Screenshot from Jedi: Fallen Order
Contact|Privacy Policy|Terms of Use
Copyright © 2024 - All Rights Reserved