std::deque::assign

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

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

 

std::deque

Member functions

deque::deque

deque::~deque

deque::operator=

deque::assign

deque::get_allocator

Element access

deque::front

deque::back

Iterators

deque::begin deque::cbegin (C++11)

deque::end deque::cend (C++11)

deque::rbegin deque::crbegin (C++11)

deque::rend deque::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

 

void assign( size_type count, const T& value );	(1)
template< class InputIterator > void assign( InputIterator first, InputIterator last );	(2)

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)

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

Complexity

1) linear in count

2) linear in distance between first and last

See also

(constructor)	constructs the deque (public member function)