[#BloombergLP-bdlcc-TimeQueue-091-popFront]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/TimeQueue-091.adoc[TimeQueue<function<void()>>]::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. Optionally load into the optionally specified `newLength`, the number of items remaining in the queue. Optionally load into the optionally specified `newMinTime` the new lowest time in this queue. Return 0 on success, and a non‐zero value if there are no items in the queue. Note that if `DATA` follows the `bdema` allocator model, the allocator of the `buffer` is used to supply memory.

== Synopsis

Declared in `<bdlcc_timequeue.h>`

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


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