#include <stl_iterator.h>
Inheritance diagram for std::insert_iterator< Container >:
Public Types | |
typedef Container | container_type |
A nested typedef for the type of whatever container you used. | |
typedef output_iterator_tag | iterator_category |
One of the tag types. | |
typedef void | value_type |
The type "pointed to" by the iterator. | |
typedef void | difference_type |
Distance between iterators is represented as this type. | |
typedef void | pointer |
This type represents a pointer-to-value_type. | |
typedef void | reference |
This type represents a reference-to-value_type. | |
Public Member Functions | |
insert_iterator (Container &x, typename Container::iterator __i) | |
insert_iterator & | operator= (const typename Container::const_reference value) |
insert_iterator & | operator * () |
Simply returns *this. | |
insert_iterator & | operator++ () |
Simply returns *this. (This iterator does not "move".). | |
insert_iterator & | operator++ (int) |
Simply returns *this. (This iterator does not "move".). |
These are output iterators, constructed from a container-of-T. Assigning a T to the iterator inserts it in the container at the iterator's position, rather than overwriting the value at that position.
(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 489 of file stl_iterator.h.
|
A nested typedef for the type of whatever container you used.
Definition at line 498 of file stl_iterator.h. |
|
Distance between iterators is represented as this type.
Definition at line 113 of file stl_iterator_base_types.h. |
|
One of the tag types.
Definition at line 109 of file stl_iterator_base_types.h. |
|
This type represents a pointer-to-value_type.
Definition at line 115 of file stl_iterator_base_types.h. |
|
This type represents a reference-to-value_type.
Definition at line 117 of file stl_iterator_base_types.h. |
|
The type "pointed to" by the iterator.
Definition at line 111 of file stl_iterator_base_types.h. |
|
The only way to create this iterator is with a container and an initial position (a normal iterator into the container). Definition at line 504 of file stl_iterator.h. |
|
Simply returns *this.
Definition at line 540 of file stl_iterator.h. |
|
Simply returns *this. (This iterator does not "move".).
Definition at line 550 of file stl_iterator.h. |
|
Simply returns *this. (This iterator does not "move".).
Definition at line 545 of file stl_iterator.h. |
|
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 531 of file stl_iterator.h. |