Sets are collections of elements with no duplicate elements. The representation of a set is not defined.
This module provides exactly the same interface as the module ordsets but with a defined representation. One difference is that while this module considers two elements as different if they do not match (=:=), ordsets considers two elements as different if and only if they do not compare equal (==).
As returned by new/0.
new() -> set()
Returns a new empty set.
Returns true if Set is a set of elements, otherwise false.
Returns the number of elements in Set.
Returns the elements of Set as a list. The order of the returned elements is undefined.
Returns a set of the elements in List.
Returns true if Element is an element of Set, otherwise false.
Returns a new set formed from Set1 with Element inserted.
Returns Set1, but with Element removed.
Returns the merged (union) set of Set1 and Set2.
Returns the merged (union) set of the list of sets.
Returns the intersection of Set1 and Set2.
Returns the intersection of the non-empty list of sets.
Returns true if Set1 and Set2 are disjoint (have no elements in common), and false otherwise.
Returns only the elements of Set1 which are not also elements of Set2.
Returns true when every element of Set11 is also a member of Set2, otherwise false.
Fold Function over every element in Set returning the final value of the accumulator. The evaluation order is undefined.
Filter elements in Set1 with boolean function Pred.