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

Synopsis

Declared in <bslalg_dequeprimitives.h>

template<class ALLOCATOR>
static
void
insertAndMoveToFront(
    Iterator* toBegin,
    Iterator fromBegin,
    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 [fromBegin .. position)] backward by numElements position. Pass the specified allocator to the copy constructor if appropriate. Load into the specified toBegin an iterator to the beginning of the data after insertion (i.e., fromBegin ‐ numElements). The behavior is undefined unless fromBegin ‐ numElements is a valid iterator (i.e., the block pointer array holds enough room before the fromBegin position to insert numElements).

Parameters

Name

Description

toBegin

loads the beginning iterator after insertion

fromBegin

current beginning 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