#include <Containers_T.h>
Collaboration diagram for ACE_Fixed_Stack< T, ACE_SIZE >:

Public Methods | |
| ACE_Fixed_Stack (void) | |
| Initialize a new stack so that it is empty. | |
| ACE_Fixed_Stack (const ACE_Fixed_Stack< T, ACE_SIZE > &s) | |
| The copy constructor (performs initialization). | |
| void | operator= (const ACE_Fixed_Stack< T, ACE_SIZE > &s) |
| Assignment operator (performs assignment). | |
| ~ACE_Fixed_Stack (void) | |
| Perform actions needed when stack goes out of scope. | |
| int | push (const T &new_item) |
| Constant time placement of element on top of stack. | |
| int | pop (T &item) |
| Constant time removal of top of stack. | |
| int | top (T &item) const |
| Constant time examination of top of stack. | |
| int | is_empty (void) const |
| Returns 1 if the container is empty, otherwise returns 0. | |
| int | is_full (void) const |
| Returns 1 if the container is full, otherwise returns 0. | |
| size_t | size (void) const |
| The number of items in the stack. | |
| void | dump (void) const |
| Dump the state of an object. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Private Attributes | |
| size_t | size_ |
| Size of the allocated data. | |
| size_t | top_ |
| Keeps track of the current top of stack. | |
| T | stack_ [ACE_SIZE] |
| Holds the stack's contents. | |
This implementation of a Stack uses a fixed array with the size fixed at instantiation time.
Requirements and Performance Characteristics
|
||||||||||
|
Initialize a new stack so that it is empty. Initialize an empty stack. |
|
||||||||||
|
The copy constructor (performs initialization). Initialize the stack and copy the provided stack into the current stack. |
|
||||||||||
|
Perform actions needed when stack goes out of scope. Destroy the stack. |
|
||||||||||
|
Dump the state of an object.
|
|
||||||||||
|
Returns 1 if the container is empty, otherwise returns 0. Performs constant time check to see if stack is empty. |
|
||||||||||
|
Returns 1 if the container is full, otherwise returns 0. Performs constant time check to see if stack is full. |
|
||||||||||
|
Assignment operator (performs assignment). Perform a deep copy of the provided stack. |
|
||||||||||
|
Constant time removal of top of stack. Remove and return the top stack item. Returns -1 if the stack is already empty, 0 if the stack is not already empty, and -1 if failure occurs. |
|
||||||||||
|
Constant time placement of element on top of stack. Place a new item on top of the stack. Returns -1 if the stack is already full, 0 if the stack is not already full, and -1 if failure occurs. |
|
||||||||||
|
The number of items in the stack. Constant time access to the current size of the stack. |
|
||||||||||
|
Constant time examination of top of stack. Return top stack item without removing it. Returns -1 if the stack is already empty, 0 if the stack is not already empty, and -1 if failure occurs. |
|
|||||
|
Declare the dynamic allocation hooks.
|
|
|||||
|
Size of the allocated data.
|
|
|||||
|
Holds the stack's contents.
|
|
|||||
|
Keeps track of the current top of stack.
|
1.2.18