#include <utils/pv/fairQueue.h>
- Loss-less. An entry will be returned by pop_front() corresponding to each call to push_back().
- Un-bounded. There is no upper limit to the number of times an entry may be queued other than machine constraints.
- Round robin. The order that entries are returned may not match the order they were added in. "Fairness" is achived by returning entries in a rotating fashion based on the order in which they were first added. Re-adding the same entry before it is popped does not change this order. Adding [A, A, B, A, C, C] would give out [A, B, C, A, C, A].
- Warning
- Only one thread should call pop_front() as push_back() does not broadcast (only wakes up one waiter)
The documentation for this class was generated from the following file:
1.8.5