Namespaces
Variants
Views
Actions

std::insert_iterator<Container>::operator=

From cppreference.com
 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
(C++20)
(C++20)
(C++20)
Utilities
(C++20)

Iterator adaptors
Iterator customization points
Iterator operations
(C++11)    
(C++11)
Range access
(C++11)(C++14)
(C++14)(C++14)    
(C++11)(C++14)
(C++14)(C++14)    
(C++17)(C++20)
(C++17)
(C++17)
 
 
(1)
insert_iterator<Container>&
    operator=( typename Container::const_reference value );
(until C++11)
insert_iterator<Container>&
    operator=( const typename Container::value_type& value );
(since C++11)
(until C++20)
constexpr insert_iterator<Container>&
    operator=( const typename Container::value_type& value );
(since C++20)
(2)
insert_iterator<Container>&
    operator=( typename Container::value_type&& value );
(since C++11)
(until C++20)
constexpr insert_iterator<Container>&
    operator=( typename Container::value_type&& value );
(since C++20)

Inserts the given value value to the container.

1) Results in iter = container->insert(iter, value); ++iter;.
2) Results in iter = container->insert(iter, std::move(value)); ++iter;.

Contents

[edit] Parameters

value - the value to insert

[edit] Return value

*this

Notes

This function exploits the signature compatibility between hinted insert for associative containers (such as std::set::insert) and positional insert for sequential containers (such as std::vector::insert).

[edit] Example

#include <deque>
#include <iostream>
#include <iterator>
 
int main()
{
    std::deque<int> q;
    std::insert_iterator<std::deque<int>> it(q, q.begin());
 
    for (int i = 0; i < 10; ++i)
        it = i; // inserts i
 
    for (auto& elem : q)
        std::cout << elem << ' ';
    std::cout << '\n';
}

Output:

0 1 2 3 4 5 6 7 8 9