(Sequences will actually insert a copy of the value before the iterator's position.)
Tip: Using the inserter function to create these iterators can save typing.
Definition at line 536 of file stl_iterator.h.
typedef _Container container_type |
A nested typedef for the type of whatever container you used.
Definition at line 545 of file stl_iterator.h.
typedef _Distance difference_type [inherited] |
Distance between iterators is represented as this type.
Reimplemented in reverse_iterator.
Definition at line 113 of file stl_iterator_base_types.h.
typedef _Category iterator_category [inherited] |
typedef _Pointer pointer [inherited] |
This type represents a pointer-to-value_type.
Reimplemented in reverse_iterator.
Definition at line 115 of file stl_iterator_base_types.h.
typedef _Reference reference [inherited] |
This type represents a reference-to-value_type.
Reimplemented in reverse_iterator.
Definition at line 117 of file stl_iterator_base_types.h.
typedef _Tp value_type [inherited] |
insert_iterator | ( | _Container & | __x, | |
typename _Container::iterator | __i | |||
) | [inline] |
The only way to create this iterator is with a container and an initial position (a normal iterator into the container).
Definition at line 551 of file stl_iterator.h.
insert_iterator& operator* | ( | ) | [inline] |
insert_iterator& operator++ | ( | int | ) | [inline] |
Simply returns *this. (This iterator does not "move".).
Definition at line 597 of file stl_iterator.h.
insert_iterator& operator++ | ( | ) | [inline] |
Simply returns *this. (This iterator does not "move".).
Definition at line 592 of file stl_iterator.h.
insert_iterator& operator= | ( | const typename _Container::const_reference | __value | ) | [inline] |
value | An instance of whatever type container_type::const_reference is; presumably a reference-to-const T for container<T>. |
The position is maintained such that subsequent assignments will insert values immediately after one another. For example,
// vector v contains A and Z insert_iterator i (v, ++v.begin()); i = 1; i = 2; i = 3; // vector v contains A, 1, 2, 3, and Z
Definition at line 578 of file stl_iterator.h.