Version 5.0 The LEDA User Manual

6.11 Dynamic Integer Sets ( d int set )
1. Definition
An instance S of the data type d int set is a subset of the integers.
#include < LEDA/core/d int set.h >
2. Creation
d int set S; creates an instance S of type d int set initializes it to the empty
set.
3. Operations
int S.min( ) returns the smallest element in S.
Precondition: S is not empty.
int S.max( ) returns the largest element in S.
Precondition: S is not empty.
void S.insert(int x) adds x to S. As the sets range is expanding
dynamically during insertion for the range
[S.min( ), S.max( )] inserting the extrema early
saves repeated reallocation time.
void S.del(int x) deletes x from S.
bool S.member(int x) returns true if x in S, false otherwise.
int S.choose( ) returns a random element of S.
Precondition: S is not empty.
bool S.empty( ) returns true if S is empty, false otherwise.
int S.size( ) returns the size of S.
void S.clear( ) makes S the empty set.
d int set S.join(const d int set& T ) returns S ∪ T .
d int set S.intersect(const d int set& T )
returns S ∩ T .
d int set S.diff(const d int set& T ) returns S − T .
d int set S.symdiff(const d int set& T )
returns the symmectric difference of S and T .
d int set S + const d int set& T returns the union S.join(T ).