Use replace() with non-random access iterators

Yes, std::ranges::replace() can be used with containers that do not support random access iterators.

This includes containers like std::list or std::forward_list. The std::ranges::replace() algorithm works with any container that provides input iterators.

Here's an example using std::list:

1#include <algorithm>
2#include <iostream>
3#include <list>
4
5int main() {
6  std::list<int> Source{1, 2, 3, 3, 3, 4, 5};
7
8  std::ranges::replace(Source, 3, 0);
9
10  std::cout << "Modified list: ";
11  for (const auto &num : Source) {
12    std::cout << num << ", ";
13  }
14}

1Modified list: 1, 2, 0, 0, 0, 4, 5,

Using std::ranges::replace() with Different Containers

1. The std::list container: Supports bidirectional iterators, allowing std::ranges::replace() to traverse and modify elements.
2. The std::forward_list container: Supports forward iterators, making it compatible with std::ranges::replace().

Example with std::forward_list:

1#include <algorithm>
2#include <forward_list>
3#include <iostream>
4
5int main() {
6  std::forward_list<int> Source{
7    1, 2, 3, 3, 3, 4, 5};
8
9  std::ranges::replace(Source, 3, 0);
10
11  std::cout << "Modified forward_list: ";
12  for (const auto &num : Source) {
13    std::cout << num << ", ";
14  }
15}

1Modified forward_list: 1, 2, 0, 0, 0, 4, 5,

Considerations

• Performance: While std::ranges::replace() works with non-random access iterators, the performance may differ compared to random access containers like std::vector.
• Algorithm Compatibility: Ensure the container type supports the operations required by the algorithm. For instance, containers must allow traversal and element modification through iterators.

Using std::ranges::replace() with non-random access iterators expands its versatility, making it applicable to a wide range of container types in C++.