| Safe Haskell | Safe-Infered |
|---|
Data.Monoid.Ord
- newtype Max a = Max {
- getMax :: a
- newtype Min a = Min {
- getMin :: a
- newtype MaxPriority a = MaxPriority {
- getMaxPriority :: Maybe a
- minfinity :: MaxPriority a
- newtype MinPriority a = MinPriority {
- getMinPriority :: Maybe a
- infinity :: MinPriority a
Max
Min
MaxPriority: Max semigroup w/ added bottom
newtype MaxPriority a Source
Constructors
| MaxPriority | |
Fields
| |
Instances
| Functor MaxPriority | |
| Eq a => Eq (MaxPriority a) | |
| Ord a => Ord (MaxPriority a) | |
| Read a => Read (MaxPriority a) | |
| Show a => Show (MaxPriority a) | |
| Ord a => Monoid (MaxPriority a) | |
| Ord a => Reducer (Maybe a) (MaxPriority a) |
MinPriority: Min semigroup w/ added top
newtype MinPriority a Source
Constructors
| MinPriority | |
Fields
| |
Instances
| Functor MinPriority | |
| Eq a => Eq (MinPriority a) | |
| Ord a => Ord (MinPriority a) | |
| Read a => Read (MinPriority a) | |
| Show a => Show (MinPriority a) | |
| Ord a => Monoid (MinPriority a) | |
| Ord a => Reducer (Maybe a) (MinPriority a) |