add overloads

Synopses

Declared in <bdlcc_timequeue.h>

Add the value of the specified item to this queue. Optionally load into the optionally specified isNewTop a non‐zero value if the replaces is now the lowest element in this queue, and a 0 value otherwise. If specified, load into the optionally specified newLength, the new number of elements in this queue. Return a value that may be used to identify the newly added item in future calls to time queue on success, and ‐1 if the maximum queue length has been reached.

Handle
add(
    TimeQueueItem<function<void()>> const& item,
    int* isNewTop = 0,
    int* newLength = 0);

» more...

Add a new item to this queue having the specified time value, and associated data. Optionally use the specified key to uniquely identify the item in subsequent calls to remove and update. Optionally load into the optionally specified isNewTop a non‐zero value if the item is now the lowest item in this queue, and a 0 value otherwise. If specified, load into the optionally specified newLength, the new number of items in this queue. Return a value that may be used to identify the newly added item in future calls to time queue on success, and ‐1 if the maximum queue length has been reached.

Handle
add(
    bsls::TimeInterval const& time,
    function<void()> const& data,
    int* isNewTop = 0,
    int* newLength = 0);

» more...

Same as the preceding overload, with the specified key.

Handle
add(
    bsls::TimeInterval const& time,
    function<void()> const& data,
    Key const& key,
    int* isNewTop = 0,
    int* newLength = 0);

» more...

Created with MrDocs