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);

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