std::list::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::list

Member functions

list::list

list::~list

list::operator=

list::assign

list::get_allocator

Element access

list::front

list::back

Iterators

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

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

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

list::rend list::crend (C++11)

Capacity

list::empty

list::size

list::max_size

Modifiers

list::clear

list::insert

list::emplace (C++11)

list::erase

list::push_front

list::emplace_front (C++11)

list::pop_front

list::push_back

list::emplace_back (C++11)

list::pop_back

list::resize

list::swap

Operations

list::merge

list::splice

list::remove list::remove_if

list::reverse

list::unique

list::sort

 

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 list (public member function)