| Copyright | (C) 2018 Ryan Scott |
|---|---|
| License | BSD-style (see LICENSE) |
| Maintainer | Ryan Scott |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Singletons.Prelude.Semigroup
Description
Defines the promoted version of Semigroup, PSemigroup, and the
singleton version, SSemigroup.
Synopsis
- class PSemigroup a where
- class SSemigroup a where
- type family Sing
- data SMin z where
- data SMax z where
- data SFirst z where
- data SLast z where
- data SWrappedMonoid z where
- SWrapMonoid :: forall (m :: Type) (n :: m). (Sing n) -> SWrappedMonoid ('WrapMonoid n :: WrappedMonoid (m :: Type))
- data SDual z where
- data SAll z where
- data SAny z where
- data SSum z where
- data SProduct z where
- data SOption z where
- data SArg z where
- type family GetMin a where ...
- type family GetMax a where ...
- type family GetFirst a where ...
- type family GetLast a where ...
- type family UnwrapMonoid a where ...
- type family GetDual a where ...
- type family GetAll a where ...
- type family GetAny a where ...
- type family GetSum a where ...
- type family GetProduct a where ...
- type family GetOption a where ...
- sGetMin :: forall (a :: Type) (t :: Min (a :: Type)). Sing t -> Sing (Apply GetMinSym0 t :: a)
- sGetMax :: forall (a :: Type) (t :: Max (a :: Type)). Sing t -> Sing (Apply GetMaxSym0 t :: a)
- sGetFirst :: forall (a :: Type) (t :: First (a :: Type)). Sing t -> Sing (Apply GetFirstSym0 t :: a)
- sGetLast :: forall (a :: Type) (t :: Last (a :: Type)). Sing t -> Sing (Apply GetLastSym0 t :: a)
- sUnwrapMonoid :: forall (m :: Type) (t :: WrappedMonoid (m :: Type)). Sing t -> Sing (Apply UnwrapMonoidSym0 t :: m)
- sGetDual :: forall (a :: Type) (t :: Dual (a :: Type)). Sing t -> Sing (Apply GetDualSym0 t :: a)
- sGetAll :: forall (t :: All). Sing t -> Sing (Apply GetAllSym0 t :: Bool)
- sGetAny :: forall (t :: Any). Sing t -> Sing (Apply GetAnySym0 t :: Bool)
- sGetSum :: forall (a :: Type) (t :: Sum (a :: Type)). Sing t -> Sing (Apply GetSumSym0 t :: a)
- sGetProduct :: forall (a :: Type) (t :: Product (a :: Type)). Sing t -> Sing (Apply GetProductSym0 t :: a)
- sGetOption :: forall (a :: Type) (t :: Option (a :: Type)). Sing t -> Sing (Apply GetOptionSym0 t :: Maybe a)
- option_ :: b -> (a -> b) -> Option a -> b
- sOption_ :: forall b a (t :: b) (t :: (~>) a b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Option_Sym0 t) t) t :: b)
- type family Option_ a a a where ...
- data (<>@#@$) a6989586621679830624
- data a6989586621679830624 <>@#@$$ a6989586621679830625
- type (<>@#@$$$) (a6989586621679830624 :: a) (a6989586621679830625 :: a) = (<>) a6989586621679830624 a6989586621679830625 :: a
- data SconcatSym0 a6989586621679830628
- type SconcatSym1 (a6989586621679830628 :: NonEmpty a) = Sconcat a6989586621679830628 :: a
- data MinSym0 a6989586621679840213
- type MinSym1 (a6989586621679840213 :: a) = 'Min a6989586621679840213 :: Min (a :: Type)
- data GetMinSym0 a6989586621679840216
- type GetMinSym1 (a6989586621679840216 :: Min (a :: Type)) = GetMin a6989586621679840216 :: a
- data MaxSym0 a6989586621679840235
- type MaxSym1 (a6989586621679840235 :: a) = 'Max a6989586621679840235 :: Max (a :: Type)
- data GetMaxSym0 a6989586621679840238
- type GetMaxSym1 (a6989586621679840238 :: Max (a :: Type)) = GetMax a6989586621679840238 :: a
- data FirstSym0 a6989586621679840257
- type FirstSym1 (a6989586621679840257 :: a) = 'First a6989586621679840257 :: First (a :: Type)
- data GetFirstSym0 a6989586621679840260
- type GetFirstSym1 (a6989586621679840260 :: First (a :: Type)) = GetFirst a6989586621679840260 :: a
- data LastSym0 a6989586621679840279
- type LastSym1 (a6989586621679840279 :: a) = 'Last a6989586621679840279 :: Last (a :: Type)
- data GetLastSym0 a6989586621679840282
- type GetLastSym1 (a6989586621679840282 :: Last (a :: Type)) = GetLast a6989586621679840282 :: a
- data WrapMonoidSym0 a6989586621679840301
- type WrapMonoidSym1 (a6989586621679840301 :: m) = 'WrapMonoid a6989586621679840301 :: WrappedMonoid (m :: Type)
- data UnwrapMonoidSym0 a6989586621679840304
- type UnwrapMonoidSym1 (a6989586621679840304 :: WrappedMonoid (m :: Type)) = UnwrapMonoid a6989586621679840304 :: m
- data DualSym0 a6989586621679840113
- type DualSym1 (a6989586621679840113 :: a) = 'Dual a6989586621679840113 :: Dual (a :: Type)
- data GetDualSym0 a6989586621679840116
- type GetDualSym1 (a6989586621679840116 :: Dual (a :: Type)) = GetDual a6989586621679840116 :: a
- data AllSym0 a6989586621679840130
- type AllSym1 (a6989586621679840130 :: Bool) = 'All a6989586621679840130 :: All
- data GetAllSym0 a6989586621679840133
- type GetAllSym1 (a6989586621679840133 :: All) = GetAll a6989586621679840133 :: Bool
- data AnySym0 a6989586621679840147
- type AnySym1 (a6989586621679840147 :: Bool) = 'Any a6989586621679840147 :: Any
- data GetAnySym0 a6989586621679840150
- type GetAnySym1 (a6989586621679840150 :: Any) = GetAny a6989586621679840150 :: Bool
- data SumSym0 a6989586621679840169
- type SumSym1 (a6989586621679840169 :: a) = 'Sum a6989586621679840169 :: Sum (a :: Type)
- data GetSumSym0 a6989586621679840172
- type GetSumSym1 (a6989586621679840172 :: Sum (a :: Type)) = GetSum a6989586621679840172 :: a
- data ProductSym0 a6989586621679840191
- type ProductSym1 (a6989586621679840191 :: a) = 'Product a6989586621679840191 :: Product (a :: Type)
- data GetProductSym0 a6989586621679840194
- type GetProductSym1 (a6989586621679840194 :: Product (a :: Type)) = GetProduct a6989586621679840194 :: a
- data OptionSym0 a6989586621679840090
- type OptionSym1 (a6989586621679840090 :: Maybe a) = 'Option a6989586621679840090 :: Option (a :: Type)
- data GetOptionSym0 a6989586621679840093
- type GetOptionSym1 (a6989586621679840093 :: Option (a :: Type)) = GetOption a6989586621679840093 :: Maybe a
- data ArgSym0 a6989586621680936903
- data ArgSym1 a6989586621680936903 a6989586621680936904
- type ArgSym2 (a6989586621680936903 :: a) (a6989586621680936904 :: b) = 'Arg a6989586621680936903 a6989586621680936904 :: Arg (a :: Type) (b :: Type)
Documentation
class PSemigroup a Source #
Instances
| PSemigroup Ordering Source # | |
| PSemigroup Symbol Source # | |
| PSemigroup () Source # | |
| PSemigroup Void Source # | |
| PSemigroup All Source # | |
| PSemigroup Any Source # | |
| PSemigroup [a] Source # | |
| PSemigroup (Maybe a) Source # | |
| PSemigroup (Min a) Source # | |
| PSemigroup (Max a) Source # | |
| PSemigroup (First a) Source # | |
| PSemigroup (Last a) Source # | |
| PSemigroup (WrappedMonoid m) Source # | |
| PSemigroup (Option a) Source # | |
| PSemigroup (Identity a) Source # | |
| PSemigroup (First a) Source # | |
| PSemigroup (Last a) Source # | |
| PSemigroup (Dual a) Source # | |
| PSemigroup (Sum a) Source # | |
| PSemigroup (Product a) Source # | |
| PSemigroup (Down a) Source # | |
| PSemigroup (NonEmpty a) Source # | |
| PSemigroup (Either a b) Source # | |
| PSemigroup (a, b) Source # | |
| PSemigroup (Proxy s) Source # | |
| PSemigroup (a ~> b) Source # | |
| PSemigroup (a, b, c) Source # | |
| PSemigroup (Const a b) Source # | |
| PSemigroup (a, b, c, d) Source # | |
| PSemigroup (a, b, c, d, e) Source # | |
class SSemigroup a where Source #
Minimal complete definition
Methods
(%<>) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t :: a) infixr 6 Source #
sSconcat :: forall (t :: NonEmpty a). Sing t -> Sing (Apply SconcatSym0 t :: a) Source #
Instances
The singleton kind-indexed type family.
Instances
Constructors
| SFirst :: forall (a :: Type) (n :: a). (Sing n) -> SFirst ('First n :: First (a :: Type)) |
data SWrappedMonoid z where Source #
Constructors
| SWrapMonoid :: forall (m :: Type) (n :: m). (Sing n) -> SWrappedMonoid ('WrapMonoid n :: WrappedMonoid (m :: Type)) |
Instances
| SDecide m => TestCoercion (SWrappedMonoid :: WrappedMonoid m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods testCoercion :: forall (a :: k) (b :: k). SWrappedMonoid a -> SWrappedMonoid b -> Maybe (Coercion a b) # | |
| SDecide m => TestEquality (SWrappedMonoid :: WrappedMonoid m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods testEquality :: forall (a :: k) (b :: k). SWrappedMonoid a -> SWrappedMonoid b -> Maybe (a :~: b) # | |
| ShowSing m => Show (SWrappedMonoid z) Source # | |
Defined in Data.Singletons.Prelude.Semigroup Methods showsPrec :: Int -> SWrappedMonoid z -> ShowS # show :: SWrappedMonoid z -> String # showList :: [SWrappedMonoid z] -> ShowS # | |
Instances
| SDecide Bool => TestCoercion SAll Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide Bool => TestEquality SAll Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| ShowSing Bool => Show (SAll z) Source # | |
Instances
| SDecide Bool => TestCoercion SAny Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide Bool => TestEquality SAny Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| ShowSing Bool => Show (SAny z) Source # | |
data SProduct z where Source #
Constructors
| SProduct :: forall (a :: Type) (n :: a). (Sing n) -> SProduct ('Product n :: Product (a :: Type)) |
Constructors
| SOption :: forall (a :: Type) (n :: Maybe a). (Sing n) -> SOption ('Option n :: Option (a :: Type)) |
Instances
| SDecide (Maybe a) => TestCoercion (SOption :: Option a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide (Maybe a) => TestEquality (SOption :: Option a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| ShowSing (Maybe a) => Show (SOption z) Source # | |
type family UnwrapMonoid a where ... Source #
Equations
| UnwrapMonoid ('WrapMonoid field) = field |
type family GetProduct a where ... Source #
Equations
| GetProduct ('Product field) = field |
sGetMin :: forall (a :: Type) (t :: Min (a :: Type)). Sing t -> Sing (Apply GetMinSym0 t :: a) Source #
sGetMax :: forall (a :: Type) (t :: Max (a :: Type)). Sing t -> Sing (Apply GetMaxSym0 t :: a) Source #
sGetFirst :: forall (a :: Type) (t :: First (a :: Type)). Sing t -> Sing (Apply GetFirstSym0 t :: a) Source #
sGetLast :: forall (a :: Type) (t :: Last (a :: Type)). Sing t -> Sing (Apply GetLastSym0 t :: a) Source #
sUnwrapMonoid :: forall (m :: Type) (t :: WrappedMonoid (m :: Type)). Sing t -> Sing (Apply UnwrapMonoidSym0 t :: m) Source #
sGetDual :: forall (a :: Type) (t :: Dual (a :: Type)). Sing t -> Sing (Apply GetDualSym0 t :: a) Source #
sGetSum :: forall (a :: Type) (t :: Sum (a :: Type)). Sing t -> Sing (Apply GetSumSym0 t :: a) Source #
sGetProduct :: forall (a :: Type) (t :: Product (a :: Type)). Sing t -> Sing (Apply GetProductSym0 t :: a) Source #
sGetOption :: forall (a :: Type) (t :: Option (a :: Type)). Sing t -> Sing (Apply GetOptionSym0 t :: Maybe a) Source #
sOption_ :: forall b a (t :: b) (t :: (~>) a b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Option_Sym0 t) t) t :: b) Source #
Defunctionalization symbols
data (<>@#@$) a6989586621679830624 infixr 6 Source #
Instances
| SSemigroup a => SingI ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # | |
| SuppressUnusedWarnings ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply ((<>@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679830624 :: a) Source # | |
data a6989586621679830624 <>@#@$$ a6989586621679830625 infixr 6 Source #
Instances
| (SSemigroup a, SingI d) => SingI ((<>@#@$$) d :: TyFun a a -> Type) Source # | |
| SuppressUnusedWarnings ((<>@#@$$) a6989586621679830624 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply ((<>@#@$$) a6989586621679830624 :: TyFun a a -> Type) (a6989586621679830625 :: a) Source # | |
type (<>@#@$$$) (a6989586621679830624 :: a) (a6989586621679830625 :: a) = (<>) a6989586621679830624 a6989586621679830625 :: a infixr 6 Source #
data SconcatSym0 a6989586621679830628 Source #
Instances
| SSemigroup a => SingI (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing SconcatSym0 Source # | |
| SuppressUnusedWarnings (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621679830628 :: NonEmpty a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621679830628 :: NonEmpty a) = SconcatSym1 a6989586621679830628 | |
type SconcatSym1 (a6989586621679830628 :: NonEmpty a) = Sconcat a6989586621679830628 :: a Source #
data MinSym0 a6989586621679840213 Source #
Instances
| SingI (MinSym0 :: TyFun a (Min a) -> Type) Source # | |
| SuppressUnusedWarnings (MinSym0 :: TyFun a (Min a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MinSym0 :: TyFun a (Min a) -> Type) (a6989586621679840213 :: a) Source # | |
data GetMinSym0 a6989586621679840216 Source #
Instances
| SingI (GetMinSym0 :: TyFun (Min a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetMinSym0 Source # | |
| SuppressUnusedWarnings (GetMinSym0 :: TyFun (Min a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetMinSym0 :: TyFun (Min a) a -> Type) (a6989586621679840216 :: Min a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetMinSym0 :: TyFun (Min a) a -> Type) (a6989586621679840216 :: Min a) = GetMinSym1 a6989586621679840216 | |
type GetMinSym1 (a6989586621679840216 :: Min (a :: Type)) = GetMin a6989586621679840216 :: a Source #
data MaxSym0 a6989586621679840235 Source #
Instances
| SingI (MaxSym0 :: TyFun a (Max a) -> Type) Source # | |
| SuppressUnusedWarnings (MaxSym0 :: TyFun a (Max a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MaxSym0 :: TyFun a (Max a) -> Type) (a6989586621679840235 :: a) Source # | |
data GetMaxSym0 a6989586621679840238 Source #
Instances
| SingI (GetMaxSym0 :: TyFun (Max a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetMaxSym0 Source # | |
| SuppressUnusedWarnings (GetMaxSym0 :: TyFun (Max a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetMaxSym0 :: TyFun (Max a) a -> Type) (a6989586621679840238 :: Max a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetMaxSym0 :: TyFun (Max a) a -> Type) (a6989586621679840238 :: Max a) = GetMaxSym1 a6989586621679840238 | |
type GetMaxSym1 (a6989586621679840238 :: Max (a :: Type)) = GetMax a6989586621679840238 :: a Source #
data FirstSym0 a6989586621679840257 Source #
Instances
| SingI (FirstSym0 :: TyFun a (First a) -> Type) Source # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun a (First a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FirstSym0 :: TyFun a (First a) -> Type) (a6989586621679840257 :: a) Source # | |
type FirstSym1 (a6989586621679840257 :: a) = 'First a6989586621679840257 :: First (a :: Type) Source #
data GetFirstSym0 a6989586621679840260 Source #
Instances
| SingI (GetFirstSym0 :: TyFun (First a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetFirstSym0 Source # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetFirstSym0 :: TyFun (First a) a -> Type) (a6989586621679840260 :: First a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetFirstSym0 :: TyFun (First a) a -> Type) (a6989586621679840260 :: First a) = GetFirstSym1 a6989586621679840260 | |
type GetFirstSym1 (a6989586621679840260 :: First (a :: Type)) = GetFirst a6989586621679840260 :: a Source #
data LastSym0 a6989586621679840279 Source #
Instances
| SingI (LastSym0 :: TyFun a (Last a) -> Type) Source # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun a (Last a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (LastSym0 :: TyFun a (Last a) -> Type) (a6989586621679840279 :: a) Source # | |
data GetLastSym0 a6989586621679840282 Source #
Instances
| SingI (GetLastSym0 :: TyFun (Last a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetLastSym0 Source # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetLastSym0 :: TyFun (Last a) a -> Type) (a6989586621679840282 :: Last a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetLastSym0 :: TyFun (Last a) a -> Type) (a6989586621679840282 :: Last a) = GetLastSym1 a6989586621679840282 | |
type GetLastSym1 (a6989586621679840282 :: Last (a :: Type)) = GetLast a6989586621679840282 :: a Source #
data WrapMonoidSym0 a6989586621679840301 Source #
Instances
| SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods | |
| SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (a6989586621679840301 :: m) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (a6989586621679840301 :: m) = WrapMonoidSym1 a6989586621679840301 | |
type WrapMonoidSym1 (a6989586621679840301 :: m) = 'WrapMonoid a6989586621679840301 :: WrappedMonoid (m :: Type) Source #
data UnwrapMonoidSym0 a6989586621679840304 Source #
Instances
| SingI (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods | |
| SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621679840304 :: WrappedMonoid m) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621679840304 :: WrappedMonoid m) = UnwrapMonoidSym1 a6989586621679840304 | |
type UnwrapMonoidSym1 (a6989586621679840304 :: WrappedMonoid (m :: Type)) = UnwrapMonoid a6989586621679840304 :: m Source #
data DualSym0 a6989586621679840113 Source #
Instances
| SingI (DualSym0 :: TyFun a (Dual a) -> Type) Source # | |
| SuppressUnusedWarnings (DualSym0 :: TyFun a (Dual a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (DualSym0 :: TyFun a (Dual a) -> Type) (a6989586621679840113 :: a) Source # | |
data GetDualSym0 a6989586621679840116 Source #
Instances
| SingI (GetDualSym0 :: TyFun (Dual a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetDualSym0 Source # | |
| SuppressUnusedWarnings (GetDualSym0 :: TyFun (Dual a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetDualSym0 :: TyFun (Dual a) a -> Type) (a6989586621679840116 :: Dual a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetDualSym0 :: TyFun (Dual a) a -> Type) (a6989586621679840116 :: Dual a) = GetDualSym1 a6989586621679840116 | |
type GetDualSym1 (a6989586621679840116 :: Dual (a :: Type)) = GetDual a6989586621679840116 :: a Source #
data AllSym0 a6989586621679840130 Source #
Instances
| SingI AllSym0 Source # | |
| SuppressUnusedWarnings AllSym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply AllSym0 (a6989586621679840130 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
data GetAllSym0 a6989586621679840133 Source #
Instances
| SingI GetAllSym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAllSym0 Source # | |
| SuppressUnusedWarnings GetAllSym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply GetAllSym0 (a6989586621679840133 :: All) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
data AnySym0 a6989586621679840147 Source #
Instances
| SingI AnySym0 Source # | |
| SuppressUnusedWarnings AnySym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply AnySym0 (a6989586621679840147 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
data GetAnySym0 a6989586621679840150 Source #
Instances
| SingI GetAnySym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAnySym0 Source # | |
| SuppressUnusedWarnings GetAnySym0 Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply GetAnySym0 (a6989586621679840150 :: Any) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
data SumSym0 a6989586621679840169 Source #
Instances
| SingI (SumSym0 :: TyFun a (Sum a) -> Type) Source # | |
| SuppressUnusedWarnings (SumSym0 :: TyFun a (Sum a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (SumSym0 :: TyFun a (Sum a) -> Type) (a6989586621679840169 :: a) Source # | |
data GetSumSym0 a6989586621679840172 Source #
Instances
| SingI (GetSumSym0 :: TyFun (Sum a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetSumSym0 Source # | |
| SuppressUnusedWarnings (GetSumSym0 :: TyFun (Sum a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetSumSym0 :: TyFun (Sum a) a -> Type) (a6989586621679840172 :: Sum a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetSumSym0 :: TyFun (Sum a) a -> Type) (a6989586621679840172 :: Sum a) = GetSumSym1 a6989586621679840172 | |
type GetSumSym1 (a6989586621679840172 :: Sum (a :: Type)) = GetSum a6989586621679840172 :: a Source #
data ProductSym0 a6989586621679840191 Source #
Instances
| SingI (ProductSym0 :: TyFun a (Product a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing ProductSym0 Source # | |
| SuppressUnusedWarnings (ProductSym0 :: TyFun a (Product a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ProductSym0 :: TyFun a (Product a) -> Type) (a6989586621679840191 :: a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (ProductSym0 :: TyFun a (Product a) -> Type) (a6989586621679840191 :: a) = ProductSym1 a6989586621679840191 | |
type ProductSym1 (a6989586621679840191 :: a) = 'Product a6989586621679840191 :: Product (a :: Type) Source #
data GetProductSym0 a6989586621679840194 Source #
Instances
| SingI (GetProductSym0 :: TyFun (Product a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods | |
| SuppressUnusedWarnings (GetProductSym0 :: TyFun (Product a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621679840194 :: Product a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621679840194 :: Product a) = GetProductSym1 a6989586621679840194 | |
type GetProductSym1 (a6989586621679840194 :: Product (a :: Type)) = GetProduct a6989586621679840194 :: a Source #
data OptionSym0 a6989586621679840090 Source #
Instances
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 Source # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621679840090 :: Maybe a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621679840090 :: Maybe a) = OptionSym1 a6989586621679840090 | |
type OptionSym1 (a6989586621679840090 :: Maybe a) = 'Option a6989586621679840090 :: Option (a :: Type) Source #
data GetOptionSym0 a6989586621679840093 Source #
Instances
| SingI (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetOptionSym0 Source # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679840093 :: Option a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679840093 :: Option a) = GetOptionSym1 a6989586621679840093 | |
type GetOptionSym1 (a6989586621679840093 :: Option (a :: Type)) = GetOption a6989586621679840093 :: Maybe a Source #
data ArgSym0 a6989586621680936903 Source #
Instances
| SingI (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type) Source # | |
| SuppressUnusedWarnings (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type) (a6989586621680936903 :: a) Source # | |
data ArgSym1 a6989586621680936903 a6989586621680936904 Source #
Instances
| SingI d => SingI (ArgSym1 d :: TyFun b (Arg a b) -> Type) Source # | |
| SuppressUnusedWarnings (ArgSym1 a6989586621680936903 :: TyFun b (Arg a b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ArgSym1 a6989586621680936903 :: TyFun b (Arg a b) -> Type) (a6989586621680936904 :: b) Source # | |
type ArgSym2 (a6989586621680936903 :: a) (a6989586621680936904 :: b) = 'Arg a6989586621680936903 a6989586621680936904 :: Arg (a :: Type) (b :: Type) Source #
Orphan instances
| SMonadPlus Option Source # | |
| SAlternative Option Source # | |
| SMonad Min Source # | |
Methods (%>>=) :: forall a b (t :: Min a) (t :: a ~> Min b). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t) Source # (%>>) :: forall a b (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SMonad Max Source # | |
Methods (%>>=) :: forall a b (t :: Max a) (t :: a ~> Max b). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t) Source # (%>>) :: forall a b (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SMonad First Source # | |
Methods (%>>=) :: forall a b (t :: First a) (t :: a ~> First b). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t) Source # (%>>) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SMonad Last Source # | |
Methods (%>>=) :: forall a b (t :: Last a) (t :: a ~> Last b). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t) Source # (%>>) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SMonad Option Source # | |
Methods (%>>=) :: forall a b (t :: Option a) (t :: a ~> Option b). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t) Source # (%>>) :: forall a b (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SApplicative Min Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t :: Min (a ~> b)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%*>) :: forall a b (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t) Source # (%<*) :: forall a b (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t) Source # | |
| SApplicative Max Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t :: Max (a ~> b)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%*>) :: forall a b (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t) Source # (%<*) :: forall a b (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t) Source # | |
| SApplicative First Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t :: First (a ~> b)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: First a) (t :: First b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%*>) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t) Source # (%<*) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t) Source # | |
| SApplicative Last Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t :: Last (a ~> b)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%*>) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t) Source # (%<*) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t) Source # | |
| SApplicative Option Source # | |
Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t :: Option (a ~> b)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%*>) :: forall a b (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t) Source # (%<*) :: forall a b (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t) Source # | |
| SFunctor Min Source # | |
| SFunctor Max Source # | |
| SFunctor First Source # | |
| SFunctor Last Source # | |
| SFunctor Option Source # | |
| PMonad Min Source # | |
| PMonad Max Source # | |
| PMonad First Source # | |
| PMonad Last Source # | |
| PMonad Option Source # | |
| PApplicative Min Source # | |
| PApplicative Max Source # | |
| PApplicative First Source # | |
| PApplicative Last Source # | |
| PApplicative Option Source # | |
| PFunctor Min Source # | |
| PFunctor Max Source # | |
| PFunctor First Source # | |
| PFunctor Last Source # | |
| PFunctor Option Source # | |
| SShow Bool => SShow All Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: All) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: All). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [All]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow Bool => SShow Any Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Any) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Any). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Any]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| PShow All Source # | |
| PShow Any Source # | |
| SFoldable Min Source # | |
Methods sFold :: forall m (t :: Min m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Min a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Min a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Min a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Min a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Min a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Min a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Min a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Min a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Min a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| SFoldable Max Source # | |
Methods sFold :: forall m (t :: Max m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Max a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Max a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Max a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Max a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Max a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Max a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Max a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Max a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Max a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| SFoldable First Source # | |
Methods sFold :: forall m (t :: First m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: First a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: First a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: First a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: First a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: First a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| SFoldable Last Source # | |
Methods sFold :: forall m (t :: Last m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Last a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Last a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Last a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Last a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Last a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| SFoldable Option Source # | |
Methods sFold :: forall m (t :: Option m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Option a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Option a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Option a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Option a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Option a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Option a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Option a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Option a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Option a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| PFoldable Min Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Max Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable First Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Last Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Option Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| STraversable Min Source # | |
Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Min a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Min (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Min a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Min (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| STraversable Max Source # | |
Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Max a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Max (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Max a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Max (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| STraversable First Source # | |
Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: First a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: First (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: First a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: First (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| STraversable Last Source # | |
Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Last a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Last (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Last a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Last (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| STraversable Option Source # | |
Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Option a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Option (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Option a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Option (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| PTraversable Min Source # | |
| PTraversable Max Source # | |
| PTraversable First Source # | |
| PTraversable Last Source # | |
| PTraversable Option Source # | |
| ShowSing Bool => Show (SAny z) Source # | |
| ShowSing Bool => Show (SAll z) Source # | |
| SNum a => SNum (Min a) Source # | |
Methods (%+) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (+@#@$) t) t) Source # (%-) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (-@#@$) t) t) Source # (%*) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (*@#@$) t) t) Source # sNegate :: forall (t :: Min a). Sing t -> Sing (Apply NegateSym0 t) Source # sAbs :: forall (t :: Min a). Sing t -> Sing (Apply AbsSym0 t) Source # sSignum :: forall (t :: Min a). Sing t -> Sing (Apply SignumSym0 t) Source # sFromInteger :: forall (t :: Nat). Sing t -> Sing (Apply FromIntegerSym0 t) Source # | |
| SNum a => SNum (Max a) Source # | |
Methods (%+) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (+@#@$) t) t) Source # (%-) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (-@#@$) t) t) Source # (%*) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (*@#@$) t) t) Source # sNegate :: forall (t :: Max a). Sing t -> Sing (Apply NegateSym0 t) Source # sAbs :: forall (t :: Max a). Sing t -> Sing (Apply AbsSym0 t) Source # sSignum :: forall (t :: Max a). Sing t -> Sing (Apply SignumSym0 t) Source # sFromInteger :: forall (t :: Nat). Sing t -> Sing (Apply FromIntegerSym0 t) Source # | |
| PNum (Min a) Source # | |
| PNum (Max a) Source # | |
| SFunctor (Arg a) Source # | |
| PFunctor (Arg a) Source # | |
| SEnum a => SEnum (Min a) Source # | |
Methods sSucc :: forall (t :: Min a). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Min a). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Min a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Min a) (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source # | |
| SEnum a => SEnum (Max a) Source # | |
Methods sSucc :: forall (t :: Max a). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Max a). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Max a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Max a) (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source # | |
| SEnum a => SEnum (First a) Source # | |
Methods sSucc :: forall (t :: First a). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: First a). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: First a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: First a) (t :: First a) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source # | |
| SEnum a => SEnum (Last a) Source # | |
Methods sSucc :: forall (t :: Last a). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Last a). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Last a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Last a) (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source # | |
| SEnum a => SEnum (WrappedMonoid a) Source # | |
Methods sSucc :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: WrappedMonoid a) (t :: WrappedMonoid a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: WrappedMonoid a) (t :: WrappedMonoid a) (t :: WrappedMonoid a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source # | |
| PEnum (Min a) Source # | |
| PEnum (Max a) Source # | |
| PEnum (First a) Source # | |
| PEnum (Last a) Source # | |
| PEnum (WrappedMonoid a) Source # | |
| SOrd a => SSemigroup (Min a) Source # | |
| SOrd a => SSemigroup (Max a) Source # | |
| SSemigroup (First a) Source # | |
| SSemigroup (Last a) Source # | |
| SMonoid m => SSemigroup (WrappedMonoid m) Source # | |
Methods (%<>) :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sSconcat :: forall (t :: NonEmpty (WrappedMonoid m)). Sing t -> Sing (Apply SconcatSym0 t) Source # | |
| SSemigroup a => SSemigroup (Option a) Source # | |
| PSemigroup (Min a) Source # | |
| PSemigroup (Max a) Source # | |
| PSemigroup (First a) Source # | |
| PSemigroup (Last a) Source # | |
| PSemigroup (WrappedMonoid m) Source # | |
| PSemigroup (Option a) Source # | |
| SShow a => SShow (Min a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Min a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Min a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Min a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (Max a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Max a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Max a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Max a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (First a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: First a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: First a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [First a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (Last a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Last a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Last a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Last a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow m => SShow (WrappedMonoid m) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: WrappedMonoid m) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: WrappedMonoid m). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [WrappedMonoid m]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow (Maybe a) => SShow (Option a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Option a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Option a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Option a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (Dual a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Dual a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Dual a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Dual a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (Sum a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Sum a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Sum a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Sum a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| SShow a => SShow (Product a) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Product a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Product a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Product a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| PShow (Min a) Source # | |
| PShow (Max a) Source # | |
| PShow (First a) Source # | |
| PShow (Last a) Source # | |
| PShow (WrappedMonoid m) Source # | |
| PShow (Option a) Source # | |
| PShow (Dual a) Source # | |
| PShow (Sum a) Source # | |
| PShow (Product a) Source # | |
| (SOrd a, SBounded a) => SMonoid (Min a) Source # | |
| (SOrd a, SBounded a) => SMonoid (Max a) Source # | |
| SMonoid m => SMonoid (WrappedMonoid m) Source # | |
Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [WrappedMonoid m]). Sing t -> Sing (Apply MconcatSym0 t) Source # | |
| SSemigroup a => SMonoid (Option a) Source # | |
| PMonoid (Min a) Source # | |
| PMonoid (Max a) Source # | |
| PMonoid (WrappedMonoid m) Source # | |
| PMonoid (Option a) Source # | |
| SFoldable (Arg a) Source # | |
Methods sFold :: forall m (t :: Arg a m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a0 m (t :: a0 ~> m) (t :: Arg a a0). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Arg a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Arg a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a0 (t :: a0) (t :: Arg a a0). SEq a0 => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a0 (t :: Arg a a0). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a0 (t :: Arg a a0). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a0 (t :: Arg a a0). SNum a0 => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a0 (t :: Arg a a0). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) Source # | |
| PFoldable (Arg a) Source # | |
Associated Types type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # | |
| STraversable (Arg a) Source # | |
Methods sTraverse :: forall a0 (f :: Type -> Type) b (t :: a0 ~> f b) (t :: Arg a a0). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t :: Arg a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a0 (m :: Type -> Type) b (t :: a0 ~> m b) (t :: Arg a a0). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a0 (t :: Arg a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source # | |
| PTraversable (Arg a) Source # | |
| PMonadPlus Option Source # | |
| PAlternative Option Source # | |
| ShowSing m => Show (SWrappedMonoid z) Source # | |
Methods showsPrec :: Int -> SWrappedMonoid z -> ShowS # show :: SWrappedMonoid z -> String # showList :: [SWrappedMonoid z] -> ShowS # | |
| ShowSing a => Show (SLast z) Source # | |
| ShowSing a => Show (SFirst z) Source # | |
| ShowSing a => Show (SMax z) Source # | |
| ShowSing a => Show (SMin z) Source # | |
| ShowSing a => Show (SProduct z) Source # | |
| ShowSing a => Show (SSum z) Source # | |
| ShowSing a => Show (SDual z) Source # | |
| ShowSing (Maybe a) => Show (SOption z) Source # | |
| (SingKind a, SingKind b) => SingKind (Arg a b) Source # | |
| PEq (Arg a b) Source # | |
| SEq a => SEq (Arg a b) Source # | |
| SOrd a => SOrd (Arg a b) Source # | |
Methods sCompare :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source # | |
| POrd (Arg a b) Source # | |
| (SShow a, SShow b) => SShow (Arg a b) Source # | |
Methods sShowsPrec :: forall (t :: Nat) (t :: Arg a b) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Arg a b). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Arg a b]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source # | |
| PShow (Arg a b) Source # | |
| (SingI n1, SingI n2) => SingI ('Arg n1 n2 :: Arg a b) Source # | |