Insert copies of a value, shifting existing elements toward the back.

Synopsis

Declared in <bslalg_dequeprimitives.h>

template<class ALLOCATOR>
static
void
insertAndMoveToBack(
    Iterator* toEnd,
    Iterator fromEnd,
    Iterator position,
    size_type numElements,
    VALUE_TYPE const& value,
    ALLOCATOR allocator);

Description

Insert the specified numElements copies of the specified value at the specified position, by moving the elements in the range [position .. fromEnd)] forward by numElements position. Pass the specified allocator to the copy constructor if appropriate. Load into the specified toEnd an iterator to the end of the deque after insertion (i.e., fromEnd + numElements). The behavior is undefined unless fromEnd + numElements is a valid iterator (i.e., the block pointer array holds enough room after the fromEnd position to insert numElements).

Parameters

Name

Description

toEnd

loads the end iterator after insertion

fromEnd

current end of the deque

position

insertion position within the deque

numElements

number of copies of value to insert

value

value copied into each inserted element

allocator

allocator passed to element constructors

Created with MrDocs