sets
Functions for Set Manipulation
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 (==
).
Functions
new() -> set()
Returns a new empty set.
is_set(Set) -> boolean()
Set = term()
Returns true
if
is a set of
elements, otherwise false
.
is_element(Element, Set) -> boolean()
Element = term()
Set = set()
Returns true
if
is an element of
, otherwise false
.
add_element(Element, Set1) -> Set2
Element = term()
Set1 = Set2 = set()
Returns a new set formed from
with
inserted.
del_element(Element, Set1) -> Set2
Element = term()
Set1 = Set2 = set()
Returns
, but with
removed.
union(Set1, Set2) -> Set3
Set1 = Set2 = Set3 = set()
Returns the merged (union) set of
and
.
union(SetList) -> Set
Returns the merged (union) set of the list of sets.
intersection(Set1, Set2) -> Set3
Set1 = Set2 = Set3 = set()
Returns the intersection of
and
.
intersection(SetList) -> Set
Returns the intersection of the non-empty list of sets.
is_disjoint(Set1, Set2) -> boolean()
Set1 = Set2 = set()
Returns true
if
and
are disjoint (have no elements in common),
and false
otherwise.
subtract(Set1, Set2) -> Set3
Set1 = Set2 = Set3 = set()
Returns only the elements of
which are not
also elements of
.
is_subset(Set1, Set2) -> boolean()
Set1 = Set2 = set()
Returns true
when every element of
1 is
also a member of
, otherwise false
.
fold(Function, Acc0, Set) -> Acc1
Function = fun((E :: term(), AccIn) -> AccOut)
Set = set()
Acc0 = Acc1 = AccIn = AccOut = T
Fold
over every element in
returning the final value of the accumulator.
filter(Pred, Set1) -> Set2
Pred = fun((E :: term()) -> boolean())
Set1 = Set2 = set()
Filter elements in
with boolean function
.