|
version 1.10, 2001/07/10 22:31:15
|
version 1.10.2.2, 2001/12/03 02:28:44
|
|
|
|
| { | { |
| public: | public: |
| | |
| /** */ |
/** Default constructor. */ |
| Stack() { } | Stack() { } |
| | |
| /** */ |
/** Copy constructor. */ |
| Stack(const Stack<T>& x) : _rep(x._rep) { } | Stack(const Stack<T>& x) : _rep(x._rep) { } |
| | |
| /** */ |
/** This constructor was added to provide a fast way of creating a stack |
| |
with a single element on it. This constructor is necessary to realize |
| |
the return-value compiler optimization which permits objects used in |
| |
return/constructor expressions to be initialized only once. |
| |
|
| |
Notice that this constructor is explicit to avoid implicit |
| |
initialization of a stack with the type of T. |
| |
which |
| |
*/ |
| |
PEGASUS_EXPLICIT Stack(const T& x) { _rep.append(x); } |
| |
|
| |
/** Destructor. */ |
| ~Stack() { } | ~Stack() { } |
| | |
| /** */ |
/** Assignment operator. */ |
| Stack<T>& operator=(const Stack<T>& x) { _rep = x._rep; return *this; } | Stack<T>& operator=(const Stack<T>& x) { _rep = x._rep; return *this; } |
| | |
| /** isEmpty Tests to determine that the stack is empty |
/** Returns size of stack. */ |
| */ |
Uint32 size() const { return _rep.size(); } |
| |
|
| |
/** Tests whether stack is empty. */ |
| Boolean isEmpty() const { return _rep.size() == 0; } | Boolean isEmpty() const { return _rep.size() == 0; } |
| | |
| /**push adds one new entry to the stack |
/** Pushes entry onto the stack. */ |
| */ |
|
| void push(const T& x) { _rep.append(x); } | void push(const T& x) { _rep.append(x); } |
| | |
| /** Top - Return the top entry on the stack. However, the entry is not |
/** Returns reference to the top element on the stack. |
| removed from the stack. This is a peek at the top entry. |
@return reference to top element on stack. |
| |
@exception throws StackUnderflow if stack is empty. |
| */ | */ |
| T& top(); | T& top(); |
| | |
| /** Top - Return the top entry on the stack. However, the entry is not |
/** Const version of top() method. |
| removed from the stack |
|
| */ | */ |
| const T& top() const { return ((Stack<T>*)this)->top(); } | const T& top() const { return ((Stack<T>*)this)->top(); } |
| | |
| /** Remove the top entry from the stack. |
/** Pops top entry from stack. */ |
| */ |
|
| void pop(); | void pop(); |
| | |
| /** size returns the number of entries in the stack |
/** Provides indexing for stack. */ |
| */ |
|
| Uint32 size() const { return _rep.size(); } |
|
| |
|
| /** The [] operator provides a way to treat the stack as an |
|
| array so that entries within the stack can be manipulated. |
|
| */ |
|
| T& operator[](Uint32 i) { return _rep[i]; } | T& operator[](Uint32 i) { return _rep[i]; } |
| | |
| /** */ |
/** Const version of indxing operator. */ |
| const T& operator[](Uint32 i) const { return _rep[i]; } | const T& operator[](Uint32 i) const { return _rep[i]; } |
| | |
| |
void reserve(Uint32 capacity) { _rep.reserve(capacity); } |
| |
|
| private: | private: |
| | |
| Array<T> _rep; | Array<T> _rep; |
|
|
|
| template<class T> | template<class T> |
| T& Stack<T>::top() | T& Stack<T>::top() |
| { | { |
| if (!isEmpty()) |
if (isEmpty()) |
| |
throw StackUnderflow(); |
| |
|
| return _rep[_rep.size() - 1]; | return _rep[_rep.size() - 1]; |
| else |
|
| { |
|
| static T dummy = T(); |
|
| return dummy; |
|
| } |
|
| } | } |
| | |
| template<class T> | template<class T> |
| void Stack<T>::pop() | void Stack<T>::pop() |
| { | { |
| if (_rep.size() == 0) |
if (isEmpty()) |
| throw StackUnderflow(); | throw StackUnderflow(); |
| | |
| _rep.remove(_rep.size() - 1); | _rep.remove(_rep.size() - 1); |
Return to
Stack.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common