std::insert_iterator< _Container >(3cxx) | std::insert_iterator< _Container >(3cxx) |
std::insert_iterator< _Container > - Turns assignment into insertion.
#include <stl_iterator.h>
Inherits std::iterator< output_iterator_tag, void, void, void, void >.
typedef _Container container_type
A nested typedef for the type of whatever container you used. typedef void
difference_type
Distance between iterators is represented as this type. typedef
output_iterator_tag iterator_category
One of the tag types. typedef void pointer
This type represents a pointer-to-value_type. typedef void reference
This type represents a reference-to-value_type. typedef void value_type
The type 'pointed to' by the iterator.
constexpr insert_iterator (_Container &__x, _Iter __i)
constexpr insert_iterator & operator* ()
Simply returns *this. constexpr insert_iterator & operator++
()
Simply returns *this. (This iterator does not move.) constexpr
insert_iterator & operator++ (int)
Simply returns *this. (This iterator does not move.) constexpr
insert_iterator & operator= (const typename
_Container::value_type &__value)
constexpr insert_iterator & operator= (typename
_Container::value_type &&__value)
_Container * container
_Iter iter
class std::insert_iterator< _Container >"Turns assignment into insertion.
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 858 of file bits/stl_iterator.h.
A nested typedef for the type of whatever container you used.
Definition at line 877 of file bits/stl_iterator.h.
Distance between iterators is represented as this type.
Definition at line 134 of file stl_iterator_base_types.h.
One of the tag types.
Definition at line 130 of file stl_iterator_base_types.h.
This type represents a pointer-to-value_type.
Definition at line 136 of file stl_iterator_base_types.h.
This type represents a reference-to-value_type.
Definition at line 138 of file stl_iterator_base_types.h.
The type 'pointed to' by the iterator.
Definition at line 132 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 890 of file bits/stl_iterator.h.
Simply returns *this.
Definition at line 947 of file bits/stl_iterator.h.
Simply returns *this. (This iterator does not move.)
Definition at line 953 of file bits/stl_iterator.h.
Simply returns *this. (This iterator does not move.)
Definition at line 959 of file bits/stl_iterator.h.
Parameters
Returns
This kind of iterator maintains its own position in the container. Assigning a value to the iterator will insert the value into the container at the place before the iterator.
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 927 of file bits/stl_iterator.h.
Definition at line 936 of file bits/stl_iterator.h.
Definition at line 871 of file bits/stl_iterator.h.
Definition at line 872 of file bits/stl_iterator.h.
Generated automatically by Doxygen for libstdc++ from the source code.
Thu Feb 16 2023 | libstdc++ |