Haskus.Utils.EADT

Extensible ADT

Documentation

newtype VariantF (xs :: [* -> *]) e

Recursive Functor-like Variant

Constructors

VariantF (V (ApplyAll e xs))

Instances

(Functor (VariantF fs), Functor f) => Functor (VariantF (f ': fs))

Defined in Haskus.Utils.EADT

Methods

fmap :: (a -> b) -> VariantF (f ': fs) a -> VariantF (f ': fs) b

(<$) :: a -> VariantF (f ': fs) b -> VariantF (f ': fs) a

Functor (VariantF ([] :: [* -> *]))

Defined in Haskus.Utils.EADT

Methods

fmap :: (a -> b) -> VariantF [] a -> VariantF [] b

(<$) :: a -> VariantF [] b -> VariantF [] a

Eq (V (ApplyAll e xs)) => Eq (VariantF xs e)

Defined in Haskus.Utils.EADT

Methods

(==) :: VariantF xs e -> VariantF xs e -> Bool

(/=) :: VariantF xs e -> VariantF xs e -> Bool

Ord (V (ApplyAll e xs)) => Ord (VariantF xs e)

Defined in Haskus.Utils.EADT

Methods

compare :: VariantF xs e -> VariantF xs e -> Ordering

(<) :: VariantF xs e -> VariantF xs e -> Bool

(<=) :: VariantF xs e -> VariantF xs e -> Bool

(>) :: VariantF xs e -> VariantF xs e -> Bool

(>=) :: VariantF xs e -> VariantF xs e -> Bool

max :: VariantF xs e -> VariantF xs e -> VariantF xs e

min :: VariantF xs e -> VariantF xs e -> VariantF xs e

Show (V (ApplyAll e xs)) => Show (VariantF xs e)

Defined in Haskus.Utils.EADT

Methods

showsPrec :: Int -> VariantF xs e -> ShowS

show :: VariantF xs e -> String

showList :: [VariantF xs e] -> ShowS

type family ApplyAll e (xs :: [* -> *]) :: [*] where ...

`ApplyAll e '[f,g,h] ==> '[f e, g e, h e]`

Equations

ApplyAll e '[] = '[]

ApplyAll e (f ': fs) = f e ': ApplyAll e fs

pattern FV :: forall c cs e. Popable c (ApplyAll e cs) => c -> VariantF cs e

Pattern-match in a VariantF

appendVariantF :: forall (ys :: [* -> *]) (xs :: [* -> *]) e. ApplyAll e (Concat xs ys) ~ Concat (ApplyAll e xs) (ApplyAll e ys) => VariantF xs e -> VariantF (Concat xs ys) e

toVariantFHead :: forall x xs e. x e -> VariantF (x ': xs) e

Set the first value

toVariantFTail :: forall x xs e. VariantF xs e -> VariantF (x ': xs) e

Set the tail

popVariantFHead :: forall x xs e. VariantF (x ': xs) e -> Either (VariantF xs e) (x e)

Pop VariantF head

popVariantF :: forall x xs ys e. (Popable (x e) (ApplyAll e xs), Filter (x e) (ApplyAll e xs) ~ ApplyAll e ys) => VariantF xs e -> Either (VariantF ys e) (x e)

Pop VariantF

mapVariantF :: forall a b cs e ds as. (MappableVariant (a e) (b e) as, ds ~ ReplaceNS (IndexesOf a cs) b cs, as ~ ApplyAll e cs, ApplyAll e ds ~ ReplaceNS (IndexesOf (a e) as) (b e) as) => (a e -> b e) -> VariantF cs e -> VariantF ds e

Map the matching types of a variant

variantFToValue :: VariantF '[f] e -> f e

Retrieve a single value

type LiftableF e xs ys = (IsSubset xs ys ~ True, LiftVariant (ApplyAll e xs) (ApplyAll e ys))

xs is liftable in ys

liftVariantF :: forall e as bs. LiftableF e as bs => VariantF as e -> VariantF bs e

Lift a VariantF into another

Extensible ADT

type EADT xs = Fix (VariantF xs)

An extensible ADT

type family f :<: xs where ...

Equations

f :<: xs = EADTF' f (EADT xs) xs

pattern VF :: forall e f cs. (e ~ EADT cs, f :<: cs) => f (EADT cs) -> EADT cs

Pattern-match in an extensible ADT

appendEADT :: forall ys xs zs. (zs ~ Concat xs ys, ApplyAll (EADT zs) zs ~ Concat (ApplyAll (EADT zs) xs) (ApplyAll (EADT zs) ys), Functor (VariantF xs)) => EADT xs -> EADT zs

Append new "constructors" to the EADT

liftEADT :: forall e as bs. (e ~ Fix (VariantF bs), LiftableF e as bs, Functor (VariantF as)) => EADT as -> EADT bs

Lift an EADT into another

popEADT :: forall xs f e. (f :<: xs, e ~ EADT xs, Popable (f e) (ApplyAll e xs), Filter (f e) (ApplyAll e xs) ~ ApplyAll e (Filter f xs)) => EADT xs -> Either (VariantF (Filter f xs) (EADT xs)) (f (EADT xs))

Pop an EADT value

Reexport

module Haskus.Utils.Functor