Elm
1.0
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/data/ListQueue.h>
Public Member Functions | |
ListQueue (void) | |
~ListQueue (void) | |
bool | isEmpty (void) const |
const T & | head (void) const |
T | get (void) |
void | put (const T &item) |
void | reset (void) |
ListQueue & | operator<< (const T &v) |
ListQueue & | operator>> (T &v) |
Simple implementation of a queue as a single link list. Notice that this class provides operator << and >> for easy use.
T | Type of items stored in queue. |
Implemented concepts:
Access complexity:
Memory usage:
elm::ListQueue< T, E >::ListQueue | ( | void | ) |
elm::ListQueue< T, E >::~ListQueue | ( | void | ) |
References elm::ListQueue< T, E >::reset().
T elm::ListQueue< T, E >::get | ( | void | ) |
Get and remove the head of the queue.
const T & elm::ListQueue< T, E >::head | ( | void | ) | const |
Get the head of the queue.
bool elm::ListQueue< T, E >::isEmpty | ( | void | ) | const |
Test if the queue is empty.
ListQueue& elm::ListQueue< T, E >::operator<< | ( | const T & | v | ) |
References elm::ListQueue< T, E >::put().
ListQueue& elm::ListQueue< T, E >::operator>> | ( | T & | v | ) |
void elm::ListQueue< T, E >::put | ( | const T & | item | ) |
Add a new item at the end of the queue.
item | Item to add. |
Referenced by elm::ListQueue< T, E >::operator<<().
void elm::ListQueue< T, E >::reset | ( | void | ) |
Reset the queue.
Referenced by elm::ListQueue< T, E >::~ListQueue().