[#BloombergLP-bdlcc-TimeQueue-09c-popFront]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/TimeQueue-09c.adoc[TimeQueue]::popFront
:relfileprefix: ../../../
:mrdocs:

Atomically remove the top item from this queue, and optionally load into the optionally specified `buffer` the time and associated data of the item removed&period; Optionally load into the optionally specified `newLength`, the number of items remaining in the queue&period; Optionally load into the optionally specified `newMinTime` the new lowest time in this queue&period; Return 0 on success, and a non&hyphen;zero value if there are no items in the queue&period; Note that if `DATA` follows the `bdema` allocator model, the allocator of the `buffer` is used to supply memory&period;

== Synopsis

Declared in `&lt;bdlcc&lowbar;timequeue&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
popFront(
    xref:BloombergLP/bdlcc/TimeQueueItem.adoc[TimeQueueItem&lt;DATA&gt;]* buffer = 0,
    int* newLength = 0,
    xref:BloombergLP/bsls/TimeInterval.adoc[bsls::TimeInterval]* newMinTime = 0);
----


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