W3cubDocs

std::forward_list::insert_after

iterator insert_after( const_iterator pos, const T& value );	(1)	(since C++11)
iterator insert_after( const_iterator pos, T&& value );	(2)	(since C++11)
iterator insert_after( const_iterator pos, size_type count, const T& value );	(3)	(since C++11)
template< class InputIt > iterator insert_after( const_iterator pos, InputIt first, InputIt last );	(4)	(since C++11)
iterator insert_after( const_iterator pos, std::initializer_list<T> ilist );	(5)	(since C++11)

Inserts elements after the specified position in the container.

1-2) inserts value after the element pointed to by pos

3) inserts count copies of the value after the element pointed to by pos

4) inserts elements from range [first, last) after the element pointed to by pos. The behavior is undefined if first and last are iterators into *this.

5) inserts elements from initializer list ilist.

No iterators or references are invalidated.

Parameters

pos	-	element after which the content will be inserted
value	-	element value to insert
first, last	-	the range of elements to insert
ilist	-	initializer list to insert the values from
Type requirements
- `InputIt` must meet the requirements of `InputIterator`.

Return value

1-2) Iterator to the inserted element.

3) Iterator to the last element inserted, or pos if count==0.

4) Iterator to the last element inserted, or pos if first==last.

5) Iterator to the last element inserted, or pos if ilist is empty.

Exceptions

If an exception is thrown during insert_after there are no effects (strong exception guarantee).

Complexity

1-2) Constant.

3) Linear in count

4) Linear in std::distance(first, last)

5) Linear in ilist.size()

emplace_after	constructs elements in-place after an element (public member function)
push_front	inserts an element to the beginning (public member function)