ordsets
Functions for manipulating sets as ordered lists.
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. Elements are ordered according to the Erlang term order.
This module provides the same interface as the sets(3)
module but with a defined representation. One difference is that while sets
considers two elements as different if they do not match (=:=
), this module considers two elements as different if and only if they do not compare equal (==
).
ordset(T) = [T]
As returned by new/0
.
Returns a new ordered set formed from Ordset1
with Element
inserted.
Returns Ordset1
, but with Element
removed.
Filters elements in Ordset1
with boolean function Pred
.
Folds Function
over every element in Ordset
and returns the final value of the accumulator.
Returns an ordered set of the elements in List
.
Returns the intersection of the non-empty list of sets.
Returns the intersection of Ordset1
and Ordset2
.
Returns true
if Ordset1
and Ordset2
are disjoint (have no elements in common), otherwise false
.
Returns true
if Element
is an element of Ordset
, otherwise false
.
Returns true
if Ordset
is an empty set, otherwise false
.
Returns true
if Ordset
is an ordered set of elements, otherwise false
.
Returns true
when every element of Ordset1
is also a member of Ordset2
, otherwise false
.
Returns a new empty ordered set.
Returns the number of elements in Ordset
.
Returns only the elements of Ordset1
that are not also elements of Ordset2
.
Returns the elements of Ordset
as a list.
Returns the merged (union) set of the list of sets.
Returns the merged (union) set of Ordset1
and Ordset2
.
© 2010–2017 Ericsson AB
Licensed under the Apache License, Version 2.0.