Parsley.Internal.Common.Indexed

Documentation

newtype Const4 a i j k l

Constructors

Const4

Fields

• getConst4 :: a

data Unit4 i j k l

Constructors

Unit4

newtype Const1 a k

Constructors

Const1

Fields

• getConst1 :: a

data Unit1 k

Constructors

Unit

class Chain r k where

Methods

(|>) :: (a -> Maybe r) -> (a -> k) -> a -> k

Instances

Chain a a

Defined in Parsley.Internal.Common.Indexed

Methods

(|>) :: (a0 -> Maybe a) -> (a0 -> a) -> a0 -> a

Chain a (Maybe a)

Defined in Parsley.Internal.Common.Indexed

Methods

(|>) :: (a0 -> Maybe a) -> (a0 -> Maybe a) -> a0 -> Maybe a

data (f :*: g) i

Constructors

(f i) :*: (g i)

data Cofree f a i

Constructors

(a i) :< (f (Cofree f a) i)

Instances

IFunctor f => IFunctor (Cofree f)

Defined in Parsley.Internal.Common.Indexed

Methods

imap :: (forall j. a j -> b j) -> Cofree f a i -> Cofree f b i

data (f :+: g) k a where

Constructors

L :: f k a -> (f :+: g) k a

R :: g k a -> (f :+: g) k a

Instances

(IFunctor f, IFunctor g) => IFunctor (f :+: g)

Defined in Parsley.Internal.Common.Indexed

Methods

imap :: (forall j. a j -> b j) -> (f :+: g) a i -> (f :+: g) b i

newtype Fix4 f i j k l

Constructors

In4 (f (Fix4 f) i j k l)

Instances

Show (Fix4 (Instr o) xs n r a)

Defined in Parsley.Internal.Backend.Machine.Instructions

Methods

showsPrec :: Int -> Fix4 (Instr o) xs n r a -> ShowS

show :: Fix4 (Instr o) xs n r a -> String

showList :: [Fix4 (Instr o) xs n r a] -> ShowS

newtype Fix f a

Constructors

In (f (Fix f) a)

Instances

Show (Fix Combinator a)

Defined in Parsley.Internal.Core.CombinatorAST

Methods

showsPrec :: Int -> Fix Combinator a -> ShowS

show :: Fix Combinator a -> String

showList :: [Fix Combinator a] -> ShowS

class IFunctor4 (f :: ([Type] -> Nat -> Type -> Type -> Type) -> [Type] -> Nat -> Type -> Type -> Type) where

Methods

imap4 :: (forall i' j' k'. a i' j' k' x -> b i' j' k' x) -> f a i j k x -> f b i j k x

Instances

IFunctor4 (Instr o)

Defined in Parsley.Internal.Backend.Machine.Instructions

Methods

imap4 :: forall a x b (i :: [Type]) (j :: Nat) k. (forall (i' :: [Type]) (j' :: Nat) k'. a i' j' k' x -> b i' j' k' x) -> Instr o a i j k x -> Instr o b i j k x

class IFunctor (f :: (Type -> Type) -> Type -> Type) where

Methods

imap :: (forall j. a j -> b j) -> f a i -> f b i

Instances

IFunctor ScopeRegister

Defined in Parsley.Internal.Core.CombinatorAST

Methods

imap :: (forall j. a j -> b j) -> ScopeRegister a i -> ScopeRegister b i

IFunctor Combinator

Defined in Parsley.Internal.Core.CombinatorAST

Methods

imap :: (forall j. a j -> b j) -> Combinator a i -> Combinator b i

IFunctor f => IFunctor (Cofree f)

Defined in Parsley.Internal.Common.Indexed

Methods

imap :: (forall j. a j -> b j) -> Cofree f a i -> Cofree f b i

(IFunctor f, IFunctor g) => IFunctor (f :+: g)

Defined in Parsley.Internal.Common.Indexed

Methods

imap :: (forall j. a j -> b j) -> (f :+: g) a i -> (f :+: g) b i

type One = Succ Zero

data Nat

Constructors

Zero

Succ Nat

Instances

Show (Fix4 (Instr o) xs n r a)

Defined in Parsley.Internal.Backend.Machine.Instructions

Methods

showsPrec :: Int -> Fix4 (Instr o) xs n r a -> ShowS

show :: Fix4 (Instr o) xs n r a -> String

showList :: [Fix4 (Instr o) xs n r a] -> ShowS

inop :: Fix f a -> f (Fix f) a

inop4 :: Fix4 f i j k l -> f (Fix4 f) i j k l

cata :: forall f a i. IFunctor f => (forall j. f a j -> a j) -> Fix f i -> a i

cata' :: forall f a i. IFunctor f => (forall j. Fix f j -> f a j -> a j) -> Fix f i -> a i

cata4 :: forall f a i j k x. IFunctor4 f => (forall i' j' k'. f a i' j' k' x -> a i' j' k' x) -> Fix4 f i j k x -> a i j k x

(\/) :: (f a i -> b) -> (g a i -> b) -> (f :+: g) a i -> b

extract :: Cofree f a i -> a i

histo :: IFunctor f => (forall j. f (Cofree f a) j -> a j) -> Fix f i -> a i

(/\) :: (a -> f i) -> (a -> g i) -> a -> (f :*: g) i

ifst :: (f :*: g) i -> f i

isnd :: (f :*: g) i -> g i

mutu :: IFunctor f => (forall j. f (a :*: b) j -> a j) -> (forall j. f (a :*: b) j -> b j) -> Fix f i -> (a :*: b) i

zygo :: IFunctor f => (forall j. f (a :*: b) j -> a j) -> (forall j. f b j -> b j) -> Fix f i -> a i

zipper :: IFunctor f => (forall j. f a j -> a j) -> (forall j. f b j -> b j) -> Fix f i -> (a :*: b) i