prosidyc-0.3.0.0: A DSL for processing Prosidy documents.
Copyright©2020 James Alexander Feldman-Crough
LicenseMPL-2.0
Maintaineralex@fldcr.com
Safe HaskellSafe
LanguageHaskell2010

Data.Void.HKT

Description

 
Synopsis

Documentation

data family Void :: k Source #

A poly-kinded, uninhabited type family.

Instances

Instances details
Functor (Void :: Type -> Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

fmap :: (a -> b) -> Void a -> Void b #

(<$) :: a -> Void b -> Void a #

Bifunctor (Void :: Type -> Type -> Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

bimap :: (a -> b) -> (c -> d) -> Void a c -> Void b d #

first :: (a -> b) -> Void a c -> Void b c #

second :: (b -> c) -> Void a b -> Void a c #

Choice (Void :: Type -> Type -> Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

left' :: Void a b -> Void (Either a c) (Either b c) #

right' :: Void a b -> Void (Either c a) (Either c b) #

Strong (Void :: Type -> Type -> Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

first' :: Void a b -> Void (a, c) (b, c) #

second' :: Void a b -> Void (c, a) (c, b) #

Profunctor (Void :: Type -> Type -> Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

dimap :: (a -> b) -> (c -> d) -> Void b c -> Void a d #

lmap :: (a -> b) -> Void b c -> Void a c #

rmap :: (b -> c) -> Void a b -> Void a c #

(#.) :: forall a b c q. Coercible c b => q b c -> Void a b -> Void a c #

(.#) :: forall a b c q. Coercible b a => Void b c -> q a b -> Void a c #

Uninhabited (Void :: Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void -> b Source #

Functor (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

fmap :: (a0 -> b) -> Void a a0 -> Void a b #

(<$) :: a0 -> Void a b -> Void a a0 #

Bifunctor (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

bimap :: (a0 -> b) -> (c -> d) -> Void a a0 c -> Void a b d #

first :: (a0 -> b) -> Void a a0 c -> Void a b c #

second :: (b -> c) -> Void a a0 b -> Void a a0 c #

Choice (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

left' :: Void a a0 b -> Void a (Either a0 c) (Either b c) #

right' :: Void a a0 b -> Void a (Either c a0) (Either c b) #

Strong (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

first' :: Void a a0 b -> Void a (a0, c) (b, c) #

second' :: Void a a0 b -> Void a (c, a0) (c, b) #

Profunctor (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

dimap :: (a0 -> b) -> (c -> d) -> Void a b c -> Void a a0 d #

lmap :: (a0 -> b) -> Void a b c -> Void a a0 c #

rmap :: (b -> c) -> Void a a0 b -> Void a a0 c #

(#.) :: forall a0 b c q. Coercible c b => q b c -> Void a a0 b -> Void a a0 c #

(.#) :: forall a0 b c q. Coercible b a0 => Void a b c -> q a0 b -> Void a a0 c #

Uninhabited (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a -> b Source #

Functor (Void a b) Source # 
Instance details

Defined in Data.Void.HKT

Methods

fmap :: (a0 -> b0) -> Void a b a0 -> Void a b b0 #

(<$) :: a0 -> Void a b b0 -> Void a b a0 #

Uninhabited (Void a b) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a b -> b0 Source #

Uninhabited (Void a b c) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a b c -> b0 Source #

data Void Source #

The uninhabited type taking no arguments.

Instance details

Defined in Data.Void.HKT

data Void
newtype Void Source #

The uninhabited type taking three arguments.

Instance details

Defined in Data.Void.HKT

newtype Void = Void3 (Void :: Type)
newtype Void Source #

The uninhabited type taking two arguments.

Instance details

Defined in Data.Void.HKT

newtype Void = Void2 (Void :: Type)
newtype Void Source #

The uninhabited type taking one argument.

Instance details

Defined in Data.Void.HKT

newtype Void = Void1 (Void :: Type)

class Uninhabited a where Source #

Defines uninhabited types.

Methods

absurd :: a -> b Source #

If a is an uninhabited type, we will never receive a value of type a and thus we can return a value of any type.

Instances

Instances details
Uninhabited (Void :: Type) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void -> b Source #

Uninhabited (Void a) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a -> b Source #

Uninhabited (Void a b) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a b -> b0 Source #

Uninhabited (Void a b c) Source # 
Instance details

Defined in Data.Void.HKT

Methods

absurd :: Void a b c -> b0 Source #