polynomial-comonad
Safe HaskellNone
LanguageGHC2021

Data.InternalCategory.Discrete

Documentation

newtype Disc a Source #

Constructors

Disc a 

Instances

Instances details
Eq a => ICategory a (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

foldPath :: Path a (Disc a) -> Disc a Source #

IQuiver a (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

src :: Disc a -> a Source #

tgt :: Disc a -> a Source #

Bounded a => Bounded (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

minBound :: Disc a #

maxBound :: Disc a #

Enum a => Enum (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

succ :: Disc a -> Disc a #

pred :: Disc a -> Disc a #

toEnum :: Int -> Disc a #

fromEnum :: Disc a -> Int #

enumFrom :: Disc a -> [Disc a] #

enumFromThen :: Disc a -> Disc a -> [Disc a] #

enumFromTo :: Disc a -> Disc a -> [Disc a] #

enumFromThenTo :: Disc a -> Disc a -> Disc a -> [Disc a] #

Read a => Read (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Show a => Show (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

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

show :: Disc a -> String #

showList :: [Disc a] -> ShowS #

Eq a => Eq (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

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

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

Ord a => Ord (Disc a) Source # 
Instance details

Defined in Data.InternalCategory.Discrete

Methods

compare :: Disc a -> Disc a -> Ordering #

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

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

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

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

max :: Disc a -> Disc a -> Disc a #

min :: Disc a -> Disc a -> Disc a #