|
|
queue< T, Container > Class Template Reference#include <c07p366.h>
List of all members.
Detailed Description
template<typename T, typename Container = deque <T>>
class queue< T, Container >
Definition at line 15 of file c07p366.h.
|
Public Member Functions |
| | queue (const Container &cnt=Container()) |
| bool | empty () const |
| size_type | size () const |
| T & | front () |
| T & | back () |
| void | pop () |
| void | push (const T &x) |
Constructor & Destructor Documentation
|
template<typename T, typename Container = deque <T>> |
| queue< T, Container >::queue |
( |
const Container & |
cnt = Container() |
) |
[explicit] |
|
|
|
Default constructor, initializes an empty queue. - Precondition:
- None.
- Postcondition:
- An empty queue exists.
|
Member Function Documentation
|
template<typename T, typename Container = deque <T>> |
| bool queue< T, Container >::empty |
( |
|
) |
const |
|
|
|
Determines if the queue is empty. - Precondition:
- None.
- Postcondition:
- None.
- Returns:
- True if the queue is empty, otherwise returns false.
|
|
template<typename T, typename Container = deque <T>> |
| size_type queue< T, Container >::size |
( |
|
) |
const |
|
|
|
Determines the size of the queue. size_type is an integral type. - Precondition:
- None.
- Postcondition:
- None.
- Returns:
- The number of items that are currently in the queue.
|
|
template<typename T, typename Container = deque <T>> |
| T& queue< T, Container >::front |
( |
|
) |
|
|
|
|
Returns a reference to the first item in the queue. - Precondition:
- None.
- Postcondition:
- The item is not removed from the queue.
- Returns:
- A reference to the first item in the queue.
|
|
template<typename T, typename Container = deque <T>> |
| T& queue< T, Container >::back |
( |
|
) |
|
|
|
|
Returns a reference to the last item in the queue. - Precondition:
- None.
- Postcondition:
- The item is not removed from the queue.
- Returns:
- A reference to the last item in the queue.
|
|
template<typename T, typename Container = deque <T>> |
| void queue< T, Container >::pop |
( |
|
) |
|
|
|
|
Removes the first item in the queue. - Precondition:
- None.
- Postcondition:
- The item at the front of the queue is removed.
|
|
template<typename T, typename Container = deque <T>> |
| void queue< T, Container >::push |
( |
const T & |
x |
) |
|
|
|
|
Inserts an item at the back of the queue. - Precondition:
- None.
- Postcondition:
- The item x is at the back of the queue.
- Parameters:
-
|
The documentation for this class was generated from the following file:
|
