#include <Containers_T.h>
Collaboration diagram for ACE_Unbounded_Stack:
Public Types | |
typedef ACE_Unbounded_Stack_Iterator< T > | ITERATOR |
Public Methods | |
ACE_Unbounded_Stack (ACE_Allocator *alloc=0) | |
Initialize an empty stack using the user specified allocation strategy if provided. More... | |
ACE_Unbounded_Stack (const ACE_Unbounded_Stack< T > &s) | |
Initialize this stack to be an exact copy of <s>. More... | |
void | operator= (const ACE_Unbounded_Stack< T > &s) |
Perform a deep copy of the rhs into the lhs. More... | |
~ACE_Unbounded_Stack (void) | |
Destroy the underlying list for the stack. More... | |
int | push (const T &new_item) |
Place a new item on top of the stack. More... | |
int | pop (T &item) |
Remove and return the top stack item. More... | |
int | top (T &item) const |
Return top stack item without removing it. More... | |
int | is_empty (void) const |
Constant time check to see if the stack is empty. More... | |
int | is_full (void) const |
Always resturns 0 since the stack is unbounded. More... | |
int | insert (const T &new_item) |
Insert <new_item> into the Stack at the head (but doesn't allow duplicates). More... | |
int | remove (const T &item) |
Linear remove operation. More... | |
int | find (const T &item) const |
Linear find operation. More... | |
size_t | size (void) const |
Constant time access to the current stack size. More... | |
void | dump (void) const |
Dump the state of an object. More... | |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... | |
Private Methods | |
void | delete_all_nodes (void) |
Delete all the nodes in the stack. More... | |
void | copy_all_nodes (const ACE_Unbounded_Stack< T > &s) |
Copy all nodes from <s> to <this>. More... | |
Private Attributes | |
ACE_Node< T > * | head_ |
Head of the linked list of Nodes. More... | |
size_t | cur_size_ |
Current size of the stack. More... | |
ACE_Allocator * | allocator_ |
Allocation strategy of the stack. More... | |
Friends | |
class | ACE_Unbounded_Stack_Iterator< T > |
This implementation of an unbounded Stack uses a linked list. If you use the <insert> or <remove> methods you should keep in mind that duplicate entries aren't allowed. In general, therefore, you should avoid the use of these methods since they aren't really part of the ADT stack. The stack is implemented as a doubly linked list.
Requirements and Performance Characteristics
|
|
|
Initialize an empty stack using the user specified allocation strategy if provided.
|
|
Initialize this stack to be an exact copy of <s>.
|
|
Destroy the underlying list for the stack.
|
|
Copy all nodes from <s> to <this>.
|
|
Delete all the nodes in the stack.
|
|
Dump the state of an object.
|
|
Linear find operation.
|
|
Insert <new_item> into the Stack at the head (but doesn't allow duplicates). Returns -1 if failures occur, 1 if item is already present (i.e., no duplicates are allowed), else 0. |
|
Constant time check to see if the stack is empty.
|
|
Always resturns 0 since the stack is unbounded.
|
|
Perform a deep copy of the rhs into the lhs.
|
|
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. |
|
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. |
|
Linear remove operation.
|
|
Constant time access to the current stack size.
|
|
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.
|
|
Allocation strategy of the stack.
|
|
Current size of the stack.
|
|
Head of the linked list of Nodes.
|