Version 5.0 The LEDA User Manual

int set S | const int set& T returns the union of S and T .
int set S & const int set& T returns the intersection of S and T .
int set S − const int set& T returns the set difference of S and T .
int set S % const int set& T returns the symmetric difference of S and T .
int set ∼S returns the complement of S, i.e. [a..b] \ S.
4. Implementation
Integer sets are implemented by bit vectors. Operations insert, delete, member, min and
max take constant time. All other operations take time O(b − a + 1).