#include <fixed_queue.h>
Public Member Functions | |
| size_type | size () const |
| size_type | freeSize () const |
| bool | empty () const |
| bool | full () const |
| void | clear () |
| void | compact () |
| void | push (const T &v) |
| const T & | top () const |
| T & | top () |
| T | pop () |
| T & | operator[] (size_type i) |
| const T & | operator[] (size_type i) const |
Protected Attributes | |
| Common::Array< T > | _data |
| size_type | _topIndex |
Extremely simple fixed size queue class.
|
inline |
Returns the size of the queue in use
|
inline |
Returns the amount of free remaining space in the queue
|
inline |
Returns true if the queue is empty
|
inline |
Returns true if the queue is full
|
inline |
Clears the queue
|
inline |
If the tail of the queue in use has reached the end of the internal array, pushes all pending data back to the start of the array
|
inline |
Adds a value to the end of the queue
|
inline |
Returns the top value on the queue
|
inline |
Returns the top value on the queue
|
inline |
Pops the top value off the queue
|
inline |
Returns values from within the queue without popping them
|
inline |
Returns values from within the queue without popping them