[#BloombergLP-bdlc-Queue-pushFront]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/Queue.adoc[Queue]::pushFront
:relfileprefix: ../../../
:mrdocs:

Insert the specified `item` into the front of this queue efficiently (in O[1]time when memory reallocation is not required). Note that this function is logically equivalent to (but generally more efficient than): ` insert(0, item); `

== Synopsis

Declared in `<bdlc_queue.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
pushFront(T const& item);
----


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