This parameterized class provides a public interface which is similar in structure and intent to Queue<DATA>, with the exception that each item stored in the TimeQueue has an associated time value. Items are retrieved or exchanged by proxy of a TimeQueueItem<DATA>, and are referred to by an opaque data type TimeQueue::Handle which serves to identify an individual element on the Time Queue. Idiomatic usage of TimeQueue includes the member function popLE, which finds all items on the queue whose bsls::TimeInterval are less than a specified value and transfers those items to a provided vector of items, and the member function update, which can update the time value for a specific TimeQueueItem without removing it from the queue.
Synopsis
Declared in <bdlcc_timequeue.h>
template<class DATA>
class TimeQueue;
Types
Name |
Description |
This type is a wrapper around a void pointer that will be supplied and used by clients to uniquely identify an item in the queue. |
Type Aliases
Name |
Description |
|
Member Functions
Name |
Description |
|
Constructors |
|
Destroy this time queue. |
|
|
Return the number of items in this queue that have a time value less than or equal to the specified |
|
|
|
Return number of items in this queue. Note that the value returned may be obsolete by the time it is received. |
|
Load into the specified |
|
Atomically remove the top item from this queue, and optionally load into the optionally specified |
|
|
|
|
|
Remove all the items from this queue. Optionally specify a |
|
Remove all the items from this queue for which |
|
|
Specializations
Name |
Description |
This parameterized class provides a public interface which is similar in structure and intent to |
Created with MrDocs