|
- A Logic Circuit Simulation Library in C++ |
|
|
- A Logic Circuit Simulation Library in C++ |
#include <queue.h>
Inheritance diagram for lcs::Queue< T >:
Public Member Functions | |
| Queue (void) | |
| Queue (const Queue< T > &q) | |
| ~Queue () | |
| void | enQueue (T element) |
| void | deQueue (void) |
| T | getFirstInQueue (void) const |
| T | getLastInQueue (void) const |
| int | getSize (void) const |
| void | popLast (void) |
| void | purge (void) |
| Queue< T > & | operator= (const Queue< T > &q) |
| lcs::Queue< T >::Queue | ( | void | ) |
Default constructor.
| lcs::Queue< T >::Queue | ( | const Queue< T > & | q | ) |
Copy constructor. This is only a shallow coppier. The new object and the original object will denote the same queue.
| lcs::Queue< T >::~Queue | ( | ) |
Destructor.
| void lcs::Queue< T >::deQueue | ( | void | ) |
Removes the first element from the queue.
| void lcs::Queue< T >::enQueue | ( | T | element | ) |
Adds an element to the end of the queue.
| element | The element to be added to the end of the queue. |
| T lcs::Queue< T >::getFirstInQueue | ( | void | ) | const |
Returns the first element in the queue.
| T lcs::Queue< T >::getLastInQueue | ( | void | ) | const |
Returns the last element in the queue.
| int lcs::Queue< T >::getSize | ( | void | ) | const [inline] |
Returns the length of the queue.
| Queue< T > & lcs::Queue< T >::operator= | ( | const Queue< T > & | q | ) |
The explicit assignment operator. The left lvalue and the rvalue will represent the same queue after the assignment.
| void lcs::Queue< T >::popLast | ( | void | ) |
Purges the last element in the queue.
| void lcs::Queue< T >::purge | ( | void | ) |
Destroys the queue.
