|
| Queue () |
| initialize a Queue object, with head and tail pointing to nullptr More...
|
|
| ~Queue () |
| finalize a Queue object by deleting all items from it More...
|
|
bool | Enqueue (const Type &element) |
| Enqueue a new element at the end of queue element element to enqueue. More...
|
|
bool | Dequeue () |
| Dequeue the an element from the front of queue. More...
|
|
Type | Front () const |
| Access the front (next in line) element of queue. More...
|
|
SzType | Size () const |
| number of elements contained in More...
|
|
bool | Enque (const Type &element) |
| Enqueue a new element at the end of queue element element to enqueue. More...
|
|
bool | Deque () |
| Enqueue a new element at the end of queue element element to enqueue. More...
|
|
Type | Fore () const |
| Enqueue a new element at the end of queue element element to enqueue. More...
|
|
bool | Add (const Type &element) |
| add an element More...
|
|
bool | Deduce () |
| deduce one element More...
|
|
Type | Peek () const |
| peek into next element contained in More...
|
|
virtual bool | IsEmpty () const |
| check if empty More...
|
|
template<typename Type, typename SzType = int>
class scire::Queue< Type, SzType >
Linked List implementation of Queue.
Queue implemented as linked items. A pointer points to head and another to tail of the queue. A new element is always added to the tail of the queue and removed from the head. This is a FIFO structure.
Definition at line 116 of file queue.hpp.