[#BloombergLP-bslalg-DequePrimitives-01-insertAndMoveToFront-00] = xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslalg.adoc[bslalg]::xref:BloombergLP/bslalg/DequePrimitives-01.adoc[DequePrimitives]::insertAndMoveToFront :relfileprefix: ../../../ :mrdocs: `insertAndMoveToFront` overloads == Synopses Declared in `<bslalg_dequeprimitives.h>` 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`). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class ALLOCATOR> static void xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-08.adoc[insertAndMoveToFront]( xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator]* toBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] fromBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] position, xref:BloombergLP/bslalg/DequePrimitives-01/size_type.adoc[size_type] numElements, VALUE_TYPE const& value, ALLOCATOR allocator); ---- [.small]#xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-08.adoc[_» more..._]# 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`). Note that the last argument is for removing overload ambiguities and is not used. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class ALLOCATOR> static void xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-05.adoc[insertAndMoveToFront]( xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator]* toBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] fromBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] position, xref:BloombergLP/bslalg/DequePrimitives-01/size_type.adoc[size_type] numElements, VALUE_TYPE const& value, ALLOCATOR allocator, xref:bsl/integral_constant-02.adoc[bsl::integral_constant<int, BSLALG_DEQUEPRIMITIVES_BITWISE_COPYABLE_TRAITS>]); ---- [.small]#xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-05.adoc[_» more..._]# Same as the related overload above for `insertAndMoveToFront`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class ALLOCATOR> static void xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-03.adoc[insertAndMoveToFront]( xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator]* toBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] fromBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] position, xref:BloombergLP/bslalg/DequePrimitives-01/size_type.adoc[size_type] numElements, VALUE_TYPE const& value, ALLOCATOR allocator, xref:bsl/integral_constant-02.adoc[bsl::integral_constant<int, BSLALG_DEQUEPRIMITIVES_BITWISE_MOVEABLE_TRAITS>]); ---- [.small]#xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-03.adoc[_» more..._]# Same as the related overload above for `insertAndMoveToFront`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class ALLOCATOR> static void xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-0d.adoc[insertAndMoveToFront]( xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator]* toBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] fromBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] position, xref:BloombergLP/bslalg/DequePrimitives-01/size_type.adoc[size_type] numElements, VALUE_TYPE const& value, ALLOCATOR allocator, xref:bsl/integral_constant-02.adoc[bsl::integral_constant<int, BSLALG_DEQUEPRIMITIVES_NIL_TRAITS>]); ---- [.small]#xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-0d.adoc[_» more..._]# Insert the specified `numElements` in the range `[first .. last)]` 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 end 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 `fromBefore` position to insert `numElements`). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class FWD_ITER, class SENTINEL, class ALLOCATOR> static void xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-0e.adoc[insertAndMoveToFront]( xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator]* toBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] fromBegin, xref:BloombergLP/bslalg/DequePrimitives-01/Iterator.adoc[Iterator] position, FWD_ITER first, SENTINEL last, xref:BloombergLP/bslalg/DequePrimitives-01/size_type.adoc[size_type] numElements, ALLOCATOR allocator); ---- [.small]#xref:BloombergLP/bslalg/DequePrimitives-01/insertAndMoveToFront-0e.adoc[_» more..._]# [.small]#Created with https://www.mrdocs.com[MrDocs]#