Sets are collections of elements with no duplicate elements. The representation of a set is undefined.
This module provides the same interface as the ordsets(3) module but with an undefined 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 (==).
Returns a new set formed from Set1 with Element inserted.
Returns Set1, but with Element removed.
Filters elements in Set1 with boolean function Pred.
Folds Function over every element in Set and returns the final value of the accumulator. The evaluation order is undefined.
Returns a set of the elements in List.
Returns the intersection of the non-empty list of sets.
Returns the intersection of Set1 and Set2.
Returns true if Set1 and Set2 are disjoint (have no elements in common), otherwise false.
Returns true if Element is an element of Set, otherwise false.
Returns true if Set is an empty set, otherwise false.
Returns true if Set is a set of elements, otherwise false.
Returns true when every element of Set1 is also a member of Set2, otherwise false.
Returns a new empty set.
Returns the number of elements in Set.
Returns only the elements of Set1 that are not also elements of Set2.
Returns the elements of Set as a list. The order of the returned elements is undefined.
Returns the merged (union) set of the list of sets.
Returns the merged (union) set of Set1 and Set2.