insertAndMoveToFront overloads
Synopses
Declared in <bslalg_dequeprimitives.h>
Insert copies of a value, shifting existing elements toward the front.
template<class ALLOCATOR>
static
void
insertAndMoveToFront(
Iterator* toBegin,
Iterator fromBegin,
Iterator position,
size_type numElements,
VALUE_TYPE const& value,
ALLOCATOR allocator);
Insert a source range, shifting existing elements toward the front.
template<
class FWD_ITER,
class SENTINEL,
class ALLOCATOR>
static
void
insertAndMoveToFront(
Iterator* toBegin,
Iterator fromBegin,
Iterator position,
FWD_ITER first,
SENTINEL last,
size_type numElements,
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 |
value copied into each inserted element |
allocator |
allocator passed to element constructors |
first |
beginning of the source range to insert |
last |
end of the source range to insert (one past the last) |
Created with MrDocs