|Maintainer||Stefan Schmidt (email@example.com)|
Version : 0.1
The KeyMap is derived from the Data.Map type. The keys of the Map are
strings and the values can be arbitrary data objects. But you don't have to
specify the keys because every value-object is able to create it's own
key via the Key typeclass.
From the functionality, the KeyMap stands between a set and a Map. If you
want to insert an element to the map, it behaves like a set. You don't need
an additionnal key and it makes no different if you insert an object multiple
times. If you want to access the objects in the KeyMap, you can lookup them
via the key, so in this case this container behaves like an ordinary map.
The functions for this container are named after the standard Map and Set
|The KeyMap datatype.
|Every element of this map has to implement a key-function. which
gives us the key of the element
|The empty KeyMap.
|Test, if the MultiMap is empty.
|Inserts an element in the KeyMap.
|Gets all different elements for one key or an empty set.
|Get all different keys from the map.
|Get all different values in the map without regarding their keys.
|Test, if a key is in the KeyMap.
|Test, if a data object is in the KeyMap.
|Deletes a whole key from the KeyMap.
|Deletes a single elemet from the KeyMap.
|Creates a KeyMap from a list of keys.
|Transforms a KeyMap to a list of keys.
|The same as toList, but the keys are in ascending order.
|Produced by Haddock version 2.6.1|