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
Returns a new ordered set formed from
Ordset1, but with
Filters elements in
Ordset1 with boolean function
Function over every element in
Ordset and returns the final value of the accumulator.
Returns an ordered set of the elements in
Returns the intersection of the non-empty list of sets.
Returns the intersection of
Ordset2 are disjoint (have no elements in common), otherwise
Element is an element of
Ordset is an empty set, otherwise
Ordset is an ordered set of elements, otherwise
true when every element of
Ordset1 is also a member of
Returns a new empty ordered set.
Returns the number of elements in
Returns only the elements of
Ordset1 that are not also elements of
Returns the elements of
Ordset as a list.
Returns the merged (union) set of the list of sets.
Returns the merged (union) set of
© 2010–2017 Ericsson AB
Licensed under the Apache License, Version 2.0.