Skip to main content

std::deque resize() method

// (1) Non const version only
void resize( size_type count );

// (2) Non const version only
void resize( size_type count, const value_type& value );

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 is the in this list.

Return value

(none)

Complexity

Linear in the difference between the current size and count - O(size() - count).

Exceptions

(none)

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 a custom Allocator::construct().

Example

Main.cpp
#include <iostream>
#include <deque>

int main()
{
std::deque<int> c = {1, 2, 3};
std::cout << "The deque holds: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(5);
std::cout << "After resize up to 5: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(2);
std::cout << "After resize down to 2: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(6, 4);
std::cout << "After resize up to 6 (initializer = 4): ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';
}
Output
The deque holds: 1 2 3
After resize up to 5: 1 2 3 0 0
After resize down to 2: 1 2
After resize up to 6 (initializer = 4): 1 2 4 4 4 4
This article originates from this CppReference page. It was likely altered for improvements or editors' preference. Click "Edit this page" to see all changes made to this document.
Hover to see the original license.

std::deque resize() method

// (1) Non const version only
void resize( size_type count );

// (2) Non const version only
void resize( size_type count, const value_type& value );

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 is the in this list.

Return value

(none)

Complexity

Linear in the difference between the current size and count - O(size() - count).

Exceptions

(none)

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 a custom Allocator::construct().

Example

Main.cpp
#include <iostream>
#include <deque>

int main()
{
std::deque<int> c = {1, 2, 3};
std::cout << "The deque holds: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(5);
std::cout << "After resize up to 5: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(2);
std::cout << "After resize down to 2: ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';

c.resize(6, 4);
std::cout << "After resize up to 6 (initializer = 4): ";
for (const auto& el: c) std::cout << el << ' ';
std::cout << '\n';
}
Output
The deque holds: 1 2 3
After resize up to 5: 1 2 3 0 0
After resize down to 2: 1 2
After resize up to 6 (initializer = 4): 1 2 4 4 4 4
This article originates from this CppReference page. It was likely altered for improvements or editors' preference. Click "Edit this page" to see all changes made to this document.
Hover to see the original license.