#include <arrayqueue.h>
|
| ArrayQueue () |
| constructor
|
|
| ArrayQueue (const ArrayQueue< TYPE > &rhs) |
| copy constructor
|
|
| ArrayQueue (ArrayQueue< TYPE > &&rhs) |
| move constructor
|
|
| ArrayQueue (const Array< TYPE > &rhs) |
| conversion constructor for array
|
|
void | operator= (const ArrayQueue< TYPE > &rhs) |
| assignment operator
|
|
void | operator= (ArrayQueue< TYPE > &&rhs) |
| move assignment operator
|
|
TYPE & | operator[] (IndexT index) const |
| access element by index, 0 is the frontmost element (next to be dequeued)
|
|
bool | operator== (const ArrayQueue< TYPE > &rhs) const |
| equality operator
|
|
bool | operator!= (const ArrayQueue< TYPE > &rhs) const |
| inequality operator
|
|
void | Reserve (SizeT num) |
| increase capacity to fit N more elements into the queue
|
|
SizeT | Size () const |
| returns number of elements in the queue
|
|
bool | IsEmpty () const |
| return true if queue is empty
|
|
void | Clear () |
| remove all elements from the queue
|
|
bool | Contains (const TYPE &e) const |
| return true if queue contains element
|
|
void | EraseIndex (const IndexT i) |
| erase element at index
|
|
void | Enqueue (const TYPE &e) |
| add element to the back of the queue
|
|
TYPE | Dequeue () |
| remove the element from the front of the queue
|
|
TYPE & | Peek () const |
| access to element at front of queue without removing it
|
|
◆ ArrayQueue() [1/4]
◆ ArrayQueue() [2/4]
◆ ArrayQueue() [3/4]
◆ ArrayQueue() [4/4]
conversion constructor for array
◆ Clear()
remove all elements from the queue
◆ Contains()
return true if queue contains element
◆ Dequeue()
remove the element from the front of the queue
◆ Enqueue()
add element to the back of the queue
◆ EraseIndex()
◆ IsEmpty()
return true if queue is empty
◆ operator!=()
◆ operator=() [1/2]
◆ operator=() [2/2]
◆ operator==()
◆ operator[]()
access element by index, 0 is the frontmost element (next to be dequeued)
◆ Peek()
access to element at front of queue without removing it
◆ Reserve()
increase capacity to fit N more elements into the queue
◆ Size()
returns number of elements in the queue
◆ queueArray
The documentation for this class was generated from the following file: