Data.TotalMap

Finitely represented total maps. Represented by as a partial map and a default value. Has Applicative and Monad instances (unlike Data.Map).

Documentation

data TMap k v

Total map

Instances

Ord k => Monad (TMap k)

Functor (TMap k)

Ord k => Applicative (TMap k)

(Ord k, Monoid v) => Monoid (TMap k v)

fromPartial :: a -> Map k a -> TMap k a

Create a total map from a default value and a partial map.

(!) :: Ord k => TMap k v -> k -> v

Sample a total map. Semantic function.

tabulate :: Eq k => v -> Set k -> (k -> v) -> TMap k v

Construct a total map, given a default value, a set of keys, and a function to sample over that set. You might want to trim the result.

trim :: (Ord k, Eq v) => TMap k v -> TMap k v

Optimize a TMap, weeding out any explicit default values. A semantic no-op, i.e., (!) . trim == (!).

intersectionPartialWith :: Ord k => (a -> b -> c) -> TMap k a -> Map k b -> Map k c

Intersect a total map with a partial one using an element combinator.

codomain :: Ord v => TMap k v -> Set v

Witness the finiteness of the support concretely by giving its image.