std::forward_list::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::forward_list

Member functions

forward_list::forward_list

forward_list::~forward_list

forward_list::operator=

forward_list::assign

forward_list::get_allocator

Element access

forward_list::front

Iterators

forward_list::before_begin forward_list::cbefore_begin

forward_list::begin forward_list::cbegin

forward_list::end forward_list::cend

Capacity

forward_list::empty

forward_list::max_size

Modifiers

forward_list::clear

forward_list::insert_after

forward_list::emplace_after

forward_list::erase_after

forward_list::push_front

forward_list::emplace_front

forward_list::pop_front

forward_list::resize

forward_list::swap

Operations

forward_list::merge

forward_list::splice_after

forward_list::remove forward_list::remove_if

forward_list::reverse

forward_list::unique

forward_list::sort

 

void clear();		(since C++11)

Removes all elements from the container. 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_after	erases an element after an element (public member function)