std::list::assign

 

C++

Language

Standard library headers

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::beginlist::cbegin (C++11)

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

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

list::rendlist::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::removelist::remove_if

list::reverse

list::unique

list::sort

 

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 does not participate in overload resolution if InputIt does not satisfy InputIterator. (since C++11)

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

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
Type requirements
- InputIt must meet the requirements of InputIterator.

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

Run this code

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

Output:

a
a
a
a
a

See also

(constructor)

constructs the list (public member function)