|
|||
|
|
|
|||
|
|
#include <Queue.h>
Public Member Functions | |
| Queue () | |
| Constructs an empty queue. | |
| Queue (const Queue< E > &Q) | |
| Constructs a queue that is a copy of Q. | |
| ~Queue () | |
| bool | empty () const |
| Returns true iff the queue is empty. | |
| int | size () const |
| Returns the number of elements in the queue. | |
| const E & | top () const |
| Returns a reference to the front element. | |
| E & | top () |
| Returns a reference to the front element. | |
| const E & | bottom () const |
| Returns a reference to the back element. | |
| E & | bottom () |
| Returns a reference to the back element. | |
| Queue< E > & | operator= (const Queue< E > &Q) |
| Assignment operator. | |
| SListIterator< E > | append (const E &x) |
| Adds x at the end of queue. | |
| E | pop () |
| Removes front element and returns it. | |
| void | clear () |
| Makes the queue empty. | |
| const SList< E > & | getList () const |
| Conversion to const SList. | |
| const SListPure< E > & | getListPure () const |
| Conversion to const SListPure. | |
| void * | operator new (size_t nBytes) |
| void * | operator new (size_t, void *p) |
| void | operator delete (void *p, size_t nBytes) |
In contrast to QueuePure<E>, instances of Queue<E> store the number of elements contained in the queue.
Definition at line 138 of file Queue.h.
| ogdf::Queue< E >::Queue | ( | ) | [inline] |
| ogdf::Queue< E >::Queue | ( | const Queue< E > & | Q | ) | [inline] |
| ogdf::Queue< E >::~Queue | ( | ) | [inline] |
| bool ogdf::Queue< E >::empty | ( | ) | const [inline] |
| int ogdf::Queue< E >::size | ( | ) | const [inline] |
| const E& ogdf::Queue< E >::top | ( | ) | const [inline] |
| E& ogdf::Queue< E >::top | ( | ) | [inline] |
| const E& ogdf::Queue< E >::bottom | ( | ) | const [inline] |
| E& ogdf::Queue< E >::bottom | ( | ) | [inline] |
| Queue<E>& ogdf::Queue< E >::operator= | ( | const Queue< E > & | Q | ) | [inline] |
| SListIterator<E> ogdf::Queue< E >::append | ( | const E & | x | ) | [inline] |
| E ogdf::Queue< E >::pop | ( | ) | [inline] |
| void ogdf::Queue< E >::clear | ( | ) | [inline] |
| const SList<E>& ogdf::Queue< E >::getList | ( | ) | const [inline] |
| const SListPure<E>& ogdf::Queue< E >::getListPure | ( | ) | const [inline] |
| void* ogdf::Queue< E >::operator new | ( | size_t | nBytes | ) | [inline] |
| void* ogdf::Queue< E >::operator new | ( | size_t | , | |
| void * | p | |||
| ) | [inline] |
| void ogdf::Queue< E >::operator delete | ( | void * | p, | |
| size_t | nBytes | |||
| ) | [inline] |
