version 1.7, 2001/06/16 23:10:05
|
version 1.15.2.1, 2002/10/28 15:43:24
|
|
|
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001 The Open group, BMC Software, Tivoli Systems, IBM |
// Copyright (c) 2000, 2001, 2002 BMC Software, Hewlett-Packard Company, IBM, |
|
// The Open Group, Tivoli Systems |
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a copy | // Permission is hereby granted, free of charge, to any person obtaining a copy |
// of this software and associated documentation files (the "Software"), to | // of this software and associated documentation files (the "Software"), to |
|
|
{ | { |
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; } |
| |
/** */ |
/** 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; } |
| |
/** */ |
/** Pushes entry onto the stack. */ |
void push(const T& x) { _rep.append(x); } | void push(const T& x) { _rep.append(x); } |
| |
/** */ |
/** Returns reference to the top element on the stack. |
|
@return reference to top element on stack. |
|
@exception throws StackUnderflow if stack is empty. |
|
*/ |
T& top(); | T& top(); |
| |
/** */ |
/** Const version of top() method. |
|
*/ |
const T& top() const { return ((Stack<T>*)this)->top(); } | const T& top() const { return ((Stack<T>*)this)->top(); } |
| |
/** */ |
/** Pops top entry from stack. */ |
void pop(); | void pop(); |
| |
/** */ |
/** Provides indexing for stack. */ |
Uint32 size() const { return _rep.size(); } |
|
|
|
/** */ |
|
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 reserveCapacity(Uint32 capacity) { _rep.reserveCapacity(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); |