popLE overloads
Declared in <bdlcc_timequeue.h>
Remove all items with a time less than or equal to the specified time.
void
popLE(bsls::TimeInterval const& time);
» more...
Remove up to maxTimers items with a time less than or equal to time.
void
popLE(
bsls::TimeInterval const& time,
int maxTimers);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
bsl::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
std::pmr::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
std::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
int maxTimers,
bsl::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
int maxTimers,
std::pmr::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
Same as the preceding overload, appending removed items to the specified buffer.
void
popLE(
bsls::TimeInterval const& time,
int maxTimers,
std::vector<TimeQueueItem<DATA>>* buffer,
int* newLength = 0,
bsls::TimeInterval* newMinTime = 0);
» more...
| Name | Description |
|---|---|
| time | time threshold for removing items |
| maxTimers | maximum number of items to remove |
| buffer | receives the removed items |
| newLength | if non-null, receives the new queue length |
| newMinTime | if non-null, receives the new minimum time |