structures/bimultimap

A bidirectional multi map (BiMultiMap) A data structure that stores associations between keys and values in both directions A key can point to multiple values A value can point to multiple keys

For example, keys have association to values:

animal → [cat, lion]
pet → [cat]

And values have reverse association to those keys

cat → [animal, pet]
lion → [animal]

Types

BiMultiMap

opaque </>

pub opaque type BiMultiMap(k, v)

Values

delete

</>

pub fn delete(
  from from: BiMultiMap(k, v),
  key key: k,
) -> BiMultiMap(k, v)

Delete a key from the multimap This removes the association from this key to any values and from values to this key

delete_key_val

</>

pub fn delete_key_val(
  from from: BiMultiMap(k, v),
  key key: k,
  value value: v,
) -> BiMultiMap(k, v)

Delete a specific combination of key and value

delete_val

</>

pub fn delete_val(
  from from: BiMultiMap(k, v),
  value value: v,
) -> BiMultiMap(k, v)

Delete a value from the multimap This removes association from keys to this value and from this value to keys

get

</>

pub fn get(from from: BiMultiMap(k, v), key key: k) -> set.Set(v)

Get the associated values for a key

get_val

</>

pub fn get_val(
  from from: BiMultiMap(k, v),
  value value: v,
) -> set.Set(k)

Get the associated keys for a value

insert

</>

pub fn insert(
  into into: BiMultiMap(k, v),
  key key: k,
  value value: v,
) -> BiMultiMap(k, v)

Insert a key an associated value

new

</>

pub fn new() -> BiMultiMap(a, b)