base package:mappings

A decision diagram (with no preferred starting point), containing leaves (representing final values of the decision process) indexed from -1 downwards, and nodes (representing the need to scrutinise a value) indexed from 0 upwards

Base :: Seq v -> Seq (Node k1 m a) -> Base (k1 :: k) (m :: Type -> Type) a v

mappings Data.Mapping.Decision

baseMap :: forall a (m :: Type -> Type) w k v . (Ord a, Ord (m Int), Ord w, Mapping k m) => (v -> w) -> Base k m a v -> Builder Int k m a w

mappings Data.Mapping.Decision

Map bases

baseMerge :: forall a w (m :: Type -> Type) k u v . (Ord a, Ord w, Ord (m Int), Mapping k m) => (u -> v -> w) -> Base k m a u -> Base k m a v -> Set (Int, Int) -> Builder (Int, Int) k m a w

mappings Data.Mapping.Decision

Merge two bases

baseMergeA :: forall f a w (m :: Type -> Type) k u v . (Applicative f, Ord a, Ord w, Ord (m Int), Mapping k m) => (u -> v -> f w) -> Base k m a u -> Base k m a v -> Set (Int, Int) -> f (Builder (Int, Int) k m a w)

mappings Data.Mapping.Decision

Merge two bases in an applicative functor

baseRecurse :: (Ord c, Mapping k m) => (v -> c) -> (a -> m c -> c) -> Base k m a v -> BaseMap c

mappings Data.Mapping.Decision

A general kind of recursive function on a Base

baseTraverse :: forall f a (m :: Type -> Type) w k v . (Applicative f, Ord a, Ord (m Int), Ord w, Mapping k m) => (v -> f w) -> Base k m a v -> f (Builder Int k m a w)

mappings Data.Mapping.Decision

Traverse bases

data BaseMap v

mappings Data.Mapping.Decision

A value for every node of a base

BaseMap :: Seq v -> Seq v -> BaseMap v

mappings Data.Mapping.Decision