Copyright | (C) 2021 Ryan Scott |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | Richard Eisenberg (rae@cs.brynmawr.edu) |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | GHC2021 |
Data.Functor.Compose.Singletons
Description
Exports the promoted and singled versions of the Compose
data type.
Synopsis
- type family Sing :: k -> Type
- data SCompose (a1 :: Compose f g a) where
- type family GetCompose (a1 :: Compose f g a) :: f (g a) where ...
- sGetCompose :: forall {k} {k1} (f :: k -> Type) (g :: k1 -> k) (a :: k1) (t :: Compose f g a). Sing t -> Sing (GetCompose t)
- data ComposeSym0 (a1 :: TyFun (f (g a)) (Compose f g a))
- type family ComposeSym1 (a6989586621680345043 :: f (g a)) :: Compose f g a where ...
- data GetComposeSym0 (a1 :: TyFun (Compose f g a) (f (g a)))
- type family GetComposeSym1 (a6989586621680345046 :: Compose f g a) :: f (g a) where ...
The Compose
singleton
type family Sing :: k -> Type #
Instances
data SCompose (a1 :: Compose f g a) where Source #
Constructors
SCompose :: forall {k} {k1} (f :: k -> Type) (g :: k1 -> k) (a :: k1) (n :: f (g a)). Sing n -> SCompose ('Compose n) infixr 9 |
Instances
SDecide (f (g a)) => TestCoercion (SCompose :: Compose f g a -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons | |
SDecide (f (g a)) => TestEquality (SCompose :: Compose f g a -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons | |
Eq (SCompose z) Source # | |
Ord (SCompose z) Source # | |
Defined in Data.Functor.Compose.Singletons |
type family GetCompose (a1 :: Compose f g a) :: f (g a) where ... Source #
Equations
GetCompose ('Compose field :: Compose f g a) = field |
sGetCompose :: forall {k} {k1} (f :: k -> Type) (g :: k1 -> k) (a :: k1) (t :: Compose f g a). Sing t -> Sing (GetCompose t) Source #
Defunctionalization symbols
data ComposeSym0 (a1 :: TyFun (f (g a)) (Compose f g a)) infixr 9 Source #
Instances
SingI (ComposeSym0 :: TyFun (f (g a)) (Compose f g a) -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons | |
SuppressUnusedWarnings (ComposeSym0 :: TyFun (f (g a)) (Compose f g a) -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons Methods suppressUnusedWarnings :: () # | |
type Apply (ComposeSym0 :: TyFun (f (g a)) (Compose f g a) -> Type) (a6989586621680345043 :: f (g a)) Source # | |
Defined in Data.Functor.Compose.Singletons |
type family ComposeSym1 (a6989586621680345043 :: f (g a)) :: Compose f g a where ... infixr 9 Source #
Equations
ComposeSym1 (a6989586621680345043 :: f (g a)) = 'Compose a6989586621680345043 |
data GetComposeSym0 (a1 :: TyFun (Compose f g a) (f (g a))) Source #
Instances
SingI (GetComposeSym0 :: TyFun (Compose f g a) (f (g a)) -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons | |
SuppressUnusedWarnings (GetComposeSym0 :: TyFun (Compose f g a) (f (g a)) -> Type) Source # | |
Defined in Data.Functor.Compose.Singletons Methods suppressUnusedWarnings :: () # | |
type Apply (GetComposeSym0 :: TyFun (Compose f g a) (f (g a)) -> Type) (a6989586621680345046 :: Compose f g a) Source # | |
Defined in Data.Functor.Compose.Singletons type Apply (GetComposeSym0 :: TyFun (Compose f g a) (f (g a)) -> Type) (a6989586621680345046 :: Compose f g a) = GetCompose a6989586621680345046 |
type family GetComposeSym1 (a6989586621680345046 :: Compose f g a) :: f (g a) where ... Source #
Equations
GetComposeSym1 (a6989586621680345046 :: Compose f g a) = GetCompose a6989586621680345046 |
Orphan instances
SingI1 ('Compose :: f (g a) -> Compose f g a) Source # | |
PAlternative (Compose f g) Source # | |
PApplicative (Compose f g) Source # | |
PFunctor (Compose f g) Source # | |
(SAlternative f, SApplicative g) => SAlternative (Compose f g) Source # | |
(SApplicative f, SApplicative g) => SApplicative (Compose f g) Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Pure t :: Compose f g a) Source # (%<*>) :: forall a b (t1 :: Compose f g (a ~> b)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (t1 <*> t2) Source # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Compose f g a) (t3 :: Compose f g b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3) Source # (%*>) :: forall a b (t1 :: Compose f g a) (t2 :: Compose f g b). Sing t1 -> Sing t2 -> Sing (t1 *> t2) Source # (%<*) :: forall a b (t1 :: Compose f g a) (t2 :: Compose f g b). Sing t1 -> Sing t2 -> Sing (t1 <* t2) Source # | |
(SFunctor f, SFunctor g) => SFunctor (Compose f g) Source # | |
PFoldable (Compose f g) Source # | |
(SFoldable f, SFoldable g) => SFoldable (Compose f g) Source # | |
Methods sFold :: forall m (t1 :: Compose f g m). SMonoid m => Sing t1 -> Sing (Fold t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Compose f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2) Source # sToList :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (ToList t1) Source # sNull :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Null t1) Source # sLength :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Length t1) Source # sElem :: forall a (t1 :: a) (t2 :: Compose f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Elem t1 t2) Source # sMaximum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Maximum t1) Source # sMinimum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Minimum t1) Source # sSum :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Sum t1) Source # sProduct :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Product t1) Source # | |
PTraversable (Compose f g) Source # | |
(STraversable f, STraversable g) => STraversable (Compose f g) Source # | |
Methods sTraverse :: forall a (f0 :: Type -> Type) b (t1 :: a ~> f0 b) (t2 :: Compose f g a). SApplicative f0 => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2) Source # sSequenceA :: forall (f0 :: Type -> Type) a (t1 :: Compose f g (f0 a)). SApplicative f0 => Sing t1 -> Sing (SequenceA t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Compose f g a). SMonad m => Sing t1 -> Sing t2 -> Sing (MapM t1 t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Compose f g (m a)). SMonad m => Sing t1 -> Sing (Sequence t1) Source # | |
SDecide (f (g a)) => SDecide (Compose f g a) Source # | |
PEq (Compose f g a) Source # | |
SEq (f (g a)) => SEq (Compose f g a) Source # | |
POrd (Compose f g a) Source # | |
SOrd (f (g a)) => SOrd (Compose f g a) Source # | |
Methods sCompare :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Compare t1 t2) Source # (%<) :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (t1 < t2) Source # (%<=) :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (t1 <= t2) Source # (%>) :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (t1 > t2) Source # (%>=) :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (t1 >= t2) Source # sMax :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Max t1 t2) Source # sMin :: forall (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Min t1 t2) Source # | |
SingI n => SingI ('Compose n :: Compose f g a) Source # | |