Manpages - std_back_insert_iterator.3

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 back_insert_iterator (_Container &__x)
The only way to create this iterator is with a container.

constexpr back_insert_iterator & operator* ()
Simply returns *this.

constexpr back_insert_iterator & operator++ ()
Simply returns *this. (This iterator does not move.)

constexpr back_insert_iterator operator++ (int)
Simply returns *this. (This iterator does not move.)

constexpr back_insert_iterator & operator= (const typename _Container::value_type &__value)

constexpr back_insert_iterator & operator= (typename _Container::value_type &&__value)

_Container * 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 628 of file bits/stl_iterator.h.

std::back_insert_iterator*< _Container >::*container_type A nested typedef for the type of whatever container you used.

Definition at line 636 of file bits/stl_iterator.h.

void , void >::*difference_type*= [inherited]= Distance between iterators is represented as this type.

Definition at line 134 of file stl_iterator_base_types.h.

, void , void , void , void >::*iterator_category*= [inherited]= One of the tag types.

Definition at line 130 of file stl_iterator_base_types.h.

void , void >::*pointer*= [inherited]= This type represents a pointer-to-value_type.

Definition at line 136 of file stl_iterator_base_types.h.

void , void >::*reference*= [inherited]= This type represents a reference-to-value_type.

Definition at line 138 of file stl_iterator_base_types.h.

void , void >::*value_type*= [inherited]= The type ’pointed to’ by the iterator.

Definition at line 132 of file stl_iterator_base_types.h.

_Container >::*back_insert_iterator* (_Container & __x)= [inline]=, = [explicit]=, = [constexpr]= The only way to create this iterator is with a container.

Definition at line 645 of file bits/stl_iterator.h.

std::back_insert_iterator*< _Container >::operator ()= [inline]=, = [constexpr]= Simply returns *this.

Definition at line 687 of file bits/stl_iterator.h.

*std::back_insert_iterator*< _Container >::operator++ ()= [inline]=, = [constexpr]= Simply returns *this. (This iterator does not move.)

Definition at line 693 of file bits/stl_iterator.h.

*std::back_insert_iterator*< _Container >::operator++ (int)= [inline]=, = [constexpr]= Simply returns *this. (This iterator does not move.)

Definition at line 699 of file bits/stl_iterator.h.

std::back_insert_iterator*< _Container >::operator= (const typename _Container::value_type & __value)= [inline]=, = [constexpr]= *Parameters

__value An instance of whatever type container_type::const_reference is; presumably a reference-to-const T for container<T>.

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 669 of file bits/stl_iterator.h.

std::back_insert_iterator*< _Container >::operator= (typename _Container::value_type && __value)= [inline]=, = [constexpr]= Definition at line *677 of file bits/stl_iterator.h.

std::back_insert_iterator*< _Container >::container= [protected]= Definition at line *632 of file bits/stl_iterator.h.