Version 5.0 The LEDA User Manual

6.10 Integer Sets ( int set )
1. Definition
An instance S of the data type int set is a subset of a fixed interval [a..b] of the integers,
called the range of S.
#include < LEDA/core/int set.h >
2. Creation
int set S(int a, int b);
creates an instance S of type int set for elements from [a..b] and
initializes it to the empty set.
int set S(int n); creates an instance S of type int set for elements from [0..n − 1]
and initializes it to the empty set.
3. Operations
void S.insert(int x) adds x to S.
Precondition: a ≤ x ≤ b.
void S.del(int x) deletes x from S.
Precondition: a ≤ x ≤ b.
bool S.member(int x) returns true if x in S, false otherwise.
Precondition: a ≤ x ≤ b.
int S.min( ) returns the minimal integer in the range of of S.
int S.max( ) returns the maximal integer in the range of of S.
void S.clear( ) makes S the empty set.
In any binary operation below, S and T must have the same range:
int set& S.join(const int set& T )
replaces S by S ∪ T and returns it.
int set& S.intersect(const int set& T )
replaces S by S ∩ T and returns it.
int set& S.diff(const int set& T )
replaces S by S \ T and returns it.
int set& S.symdiff(const int set& T )
replaces S by (S \ T ) ∪ (T \ S) and returns it.
int set& S.complement( )
replaces S by [a..b] \ S and returns it.