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

Insert copies of the specified `item` at the back of its priority.

== Synopsis

Declared in `<bdlcc_multipriorityqueue.h>`

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

== Description

Insert the value of the specified `item` with the specified `itemPriority` onto the back of this multipriority queue before any queued items having a less urgent priority (higher value) than `itemPriority`, and after any items having the same or more urgent priority (lower value) than `itemPriority`. All of the specified `numItems` items are pushed as a single atomic action, unless the copy constructor for one of them throws an exception, 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. Note that this method is targeted for specific use by the class `bdlmt::MultipriorityThreadPool`. The behavior is undefined unless `0 <= itemPriority < numPriorities()`.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *item*
| item to insert
| *itemPriority*
| priority of `item` (0 is most urgent)
| *numItems*
| number of copies of `item` to insert
|===


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