Version 5.0 The LEDA User Manual

Stacks ( stack )
1. Definition
An instance S of the parameterized data type stack is a sequence of elements of data
type E, called the element type of S. Insertions or deletions of elements take place only
at one end of the sequence, called the top of S. The size of S is the length of the sequence,
a stack of size zero is called the empty stack.
2. Creation
stack S;
creates an instance S of type stack and initializes it to the
empty stack.
3. Operations
E S.top( ) returns the top element of S.
Precondition: S is not empty.
void S.push(E x) adds x as new top element to S.
E S.pop( ) deletes and returns the top element of S.
Precondition: S is not empty.
4. Implementation
Stacks are implemented by singly linked linear lists. All operations take time O(1), except
clear which takes time O(n), where n is the size of the stack.
Figure C.2: The manual page for the stack data type
Figure Header file of Stack shows a header file augmented by manual comments and
figure A Man-Page shows the manual page produced from it. The body of a manual
comment is an ordinary L A TEX-text augmented by the possiblity to quote code. Code
is quoted by enclosing it either between vertical bars (|. . . |) or between double square
brackets ([[. . . ]]). Code quoted by double square brackets is typeset using typewriter
font and code quoted by vertical bars is given a math-like appearance. So [[S.insert(E
x)]] produces S.insert(E x) and |S.insert(E x)| produces S.insert(E x).
Lman is based on the command lextract. See figure ldel and lextract.
lextract infile outfile [options]
reads infile, processes the manual commands in it, and writes the core of a TEX-file on
outfile. All Lman options apply. Lman itself works in three phases. It first produces a
tempory L A TEX-file
\documentclass[a4paper,size pt]{article}