Janiczek / elm-bidict / MultiBiDict.Assoc

A dictionary mapping unique keys to multiple values, which maintains a mapping from the values back to keys, allowing for modelling many-to-many relationships.

Example usage:

manyToMany : MultiBiDict String Int
manyToMany =
    MultiBiDict.empty
        |> MultiBiDict.insert "A" 1
        |> MultiBiDict.insert "B" 2
        |> MultiBiDict.insert "C" 3
        |> MultiBiDict.insert "A" 2

MultiBiDict.get "A" manyToMany
--> Set.fromList [1, 2]

MultiBiDict.getReverse 2 manyToMany
--> Set.fromList ["A", "B"]

This module in particular uses assoc-list and assoc-set under the hood to get rid of the comparable constraint on keys that's usually associated with Dicts and Sets.

Dictionaries


type MultiBiDict a b

The underlying data structure. Think about it as

type alias MultiBiDict a b =
    { forward : Dict a (Set b) -- just a normal Dict!
    , reverse : Dict b (Set a) -- the reverse mappings!
    }

Differences from Dict

toDict : MultiBiDict a b -> AssocList.Dict a (AssocSet.Set b)

Convert MultiBiDict into a Dict. (Throw away the reverse mapping.)

fromDict : AssocList.Dict a (AssocSet.Set b) -> MultiBiDict a b

Convert Dict into a MultiBiDict. (Compute the reverse mapping.)

getReverse : b -> MultiBiDict a b -> AssocSet.Set a

Get the keys associated with a value. If the value is not found, return an empty set.

uniqueValues : MultiBiDict a b -> List b

Get a list of unique values in the dictionary.

uniqueValuesCount : MultiBiDict a b -> Basics.Int

Get a count of unique values in the dictionary.

toReverseList : MultiBiDict a b -> List ( b, AssocSet.Set a )

Convert a dictionary into a reverse association list of value-keys pairs.

Build

empty : MultiBiDict a b

Create an empty dictionary.

singleton : a -> b -> MultiBiDict a b

Create a dictionary with one key-value pair.

insert : a -> b -> MultiBiDict a b -> MultiBiDict a b

Insert a key-value pair into a dictionary. Replaces value when there is a collision.

update : a -> (AssocSet.Set b -> AssocSet.Set b) -> MultiBiDict a b -> MultiBiDict a b

Update the value of a dictionary for a specific key with a given function.

remove : a -> b -> MultiBiDict a b -> MultiBiDict a b

Remove a single key-value pair from a dictionary. If the key is not found, no changes are made.

removeAll : a -> MultiBiDict a b -> MultiBiDict a b

Remove all key-value pairs for the given key from a dictionary. If the key is not found, no changes are made.

Query

isEmpty : MultiBiDict a b -> Basics.Bool

Determine if a dictionary is empty.

isEmpty empty == True

member : a -> MultiBiDict a b -> Basics.Bool

Determine if a key is in a dictionary.

get : a -> MultiBiDict a b -> AssocSet.Set b

Get the value associated with a key. If the key is not found, return Nothing. This is useful when you are not sure if a key will be in the dictionary.

animals = fromList [ ("Tom", Cat), ("Jerry", Mouse) ]

get "Tom"   animals == Just Cat
get "Jerry" animals == Just Mouse
get "Spike" animals == Nothing

size : MultiBiDict a b -> Basics.Int

Determine the number of key-value pairs in the dictionary.

Lists

keys : MultiBiDict a b -> List a

Get all of the keys in a dictionary, sorted from lowest to highest.

keys (fromList [ ( 0, "Alice" ), ( 1, "Bob" ) ]) == [ 0, 1 ]

values : MultiBiDict a b -> List b

Get all of the values in a dictionary, in the order of their keys.

values (fromList [ ( 0, "Alice" ), ( 1, "Bob" ) ]) == [ "Alice", "Bob" ]

toList : MultiBiDict a b -> List ( a, AssocSet.Set b )

Convert a dictionary into an association list of key-value pairs, sorted by keys.

fromList : List ( a, AssocSet.Set b ) -> MultiBiDict a b

Convert an association list into a dictionary.

Transform

map : (a -> b1 -> b2) -> MultiBiDict a b1 -> MultiBiDict a b2

Apply a function to all values in a dictionary.

foldl : (a -> AssocSet.Set b -> acc -> acc) -> acc -> MultiBiDict a b -> acc

Fold over the key-value pairs in a dictionary from lowest key to highest key.

getAges users =
    Dict.foldl addAge [] users

addAge _ user ages =
    user.age :: ages

-- getAges users == [33,19,28]

foldr : (a -> AssocSet.Set b -> acc -> acc) -> acc -> MultiBiDict a b -> acc

Fold over the key-value pairs in a dictionary from highest key to lowest key.

getAges users =
    Dict.foldr addAge [] users

addAge _ user ages =
    user.age :: ages

-- getAges users == [28,19,33]

filter : (a -> b -> Basics.Bool) -> MultiBiDict a b -> MultiBiDict a b

Keep only the mappings that pass the given test.

partition : (a -> AssocSet.Set b -> Basics.Bool) -> MultiBiDict a b -> ( MultiBiDict a b, MultiBiDict a b )

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

union : MultiBiDict a b -> MultiBiDict a b -> MultiBiDict a b

Combine two dictionaries. If there is a collision, preference is given to the first dictionary.

intersect : MultiBiDict a b -> MultiBiDict a b -> MultiBiDict a b

Keep a key-value pair when its key appears in the second dictionary. Preference is given to values in the first dictionary.

diff : MultiBiDict a b -> MultiBiDict a b -> MultiBiDict a b

Keep a key-value pair when its key does not appear in the second dictionary.

merge : (a -> AssocSet.Set b1 -> acc -> acc) -> (a -> AssocSet.Set b1 -> AssocSet.Set b2 -> acc -> acc) -> (a -> AssocSet.Set b2 -> acc -> acc) -> MultiBiDict a b1 -> MultiBiDict a b2 -> acc -> acc

The most general way of combining two dictionaries. You provide three accumulators for when a given key appears:

  1. Only in the left dictionary.
  2. In both dictionaries.
  3. Only in the right dictionary.

You then traverse all the keys from lowest to highest, building up whatever you want.