Documentation

Sets of integers from 0 to 63 efficiently implemented using a Word64

Construct a set given a list of set members.

>>> fromList []
fromList []

>>> fromList [0]
fromList [0]

>>> fromList [63]
fromList [63]

>>> fromList [0,10,20]
fromList [0,10,20]

Return an ordered list of the elements in the set

Predicate for integer elements that fit in a SmallSet

The set with no members.

>>> empty
fromList []

Make a new set with a single element

>>> singleton 42
fromList [42]

Compute the union of two sets

>>> union (fromList [3,4,5,6]) (fromList [5,6,7,8])
fromList [3,4,5,6,7,8]

Union of the sets in a list

>>> unions []
fromList []

>>> unions [singleton 1, fromList [2,4], fromList [2,3]]
fromList [1,2,3,4]

Compute the intersection of two sets

>>> intersection (fromList [3,4,5,6]) (fromList [5,6,7,8])
fromList [5,6]

Subtract the elements of the second set from the first set.

>>> difference (fromList [3,4,5,6]) (fromList [5,6,7,8])
fromList [3,4]

Add an element to a set

>>> insert 10 (fromList [3,4,5])
fromList [3,4,5,10]

>>> insert 5 (fromList [3,4,5])
fromList [3,4,5]

Remove an element from a set

>>> delete 5 (fromList [3,4,5])
fromList [3,4]

>>> delete 8 (fromList [3,4,5])
fromList [3,4,5]

Check if a set contains an element

>>> member 8 (fromList [3,4,5])
False

>>> member 4 (fromList [3,4,5])
True

Number of elements in a set.

>>> size (fromList [1,2,3])
3

>>> size empty
0