libstdc++: std::back_insert_iterator< _Container > Class Template Reference (original) (raw)
#include <[stl_iterator.h](a17942%5Fsource.html)>
| Public Types | |
|---|---|
| typedef _Container | container_type |
| using | difference_type = ptrdiff_t |
| typedef output_iterator_tag | iterator_category |
| typedef void | pointer |
| typedef void | reference |
| typedef void | value_type |
| Public Member Functions | |
|---|---|
| constexpr | back_insert_iterator (_Container &__x) |
| constexpr back_insert_iterator & | operator* () |
| constexpr back_insert_iterator & | operator++ () |
| constexpr back_insert_iterator | operator++ (int) |
| constexpr back_insert_iterator & | operator= (const typename _Container::value_type &__value) |
| constexpr back_insert_iterator & | operator= (typename _Container::value_type &&__value) |
template<typename _Container>
class std::back_insert_iterator< _Container >
Turns assignment into insertion.
These are output iterators, constructed from a container-of-T. Assigning a T to the iterator appends it to the container using push_back.
Tip: Using the back_inserter function to create these iterators can save typing.
Definition at line 689 of file bits/stl_iterator.h.
◆ container_type
template<typename _Container >
A nested typedef for the type of whatever container you used.
Definition at line 697 of file bits/stl_iterator.h.
◆ difference_type
template<typename _Container >
◆ iterator_category
◆ pointer
◆ value_type
◆ back_insert_iterator()
template<typename _Container >
◆ operator*()
template<typename _Container >
◆ operator++() [1/2]
template<typename _Container >
◆ operator++() [2/2]
template<typename _Container >
◆ operator=() [1/2]
template<typename _Container >
Parameters
| __value | An instance of whatever type container_type::const_reference is; presumably a reference-to-const T for container. |
|---|
Returns
This iterator, for chained operations.
This kind of iterator doesn't really have a position in the container (you can think of the position as being permanently at the end, if you like). Assigning a value to the iterator will always append the value to the end of the container.
Definition at line 728 of file bits/stl_iterator.h.
◆ operator=() [2/2]
template<typename _Container >
◆ container
template<typename _Container >
The documentation for this class was generated from the following file: