std::deque::resize

From Cppreference

C++ Standard Library
Language 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::deque
Member functions deque::deque deque::~deque deque::operator= deque::assign deque::get_allocator Element access deque::front deque::back Iterators deque::begin deque::cbegin (C++11) deque::end deque::cend (C++11) deque::rbegin deque::crbegin (C++11) deque::rend deque::crend (C++11) Capacity deque::empty deque::size deque::max_size deque::shrink_to_fit Modifiers deque::clear deque::insert deque::emplace deque::erase deque::push_front deque::emplace_front deque::pop_front deque::push_back deque::emplace_back deque::pop_back deque::resize deque::swap

void resize( size_type count, T value = T() ); void resize( size_type count); void resize( size_type count, const value_type& value);		(pre-C++11 version) (C++11 version) (C++11 version)

Resizes the container to contain count elements.

If the current size is less than count, additional elements are appended and initialized with value.

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

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

count	-	new size of the container
value	-	the value to initialize the new elements with

[edit] Return value

(none)

[edit] Complexity

linear in the size of the container

[edit] See also

size	returns the number of elements (public member function)