Data.Functor.Const.Singletons

Exports the promoted and singled versions of the Const data type.

The Const singleton

type family Sing :: k -> Type

Instances

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SVoid

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SAll

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SAny

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SOrdering

type Sing

Defined in Data.Singletons.Base.TypeError

type Sing = SErrorMessage

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SNat

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple0

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SBool

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SChar

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SSymbol

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SMax :: Max a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SMin :: Min a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SWrappedMonoid :: WrappedMonoid m -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SNonEmpty :: NonEmpty a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SIdentity :: Identity a -> Type

type Sing

Defined in Data.Monoid.Singletons

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Monoid.Singletons

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Ord.Singletons

type Sing = SDown :: Down a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SDual :: Dual a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SProduct :: Product a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal.Wrappers

type Sing = SSum :: Sum a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SMaybe :: Maybe a -> Type

type Sing

A choice of singleton for the kind TYPE rep (for some RuntimeRep rep), an instantiation of which is the famous kind Type.

Conceivably, one could generalize this instance to `Sing @k` for any kind k, and remove all other Sing instances. We don't adopt this design, however, since it is far more convenient in practice to work with explicit singleton values than TypeReps (for instance, TypeReps are more difficult to pattern match on, and require extra runtime checks).

We cannot produce explicit singleton values for everything in TYPE rep, however, since it is an open kind, so we reach for TypeRep in this one particular case.

Defined in Data.Singletons.Base.TypeRepTYPE

type Sing = TypeRep :: TYPE rep -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SList :: [a] -> Type

type Sing

Defined in Data.Semigroup.Singletons

type Sing = SArg :: Arg a b -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SEither :: Either a b -> Type

type Sing

Defined in Data.Proxy.Singletons

type Sing = SProxy :: Proxy t -> Type

type Sing

Defined in Data.Singletons

type Sing = SWrappedSing :: WrappedSing a -> Type

type Sing

Defined in Data.Singletons

type Sing = SLambda :: (k1 ~> k2) -> Type

type Sing

Defined in Data.Singletons.Sigma

type Sing = SSigma :: Sigma s t -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple2 :: (a, b) -> Type

type Sing

Defined in Data.Functor.Const.Singletons

type Sing = SConst :: Const a b -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple3 :: (a, b, c) -> Type

type Sing

Defined in Data.Functor.Product.Singletons

type Sing = SProduct :: Product f g a -> Type

type Sing

Defined in Data.Functor.Sum.Singletons

type Sing = SSum :: Sum f g a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple4 :: (a, b, c, d) -> Type

type Sing

Defined in Data.Functor.Compose.Singletons

type Sing = SCompose :: Compose f g a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple5 :: (a, b, c, d, e) -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple6 :: (a, b, c, d, e, f) -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple7 :: (a, b, c, d, e, f, g) -> Type

data SConst (a1 :: Const a b) where

Constructors

SConst :: forall {k} a (b :: k) (n :: a). Sing n -> SConst ('Const n :: Const a b)

Instances

SDecide a => TestCoercion (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testCoercion :: forall (a0 :: Const a b) (b0 :: Const a b). SConst a0 -> SConst b0 -> Maybe (Coercion a0 b0)

SDecide a => TestEquality (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testEquality :: forall (a0 :: Const a b) (b0 :: Const a b). SConst a0 -> SConst b0 -> Maybe (a0 :~: b0)

Eq (SConst z)

Defined in Data.Functor.Const.Singletons

Methods

(==) :: SConst z -> SConst z -> Bool

(/=) :: SConst z -> SConst z -> Bool

Ord (SConst z)

Defined in Data.Functor.Const.Singletons

Methods

compare :: SConst z -> SConst z -> Ordering

(<) :: SConst z -> SConst z -> Bool

(<=) :: SConst z -> SConst z -> Bool

(>) :: SConst z -> SConst z -> Bool

(>=) :: SConst z -> SConst z -> Bool

max :: SConst z -> SConst z -> SConst z

min :: SConst z -> SConst z -> SConst z

type family GetConst (a1 :: Const a b) :: a where ...

Equations

GetConst ('Const field :: Const a b) = field

sGetConst :: forall {k} a (b :: k) (t :: Const a b). Sing t -> Sing (GetConst t)

Defunctionalization symbols

data ConstSym0 (a1 :: TyFun a (Const a b))

Instances

SingI (ConstSym0 :: TyFun a (Const a b) -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing (ConstSym0 :: TyFun a (Const a b) -> Type)

SuppressUnusedWarnings (ConstSym0 :: TyFun a (Const a b) -> Type)

Defined in Data.Functor.Const.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (a6989586621680067841 :: a)

Defined in Data.Functor.Const.Singletons

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (a6989586621680067841 :: a) = 'Const a6989586621680067841 :: Const a b

type family ConstSym1 (a6989586621680067841 :: a) :: Const a b where ...

Equations

ConstSym1 (a6989586621680067841 :: a) = 'Const a6989586621680067841 :: Const a b

data GetConstSym0 (a1 :: TyFun (Const a b) a)

Instances

SingI (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing (GetConstSym0 :: TyFun (Const a b) a -> Type)

SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680067844 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680067844 :: Const a b) = GetConst a6989586621680067844

type family GetConstSym1 (a6989586621680067844 :: Const a b) :: a where ...

Equations

GetConstSym1 (a6989586621680067844 :: Const a b) = GetConst a6989586621680067844

Orphan instances

SingI1 ('Const :: k1 -> Const k1 b)

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ('Const x :: Const k1 b)

PApplicative (Const m :: Type -> Type)

PFunctor (Const m :: Type -> Type)

SMonoid m => SApplicative (Const m :: Type -> Type)

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Pure t :: Const m a)

(%<*>) :: forall a b (t1 :: Const m (a ~> b)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (t1 <*> t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Const m a) (t3 :: Const m b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)

(%*>) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (t1 *> t2)

(%<*) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (t1 <* t2)

SFunctor (Const m :: Type -> Type)

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Fmap t1 t2)

(%<$) :: forall a b (t1 :: a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (t1 <$ t2)

PFoldable (Const m :: Type -> Type)

SFoldable (Const m :: Type -> Type)

Methods

sFold :: forall m0 (t1 :: Const m m0). SMonoid m0 => Sing t1 -> Sing (Fold t1)

sFoldMap :: forall a m0 (t1 :: a ~> m0) (t2 :: Const m a). SMonoid m0 => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3)

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)

sToList :: forall a (t1 :: Const m a). Sing t1 -> Sing (ToList t1)

sNull :: forall a (t1 :: Const m a). Sing t1 -> Sing (Null t1)

sLength :: forall a (t1 :: Const m a). Sing t1 -> Sing (Length t1)

sElem :: forall a (t1 :: a) (t2 :: Const m a). SEq a => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)

sMaximum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Maximum t1)

sMinimum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Minimum t1)

sSum :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Sum t1)

sProduct :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Product t1)

SingKind a => SingKind (Const a b)

Associated Types

type Demote (Const a b)

Defined in Data.Functor.Const.Singletons

type Demote (Const a b) = Const (Demote a) b

Methods

fromSing :: forall (a0 :: Const a b). Sing a0 -> Demote (Const a b)

toSing :: Demote (Const a b) -> SomeSing (Const a b)

SDecide a => SDecide (Const a b)

Methods

(%~) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Decision (a0 :~: b0)

PEq (Const a b)

SEq a => SEq (Const a b)

Methods

(%==) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 == t2)

(%/=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 /= t2)

PMonoid (Const a b)

Associated Types

type Mempty

Defined in Data.Functor.Const.Singletons

type Mempty

SMonoid a => SMonoid (Const a b)

Methods

sMempty :: Sing (Mempty :: Const a b)

sMappend :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)

sMconcat :: forall (t :: [Const a b]). Sing t -> Sing (Mconcat t)

POrd (Const a b)

SOrd a => SOrd (Const a b)

Methods

sCompare :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Compare t1 t2)

(%<) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 < t2)

(%<=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 <= t2)

(%>) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 > t2)

(%>=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 >= t2)

sMax :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Max t1 t2)

sMin :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Min t1 t2)

PSemigroup (Const a b)

SSemigroup a => SSemigroup (Const a b)

Methods

(%<>) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 <> t2)

sSconcat :: forall (t :: NonEmpty (Const a b)). Sing t -> Sing (Sconcat t)

PBounded (Const a b)

Associated Types

type MinBound

Defined in Data.Functor.Const.Singletons

type MinBound

type MaxBound

Defined in Data.Functor.Const.Singletons

type MaxBound

PEnum (Const a b)

SBounded a => SBounded (Const a b)

Methods

sMinBound :: Sing (MinBound :: Const a b)

sMaxBound :: Sing (MaxBound :: Const a b)

SEnum a => SEnum (Const a b)

Methods

sSucc :: forall (t :: Const a b). Sing t -> Sing (Succ t)

sPred :: forall (t :: Const a b). Sing t -> Sing (Pred t)

sToEnum :: forall (t :: Natural). Sing t -> Sing (ToEnum t :: Const a b)

sFromEnum :: forall (t :: Const a b). Sing t -> Sing (FromEnum t)

sEnumFromTo :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (EnumFromTo t1 t2)

sEnumFromThenTo :: forall (t1 :: Const a b) (t2 :: Const a b) (t3 :: Const a b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (EnumFromThenTo t1 t2 t3)

PNum (Const a b)

SNum a => SNum (Const a b)

Methods

(%+) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 + t2)

(%-) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 - t2)

(%*) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (t1 * t2)

sNegate :: forall (t :: Const a b). Sing t -> Sing (Negate t)

sAbs :: forall (t :: Const a b). Sing t -> Sing (Abs t)

sSignum :: forall (t :: Const a b). Sing t -> Sing (Signum t)

sFromInteger :: forall (t :: Natural). Sing t -> Sing (FromInteger t :: Const a b)

PShow (Const a b)

SShow a => SShow (Const a b)

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Const a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)

sShow_ :: forall (t :: Const a b). Sing t -> Sing (Show_ t)

sShowList :: forall (t1 :: [Const a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)

SingI n => SingI ('Const n :: Const a b)

Methods

sing :: Sing ('Const n :: Const a b)