std::deque<T,Allocator>::shrink_to_fit (3) - Linux Manuals
std::deque<T,Allocator>::shrink_to_fit: std::deque<T,Allocator>::shrink_to_fit
Command to display std::deque<T,Allocator>::shrink_to_fit
manual in Linux: $ man 3 std::deque<T,Allocator>::shrink_to_fit
NAME
std::deque<T,Allocator>::shrink_to_fit - std::deque<T,Allocator>::shrink_to_fit
Synopsis
void shrink_to_fit(); (since C++11)
Requests the removal of unused capacity.
It is a non-binding request to reduce the memory usage without changing the size of the sequence. It depends on the implementation whether the request is fulfilled.
All iterators and references are invalidated. Past-the-end iterator is also invalidated.
Parameters
(none)
Type requirements
-
T must meet the requirements of MoveInsertable.
Return value
(none)
Complexity
At most linear in the size of the container.
Notes
If an exception is thrown other than by T's move constructor, there are no effects.
Example
// Run this code
#include <deque>
int main() {
std::deque<int> nums(1000, 42);
nums.push_front(1);
nums.pop_front();
nums.clear();
// nums now contains no items, but it may still be holding allocated memory.
// Calling shrink_to_fit may free any unused memory.
nums.shrink_to_fit();
}
See also
returns the number of elements
size (public member function)
Pages related to std::deque<T,Allocator>::shrink_to_fit
- std::deque<T,Allocator>::size (3) - std::deque<T,Allocator>::size
- std::deque<T,Allocator>::swap (3) - std::deque<T,Allocator>::swap
- std::deque<T,Allocator>::assign (3) - std::deque<T,Allocator>::assign
- std::deque<T,Allocator>::at (3) - std::deque<T,Allocator>::at
- std::deque<T,Allocator>::back (3) - std::deque<T,Allocator>::back
- std::deque<T,Allocator>::begin,std::deque<T,Allocator>::cbegin (3) - std::deque<T,Allocator>::begin,std::deque<T,Allocator>::cbegin
- std::deque<T,Allocator>::clear (3) - std::deque<T,Allocator>::clear
- std::deque<T,Allocator>::deque (3) - std::deque<T,Allocator>::deque
- std::deque<T,Allocator>::emplace (3) - std::deque<T,Allocator>::emplace
- std::deque<T,Allocator>::emplace_back (3) - std::deque<T,Allocator>::emplace_back
- std::deque<T,Allocator>::emplace_front (3) - std::deque<T,Allocator>::emplace_front
- std::deque<T,Allocator>::empty (3) - std::deque<T,Allocator>::empty
- std::deque<T,Allocator>::end,std::deque<T,Allocator>::cend (3) - std::deque<T,Allocator>::end,std::deque<T,Allocator>::cend
- std::deque<T,Allocator>::erase (3) - std::deque<T,Allocator>::erase
- std::deque<T,Allocator>::front (3) - std::deque<T,Allocator>::front
- std::deque<T,Allocator>::get_allocator (3) - std::deque<T,Allocator>::get_allocator
- std::deque<T,Allocator>::insert (3) - std::deque<T,Allocator>::insert
- std::deque<T,Allocator>::max_size (3) - std::deque<T,Allocator>::max_size
- std::deque<T,Allocator>::operator= (3) - std::deque<T,Allocator>::operator=
- std::deque<T,Allocator>::operator[] (3) - std::deque<T,Allocator>::operator[]
- std::deque<T,Allocator>::pop_back (3) - std::deque<T,Allocator>::pop_back
- std::deque<T,Allocator>::pop_front (3) - std::deque<T,Allocator>::pop_front
- std::deque<T,Allocator>::push_back (3) - std::deque<T,Allocator>::push_back
- std::deque<T,Allocator>::push_front (3) - std::deque<T,Allocator>::push_front
- std::deque<T,Allocator>::rbegin,std::deque<T,Allocator>::crbegin (3) - std::deque<T,Allocator>::rbegin,std::deque<T,Allocator>::crbegin
- std::deque<T,Allocator>::rend,std::deque<T,Allocator>::crend (3) - std::deque<T,Allocator>::rend,std::deque<T,Allocator>::crend
- std::deque<T,Allocator>::resize (3) - std::deque<T,Allocator>::resize
- std::deque<T,Allocator>::~deque (3) - std::deque<T,Allocator>::~deque
- std::deque (3) - std::deque