Showing content from https://cplusplus.com/reference/deque/deque/resize/ below:
public member function
<deque>
std::deque::resize
void resize (size_type n, value_type val = value_type());
void resize (size_type n);void resize (size_type n, const value_type& val);
Change size
Resizes the container so that it contains n elements.
If n is smaller than the current container size, the content is reduced to its first n elements, removing those beyond (and destroying them).
If n is greater than the current container size, the content is expanded by inserting at the end as many elements as needed to reach a size of n. If val is specified, the new elements are initialized as copies of val, otherwise, they are value-initialized.
Notice that this function changes the actual content of the container by inserting or erasing elements from it.
Parameters
-
n
-
New container size, expressed in number of elements.
Member type size_type is an unsigned integral type.
-
val
-
Object whose content is copied to the added elements in case that n is greater than the current container size.
If not specified, the default constructor is used instead.
Member type value_type is the type of the elements in the container, defined in deque as an alias of the first template parameter (T).
Return Value none
In case of growth, the storage for the new elements is allocated using the container's allocator, which may throw exceptions on failure (for the default allocator, bad_alloc is thrown if the allocation request does not succeed).
Example
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// resizing deque
#include <iostream>
#include <deque>
int main ()
{
std::deque<int> mydeque;
std::deque<int>::iterator it;
// set some initial content:
for (int i=1; i<10; ++i) mydeque.push_back(i);
mydeque.resize(5);
mydeque.resize(8,100);
mydeque.resize(12);
std::cout << "mydeque contains:";
for (std::deque<int>::iterator it = mydeque.begin(); it != mydeque.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
return 0;
}
The code sets a sequence of 9 numbers as the initial content for mydeque. It then uses resize first to set the container size to 5, then to extend its size to 8 with values of 100 for its new elements, and finally it extends its size to 12 with their default values (for int elements this is zero). Output:
mydeque contains: 1 2 3 4 5 100 100 100 0 0 0 0
Complexity Linear on the number of elements inserted/erased (constructions/destructions).
Iterator validity In case the container shrinks, all iterators, pointers and references to elements that have not been removed remain valid after the resize and refer to the same elements they were referring to before the call.
If the container expands, all iterators are invalidated, but existing pointers and references remain valid, referring to the same elements they were referring to before.
Data races The container is modified.
Removed elements are modified (see iterator validity above).
Exception safety If n is less than or equal to the size of the container, the function never throws exceptions (no-throw guarantee).
Otherwise, if an exception is thrown, the container is left with a valid state (basic guarantee): Constructing elements or allocating storage may throw.
See also
-
deque::size
-
Return size (public member function)
-
deque::clear
-
Clear content (public member function)
-
deque::erase
-
Erase elements (public member function)
-
deque::max_size
-
Return maximum size (public member function)
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4