Version 5.0 The LEDA User Manual

15.3 Sets of Intervals ( interval set )
1. Definition
An instance S of the parameterized data type interval set is a collection of items
(is item). Every item in S contains a closed interval of the double numbers as key and an
information from data type I, called the information type of S. The number of items in
S is called the size of S. An interval set of size zero is said to be empty. We use
to denote the item with interval [x, y] and information i; x (y) is called the left (right)
boundary of the item. For each interval [x, y] there is at most one item ∈ S.
#include < LEDA/geo/interval set.h >
2. Creation
interval set S;
creates an instance S of type interval set and initializes S to
the empty set.
3. Operations
double S.left(is item it) returns the left boundary of item it.
Precondition: it is an item in S.
double S.right(is item it) returns the right boundary of item it.
Precondition: it is an item in S.
const I& S.inf(is item it) returns the information of item it.
Precondition: it is an item in S.
is item S.insert(double x, double y, const I& i)
is item S.lookup(double x, double y)
list const S.intersection(double a, double b)
associates the information i with interval [x, y].
If there is an item in S then j is replaced
by i, else a new item is added
to S. In both cases the item is returned.
returns the item with interval [x, y] (nil if no such
item exists in S).
returns all items ∈ S with [x, y] ∩
[a, b] ≠ ∅.
void S.del(double x, double y) deletes the item with interval [x, y] from S.
void S.del item(is item it) removes item it from S.
Precondition: it is an item in S.