[#BloombergLP-bdlcc-TimeQueue-091-popLE-0f]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/TimeQueue-091.adoc[TimeQueue<function<void()>>]::popLE
:relfileprefix: ../../../
:mrdocs:

Remove from this queue up to the specified `maxTimers` number of items that have a time value less than or equal to the specified `time`, and optionally append into the optionally specified `buffer` a list of the removed items, ordered by their corresponding time values (top item first). Optionally load into the optionally specified `newLength` the number of items remaining in this queue, and into the optionally specified `newMinTime` the lowest remaining time value in this queue. The behavior is undefined unless `maxTimers >= 0`. Note that `newMinTime` is only loaded if there are items remaining in the time queue; therefore, `newLength` should be specified and examined to determine whether items remain, and `newMinTime` used only when `newLength > 0`. Also note that if `DATA` follows the `bdema` allocator model, the allocator of the `buffer` vector is used to supply memory. Note finally that all the items appended into `buffer` have a time value less than or equal to the elements remaining in this queue.

== Synopsis

Declared in `<bdlcc_timequeue.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
popLE(
    xref:BloombergLP/bsls/TimeInterval.adoc[bsls::TimeInterval] const& time,
    int maxTimers);
----


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