std::vector::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)

 

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

Member functions

vector::vector

vector::~vector

vector::operator=

vector::assign

vector::get_allocator

Element access

vector::at

vector::operator[]

vector::front

vector::back

vector::data (C++11)

Iterators

vector::beginvector::cbegin (C++11)

vector::endvector::cend (C++11)

vector::rbeginvector::crbegin (C++11)

vector::rendvector::crend (C++11)

Capacity

vector::empty

vector::size

vector::max_size

vector::reserve

vector::capacity

vector::shrink_to_fit (C++11)

Modifiers

vector::clear

vector::insert

vector::emplace (C++11)

vector::erase

vector::push_back

vector::emplace_back (C++11)

vector::pop_back

vector::resize

vector::swap

 

void resize( size_type count, T value = T() );		(until C++11)
void resize( size_type count );	(1)	(since C++11)
void resize( size_type count, const value_type& value );	(2)	(since C++11)

Resizes the container to contain count elements.

If the current size is greater than count, the container is reduced to its first count elements as if by repeatedly calling pop_back().

If the current size is less than count, additional elements are appended and initialized with copies of value.	(until C++11)
If the current size is less than count, 1) additional value-initialized elements are appended 2) additional copies of value are appended	(since C++11)

Parameters

count	-	new size of the container
value	-	the value to initialize the new elements with
Type requirements
- 1) T must meet the requirements of DefaultConstructible and MoveInsertable.
- 2) T must meet the requirements of CopyInsertable.

Return value

(none)

Complexity

Linear in the size of the container

Notes

If value-initialization is undesirable, for example, if the elements are of non-class type and zeroing out is not needed, it can be avoided by providing a custom Allocator::constuct.

See also

size	returns the number of elements (public member function)