Fork of elm/core's Set, bypassing the
"comparable"-key limitation for UUIDs.
Also includes some extras.
Insert, remove, and query operations all take O(log n) time.
Get the intersection of two sets. Keeps values that appear in both sets.
Get the difference between the first set and the second. Keeps values that do not appear in the second set.
Map a function onto an elm/core's Set,
creating a new set with no duplicates.
Fold over the values in a set, in order from lowest to highest.
Fold over the values in a set, in order from highest to lowest.
Only keep elements that pass the given test.
See elm/core's Set.filter for the original version.
Create two new sets. The first contains all the elements that passed the given test, and the second contains all the elements that did not.
Represents a set of unique
UUIDs.