It is a pointer-like object that can be incremented with ++, dereferenced with *, and compared against another iterator with !=
Categories category properties valid expressions all categories copy-constructible, copy-assignable and destructibleX b(a);
b = a;
It can be incremented++a
a++
Random Access Bidirectional Forward Input It supports equality/inequality comparisonsa == b
a != b
It can be dereferenced as an rvalue*a
a->m
OutputIt can be dereferenced as an lvalue
(only for mutable iterator types)
*a = t
*a++ = t
default-constructibleX a;
X()
Multi-pass: neither dereferencing nor incrementing affects dereferenceability{ b = a; *a++; *b; } It can be decremented
--a
a--
*a--
It supports arithmetic operators + and -a + n
n + a
a - n
a - b
It supports inequality comparisons ( <, >, <= and >=) between iteratorsa < b
a > b
a <= b
a >= b
It supports compound assignment operations += and -=a += n
a -= n
It supports offset dereference operator ([]) a[n] Functions Sr.No. Functions & Description 1 advanceIt advances the iterator it by n element positions.
2 distanceIt returns distance between iterators.
3 beginIt is used to begin an iterator.
4 endIt is used to end an iterator.
5 prevIt is used to get iterator to previous element.
6 nextIt is used to get iterator to next element.
Iterator generators Classes Predefined iterators Category tagsRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4