#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. | |
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".). |
(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 482 of file stl_iterator.h.
|
A nested typedef for the type of whatever container you used.
Definition at line 491 of file stl_iterator.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 497 of file stl_iterator.h. |
|
Simply returns *this.
Definition at line 533 of file stl_iterator.h. |
|
Simply returns *this. (This iterator does not "move".).
Definition at line 541 of file stl_iterator.h. |
|
Simply returns *this. (This iterator does not "move".).
Definition at line 537 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 524 of file stl_iterator.h. |