countable-1.0: Countable, Searchable, Finite, Empty classes

Safe HaskellSafe
LanguageHaskell2010

Data.Empty

Documentation

class Finite n => Empty n where #

Minimal complete definition

never

Methods

never :: n -> a #

Instances

Empty None # 

Methods

never :: None -> a #

(AtLeastOneCountable a, Finite a, Empty b) => Empty (a -> b) # 

Methods

never :: (a -> b) -> a #

(Empty a, Empty b) => Empty (Either a b) # 

Methods

never :: Either a b -> a #

(Empty a, Finite b) => Empty (a, b) # 

Methods

never :: (a, b) -> a #

data None #

Instances

Eq None # 

Methods

(==) :: None -> None -> Bool #

(/=) :: None -> None -> Bool #

Ord None # 

Methods

compare :: None -> None -> Ordering #

(<) :: None -> None -> Bool #

(<=) :: None -> None -> Bool #

(>) :: None -> None -> Bool #

(>=) :: None -> None -> Bool #

max :: None -> None -> None #

min :: None -> None -> None #

Show None # 

Methods

showsPrec :: Int -> None -> ShowS #

show :: None -> String #

showList :: [None] -> ShowS #

Countable None # 
Finite None # 

Methods

allValues :: [None] #

assemble :: Applicative f => (None -> f b) -> f (None -> b) #

Searchable None # 

Methods

search :: (None -> Maybe b) -> Maybe b #

Empty None # 

Methods

never :: None -> a #