std::list<T,Allocator>::assign (3) - Linux Manuals
std::list<T,Allocator>::assign: std::list<T,Allocator>::assign
Command to display std::list<T,Allocator>::assign
manual in Linux: $ man 3 std::list<T,Allocator>::assign
NAME
std::list<T,Allocator>::assign - std::list<T,Allocator>::assign
Synopsis
void assign( size_type count, const T& value ); (1)
template< class InputIt > (2)
void assign( InputIt first, InputIt last );
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.
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::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
constructs the list
constructor (public member function)
Pages related to std::list<T,Allocator>::assign
- std::list<T,Allocator>::back (3) - std::list<T,Allocator>::back
- std::list<T,Allocator>::begin,std::list<T,Allocator>::cbegin (3) - std::list<T,Allocator>::begin,std::list<T,Allocator>::cbegin
- std::list<T,Allocator>::clear (3) - std::list<T,Allocator>::clear
- std::list<T,Allocator>::emplace (3) - std::list<T,Allocator>::emplace
- std::list<T,Allocator>::emplace_back (3) - std::list<T,Allocator>::emplace_back
- std::list<T,Allocator>::emplace_front (3) - std::list<T,Allocator>::emplace_front
- std::list<T,Allocator>::empty (3) - std::list<T,Allocator>::empty
- std::list<T,Allocator>::end,std::list<T,Allocator>::cend (3) - std::list<T,Allocator>::end,std::list<T,Allocator>::cend
- std::list<T,Allocator>::erase (3) - std::list<T,Allocator>::erase
- std::list<T,Allocator>::front (3) - std::list<T,Allocator>::front
- std::list<T,Allocator>::get_allocator (3) - std::list<T,Allocator>::get_allocator
- std::list<T,Allocator>::insert (3) - std::list<T,Allocator>::insert
- std::list<T,Allocator>::list (3) - std::list<T,Allocator>::list
- std::list<T,Allocator>::max_size (3) - std::list<T,Allocator>::max_size
- std::list<T,Allocator>::merge (3) - std::list<T,Allocator>::merge
- std::list<T,Allocator>::operator= (3) - std::list<T,Allocator>::operator=
- std::list<T,Allocator>::pop_back (3) - std::list<T,Allocator>::pop_back
- std::list<T,Allocator>::pop_front (3) - std::list<T,Allocator>::pop_front
- std::list<T,Allocator>::push_back (3) - std::list<T,Allocator>::push_back
- std::list<T,Allocator>::push_front (3) - std::list<T,Allocator>::push_front
- std::list<T,Allocator>::rbegin,std::list<T,Allocator>::crbegin (3) - std::list<T,Allocator>::rbegin,std::list<T,Allocator>::crbegin
- std::list<T,Allocator>::remove,remove_if (3) - std::list<T,Allocator>::remove,remove_if
- std::list<T,Allocator>::rend,std::list<T,Allocator>::crend (3) - std::list<T,Allocator>::rend,std::list<T,Allocator>::crend
- std::list<T,Allocator>::resize (3) - std::list<T,Allocator>::resize
- std::list<T,Allocator>::reverse (3) - std::list<T,Allocator>::reverse
- std::list<T,Allocator>::size (3) - std::list<T,Allocator>::size
- std::list<T,Allocator>::sort (3) - std::list<T,Allocator>::sort
- std::list<T,Allocator>::splice (3) - std::list<T,Allocator>::splice