std::forward_list<T,Allocator>::erase_after

From cppreference.com

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros(C++20)
Language support library
Concepts library(C++20)
Diagnostics library
Memory management library
Metaprogramming library(C++11)
General utilities library
Containers library
Iterators library
Ranges library(C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library(C++17)
Concurrency support library(C++11)
Execution control library(C++26)
Technical specifications
Symbols index
External libraries

[edit]

Containers library

node-handle (C++17)
Sequence
array (C++11)
vector
vector<bool>
inplace_vector (C++26)
hive (C++26)
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Tables
Iterator invalidation
Member function table
Non-member function table

[edit]

std::forward_list

Member functions

forward_list::forward_list
forward_list::~forward_list
forward_list::operator=
forward_list::assign
forward_list::assign_range (C++23)
forward_list::get_allocator
Element access
forward_list::front
Iterators
forward_list::before_beginforward_list::cbefore_begin
forward_list::beginforward_list::cbegin
forward_list::endforward_list::cend
Capacity
forward_list::empty
forward_list::max_size

Modifiers
forward_list::clear
forward_list::emplace_front
forward_list::push_front
forward_list::insert_after
forward_list::emplace_after
forward_list::erase_after
forward_list::insert_range_after (C++23)
forward_list::prepend_range (C++23)
forward_list::pop_front
forward_list::resize
forward_list::swap
Operations
forward_list::merge
forward_list::splice_after
forward_list::removeforward_list::remove_if
forward_list::reverse
forward_list::unique
forward_list::sort

Non-member functions

operator==operator<=> (C++20)
swap(std::forward_list)
erase(std::forward_list)erase_if(std::forward_list) (C++20)(C++20)

operator!=operator<operator>operator<=operator>=

(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

[edit]

iterator erase_after( const_iterator pos);	(1)	(since C++11) (constexpr since C++26)
iterator erase_after( const_iterator first, const_iterator last);	(2)	(since C++11) (constexpr since C++26)

Removes specified elements from the container.

1) Removes the element followingpos.

If the iterator followingpos is not dereferceable, the behavior is undefined.

2) Removes the elements in the range(first, last).

If any iterator in the range(first, last) is not dereferceable, the behavior is undefined.

[edit]Parameters

pos	-	iterator to the element preceding the element to remove
first, last	-	the pair of iterators defining therange of elements to remove

[edit]Return value

1) Iterator to the element following the erased one, orend() if no such element exists.

2)last

[edit]Complexity

1) Constant.

2) Linear in distance betweenfirst andlast.

[edit]Exceptions

Throws nothing.

[edit]Example

Run this code

#include <forward_list>#include <iostream>#include <iterator> int main(){std::forward_list<int> l={1,2,3,4,5,6,7,8,9}; //  l.erase(l.begin()); // Error: no function erase()     l.erase_after(l.before_begin());// Removes first element for(auto n: l)std::cout<< n<<' ';std::cout<<'\n'; auto fi=std::next(l.begin());auto la=std::next(fi,3);     l.erase_after(fi, la); for(auto n: l)std::cout<< n<<' ';std::cout<<'\n';}