Modulebarbies-2.1.1.0

Barbies

9 types
11 classes
53 values

Packagebarbies-2.1.1.0
Exports75
LicenceBSD-3-Clause

valuebtfoldMap

:: (TraversableB (b f), TraversableT b, Monoid m)
=> forall (a :: k2). f a -> m
-> forall (a :: k3). g a -> m
-> b f g
-> m

valuebtfor1

:: (TraversableB (b f), TraversableT b, Monad t)
=> b f f
-> forall (a :: k1). f a -> t (g a)
-> t (b g g)

valuebtmap

:: (FunctorB (b f), FunctorT b)
=> forall (a :: k2). f a -> f' a
-> forall (a :: k3). g a -> g' a
-> b f g
-> b f' g'

valuebtmap1

:: (FunctorB (b f), FunctorT b)
=> forall (a :: k1). f a -> g a
-> b f f
-> b g g

valuebtprod

:: (ApplicativeB (b (Alt (Product f f'))), FunctorT b, Alternative f, Alternative f')
=> b f g
-> b f' g'
-> b (Product f f') (Product g g')

valuebtpure

:: (ApplicativeB (b Unit), FunctorT b)
=> forall (a :: k -> Type). f a
-> forall (a :: k1). g a
-> b f g

valuebtpure1

:: (ApplicativeB (b Unit), FunctorT b)
=> forall (a :: k -> Type). f a
-> b f f

valuebttraverse

:: (TraversableB (b f), TraversableT b, Monad t)
=> forall (a :: k2). f a -> t (f' a)
-> forall (a :: k3). g a -> t (g' a)
-> b f g
-> t (b f' g')

valuebttraverse1

:: (TraversableB (b f), TraversableT b, Monad t)
=> forall (a :: k1). f a -> t (g a)
-> b f f
-> t (b g g)

valuebttraverse_

:: (TraversableB (b f), TraversableT b, Monad e)
=> forall (a :: k2). f a -> e c
-> forall (a :: k3). g a -> e d
-> b f g
-> e ()

valuebunzip :: ApplicativeB b => b (Product f g) -> (b f, b g)

valuebzip :: ApplicativeB b => b f -> b g -> b (Product f g)

valuebzipWith

:: ApplicativeB b
=> forall (a :: k). f a -> g a -> h a
-> b f
-> b g
-> b h

valuebzipWith3

:: ApplicativeB b
=> forall (a :: k). f a -> g a -> h a -> i a
-> b f
-> b g
-> b h
-> b i

valuebzipWith4

:: ApplicativeB b
=> forall (a :: k). f a -> g a -> h a -> i a -> j a
-> b f
-> b g
-> b h
-> b i
-> b j

valuetunzip :: ApplicativeT t => t (Product f g) x -> (t f x, t g x)

valuetzip :: ApplicativeT t => t f x -> t g x -> t (Product f g) x

valuetzipWith

:: ApplicativeT t
=> forall (a :: k). f a -> g a -> h a
-> t f x
-> t g x
-> t h x

valuetzipWith3

:: ApplicativeT t
=> forall (a :: k). f a -> g a -> h a -> i a
-> t f x
-> t g x
-> t h x
-> t i x

valuetzipWith4

:: ApplicativeT t
=> forall (a :: k). f a -> g a -> h a -> i a -> j a
-> t f x
-> t g x
-> t h x
-> t i x
-> t j x

valuebdicts :: (ConstraintsB b, ApplicativeB b, AllB c b) => b (Dict c)

valuebfoldMapC

:: (TraversableB b, ConstraintsB b, AllB c b, Monoid m)
=> forall (a :: k). c a => f a -> m
-> b f
-> m

valuebforC

:: (TraversableB b, ConstraintsB b, AllB c b, Applicative e)
=> b f
-> forall (a :: k). c a => f a -> e (g a)
-> e (b g)

valuebmapC

:: (AllB c b, ConstraintsB b)
=> forall (a :: k). c a => f a -> g a
-> b f
-> b g

valuebmempty :: (AllBF Monoid f b, ConstraintsB b, ApplicativeB b) => b f

valuebpureC

:: (AllB c b, ConstraintsB b, ApplicativeB b)
=> forall (a :: k1). c a => f a
-> b f

valuebtraverseC

:: (TraversableB b, ConstraintsB b, AllB c b, Applicative e)
=> forall (a :: k). c a => f a -> e (g a)
-> b f
-> e (b g)

valuebzipWith3C

:: (AllB c b, ConstraintsB b, ApplicativeB b)
=> forall (a :: k1). c a => f a -> g a -> h a -> i a
-> b f
-> b g
-> b h
-> b i

valuebzipWith4C

:: (AllB c b, ConstraintsB b, ApplicativeB b)
=> forall (a :: k1). c a => f a -> g a -> h a -> i a -> j a
-> b f
-> b g
-> b h
-> b i
-> b j

valuebzipWithC

:: (AllB c b, ConstraintsB b, ApplicativeB b)
=> forall (a :: k1). c a => f a -> g a -> h a
-> b f
-> b g
-> b h

valuetforC

:: (TraversableT t, ConstraintsT t, AllT c t, Applicative e)
=> t f x
-> forall (a :: kl). c a => f a -> e (g a)
-> e (t g x)

valuetmapC

:: (AllT c t, ConstraintsT t)
=> forall (a :: k). c a => f a -> g a
-> t f x
-> t g x

valuettraverseC

:: (TraversableT t, ConstraintsT t, AllT c t, Applicative e)
=> forall (a :: k). c a => f a -> e (g a)
-> t f x
-> e (t g x)

valuebcotraverse

:: (DistributiveB b, Functor f)
=> forall a. f (g a) -> f a
-> f (b g)
-> b f

valuebdecompose :: DistributiveB b => (a -> b Identity) -> b ((->) a)

valuebdistribute' :: (DistributiveB b, Functor f) => f (b Identity) -> b f

valuebrecompose :: FunctorB b => b ((->) a) -> a -> b Identity

valuetcotraverse

:: (DistributiveT t, Functor f)
=> forall a. f (g a) -> f a
-> f (t g x)
-> t f x

valuetdecompose :: DistributiveT t => (a -> t Identity x) -> t ((->) a) x

valuetdistribute' :: (DistributiveT t, Functor f) => f (t Identity x) -> t f x

valuetrecompose :: FunctorT t => t ((->) a) x -> a -> t Identity x

valuebfoldMap

:: (TraversableB b, Monoid m)
=> forall (a :: k). f a -> m
-> b f
-> m

valuebfor

:: (TraversableB b, Applicative e)
=> b f
-> forall (a :: k). f a -> e (g a)
-> e (b g)

valuebfor_

:: (TraversableB b, Applicative e)
=> b f
-> forall (a :: k). f a -> e c
-> e ()

valuebsequence :: (Applicative e, TraversableB b) => b (Compose e f) -> e (b f)

valuebsequence' :: (Applicative e, TraversableB b) => b e -> e (b Identity)

valuebtraverse_

:: (TraversableB b, Applicative e)
=> forall (a :: k). f a -> e c
-> b f
-> e ()

valuetfoldMap

:: (TraversableT t, Monoid m)
=> forall (a :: k). f a -> m
-> t f x
-> m

valuetfor

:: (TraversableT t, Applicative e)
=> t f x
-> forall (a :: k). f a -> e (g a)
-> e (t g x)

valuetfor_

:: (TraversableT t, Applicative e)
=> t f x
-> forall (a :: k). f a -> e c
-> e ()

valuetsequence

:: (Applicative e, TraversableT t)
=> t (Compose e f) x
-> e (t f x)

valuetsequence' :: (Applicative e, TraversableT t) => t e x -> e (t Identity x)

valuettraverse_

:: (TraversableT t, Applicative e)
=> forall (a :: k). f a -> e c
-> t f x
-> e ()

newtypenewtype Flip (b :: k -> k1 -> Type) (l :: k1) (r :: k)

Constructors

Flip
- runFlip :: b r l

Instances12ApplicativeT, FunctorT, TraversableT, DistributiveT, ApplicativeB, DistributiveB, …

(forall (f :: k'1). ApplicativeB (b f)) => ApplicativeT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi
(forall (f :: k'1). FunctorB (b f)) => FunctorT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi
(forall (f :: k'1). TraversableB (b f)) => TraversableT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi
(forall (f :: i1). DistributiveB (b f)) => DistributiveT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi
ApplicativeT b => ApplicativeB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
DistributiveT b => DistributiveB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
FunctorT b => FunctorB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
TraversableT b => TraversableB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
Eq (b r l) => Eq (Flip b l r)Defined in barbies-2.1.1.0 · Barbies.Bi
Ord (b r l) => Ord (Flip b l r)Defined in barbies-2.1.1.0 · Barbies.Bi
Read (b r l) => Read (Flip b l r)Defined in barbies-2.1.1.0 · Barbies.Bi
Show (b r l) => Show (Flip b l r)Defined in barbies-2.1.1.0 · Barbies.Bi

classclass FunctorB b => ApplicativeB (b :: (k -> Type) -> Type) where

Methods

bpure :: (forall (a :: k). f a) -> b f
bprod :: b f -> b g -> b (Product f g)

Instances7ApplicativeB, …

ApplicativeB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
ApplicativeB ProxyDefined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB
ApplicativeB b => ApplicativeB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
Monoid a => ApplicativeB (Const a)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB
Monoid a => ApplicativeB (Constant a)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB
(ApplicativeB a, ApplicativeB b) => ApplicativeB (Product a b)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB
ApplicativeT b => ApplicativeB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi

classclass FunctorT t => ApplicativeT (t :: (k -> Type) -> k' -> Type) where

Methods

tpure :: (forall (a :: k). f a) -> t f x
tprod :: t f x -> t g x -> t (Product f g) x

Instances5ApplicativeT

ApplicativeT ReverseDefined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT
Alternative f => ApplicativeT (Product f)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT
Alternative f => ApplicativeT (Sum f)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT
Applicative f => ApplicativeT (Compose f)Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT
(forall (f :: k'1). ApplicativeB (b f)) => ApplicativeT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi

familytype family AllB (c :: k -> Constraint) (b :: (k -> Type) -> Type) :: Constraint

Instances8AllB, …

type AllB c Unit = GAll 0 c (GAllRepB Unit)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type AllB c Void = GAll 0 c (GAllRepB Void)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type AllB c Proxy = ()Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
type AllB c (Barbie b) = AllB c bDefined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
type AllB c (Compose f b) = AllB c bDefined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
type AllB c (Product a b) = (AllB c a, AllB c b)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
type AllB c (Sum a b) = (AllB c a, AllB c b)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
type AllB c (Const a) = ()Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB

typetype AllBF (c :: k2 -> Constraint) (f :: k -> k2) (b :: (k -> Type) -> Type) = AllB (ClassF c f) b

classclass FunctorB b => ConstraintsB (b :: (k -> Type) -> Type) where

Associated types

type family AllB (c :: k -> Constraint) (b :: (k -> Type) -> Type) :: Constraint

Methods

baddDicts :: AllB c b => b f -> b (Product (Dict c) f)

Instances8ConstraintsB, …

ConstraintsB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
ConstraintsB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
ConstraintsB ProxyDefined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
ConstraintsB (Const a)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
ConstraintsB b => ConstraintsB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
(ConstraintsB a, ConstraintsB b) => ConstraintsB (Product a b)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
(ConstraintsB a, ConstraintsB b) => ConstraintsB (Sum a b)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB
(Functor f, ConstraintsB b) => ConstraintsB (Compose f b)Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB

familytype family AllT (c :: k -> Constraint) (t :: (kl -> Type) -> kr -> Type) :: Constraint

typetype AllTF (c :: k2 -> Constraint) (f :: k -> k2) (t :: (kl -> Type) -> kr -> Type) = AllT (ClassF c f) t

classclass FunctorT t => ConstraintsT (t :: (kl -> Type) -> kr -> Type) where

Associated types

type family AllT (c :: k -> Constraint) (t :: (kl -> Type) -> kr -> Type) :: Constraint

Methods

taddDicts :: AllT c t => t f x -> t (Product (Dict c) f) x

newtypenewtype Container (b :: (Type -> Type) -> Type) a

Constructors

Container
- getContainer :: b (Const a)

Instances10Functor, Applicative, Foldable, Traversable, Eq, Ord, …

FunctorB b => Functor (Container b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
ApplicativeB b => Applicative (Container b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
TraversableB b => Foldable (Container b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
TraversableB b => Traversable (Container b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Eq (b (Const a)) => Eq (Container b a)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Ord (b (Const a)) => Ord (Container b a)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Read (b (Const a)) => Read (Container b a)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Show (b (Const a)) => Show (Container b a)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Generic (Container b a)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
type Rep (Container b a) = D1 ('MetaData "Container" "Barbies.Internal.Containers" "barbies-2.1.1.0-1hW2kkRxO1bJuOAP5it1mQ" 'True) (C1 ('MetaCons "Container" 'PrefixI 'True) (S1 ('MetaSel ('Just "getContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Const a)))))Defined in barbies-2.1.1.0 · Barbies.Internal.Containers

newtypenewtype ErrorContainer (b :: (Type -> Type) -> Type) e

Constructors

ErrorContainer
- getErrorContainer :: b (Either e)

Instances9Functor, Foldable, Traversable, Eq, Ord, Read, …

FunctorB b => Functor (ErrorContainer b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
TraversableB b => Foldable (ErrorContainer b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
TraversableB b => Traversable (ErrorContainer b)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Eq (b (Either e)) => Eq (ErrorContainer b e)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Ord (b (Either e)) => Ord (ErrorContainer b e)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Read (b (Either e)) => Read (ErrorContainer b e)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Show (b (Either e)) => Show (ErrorContainer b e)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
Generic (ErrorContainer b e)Defined in barbies-2.1.1.0 · Barbies.Internal.Containers
type Rep (ErrorContainer b e) = D1 ('MetaData "ErrorContainer" "Barbies.Internal.Containers" "barbies-2.1.1.0-1hW2kkRxO1bJuOAP5it1mQ" 'True) (C1 ('MetaCons "ErrorContainer" 'PrefixI 'True) (S1 ('MetaSel ('Just "getErrorContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Either e)))))Defined in barbies-2.1.1.0 · Barbies.Internal.Containers

classclass FunctorB b => DistributiveB (b :: (k -> Type) -> Type) where

Methods

bdistribute :: Functor f => f (b g) -> b (Compose f g)

Instances5DistributiveB

DistributiveB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
DistributiveB ProxyDefined in barbies-2.1.1.0 · Barbies.Internal.DistributiveB
(DistributiveB a, DistributiveB b) => DistributiveB (Product a b)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveB
DistributiveT b => DistributiveB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
(Distributive h, DistributiveB b) => DistributiveB (Compose h b)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveB

classclass FunctorT t => DistributiveT (t :: (Type -> Type) -> i -> Type) where

Methods

tdistribute :: Functor f => f (t g x) -> t (Compose f g) x

Instances15DistributiveT, …

DistributiveT MaybeTDefined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT BackwardsDefined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT IdentityTDefined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT ReverseDefined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (AccumT w)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (ExceptT e)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (ReaderT r)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (StateT s)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (StateT s)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (RWST r w s)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
DistributiveT (RWST r w s)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
Distributive f => DistributiveT (Compose f)Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT
(forall (f :: i1). DistributiveB (b f)) => DistributiveT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi

classclass FunctorB (b :: (k -> Type) -> Type) where

Methods

bmap :: (forall (a :: k). f a -> g a) -> b f -> b g

Instances10FunctorB, …

FunctorB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
FunctorB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
FunctorB ProxyDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorB
FunctorB (Const x)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB
FunctorB (Constant x)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB
FunctorB b => FunctorB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
(FunctorB a, FunctorB b) => FunctorB (Product a b)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB
(FunctorB a, FunctorB b) => FunctorB (Sum a b)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB
FunctorT b => FunctorB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
(Functor f, FunctorB b) => FunctorB (Compose f b)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB

classclass FunctorT (t :: (k -> Type) -> k' -> Type) where

Methods

tmap :: (forall (a :: k). f a -> g a) -> t f x -> t g x

Instances18FunctorT, …

FunctorT LiftDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT MaybeTDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT BackwardsDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT IdentityTDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT ReverseDefined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (AccumT w)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (ExceptT e)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (ReaderT r)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (StateT s)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (StateT s)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (Product f)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (Sum f)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (RWST r w s)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
FunctorT (RWST r w s)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
Functor f => FunctorT (Compose f)Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT
(forall (f :: k'1). FunctorB (b f)) => FunctorT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi

classclass FunctorT t => MonadT (t :: (k'1 -> Type) -> k'1 -> Type) where

Methods

tlift :: f a -> t f a
tjoin :: t (t f) a -> t f a
tembed :: MonadT t => (forall (x :: k'1). f x -> t g x) -> t f a -> t g a

Instances8MonadT, …

MonadT LiftDefined in barbies-2.1.1.0 · Barbies.Internal.MonadT
MonadT BackwardsDefined in barbies-2.1.1.0 · Barbies.Internal.MonadT
MonadT IdentityTDefined in barbies-2.1.1.0 · Barbies.Internal.MonadT
MonadT ReverseDefined in barbies-2.1.1.0 · Barbies.Internal.MonadT
MonadT (ReaderT r)Defined in barbies-2.1.1.0 · Barbies.Internal.MonadT
MonadT (Sum f)Defined in barbies-2.1.1.0 · Barbies.Internal.MonadT
Alternative f => MonadT (Product f)Defined in barbies-2.1.1.0 · Barbies.Internal.MonadT
Monad f => MonadT (Compose f)Defined in barbies-2.1.1.0 · Barbies.Internal.MonadT

classclass FunctorB b => TraversableB (b :: (k -> Type) -> Type) where

Methods

btraverse :: Applicative e => (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)

Instances10TraversableB, …

TraversableB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
TraversableB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
TraversableB ProxyDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableB
TraversableB (Const a)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB
TraversableB (Constant a)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB
TraversableB b => TraversableB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
(TraversableB a, TraversableB b) => TraversableB (Product a b)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB
(TraversableB a, TraversableB b) => TraversableB (Sum a b)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB
TraversableT b => TraversableB (Flip b f)Defined in barbies-2.1.1.0 · Barbies.Bi
(Traversable f, TraversableB b) => TraversableB (Compose f b)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB

classclass FunctorT t => TraversableT (t :: (k -> Type) -> k' -> Type) where

Methods

ttraverse :: Applicative e => (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)

Instances12TraversableT, …

TraversableT LiftDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT MaybeTDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT BackwardsDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT IdentityTDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT ReverseDefined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT (ExceptT e)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT (WriterT w)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT (Product f)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
TraversableT (Sum f)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
Traversable f => TraversableT (Compose f)Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT
(forall (f :: k'1). TraversableB (b f)) => TraversableT (Flip b)Defined in barbies-2.1.1.0 · Barbies.Bi

datadata Unit (f :: k -> Type)

Unit

Instances15ApplicativeB, ConstraintsB, DistributiveB, FunctorB, TraversableB, Eq, …

ApplicativeB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
ConstraintsB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
DistributiveB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
FunctorB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
TraversableB UnitDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Eq (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
(Typeable f, Typeable k) => Data (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Ord (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Read (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Show (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Generic (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Semigroup (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Monoid (Unit f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type Rep (Unit f) = D1 ('MetaData "Unit" "Barbies.Internal.Trivial" "barbies-2.1.1.0-1hW2kkRxO1bJuOAP5it1mQ" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) U1)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type AllB c Unit = GAll 0 c (GAllRepB Unit)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial

datadata Void (f :: k -> Type)

Instances10ConstraintsB, FunctorB, TraversableB, Eq, Ord, Show, …

ConstraintsB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
FunctorB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
TraversableB VoidDefined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Eq (Void f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Ord (Void f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Show (Void f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Generic (Void f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
Semigroup (Void f)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type Rep (Void f) = D1 ('MetaData "Void" "Barbies.Internal.Trivial" "barbies-2.1.1.0-1hW2kkRxO1bJuOAP5it1mQ" 'False) V1Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial
type AllB c Void = GAll 0 c (GAllRepB Void)Defined in barbies-2.1.1.0 · Barbies.Internal.Trivial

newtypenewtype Barbie (b :: (k -> Type) -> Type) (f :: k -> Type)

Constructors

Barbie
- getBarbie :: b f

Instances7ApplicativeB, ConstraintsB, FunctorB, TraversableB, Semigroup, Monoid, …

ApplicativeB b => ApplicativeB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
ConstraintsB b => ConstraintsB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
FunctorB b => FunctorB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
TraversableB b => TraversableB (Barbie b)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b) => Semigroup (Barbie b f)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b, AllBF Monoid f b) => Monoid (Barbie b f)Defined in barbies-2.1.1.0 · Barbies.Internal.Wrappers
type AllB c (Barbie b) = AllB c bDefined in barbies-2.1.1.0 · Barbies.Internal.Wrappers

newtypenewtype Rec p a (x :: k)

Constructors

Rec
- unRec :: K1 R a x

Instances45GTraversable, GApplicative, GFunctor, GDistributive, GBare, GConstraints, …

GTraversable n f g (Rec (P n f a') (f a)) (Rec (P n g a') (g a))Defined in barbies-2.1.1.0 · Barbies.Generics.Traversable
GTraversable n f g (Rec a a) (Rec a a)Defined in barbies-2.1.1.0 · Barbies.Generics.Traversable
TraversableB b => GTraversable 0 f g (Rec (b (P 0 f)) (b f)) (Rec (b (P 0 g)) (b g))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB · orphan
TraversableT t => GTraversable 1 f g (Rec (t (P 1 f) x) (t f x)) (Rec (t (P 1 g) x) (t g x))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT · orphan
Traversable h => GTraversable n f g (Rec (h (P n f a)) (h (f a))) (Rec (h (P n g a)) (h (g a)))Defined in barbies-2.1.1.0 · Barbies.Generics.Traversable
(Traversable h, TraversableB b) => GTraversable 0 f g (Rec (h (b (P 0 f))) (h (b f))) (Rec (h (b (P 0 g))) (h (b g)))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB · orphan
(Traversable h, TraversableT t) => GTraversable 1 f g (Rec (h (t (P 1 f) x)) (h (t f x))) (Rec (h (t (P 1 g) x)) (h (t g x)))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT · orphan
(Traversable h, Traversable m, TraversableB b) => GTraversable 0 f g (Rec (m (h (b (P 0 f)))) (m (h (b f)))) (Rec (m (h (b (P 0 g)))) (m (h (b g))))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableB · orphan
(Traversable h, Traversable m, TraversableT t) => GTraversable 1 f g (Rec (m (h (t (P 1 f) x))) (m (h (t f x)))) (Rec (m (h (t (P 1 g) x))) (m (h (t g x))))Defined in barbies-2.1.1.0 · Barbies.Internal.TraversableT · orphan
GApplicative n f g (Rec (P n f a) (f a)) (Rec (P n g a) (g a)) (Rec (P n (Product f g) a) (Product f g a))Defined in barbies-2.1.1.0 · Barbies.Generics.Applicative
ApplicativeB b => GApplicative 0 f g (Rec (b (P 0 f)) (b f)) (Rec (b (P 0 g)) (b g)) (Rec (b (P 0 (Product f g))) (b (Product f g)))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB · orphan
ApplicativeT t => GApplicative 1 f g (Rec (t (P 1 f) x) (t f x)) (Rec (t (P 1 g) x) (t g x)) (Rec (t (P 1 (Product f g)) x) (t (Product f g) x))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT · orphan
Applicative h => GApplicative n f g (Rec (h (P n f a)) (h (f a))) (Rec (h (P n g a)) (h (g a))) (Rec (h (P n (Product f g) a)) (h (Product f g a)))Defined in barbies-2.1.1.0 · Barbies.Generics.Applicative
Monoid x => GApplicative n f g (Rec x x) (Rec x x) (Rec x x)Defined in barbies-2.1.1.0 · Barbies.Generics.Applicative
(Applicative h, ApplicativeB b) => GApplicative 0 f g (Rec (h (b (P 0 f))) (h (b f))) (Rec (h (b (P 0 g))) (h (b g))) (Rec (h (b (P 0 (Product f g)))) (h (b (Product f g))))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB · orphan
(Applicative h, ApplicativeT t) => GApplicative 1 f g (Rec (h (t (P 1 f) x)) (h (t f x))) (Rec (h (t (P 1 g) x)) (h (t g x))) (Rec (h (t (P 1 (Product f g)) x)) (h (t (Product f g) x)))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT · orphan
(Applicative h, Applicative m, ApplicativeB b) => GApplicative 0 f g (Rec (m (h (b (P 0 f)))) (m (h (b f)))) (Rec (m (h (b (P 0 g)))) (m (h (b g)))) (Rec (m (h (b (P 0 (Product f g))))) (m (h (b (Product f g)))))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeB · orphan
(Applicative h, Applicative m, ApplicativeT t) => GApplicative 1 f g (Rec (m (h (t (P 1 f) x))) (m (h (t f x)))) (Rec (m (h (t (P 1 g) x))) (m (h (t g x)))) (Rec (m (h (t (P 1 (Product f g)) x))) (m (h (t (Product f g) x))))Defined in barbies-2.1.1.0 · Barbies.Internal.ApplicativeT · orphan
GConstraints n c f (Rec a' a) (Rec b' b) (Rec b' b)Defined in barbies-2.1.1.0 · Barbies.Generics.Constraints
GFunctor n f g (Rec (P n f a') (f a)) (Rec (P n g a') (g a))Defined in barbies-2.1.1.0 · Barbies.Generics.Functor
GFunctor n f g (Rec x x) (Rec x x)Defined in barbies-2.1.1.0 · Barbies.Generics.Functor
FunctorB b => GFunctor 0 f g (Rec (b' (P 0 f)) (b f)) (Rec (b' (P 0 g)) (b g))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB · orphan
FunctorT t => GFunctor 1 f g (Rec (t (P 1 f) x) (t f x)) (Rec (t (P 1 g) x) (t g x))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT · orphan
Functor h => GFunctor n f g (Rec (h (P n f a')) (h (f a))) (Rec (h (P n g a')) (h (g a)))Defined in barbies-2.1.1.0 · Barbies.Generics.Functor
(Functor h, FunctorB b) => GFunctor 0 f g (Rec (h' (b' (P 0 f))) (h (b f))) (Rec (h' (b' (P 0 g))) (h (b g)))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB · orphan
(Functor h, FunctorT t) => GFunctor 1 f g (Rec (h (t (P 1 f) x)) (h (t f x))) (Rec (h (t (P 1 g) x)) (h (t g x)))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT · orphan
(Functor h, Functor m, FunctorB b) => GFunctor 0 f g (Rec (m' (h' (b' (P 0 f)))) (m (h (b f)))) (Rec (m' (h' (b' (P 0 g)))) (m (h (b g))))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorB · orphan
(Functor h, Functor m, FunctorT t) => GFunctor 1 f g (Rec (m (h (t (P 1 f) x))) (m (h (t f x)))) (Rec (m (h (t (P 1 g) x))) (m (h (t g x))))Defined in barbies-2.1.1.0 · Barbies.Internal.FunctorT · orphan
Functor f => GDistributive n f (Rec (P n g a) (g a)) (Rec (P n (Compose f g) a) (Compose f g a))Defined in barbies-2.1.1.0 · Barbies.Generics.Distributive
(Functor f, DistributiveB b) => GDistributive 0 f (Rec (b' (P 0 g)) (b g)) (Rec (b' (P 0 (Compose f g))) (b (Compose f g)))Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveB · orphan
(Functor f, DistributiveT t) => GDistributive 1 f (Rec (t (P 1 g) x) (t g x)) (Rec (t (P 1 (Compose f g)) x) (t (Compose f g) x))Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT · orphan
(Functor f, Distributive h) => GDistributive n f (Rec (h (P n g a)) (h (g a))) (Rec (h (P n (Compose f g) a)) (h (Compose f g a)))Defined in barbies-2.1.1.0 · Barbies.Generics.Distributive
(Functor f, Distributive h, DistributiveB b) => GDistributive n f (Rec (h (b (P n g))) (h (b g))) (Rec (h (b (P n (Compose f g)))) (h (b (Compose f g))))Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveB · orphan
(Functor f, Distributive h, DistributiveT t) => GDistributive 1 f (Rec (h (t (P 1 g) x)) (h (t g x))) (Rec (h (t (P 1 (Compose f g)) x)) (h (t (Compose f g) x)))Defined in barbies-2.1.1.0 · Barbies.Internal.DistributiveT · orphan
BareB b => GBare 0 (Rec (b Covered (P 0 Identity)) (b Covered Identity)) (Rec (b Bare (P 0 Identity)) (b Bare Identity))Defined in barbies-2.1.1.0 · Barbies.Internal.BareB · orphan
Coercible a b => GBare n (Rec (P n Identity a) (Identity a)) (Rec b b)Defined in barbies-2.1.1.0 · Barbies.Generics.Bare
(Functor h, BareB b) => GBare 0 (Rec (h (b Covered (P 0 Identity))) (h (b Covered Identity))) (Rec (h (b Bare (P 0 Identity))) (h (b Bare Identity)))Defined in barbies-2.1.1.0 · Barbies.Internal.BareB · orphan
(Functor h, Functor m, BareB b) => GBare 0 (Rec (m (h (b Covered (P 0 Identity)))) (m (h (b Covered Identity)))) (Rec (m (h (b Bare (P 0 Identity)))) (m (h (b Bare Identity))))Defined in barbies-2.1.1.0 · Barbies.Internal.BareB · orphan
repbi ~ repbb => GBare n (Rec repbi repbi) (Rec repbb repbb)Defined in barbies-2.1.1.0 · Barbies.Generics.Bare
(ConstraintsB b, AllB c b) => GConstraints 0 c f (Other (b' (P 0 X)) (b X)) (Rec (b' (P 0 f)) (b f)) (Rec (b' (P 0 (Product (Dict c) f))) (b (Product (Dict c) f)))Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB · orphan
(ConstraintsB b, AllB c b) => GConstraints 0 c f (Self (b' (P 0 X)) (b X)) (Rec (b' (P 0 f)) (b f)) (Rec (b' (P 0 (Product (Dict c) f))) (b (Product (Dict c) f)))Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsB · orphan
(ConstraintsT t, AllT c t) => GConstraints 1 c f (Other (t' (P 1 X) Y) (t X Y)) (Rec (t' (P 1 f) (P 0 y)) (t f y)) (Rec (t' (P 1 (Product (Dict c) f)) (P 0 y)) (t (Product (Dict c) f) y))Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsT · orphan
(ConstraintsT t, AllT c t) => GConstraints 1 c f (Self (t' (P 1 X) Y) (t X Y)) (Rec (t' (P 1 f) (P 0 y)) (t f y)) (Rec (t' (P 1 (Product (Dict c) f)) (P 0 y)) (t (Product (Dict c) f) y))Defined in barbies-2.1.1.0 · Barbies.Internal.ConstraintsT · orphan
GConstraints n c f (Rec (P n X a') (X a)) (Rec (P n f a') (f a)) (Rec (P n (Product (Dict c) f) a') (Product (Dict c) f a))Defined in barbies-2.1.1.0 · Barbies.Generics.Constraints
type GAll n c (Rec l r) = GAllRec n c l rDefined in barbies-2.1.1.0 · Barbies.Generics.Constraints