![]() |
Elm
2
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) |
| bool | contains (const T &val) |
| void | put (const T &item) |
| void | reset (void) |
| operator bool (void) const | |
| 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:
References ListQueue< T, M >::reset().
|
inline |
|
inline |
Get and remove the head of the queue.
Referenced by ListQueue< T, M >::operator>>().
|
inline |
Get the head of the queue.
Test if the queue is empty.
Referenced by ListQueue< T, M >::operator bool().
References ListQueue< T, M >::isEmpty().
|
inline |
References ListQueue< T, M >::put().
|
inline |
References ListQueue< T, M >::get().
|
inline |
Add a new item at the end of the queue.
| item | Item to add. |
Referenced by ListQueue< T, M >::operator<<().
Reset the queue.
Referenced by ListQueue< T, M >::~ListQueue().