Unavailable. Nobody can download this version any more, with elm or with the Lamdera compiler: github.com/opvasger/comparable is gone (deleted or private); Software Heritage not asked yet (this run's --swh-calls were used up); no fork with tag 2.0.0 found (60 same-name repos checked); no cached copy. Use another version.
A dictionary mapping unique keys to values. The keys can be any type.
Determine if two dictionaries contain the same entries.
Insert a key-value pair into a dictionary. Replaces value when there is a collision.
Update the value of a dictionary for a specific key with a given function.
Remove a key-value pair from a dictionary. If the key is not found, no changes are made.
Get all of the keys in a dictionary, sorted from lowest to highest.
Get all of the values in a dictionary, in the compare of their keys.
Convert a dictionary into an association list of key-value pairs, sorted by keys.
Convert an association list into a dictionary.
Apply a function to all values in a dictionary.
Fold over the key-value pairs in a dictionary from lowest key to highest key.
Fold over the key-value pairs in a dictionary from highest key to lowest key.
Keep only the key-value pairs that pass the given test.
Partition a dictionary according to some test. The first dictionary contains all key-value pairs which passed the test, and the second contains the pairs that did not.
Combine two dictionaries. If there is a collision, preference is given to the first dictionary.
Keep a key-value pair when its key appears in the second dictionary. Preference is given to values in the first dictionary.
Keep a key-value pair when its key does not appear in the second dictionary.
The most general way of combining two dictionaries. You provide three accumulators for when a given key appears:
Only in the left dictionary.
In both dictionaries.
Only in the right dictionary. You then traverse all the keys from lowest to highest, building up whatever you want.
A dictionary of keys and values.