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

`remove` overloads

== Synopses

Declared in `<bdlcc_timequeue.h>`

Remove from this queue the item having the specified `handle`, and optionally load into the optionally specified `item` the time and data values of the recently removed item. Optionally use the specified `key` to uniquely identify the item. If specified, load into the optionally specified `newMinTime`, the resulting lowest time value remaining in the queue. Return 0 on success, and a non‐zero value if no item with the `handle` exists in the queue. Note that if `DATA` follows the `bdema` allocator model, the allocator of the `item` instance is used to supply memory.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
xref:BloombergLP/bdlcc/TimeQueue-09c/remove-06.adoc[remove](
    xref:BloombergLP/bdlcc/TimeQueue-09c/Handle.adoc[Handle] handle,
    int* newLength = 0,
    xref:BloombergLP/bsls/TimeInterval.adoc[bsls::TimeInterval]* newMinTime = 0,
    xref:BloombergLP/bdlcc/TimeQueueItem.adoc[TimeQueueItem<DATA>]* item = 0);
----

[.small]#xref:BloombergLP/bdlcc/TimeQueue-09c/remove-06.adoc[_» more..._]#

Same as the preceding overload, with the specified `key`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
xref:BloombergLP/bdlcc/TimeQueue-09c/remove-07.adoc[remove](
    xref:BloombergLP/bdlcc/TimeQueue-09c/Handle.adoc[Handle] handle,
    xref:BloombergLP/bdlcc/TimeQueue-09c/Key.adoc[Key] const& key,
    int* newLength = 0,
    xref:BloombergLP/bsls/TimeInterval.adoc[bsls::TimeInterval]* newMinTime = 0,
    xref:BloombergLP/bdlcc/TimeQueueItem.adoc[TimeQueueItem<DATA>]* item = 0);
----

[.small]#xref:BloombergLP/bdlcc/TimeQueue-09c/remove-07.adoc[_» more..._]#


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