CircularQueueList< T > Class Template Reference
[Collections]
#include <CircularQueueList.h>
Collaboration diagram for CircularQueueList< T >:
Detailed Description
template<class T>
class CircularQueueList< T >
a wrapper around CircularQueue to make it variable size
Logically extends the CirculuarQueue class to make it variable size as a FIFOLinkedList of CirculuarQueues. Again, this is done in a lock-free mechanism assuming one thread popping and one thread pushing, allocating chunks at a time.
- Todo:
- JWA, please check my docs
Definition at line 62 of file CircularQueueList.h.
Public Member Functions | |
| virtual uint64_t | size () const |
| Returns the number of elements in the queue. | |
| virtual bool | empty () const |
| Returns whether the queue is empty. | |
| virtual T & | front () const |
| Returns a reference to the first queue element. | |
| virtual void | pop () |
| Removes the first queue element. | |
| virtual void | push (const T &v) |
| Adds a new queue element to the end. | |
| virtual void | clear () |
| Removes all queue elements. | |
Public Attributes | |
| const size_t | MAX_SIZE |
| the maximum number of elements storable in each circular queue | |
The documentation for this class was generated from the following file:
- /home/elb/work/cs590n/mace/mace/lib/CircularQueueList.h
