Stack for holding red-black trees in symbol table
Public Methods
-
SymbolStack()
- Default constructor
-
~SymbolStack()
- Destructor
-
BalancedTree* push(BalancedTree* )
- Push new scope tree on to stack
-
BalancedTree* pop()
- Pop of top scope tree
-
BalancedTree* peek()
- Peek at current scope tree
-
int isEmpty()
- Is the stack empty?
-
int atTop()
- Are we at the top of the stack?
-
int moveDown()
- Moves current pointer, use in conjunction with peek() to traverse stack.
-
void moveTop()
- Move current pointer back to top
Documentation
Stack for holding red-black trees in symbol table
SymbolStack()
- Default constructor
~SymbolStack()
- Destructor
BalancedTree* push(BalancedTree* )
- Push new scope tree on to stack
BalancedTree* pop()
- Pop of top scope tree
BalancedTree* peek()
- Peek at current scope tree
int isEmpty()
- Is the stack empty?
int atTop()
- Are we at the top of the stack?
int moveDown()
-
Moves current pointer, use in conjunction with peek() to traverse stack.
Note that this doesn't affect push() and pop().
void moveTop()
- Move current pointer back to top
- This class has no child classes.
Alphabetic index HTML hierarchy of classes or Java
This page was generated with the help of DOC++.