Version 5.0 The LEDA User Manual

d int set S − const d int set& T returns the difference S.diff (T ).
d int set S & const d int set& T returns the intersection of S and T .
d int set S | const d int set& T returns the union S.join(T ).
d int set S % const d int set& T returns the symmetric difference S.symdiff (T ).
d int set& S += const d int set& T assigns S.join(T ) to S and returns S.
d int set& S −= const d int set& T assigns S.diff (T ) to S and returns S.
d int set& S &= const d int set& T assigns S.intersect(T ) to S and returns S.
d int set& S |= const d int set& T assigns S.join(T ) to S and returns S.
d int set& S % = const d int set& T
assigns S.symdiff (T ) to S and returns S.
bool S != const d int set& T returns true if S ≠ T , false otherwise.
bool S == const d int set& T returns true if S = T , false otherwise.
bool S ≥ const d int set& T returns true if T ⊆ S, false otherwise.
bool S ≤ const d int set& T returns true if S ⊆ T , false otherwise.
bool S < const d int set& T returns true if S ⊂ T , false otherwise.
bool S > const d int set& T returns true if T ⊂ S, false otherwise.
void S.get element list(list& L)
Iteration
fills L with all elements stored in the set in increasing
order.
forall elements(x,S) { “the elements of S are successively assigned to x” }
4. Implementation
Dynamic integer sets are implemented by (dynamic) bit vectors. Operations member,
empty, size, min and max take constant time. The operations clear, intersection, union
and complement take time O(b−a+1), where a = max( ) and b = min( ). The operations