Compare two Key
s. The ordering is total but otherwise arbitrary. (It uses
Name.quickCmp
internally.)
Instances For
Monadically fold the keys and values stored in a Trie
.
Fold the keys and values stored in a Trie
.
Instances For
Monadically fold the values stored in a Trie
.
Fold the values stored in a Trie
.
Instances For
The number of values stored in a Trie
.
Merge two Trie
s. Duplicate values are preserved.
Auxiliary definition for mergePreservingDuplicates
.
Monadically fold over the keys and values stored in a DiscrTree
.
Instances For
Fold over the keys and values stored in a DiscrTree
Instances For
Monadically fold over the values stored in a DiscrTree
.
Instances For
Fold over the values stored in a DiscrTree
.
Instances For
Extract the values stored in a DiscrTree
.
Instances For
Extract the keys and values stored in a DiscrTree
.
Instances For
Get the number of values stored in a DiscrTree
. O(n) in the size of the tree.
Instances For
Merge two DiscrTree
s. Duplicate values are preserved.