Turns assignment into insertion. More...
These are output iterators, constructed from a container-of-T. Assigning a T to the iterator prepends it to the container using push_front.
Tip: Using the front_inserter function to create these iterators can save typing.
Definition at line 458 of file stl_iterator.h.
typedef _Container container_type |
A nested typedef for the type of whatever container you used.
Definition at line 466 of file stl_iterator.h.
typedef void difference_type [inherited] |
Distance between iterators is represented as this type.
Definition at line 113 of file stl_iterator_base_types.h.
typedef output_iterator_tag iterator_category [inherited] |
One of the tag types.
Definition at line 109 of file stl_iterator_base_types.h.
typedef void pointer [inherited] |
This type represents a pointer-to-value_type.
Definition at line 115 of file stl_iterator_base_types.h.
typedef void reference [inherited] |
This type represents a reference-to-value_type.
Definition at line 117 of file stl_iterator_base_types.h.
typedef void value_type [inherited] |
The type "pointed to" by the iterator.
Definition at line 111 of file stl_iterator_base_types.h.
front_insert_iterator | ( | _Container & | __x | ) | [inline, explicit] |
The only way to create this iterator is with a container.
Definition at line 469 of file stl_iterator.h.
front_insert_iterator& operator* | ( | ) | [inline] |
Simply returns *this.
Definition at line 491 of file stl_iterator.h.
front_insert_iterator operator++ | ( | int | ) | [inline] |
Simply returns *this. (This iterator does not "move".).
Definition at line 501 of file stl_iterator.h.
front_insert_iterator& operator++ | ( | ) | [inline] |
Simply returns *this. (This iterator does not "move".).
Definition at line 496 of file stl_iterator.h.
front_insert_iterator& operator= | ( | 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>. |
This kind of iterator doesn't really have a "position" in the container (you can think of the position as being permanently at the front, if you like). Assigning a value to the iterator will always prepend the value to the front of the container.
Definition at line 483 of file stl_iterator.h.