##### cppreference.com

##### Search

Create account

##### Namespaces

- Page
- Discussion

##### Variants

##### Views

- View
- Edit
- History

##### Actions

# std::deque::shrink_to_fit

From cppreference.com
< cpp‎ | container‎ | deque

[edit template]

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 if the request is fulfilled.

All iterators and references are invalidated. Past-the-end iterator is also invalidated.

### [edit] Parameters

(none)

Type requirements
- `T` must meet the requirements of `MoveInsertable`.

### [edit] Return value

(none)

### [edit] Complexity

At most linear in the size of the container.

### [edit] Notes

If an exception is thrown other than by T's move constructor, there are no effects.

### [edit] Example

[edit]
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 will free any unused memory.
        nums.shrink_to_fit();
    }

### [edit] See also

size | returns the number of elements (public member function) [edit]

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/container/deque/shrink_to_fit&oldid=50473"