No subtrees should be empty. Returns True if one is.

Join a key so that an EnumMapMap of EnumMapMaps becomes an EnumMapMap.

newtype ID = ID Int deriving Enum
emm :: EnumMapMap (K Int) (EnumMapMap (K ID) Bool)
res :: EnumMapMap (Int :& K ID) Bool
res = joinKey emm

joinKey is the opposite of splitKey.

emm = empty :: EnumMapMap (Int :& Int :& K ID) Bool)
emm == joinKey $ splitKey d2 emm

Join a key so that an EnumMapMap of EnumMapMaps becomes an EnumMapMap. The unsafe version does not check for empty subtrees, so it is faster.

newtype ID = ID Int deriving Enum
emm :: EnumMapMap (K Int) (EnumMapMap (K ID) Bool)
res :: EnumMapMap (Int :& K ID) Bool
res = unsafeJoinKey emm

The empty EnumMapMap.

Is the EnumMapMap empty?

Submaps can never be empty, so the following should always hold true:

emm :: EnumMapMap (Int :& Int :& K ID) Bool)
null $ splitKey x emm == False

Number of elements in the EnumMapMap.

The expression (alter f k emm) alters the value at k, or absence thereof. alter can be used to insert, delete, or update a value in an EnumMapMap.

Map a function over all values in the EnumMapMap.

Map values and collect the Just results.

Map keys/values and collect the Just results.

Map a function over all key/value pairs in the EnumMapMap.

TraverseWithKey behaves exactly like a regular traverse except that the traversing function also has access to the key associated with a value.

Fold the values in the EnumMapMap using the given right-associative binary operator

Fold the keys and values in the EnumMapMap using the given right-associative binary operator.

Convert the EnumMapMap to a list of key/value pairs.

Create an EnumMapMap from a list of key/value pairs.

List of elements in ascending order of keys

List of keys

The EnumMapSet of the keys. EnumMapMap keys can be converted into EnumMapSet keys using toS, and back again using toK.

Build an EnumMapMap from an EnumMapSet and a function which for each key computes it's value

The minimal key and value of the EnumMapMap.

findMin empty -- ERROR, no minimal key
findMin $ fromList [(K 1, "a", K 3, "b")] == (K 1, a)

Retrieves the minimal (key,value) pair of the EnumMapMap, and the EnumMapMap stripped of that element, or Nothing if passed an empty map.

The (left-biased) union of two EnumMapMaps. It prefers the first EnumMapMap when duplicate keys are encountered.

The union of a list of maps.

The union of a list of maps with a combining function

The union with a combining function.

The union with a combining function.

Difference between two EnumMapMaps (based on keys).

Difference with a combining function.

Difference with a combining function.

The (left-biased) intersection of two EnumMapMap (based on keys).

The intersection with a combining function.

The intersection with a combining function.

Is the key present in the EnumMapMap?

An EnumMapMap with one element

singleton (5 :& K 3) "a" == fromList [(5 :& K 3, "a")]
singleton (K 5) $ singleton (K 2) "a" == fromList [(5 :& K 3, "a")]

Lookup up the value at a key in the EnumMapMap.

emm = fromList [(3 :& K 1, "a")]
lookup (3 :& K 1) emm == Just "a"
lookup (2 :& K 1) emm == Nothing

If the given key has less dimensions then the EnumMapMap then a submap is returned.

emm2 = fromList [(3 :& 2 :& K 1, "a"), (3 :& 2 :& K 4, "a")]
lookup (3 :& K 2) emm2 == Just $ fromList [(K 1, "a"), (K 4, "a")]

Insert a new key/value pair into the EnumMapMap. Can also insert submaps.

Insert with a combining function. Can also insert submaps.

Insert with a combining function. Can also insert submaps.

Remove a key and it's value from the EnumMapMap. If the key is not present the original EnumMapMap is returned.