|
Developer Documentation |
|
Centre for Vision, Speech & Signal Processing |
Comments:
Complexity proportional to sqrt(N); not N!
Parent Classes:
Derived Classes:
Child Classes:
Variables:
- int blkSize;
-
size of the first (top) block in the stack
- s_Blk * topBlk;
-
pointer to the first (top) block
- int top;
-
index of the first *empty* slot in the last block
this choice reduces the number of if statements;
as 'top' can't point to the top of the
stack (first occupied elem.) if the stack is empty
Methods:
- BaseStackG()
-
Default constructor
create an empty stack.
- BaseStackG(const BaseStackG<T> &)
-
Copy constructor.
- T & Top()
-
Access element at the top of the stack.
i.e. the next one returned if Pop() is called.
- const T & Top() const
-
Access element at the top of the stack.
i.e. the next one returned if Pop() is called.
- T & First()
-
Access element at the top of the stack.
i.e. the next one returned if Pop() is called.
Same as Top().
- const T & First() const
-
Access element at the top of the stack.
i.e. the next one returned if Pop() is called.
Same as Top().
- bool IsEmpty() const
-
Test if stack is empty.
Returns true if it is empty.
- long Size() const
-
Get the number of elements in the stack.
- void DbPrint()
-
Usefull for debuging the stack
Not usefull for normal users.
- BaseStackG<T> & operator=(const BaseStackG<T> &)
-
--------- private function for memory allocation
place at the top of the file to allow inlining
- s_Blk * AllocBlk() const
-
|
Programmer:George (Jiri) Matas, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001
|