Data.Effect.OpenUnion.Internal.HO

Implementation of an open union for higher-order effects.

Importing this module allows unsafe access to the data structure of the open union, so it should not usually be imported directly.

Based on the open union in freer-simple.

Documentation

data UnionH (es :: [EffectH]) (f :: Type -> Type) a where

Open union for higher-order effects.

Constructors

UnionH

Fields

• :: forall (e :: (Type -> Type) -> Type -> Type) (g :: Type -> Type) a (f :: Type -> Type) (es :: [EffectH]). !Word

  A natural number tag to identify the element of the union.

• -> e g a

  The data of the higher-order effect that is an element of the union.

• -> (g ~> f)

  Continuation of interpretation. Due to this component, hfmap for UnionH becomes faster (because it no longer requires the HFunctor dictionary), thus improving overall performance.

• -> UnionH es f a

Instances

HFunctor (UnionH es)

Defined in Data.Effect.OpenUnion.Internal.HO

Methods

hfmap :: forall (f :: Type -> Type) (g :: Type -> Type). (f :-> g) -> UnionH es f :-> UnionH es g

hfmapUnion :: forall (f :: Type -> Type) (g :: Type -> Type) (es :: [EffectH]) a. (f ~> g) -> UnionH es f a -> UnionH es g a

unsafeInjH :: forall e (f :: Type -> Type) a (es :: [EffectH]). Word -> e f a -> UnionH es f a

unsafePrjH :: forall e (es :: [EffectH]) (f :: Type -> Type) a. HFunctor e => Word -> UnionH es f a -> Maybe (e f a)

class FindElem e es => MemberH (e :: EffectH) (es :: [EffectH]) where

Methods

injH :: forall (f :: Type -> Type) a. e f a -> UnionH es f a

prjH :: forall (f :: Type -> Type) a. HFunctor e => UnionH es f a -> Maybe (e f a)

Instances

(FindElem e es, IfNotFound e es es) => MemberH e es

Defined in Data.Effect.OpenUnion.Internal.HO

Methods

injH :: forall (f :: Type -> Type) a. e f a -> UnionH es f a

prjH :: forall (f :: Type -> Type) a. HFunctor e => UnionH es f a -> Maybe (e f a)

type (<<|) = MemberH infix 3

type MemberHBy (key :: k) (e :: EffectH) (es :: [EffectH]) = ((key ##> e) <<| es, LookupH key es ~ (key ##> e), IfKeyNotFound key es es)

type family LookupH (key :: k) (r :: [(Type -> Type) -> Type -> Type]) :: EffectH where ...

Equations

LookupH (key :: k) ((key ##> e) ': _1) = key ##> e

LookupH (key :: k) (_1 ': r) = LookupH key r

decompH :: forall e (es :: [(Type -> Type) -> Type -> Type]) (f :: Type -> Type) a. HFunctor e => UnionH (e ': es) f a -> Either (UnionH es f a) (e f a)

decomp0H :: forall e (f :: Type -> Type) a. HFunctor e => UnionH '[e] f a -> Either (UnionH ('[] :: [EffectH]) f a) (e f a)

(!!+) :: forall e (f :: Type -> Type) a r (es :: [EffectH]). HFunctor e => (e f a -> r) -> (UnionH es f a -> r) -> UnionH (e ': es) f a -> r infixr 5

extractH :: forall e (f :: Type -> Type) a. HFunctor e => UnionH '[e] f a -> e f a

inj0H :: forall e (es :: [(Type -> Type) -> Type -> Type]) (f :: Type -> Type) a. e f a -> UnionH (e ': es) f a

injNH :: forall (i :: Nat) (es :: [(Type -> Type) -> Type -> Type]) (f :: Type -> Type) a. KnownNat i => ElemAt i es f a -> UnionH es f a

prjNH :: forall (i :: Nat) (es :: [(Type -> Type) -> Type -> Type]) (f :: Type -> Type) a. (KnownNat i, HFunctor (ElemAt i es)) => UnionH es f a -> Maybe (ElemAt i es f a)

weakenH :: forall (any :: EffectH) (es :: [EffectH]) (f :: Type -> Type) a. UnionH es f a -> UnionH (any ': es) f a

weakensH :: forall (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. IsSuffixOf es es' => UnionH es f a -> UnionH es' f a

weakenNH :: forall (len :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. WeakenN len es es' => UnionH es f a -> UnionH es' f a

weakenUnderH :: forall (any :: EffectH) (e :: EffectH) (es :: [EffectH]) (f :: Type -> Type) a. UnionH (e ': es) f a -> UnionH (e ': (any ': es)) f a

weakensUnderH :: forall (offset :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. WeakenUnder offset es es' => UnionH es f a -> UnionH es' f a

weakenNUnderH :: forall (len :: Natural) (offset :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. WeakenNUnder len offset es es' => UnionH es f a -> UnionH es' f a

strengthenH :: forall (e :: EffectH) (es :: [EffectH]) (f :: Type -> Type) a. e <<| es => UnionH (e ': es) f a -> UnionH es f a

strengthensH :: forall (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. Strengthen es es' => UnionH es f a -> UnionH es' f a

strengthenNH :: forall (len :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. StrengthenN len es es' => UnionH es f a -> UnionH es' f a

strengthenUnderH :: forall (e2 :: EffectH) (e1 :: EffectH) (es :: [EffectH]) (f :: Type -> Type) a. e2 <<| es => UnionH (e1 ': (e2 ': es)) f a -> UnionH (e1 ': es) f a

strengthensUnderH :: forall (offset :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. StrengthenUnder offset es es' => UnionH es f a -> UnionH es' f a

strengthenNUnderH :: forall (len :: Natural) (offset :: Natural) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. StrengthenNUnder len offset es es' => UnionH es f a -> UnionH es' f a

bundleUnionH :: forall (bundle :: [EffectH]) (es :: [EffectH]) (rest :: [EffectH]) (f :: Type -> Type) a. Split es bundle rest => UnionH es f a -> UnionH (UnionH bundle ': rest) f a

bundleUnionNH :: forall (len :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. KnownNat len => UnionH es f a -> UnionH (UnionH (Take len es) ': Drop len es) f a

unbundleUnionH :: forall (bundle :: [EffectH]) (es :: [EffectH]) (rest :: [EffectH]) (f :: Type -> Type) a. Split es bundle rest => UnionH (UnionH bundle ': rest) f a -> UnionH es f a

unbundleUnionNH :: forall (len :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. KnownNat len => UnionH (UnionH (Take len es) ': Drop len es) f a -> UnionH es f a

bundleUnionUnderH :: forall (offset :: Natural) (bundle :: [EffectH]) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. BundleUnder UnionH offset es es' bundle => UnionH es f a -> UnionH es' f a

bundleUnionNUnderH :: forall (len :: Nat) (offset :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. (KnownNat len, KnownNat offset) => UnionH es f a -> UnionH (Take offset es ++ (UnionH (Take len (Drop offset es)) ': Drop len (Drop offset es))) f a

unbundleUnionUnderH :: forall (offset :: Natural) (bundle :: [EffectH]) (es :: [EffectH]) (es' :: [EffectH]) (f :: Type -> Type) a. BundleUnder UnionH offset es es' bundle => UnionH es' f a -> UnionH es f a

unbundleUnionNUnderH :: forall (len :: Nat) (offset :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. (KnownNat len, KnownNat offset) => UnionH (Take offset es ++ (UnionH (Take len (Drop offset es)) ': Drop len (Drop offset es))) f a -> UnionH es f a

bundleAllUnionH :: forall (es :: [EffectH]) (f :: Type -> Type) a. UnionH es f a -> UnionH '[UnionH es] f a

unbundleAllUnionH :: forall (es :: [EffectH]) (f :: Type -> Type) a. UnionH '[UnionH es] f a -> UnionH es f a

prefixUnionH :: forall (any :: [EffectH]) (es :: [EffectH]) (f :: Type -> Type) a. KnownLength any => UnionH es f a -> UnionH (any ++ es) f a

prefixUnionUnderH :: forall (any :: [EffectH]) (offset :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. (KnownLength any, KnownNat offset) => UnionH es f a -> UnionH (Take offset es ++ (any ++ Drop offset es)) f a

suffixUnionH :: forall (any :: [EffectH]) (es :: [EffectH]) (f :: Type -> Type) a. UnionH es f a -> UnionH (es ++ any) f a

suffixUnionOverNH :: forall (any :: [EffectH]) (offset :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. (KnownLength any, KnownNat offset, KnownLength es) => UnionH es f a -> UnionH (Take (Length es - offset) es ++ (any ++ Drop (Length es - offset) es)) f a

flipAllUnionH :: forall (es :: [EffectH]) (f :: Type -> Type) a. KnownLength es => UnionH es f a -> UnionH (Reverse es) f a

flipUnionH :: forall (len :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. KnownNat len => UnionH es f a -> UnionH (Reverse (Take len es) ++ Drop len es) f a

flipUnionUnderH :: forall (len :: Nat) (offset :: Nat) (es :: [EffectH]) (f :: Type -> Type) a. (KnownNat len, KnownNat offset) => UnionH es f a -> UnionH (Take offset es ++ (Reverse (Take len (Drop offset es)) ++ Drop len (Drop offset es))) f a

nilH :: forall (f :: Type -> Type) a r. UnionH ('[] :: [EffectH]) f a -> r