std::deque<T,Allocator>::assign

void assign( size_type count, const T& value );	(1)
template< class InputIt > void assign( InputIt first, InputIt last );	(2)
void assign( std::initializer_list<T> ilist );	(3)	(since C++11)

Replaces the contents of the container.

1) Replaces the contents with count copies of value value

2) Replaces the contents with copies of those in the range [first, last).

This overload has the same effect as overload (1) if `InputIt` is an integral type.	(until C++11)
This overload only participates in overload resolution if `InputIt` satisfies LegacyInputIterator.	(since C++11)

3) Replaces the contents with the elements from the initializer list ilist.

All iterators, pointers and references to the elements of the container are invalidated. The past-the-end iterator is also invalidated.

Parameters

count	-	the new size of the container
value	-	the value to initialize elements of the container with
first, last	-	the range to copy the elements from
ilist	-	initializer list to copy the values from

Complexity

1) Linear in count

2) Linear in distance between first and last

3) Linear in ilist.size()

Example

The following code uses assign to add several characters to a std::deque<char>:

Run this code

#include <deque>
#include <iostream>
 
int main()
{
    std::deque<char> characters;
 
    characters.assign(5, 'a');
 
    for (char c : characters) {
        std::cout << c << '\n';
    } 
 
    return 0;
}

Output:

a
a
a
a
a

Language
Standard Library Headers
Freestanding and hosted implementations
Named requirements
Language support library
Concepts library (C++20)
Diagnostics library
Utilities library
Strings library
Containers library
Iterators library
Ranges library (C++20)
Algorithms library
Numerics library
Input/output library
Localizations library
Regular expressions library (C++11)
Atomic operations library (C++11)
Thread support library (C++11)
Filesystem library (C++17)
Technical Specifications

array (C++11)
vector
deque
forward_list (C++11)
list
set
multiset
map
multimap
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
stack
queue
priority_queue
span (C++20)

Member functions
deque::deque
deque::~deque
deque::operator=
deque::assign
deque::get_allocator
Element access
deque::front
deque::back
Iterators
deque::begindeque::cbegin (C++11)
deque::enddeque::cend (C++11)
deque::rbegindeque::crbegin (C++11)
deque::renddeque::crend (C++11)
Capacity
deque::empty
deque::size
deque::max_size
deque::shrink_to_fit
Modifiers
deque::clear
deque::insert
deque::emplace
deque::erase
deque::push_front
deque::emplace_front
deque::pop_front
deque::push_back
deque::emplace_back
deque::pop_back
deque::resize
deque::swap
Deduction guides(C++17)

std::deque<T,Allocator>::assign

Parameters

Complexity

Example

See also