Version 5.0 The LEDA User Manual

6.6 Bounded Queues ( b queue )
1. Definition
An instance Q of the parameterized data type b queue is a queue (see section 6.4) of
bounded size.
#include < LEDA/core/b queue.h >
2. Creation
b queue Q(int n);
creates an instance Q of type b queue that can hold up to n
elements. Q is initialized with the empty queue.
3. Operations
const E& Q.top( ) returns the front element of Q.
Precondition: Q is not empty.
const E& Q.pop( ) deletes and returns the front element of Q.
Precondition: Q is not empty.
void Q.del top( ) deletes the front element of Q.
Precondition: Q is not empty.
void Q.append(const E& x) appends x to the rear end of Q.
Precondition: Q.size()< n.
void Q.clear( ) makes Q the empty queue.
int Q.size( ) returns the size of Q.
bool Q.empty( ) returns true if Q is empty, false otherwise.
4. Implementation
Bounded queues are implemented by circular arrays. All operations take time O(1). The
space requirement is O(n).