bsl::slist::insert

insert overloads

Synopses

Declared in <bslstp_slist.h>

Insert __x before __pos and return an iterator to the new element.

iterator
insert(
    iterator __pos,
    value_type const& __x = _Tp());

Insert __n copies of __x before __pos.

void
insert(
    iterator __pos,
    size_type __n,
    value_type const& __x);

Insert the specified range before __pos.

template<class _InIter>
void
insert(
    iterator __pos,
    _InIter __first,
    _InIter __last);

iterator referring to the inserted element

Name

Description

__pos

position before which to insert

__x

value to insert

__n

number of copies to insert

__first

beginning of the range to insert

__last

end of the range to insert (exclusive)

Created with MrDocs