Control.Applicative.Graph

Documentation

type family DefaultThen (useReplace :: Bool) (f :: p -> * -> *) (i :: p) (j :: p) where ...

Equations

DefaultThen True f i j = Apply f (Replace f i) j

DefaultThen False f i j = LiftA2 f i j

type family DefaultThenCxt (useReplace :: Bool) (f :: p -> * -> *) (i :: p) (j :: p) where ...

Equations

DefaultThenCxt True f i j = (Apply f (Replace f i) j ~ Then f i j, ApplyInv f (Replace f i) j)

DefaultThenCxt False f i j = (LiftA2 f i j ~ Then f i j, LiftA2Inv f i j)

class GApplicativeThen useReplace f where

Minimal complete definition

gdefaultThenProxy, gdefaultThen

Methods

gdefaultThenProxy :: DefaultThenCxt useReplace f i j => proxy useReplace -> f i a -> f j b -> f (Then f i j) b

gdefaultThen :: DefaultThenCxt useReplace f i j => f i a -> f j b -> f (Then f i j) b

Instances

GApplicative p f => GApplicativeThen p False f

Methods

gdefaultThenProxy :: DefaultThenCxt False f f i j => proxy f -> f i a -> f j b -> f (Then False f i j) b

gdefaultThen :: DefaultThenCxt False f f i j => f i a -> f j b -> f (Then False f i j) b

GApplicative p f => GApplicativeThen p True f

Methods

gdefaultThenProxy :: DefaultThenCxt True f f i j => proxy f -> f i a -> f j b -> f (Then True f i j) b

gdefaultThen :: DefaultThenCxt True f f i j => f i a -> f j b -> f (Then True f i j) b

class (GFunctor f, GPointed f) => GApplicative f where

Graph indexed applicative functor.

Minimal complete definition

gap

Associated Types

type Apply f (i :: p) (j :: p) :: p

The apply operation (<*>) on the graph index.

Default instance: Apply f i j = Combine f i j

type ApplyInv f (i :: p) (j :: p) :: Constraint

An invariant on the indexes of Apply.

Default instance: ApplyInv m i j = Inv m i j

type LiftA2 f (i :: p) (j :: p) :: p

The liftA2 operation on the graph index.

Default instance: Lift f i j = Apply f (Apply f (Pure f) i) j

type LiftA2Inv f (i :: p) (j :: p) :: Constraint

An invariant on the indexes of But.

Default instance: ButInv m i j = ApplyInv m i j

type ThenUseReplace f :: Bool

Whether to use gliftA2, or gap and greplace in the definition of gthen.

If an efficient Replace exists, we should probably use that to reduce allocations. But liftA2 might also be appropriate.

type Then f (i :: p) (j :: p) :: p

The then operation (*>) on the graph index.

Default instance depends on ThenUseReplace f:

• True: Then f i j = Apply f (Replace f i) j
• False: Then f i j = LiftA2 f i j

type ThenInv f (i :: p) (j :: p) :: Constraint

An invariant on the indexes of Then.

Default instance: ThenInv m i j = ApplyInv m i j

type But f (i :: p) (j :: p) :: p

The but operation (<*) on the graph index.

Default instance: But f i j = LiftA2 f i j

type ButInv f (i :: p) (j :: p) :: Constraint

An invariant on the indexes of But.

Default instance: ButInv m i j = ApplyInv m i j

Methods

gap :: ApplyInv f i j => f i (a -> b) -> f j a -> f (Apply f i j) b

Sequential application (<*>).

gliftA2 :: LiftA2Inv f i j => (a -> b -> c) -> f i a -> f j b -> f (LiftA2 f i j) c

Lift a binary function to actions.

Default implementation is defined in terms of Apply and Fmap.

gliftA2 :: (Apply f (Fmap f i) j ~ LiftA2 f i j, ApplyInv f (Fmap f i) j) => (a -> b -> c) -> f i a -> f j b -> f (LiftA2 f i j) c

Lift a binary function to actions.

Default implementation is defined in terms of Apply and Fmap.

gthen :: ThenInv f i j => f i a -> f j b -> f (Then f i j) b

Sequence actions, discarding the value of the first argument (*>).

Default implementation requires the default instance of Then.

gthen :: (GApplicativeThen (ThenUseReplace f) f, DefaultThenCxt (ThenUseReplace f) f i j) => f i a -> f j b -> f (Then f i j) b

Sequence actions, discarding the value of the first argument (*>).

Default implementation requires the default instance of Then.

gbut :: ButInv f i j => f i a -> f j b -> f (But f i j) a

Sequence actions, discarding values of the second argument (<*).

Default implementation requires the default instance of But.

gbut :: (LiftA2 f i j ~ But f i j, LiftA2Inv f i j) => f i a -> f j b -> f (But f i j) a

Sequence actions, discarding values of the second argument (<*).

Default implementation requires the default instance of But.

Instances

Applicative f => GApplicative * (GWrapped f)

Associated Types

type Apply (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: p

type ApplyInv (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: Constraint

type LiftA2 (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: p

type LiftA2Inv (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: Constraint

type ThenUseReplace (GWrapped f) (f :: GWrapped f -> * -> *) :: Bool

type Then (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: p

type ThenInv (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: Constraint

type But (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: p

type ButInv (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) (j :: GWrapped f) :: Constraint

Methods

gap :: ApplyInv (GWrapped f) f i j => f i (a -> b) -> f j a -> f (Apply (GWrapped f) f i j) b

gliftA2 :: LiftA2Inv (GWrapped f) f i j => (a -> b -> c) -> f i a -> f j b -> f (LiftA2 (GWrapped f) f i j) c

gthen :: ThenInv (GWrapped f) f i j => f i a -> f j b -> f (Then (GWrapped f) f i j) b

gbut :: ButInv (GWrapped f) f i j => f i a -> f j b -> f (But (GWrapped f) f i j) a

IxApplicative * f => GApplicative (*, *) (WrappedIx f)

Associated Types

type Apply (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: p

type ApplyInv (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: Constraint

type LiftA2 (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: p

type LiftA2Inv (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: Constraint

type ThenUseReplace (WrappedIx f) (f :: WrappedIx f -> * -> *) :: Bool

type Then (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: p

type ThenInv (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: Constraint

type But (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: p

type ButInv (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) (j :: WrappedIx f) :: Constraint

Methods

gap :: ApplyInv (WrappedIx f) f i j => f i (a -> b) -> f j a -> f (Apply (WrappedIx f) f i j) b

gliftA2 :: LiftA2Inv (WrappedIx f) f i j => (a -> b -> c) -> f i a -> f j b -> f (LiftA2 (WrappedIx f) f i j) c

gthen :: ThenInv (WrappedIx f) f i j => f i a -> f j b -> f (Then (WrappedIx f) f i j) b

gbut :: ButInv (WrappedIx f) f i j => f i a -> f j b -> f (But (WrappedIx f) f i j) a