std::vector::clear

 

C++

Language

Standard library headers

Concepts

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::vector

Member functions

vector::vector

vector::~vector

vector::operator=

vector::assign

vector::get_allocator

Element access

vector::at

vector::operator[]

vector::front

vector::back

vector::data (C++11)

Iterators

vector::begin vector::cbegin (C++11)

vector::end vector::cend (C++11)

vector::rbegin vector::crbegin (C++11)

vector::rend vector::crend (C++11)

Capacity

vector::empty

vector::size

vector::max_size

vector::reserve

vector::capacity

vector::shrink_to_fit (C++11)

Modifiers

vector::clear

vector::insert

vector::emplace (C++11)

vector::erase

vector::push_back

vector::emplace_back (C++11)

vector::pop_back

vector::resize

vector::swap

 

void clear();

Removes all elements from the container. The allocated memory will not be released, effectively leaving the capacity of the vector unchanged. The past-the-end iterators are not invalidated.

Parameters

(none)

Return value

(none)

Exceptions

noexcept specification:  

noexcept

  (since C++11)

Complexity

linear in the size of the container.

clear is defined in terms of erase, which has linear complexity.	(until C++11)
clear is not defined in terms of erase, but LWG 2231 proposes to define clear to have linear complexity for sequence containers.	(since C++11)

See also

erase	erases elements (public member function)