License | BSD-style (see the file LICENSE) |
---|---|
Maintainer | sjoerd@w3future.com |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell98 |
- eqADT :: (ADT t, Constraints t Eq) => t -> t -> Bool
- compareADT :: (ADT t, Constraints t Ord) => t -> t -> Ordering
- minBoundADT :: (ADT t, Constraints t Bounded) => t
- maxBoundADT :: (ADT t, Constraints t Bounded) => t
- showsPrecADT :: forall t. (ADT t, Constraints t Show) => Int -> t -> ShowS
- readPrecADT :: forall t. (ADT t, Constraints t Read) => ReadPrec t
- memptyADT :: (ADTRecord t, Constraints t Monoid) => t
- mappendADT :: (ADTRecord t, Constraints t Monoid) => t -> t -> t
- fromIntegerADT :: (ADTRecord t, Constraints t Num) => Integer -> t
For all instances
compareADT :: (ADT t, Constraints t Ord) => t -> t -> Ordering Source
minBoundADT :: (ADT t, Constraints t Bounded) => t Source
maxBoundADT :: (ADT t, Constraints t Bounded) => t Source
showsPrecADT :: forall t. (ADT t, Constraints t Show) => Int -> t -> ShowS Source
readPrecADT :: forall t. (ADT t, Constraints t Read) => ReadPrec t Source
For datatypes with one constructor
memptyADT :: (ADTRecord t, Constraints t Monoid) => t Source
mappendADT :: (ADTRecord t, Constraints t Monoid) => t -> t -> t Source
fromIntegerADT :: (ADTRecord t, Constraints t Num) => Integer -> t Source