Same as the related overload above for insertAndMoveToBack.
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,
bsl::integral_constant<int, BSLALG_DEQUEPRIMITIVES_BITWISE_MOVEABLE_TRAITS> traits);| 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 |
| traits | unused trait tag for overload resolution |