insert overloads

Synopses

Declared in <bslstl_deque.h>

Insert a move‐inserted value before position.

Insert the elements of values before position.

deque<VALUE_TYPE, ALLOCATOR>::iterator
insert(
    const_iterator position,
    std::initializer_list<value_type> values);

Insert a copy of value before position.

deque<VALUE_TYPE, ALLOCATOR>::iterator
insert(
    const_iterator position,
    VALUE_TYPE const& value);

Insert numElements copies of value before position.

deque<VALUE_TYPE, ALLOCATOR>::iterator
insert(
    const_iterator position,
    size_type numElements,
    VALUE_TYPE const& value);

Insert the range [first, last)] before position.

template<class INPUT_ITERATOR>
deque<VALUE_TYPE, ALLOCATOR>::iterator
insert(
    const_iterator position,
    INPUT_ITERATOR first,
    INPUT_ITERATOR last);

Return Value

  • iterator to the newly inserted element

  • iterator to the first inserted element

Parameters

Name

Description

position

iterator before which to insert

value

move‐insertable value to insert

values

initializer list of elements to insert

numElements

number of copies to insert

first

beginning of the range to insert

last

end of the range to insert

Created with MrDocs