#include <ustl.h>
Public Types | |
| typedef Sequence::value_type | value_type |
| typedef Sequence::size_type | size_type |
| typedef Sequence::difference_type | difference_type |
| typedef Sequence::reference | reference |
| typedef Sequence::const_reference | const_reference |
| typedef Sequence::pointer | pointer |
Public Member Functions | |
| queue (void) | |
| Default constructor. | |
| queue (const Sequence &s) | |
Copies contents of s. | |
| bool | empty (void) const |
| Returns true if empty. | |
| size_type | size (void) const |
| Returns the number of elements. | |
| reference | front (void) |
| Returns the front element. | |
| const_reference | front (void) const |
| Returns the front element. | |
| reference | back (void) |
| Returns the back element. | |
| const_reference | back (void) const |
| Returns the back element. | |
| void | push (const value_type &v) |
Pushes v on the queue. | |
| void | pop (void) |
| Pops the topmost element from the queue. | |
| bool | operator== (const queue &s) |
Compares to s. | |
| bool | operator< (const queue &s) |
Compares to s. | |
The most efficient way to use this implementation is to fill the queue and the completely empty it before filling again.