All Iterator Adapters

Reverse and move adapters

• std::reverse_iterator
• std::move_iterator
• reverse-iterator helpers such as rbegin and rend

Insert iterators

• std::back_insert_iterator
• std::front_insert_iterator
• std::insert_iterator
• helpers back_inserter, front_inserter, inserter

Stream iterators

• std::istream_iterator
• std::ostream_iterator
• std::istreambuf_iterator
• std::ostreambuf_iterator

Practical rules

• Insert iterators are the clean bridge between algorithms and container growth.
• move_iterator changes value category behavior, not ownership by itself.
• Stream iterators are convenient but carry stream-state and formatting costs.

Small worked examples

#include <algorithm>
#include <iterator>
#include <vector>

int main() {
	std::vector<int> source{1, 2, 3};
	std::vector<int> dest;
	std::copy(source.begin(), source.end(), std::back_inserter(dest));
	return dest.back();
}

Use back_inserter when an algorithm should grow the destination container instead of assuming preallocated output space.

std::vector<std::string> src{"Ada", "Grace"};
std::vector<std::string> dst;
std::move(std::make_move_iterator(src.begin()),
		  std::make_move_iterator(src.end()),
		  std::back_inserter(dst));

Use move_iterator when the algorithm should move from the source range instead of copying.

Adapter selection guide

• use insert iterators when algorithms must append or insert into a container that grows
• use reverse iterators when the logical traversal direction is backward
• use move iterators when the algorithm should preserve move semantics across a generic range operation
• use stream iterators for compact I/O pipelines, but prefer clearer loops when error handling or formatting rules matter

Related pages

• Header reference: <iterator>
• All range algorithms
• All stream types and I/O facilities