std::forward_list::resize

 

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)

Filesystem library (C++17)

Technical Specifications

 

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::forward_list

Member functions

forward_list::forward_list

forward_list::~forward_list

forward_list::operator=

forward_list::assign

forward_list::get_allocator

Element access

forward_list::front

Iterators

forward_list::before_beginforward_list::cbefore_begin

forward_list::beginforward_list::cbegin

forward_list::endforward_list::cend

Capacity

forward_list::empty

forward_list::max_size

Modifiers

forward_list::clear

forward_list::insert_after

forward_list::emplace_after

forward_list::erase_after

forward_list::push_front

forward_list::emplace_front

forward_list::pop_front

forward_list::resize

forward_list::swap

Operations

forward_list::merge

forward_list::splice_after

forward_list::removeforward_list::remove_if

forward_list::reverse

forward_list::unique

forward_list::sort

 

void resize( size_type count );	(1)
void resize( size_type count, const value_type& value );	(2)

Resizes the container to contain count elements.

If the current size is greater than count, the container is reduced to its first count elements.

If the current size is less than count,

1) additional default-inserted elements are appended

2) additional copies of value are appended

Parameters

count	-	new size of the container
value	-	the value to initialize the new elements with
Type requirements
- T must meet the requirements of DefaultInsertable in order to use overload (1).
- T must meet the requirements of CopyInsertable in order to use overload (2).

Return value

(none)

Complexity

Linear in the difference between the current size and count.

Example

Run this code

#include <iostream>
#include <forward_list>
int main()
{
    std::forward_list<int> c = {1, 2, 3};
    std::cout << "The forward_list holds: ";
    for(auto& el: c) std::cout << el << ' ';
    std::cout << '\n';
    c.resize(5);
    std::cout << "After resize up 5: ";
    for(auto& el: c) std::cout << el << ' ';
    std::cout << '\n';
    c.resize(2);
    std::cout << "After resize down to 2: ";
    for(auto& el: c) std::cout << el << ' ';
    std::cout << '\n';
}

Output:

The forward_list holds: 1 2 3
After resize up 5: 1 2 3 0 0
After resize down to 2: 1 2

See also

insert_after	inserts elements after an element (public member function)
erase_after	erases an element after an element (public member function)