![[Erlang Systems]](min_head.gif)
Sets are collections of elements with no duplicate elements. The representation of a set is not defined.
Set = set()Returns a new empty ordered set.
Set = term()Returns true if Set is an ordered set of
elements, otherwise false.
Set = term()Returns the number of elements in Set.
Set = set()List = [term()]Returns the elements of Set as a list.
List = [term()]Set = set()Returns an ordered set of the elements in List.
is_element(Element, Set) -> bool()
Element = term()Set = set()Returns true if Element is an element of
Set, otherwise false.
add_element(Element, Set1) -> Set2
Element = term()Set1 = Set2 = set()Returns a new ordered set formed from Set1 with
Element inserted.
del_element(Element, Set1) -> Set2
Element = term()Set1 = Set2 = set()Returns Set1, but with Element removed.
Set1 = Set2 = Set3 = set()Returns the merged (union) set of Set1 and
Set2.
SetList = [set()]Set = set()Returns the merged (union) set of the list of sets.
intersection(Set1, Set2) -> Set3
Set1 = Set2 = Set3 = set()Returns the intersection of Set1 and
Set2.
SetList = [set()]Set = set()Returns the intersection of the non-empty list of sets.
Set1 = Set2 = Set3 = set()Returns only the elements of Set1 which are not
also elements of Set2.
is_subset(Set1, Set2) -> bool()
Set1 = Set2 = set()Returns true when every element of Set1 is
also a member of Set2, otherwise false.
fold(Function, Acc0, Set) -> Acc1
Function = fun (E, AccIn) -> AccOutAcc0 = Acc1 = AccIn = AccOut = term()Set = set()Fold Function over every element in Set
returning the final value of the accumulator.
Pred = fun (E) -> bool()Set1 = Set2 = set()Filter elements in Set1 with boolean function
Fun.