[#BloombergLP-bdlcc-MultipriorityQueue-pushFrontMultipleRaw]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/MultipriorityQueue.adoc[MultipriorityQueue]::pushFrontMultipleRaw
:relfileprefix: ../../../
:mrdocs:

Insert the value of the specified `item` with the specified `itemPriority` into the front of this multipriority queue the specified `numItems` times, before any queued items having the same or less urgent priority (higher value) than `itemPriority`, and after any items having more urgent priority (lower value) than `itemPriority`. All `numItems` items are pushed as a single atomic action, unless the copy constructor throws while creating one of them, in which case a possibly empty subset of the pushes will have completed and no memory will be leaked. `Raw` means that the push will succeed even if the multipriority queue is disabled. The behavior is undefined unless `0 <= itemPriority < numPriorities()`. Note that this method is targeted at specific uses by the class `bdlmt::MultipriorityThreadPool`.

== Synopsis

Declared in `<bdlcc_multipriorityqueue.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
pushFrontMultipleRaw(
    TYPE const& item,
    int itemPriority,
    int numItems);
----


[.small]#Created with https://www.mrdocs.com[MrDocs]#