Iterator category tags in C++ are used to specify the capabilities of an iterator. They help algorithms determine what operations can be performed with the iterator. The main categories are:
std::input_iterator_tag
std::output_iterator_tag
std::forward_iterator_tag
std::bidirectional_iterator_tag
std::random_access_iterator_tag
std::contiguous_iterator_tag
For example, to create a forward iterator for a custom container, you can use std::forward_iterator_tag
. Here's how to implement it:
#include <iostream>
#include <string>
#include <iterator>
#include <stdexcept>
class Player {
public:
std::string Name;
};
class Party {
public:
Party(Player A, Player B, Player C)
: A{A}, B{B}, C{C} {}
Player A, B, C;
class Iterator {
public:
using iterator_category = std::forward_iterator_tag;
using value_type = Player;
using difference_type = std::ptrdiff_t;
using pointer = Player*;
using reference = Player&;
Iterator(Party* ptr, size_t idx)
: Party(ptr), idx(idx) {}
Player& operator*() const {
if (idx == 0) return Party->A;
if (idx == 1) return Party->B;
if (idx == 2) return Party->C;
throw std::out_of_range("Invalid index");
}
Iterator& operator++() {
++idx;
return *this;
}
bool operator==(const Iterator& other) const {
return Party == other.Party && idx == other.idx;
}
bool operator!=(const Iterator& other) const {
return !(*this == other);
}
private:
size_t idx;
Party* Party;
};
Iterator begin() { return Iterator(this, 0); }
Iterator end() { return Iterator(this, 3); }
};
int main() {
Party party{Player{"Anna"},
Player{"Bob"}, Player{"Cara"}};
for (Player& p : party) {
std::cout << p.Name << ", ";
}
}
Anna, Bob, Cara,
iterator_category
: Specifies that the Iterator
is a forward iterator.value_type
, difference_type
, pointer
, reference
: These typedefs provide information about the types used by the iterator.Using these tags and typedefs makes your iterator more compatible with the standard library algorithms and allows the compiler to optimize code based on the iterator's capabilities.
Answers to questions are automatically generated and may not have been reviewed.
A detailed guide to implementing a custom iterator type from scratch, using modern recommended techniques