Version 5.0 The LEDA User Manual

6.5 Bounded Stacks ( b stack )
1. Definition
An instance S of the parameterized data type b stack is a stack (see section 6.3) of
bounded size.
#include < LEDA/core/b stack.h >
2. Creation
b stack S(int n);
creates an instance S of type b stack that can hold up to n
elements. S is initialized with the empty stack.
3. Operations
const E& S.top( ) returns the top element of S.
Precondition: S is not empty.
const E& S.pop( ) deletes and returns the top element of S.
Precondition: S is not empty.
void S.push(const E& x) adds x as new top element to S.
Precondition: S.size() < n.
void S.clear( ) makes S the empty stack.
int S.size( ) returns the size of S.
bool S.empty( ) returns true if S is empty, false otherwise.
4. Implementation
Bounded stacks are implemented by C++vectors.
space requirement is O(n).
All operations take time O(1). The