Version 5.0 The LEDA User Manual

6.9 Sets ( set )
1. Definition
An instance S of the parameterized data type set is a collection of elements of the
linearly ordered type E, called the element type of S. The size of S is the number of
elements in S, a set of size zero is called the empty set.
#include < LEDA/core/set.h >
2. Creation
set S;
creates an instance S of type set and initializes it to the empty
set.
3. Operations
void S.insert(const E& x) adds x to S.
void S.del(const E& x) deletes x from S.
bool S.member(const E& x) returns true if x in S, false otherwise.
const E& S.choose( ) returns an element of S.
Precondition: S is not empty.
set S.join(const set& T )
returns S ∪ T .
set S.diff(const set& T )
returns S − T .
set S.intersect(const set& T )
returns S ∩ T .
set S.symdiff(const set& T )
set S + const set& T
returns the symetric difference of S and T .
returns S.join(T ).
set S − const set& T
returns S.diff (T ).
set S & const set& T
returns S.intersect(T ).