Same as the preceding overload, with the specified key.
Declared in <bdlcc_timequeue.h>
TimeQueue<DATA>::Handle
add(
bsls::TimeInterval const& time,
DATA const& data,
Key const& key,
int* isNewTop = 0,
int* newLength = 0);
handle for the item, or -1 if the queue is full
| Name | Description |
|---|---|
| time | scheduled time for the item |
| data | data associated with the item |
| key | key used to uniquely identify the item |
| isNewTop | optional flag set if the item is the new lowest |
| newLength | optional location for the new queue length |