countable-1.2: Countable, Searchable, Finite, Empty classes
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Function.Eq

Orphan instances

(Finite a, AtLeastOneCountable b) => AtLeastOneCountable (a -> b) Source # 
Instance details

Methods

countFirst :: a -> b Source #

(Finite a, Countable b) => Countable (a -> b) Source # 
Instance details

Methods

countPrevious :: (a -> b) -> Maybe (a -> b) Source #

countMaybeNext :: Maybe (a -> b) -> Maybe (a -> b) Source #

(Finite a, AtLeastOneCountable a, InfiniteCountable b) => InfiniteCountable (a -> b) Source # 
Instance details

Methods

countNext :: Maybe (a -> b) -> a -> b Source #

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

Methods

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

(Finite a, Finite b) => Finite (a -> b) Source # 
Instance details

Methods

allValues :: [a -> b] Source #

assemble :: forall b0 f. Applicative f => ((a -> b) -> f b0) -> f ((a -> b) -> b0) Source #

(Searchable a, Eq b) => Eq (a -> b) Source # 
Instance details

Methods

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

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