Sets are collections of elements with no duplicate elements.
An ordset is a representation of a set, where an ordered
list is used to store the elements of the set. An ordered list
is more efficient than an unordered list.
OrdSet = ordset()Returns a new empty ordered set.
OrdSet = term()Returns true if OrdSet is an ordered set of
elements, otherwise false.
OrdSet = ordset()List = [term()]Returns the elements of OrdSet as a list.
List = [term()]OrdSet = ordset()Returns an ordered set of the elements in List.
is_element(Element, OrdSet) -> bool()
Element = term()OrdSet = ordset()Returns true if Element is an element of
OrdSet, otherwise false.
add_element(Element, OrdSet1) -> OrdSet2
Element = term()OrdSet1 = OrdSet2 = Ordset()Returns a new ordered set formed from OrdSet1 with
Element inserted.
del_element(Element, OrdSet1) -> OrdSet2
Element = term()OrdSet1 = OrdSet2 = ordset()Returns OrdSet1, but with Element removed.
union(OrdSet1, OrdSet2) -> OrdSet3
OrdSet1 = OrdSet2 = OrdSet3 = ordset()Returns the merged (union) set of OrdSet1 and
OrdSet2.
OrdSetList = [ordset()]OrdSet = ordset()Returns the merged (union) set of the list of sets.
intersection(OrdSet1, OrdSet2) -> OrdSet3
OrdSet1 = OrdSet2 = OrdSet3 = ordset()Returns the intersection of OrdSet1 and
OrdSet2.
intersection(OrdSetList) -> OrdSet
OrdSetList = [ordset()]OrdSet = ordset()Returns the intersection of the list of sets.
subtract(OrdSet1, OrdSet2) -> OrdSet3
OrdSet1 = OrdSet2 = OrdSet3 = ordset()Returns only the elements of OrdSet1 which are not
also elements of OrdSet2.
subset(OrdSet1, OrdSet2) -> bool()
OrdSet1 = OrdSet2 = ordset()Returns true when every element of OrdSet1 is
also a member of OrdSet2, otherwise false.