Sets
Set Operations
Section titled “Set Operations”| Function | Description |
|---|---|
set.of |
Create a set from list xs of primitive values, in one pass (duplicates removed) |
set.from-list |
Alias of set.of: create a set from list xs of primitive values |
set.to-list |
Return sorted list of elements in set s |
set.add |
Add element e to set s |
set.remove |
Remove element e from set s |
set.contains? |
True if set s contains element e |
set.size |
Return number of elements in set s |
set.empty?(s) |
True if set s has no elements |
set.union |
Return union of sets a and b |
set.intersect |
Return intersection of sets a and b |
set.diff |
Return elements in set a that are not in set b |
set.sample(k, s, stream) |
Random monad action: pick n random elements from set s. Returns value/rest block; a negative n samples nothing; a non-integer n is an error |
∅ |
The empty set |
(l ∈ r) |
True if element v is a member of set s |
(l ∉ r) |
True if element v is not a member of set s |
s: set.of([1, 2, 3, 2, 1])# s contains {1, 2, 3} (duplicates removed)Set Algebra
Section titled “Set Algebra”a: set.from-list([1, 2, 3])b: set.from-list([2, 3, 4])u: set.union(a, b) set.to-list # [1, 2, 3, 4]i: set.intersect(a, b) set.to-list # [2, 3]d: set.diff(a, b) set.to-list # [1]