std::deque::clear

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 clear();

Removes all elements from the container. The past-the-end iterators are not invalidated.

Contents 1 Parameters 2 Return value 3 Exceptions 4 Complexity 5 See also

[edit] Parameters

(none)

[edit] Return value

(none)

[edit] Exceptions

1-3)

[edit] Complexity

linear in the size of the container.

[edit] See also

erase	erases elements (public member function)