Resizes the container to containcount elements:

• Ifcount is equal to the current size, does nothing.
• If the current size is greater thancount, the container is reduced to its firstcount elements.
• If the current size is less thancount, then:

[edit]Parameters

[edit]Complexity

Linear in the difference between the current size andcount. Additional complexity possible due to list traversal to reach the first element to erase/the end position to insert.

Notes

If value-initialization in overload(1) is undesirable, for example, if the elements are of non-class type and zeroing out is not needed, it can be avoided by providing acustomAllocator::construct.

[edit]Example

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

The forward_list holds: 1 2 3After resize up to 5: 1 2 3 0 0After resize down to 2: 1 2After resize up to 6 (initializer = 4): 1 2 4 4 4 4

[edit]See also

• In other languages

• Deutsch
• Español
• Français
• Italiano
• 日本語
• Português
• Русский
• 中文