Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../../cpp/container/list/assign.html below:

std::list<T,Allocator>::assign - cppreference.com

void assign( size_type count, const T& value );

template< class InputIt >
void assign( InputIt first, InputIt last );

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.

This overload participates in overload resolution only if InputIt satisfies the requirements of LegacyInputIterator.

If first or last is an iterator into *this, the behavior is undefined.

3) Replaces the contents with the elements from ilist.

All iterators, pointers and references to the elements of the container are invalidated.

1) Linear in count.

2) Linear in distance between first and last.

3) Linear in ilist.size().

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

#include <list>
#include <iostream>
#include <string>
 
int main()
{
    std::list<char> characters;
 
    auto print_list = [&]()
    {
        for (char c : characters)
            std::cout << c << ' ';
        std::cout << '\n';
    };
 
    characters.assign(5, 'a');
    print_list();
 
    const std::string extra(6, 'b');
    characters.assign(extra.begin(), extra.end());
    print_list();
 
    characters.assign({'C', '+', '+', '1', '1'});
    print_list();
}

Output:

a a a a a
b b b b b b
C + + 1 1

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4