Copyright	(c) L. S. Leary 2025
Safe Haskell	None
Language	GHC2021

Data.Hetero.Void

Contents

VoidF

Description

A higher-kinded Void. Dual to Proxy.

Synopsis

data VoidF (a :: k)
absurdF :: forall {k} (a :: k) b. VoidF a -> b
vacuousF :: forall {k} f (a :: k) b. Functor f => f (VoidF a) -> f b

VoidF

data VoidF (a :: k) Source #

A higher-kinded Void. Dual to Proxy.

Instances

Instances details

HetEq (VoidF :: k -> Type) Source #

Instance details

Defined in Data.Hetero.Void

Associated Types

type Strength (VoidF :: k -> Type)
Instance details Defined in Data.Hetero.Void type Strength (VoidF :: k -> Type) = 'Nominal

Methods

heq :: forall (a :: k) (b :: k). VoidF a -> VoidF b -> Maybe (AtLeast (Strength (VoidF :: k -> Type)) a b) Source #

HetOrd (VoidF :: k -> Type) Source #

Instance details

Defined in Data.Hetero.Void

Methods

hcompare :: forall (a :: k) (b :: k). VoidF a -> VoidF b -> HetOrdering (Strength (VoidF :: k -> Type)) a b Source #

Functor (VoidF :: Type -> Type) Source #

Instance details

Defined in Data.Hetero.Void

Methods

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

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

Foldable (VoidF :: Type -> Type) Source #

Instance details

Defined in Data.Hetero.Void

Methods

fold :: Monoid m => VoidF m -> m #

foldMap :: Monoid m => (a -> m) -> VoidF a -> m #

foldMap' :: Monoid m => (a -> m) -> VoidF a -> m #

foldr :: (a -> b -> b) -> b -> VoidF a -> b #

foldr' :: (a -> b -> b) -> b -> VoidF a -> b #

foldl :: (b -> a -> b) -> b -> VoidF a -> b #

foldl' :: (b -> a -> b) -> b -> VoidF a -> b #

foldr1 :: (a -> a -> a) -> VoidF a -> a #

foldl1 :: (a -> a -> a) -> VoidF a -> a #

toList :: VoidF a -> [a] #

null :: VoidF a -> Bool #

length :: VoidF a -> Int #

elem :: Eq a => a -> VoidF a -> Bool #

maximum :: Ord a => VoidF a -> a #

minimum :: Ord a => VoidF a -> a #

sum :: Num a => VoidF a -> a #

product :: Num a => VoidF a -> a #

Traversable (VoidF :: Type -> Type) Source #

Instance details

Defined in Data.Hetero.Void

Methods

traverse :: Applicative f => (a -> f b) -> VoidF a -> f (VoidF b) #

sequenceA :: Applicative f => VoidF (f a) -> f (VoidF a) #

mapM :: Monad m => (a -> m b) -> VoidF a -> m (VoidF b) #

sequence :: Monad m => VoidF (m a) -> m (VoidF a) #

Semigroup (VoidF a) Source #

Instance details

Defined in Data.Hetero.Void

Methods

(<>) :: VoidF a -> VoidF a -> VoidF a #

sconcat :: NonEmpty (VoidF a) -> VoidF a #

stimes :: Integral b => b -> VoidF a -> VoidF a #

Read (VoidF a) Source #

Instance details

Defined in Data.Hetero.Void

Methods

readsPrec :: Int -> ReadS (VoidF a) #

readList :: ReadS [VoidF a] #

readPrec :: ReadPrec (VoidF a) #

readListPrec :: ReadPrec [VoidF a] #

Show (VoidF a) Source #

Instance details

Defined in Data.Hetero.Void

Methods

showsPrec :: Int -> VoidF a -> ShowS #

show :: VoidF a -> String #

showList :: [VoidF a] -> ShowS #

Eq (VoidF a) Source #

Instance details

Defined in Data.Hetero.Void

Methods

(==) :: VoidF a -> VoidF a -> Bool #

(/=) :: VoidF a -> VoidF a -> Bool #

Ord (VoidF a) Source #

Instance details

Defined in Data.Hetero.Void

Methods

compare :: VoidF a -> VoidF a -> Ordering #

(<) :: VoidF a -> VoidF a -> Bool #

(<=) :: VoidF a -> VoidF a -> Bool #

(>) :: VoidF a -> VoidF a -> Bool #

(>=) :: VoidF a -> VoidF a -> Bool #

max :: VoidF a -> VoidF a -> VoidF a #

min :: VoidF a -> VoidF a -> VoidF a #

type Strength (VoidF :: k -> Type) Source #

Instance details

Defined in Data.Hetero.Void

type Strength (VoidF :: k -> Type) = 'Nominal

absurdF :: forall {k} (a :: k) b. VoidF a -> b Source #

vacuousF :: forall {k} f (a :: k) b. Functor f => f (VoidF a) -> f b Source #