monoids-0.2.0: Monoids, specialized containers and a general map/reduce frameworkSource codeContentsIndex
Data.Monoid.Ord
Contents
Max
Min
MaxPriority: Max semigroup w/ added bottom
MinPriority: Min semigroup w/ added top
Synopsis
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
newtype Max a Source
The Monoid (max,minBound)
Constructors
Max
getMax :: a
show/hide Instances
Functor Max
(Ord a, Bounded a) => Reducer a (Max a)
Bounded a => Bounded (Max a)
Eq a => Eq (Max a)
Ord a => Ord (Max a)
Read a => Read (Max a)
Show a => Show (Max a)
(Ord a, Bounded a) => Monoid (Max a)
Min
newtype Min a Source
The Monoid given by (min,maxBound)
Constructors
Min
getMin :: a
show/hide Instances
Functor Min
(Ord a, Bounded a) => Reducer a (Min a)
Bounded a => Bounded (Min a)
Eq a => Eq (Min a)
Ord a => Ord (Min a)
Read a => Read (Min a)
Show a => Show (Min a)
(Ord a, Bounded a) => Monoid (Min a)
MaxPriority: Max semigroup w/ added bottom
newtype MaxPriority a Source
The Monoid (max,Nothing) over Maybe a where Nothing is the bottom element
Constructors
MaxPriority
getMaxPriority :: Maybe a
show/hide Instances
minfinity :: MaxPriority aSource
MinPriority: Min semigroup w/ added top
newtype MinPriority a Source
The Monoid (min,Nothing) over Maybe a where Nothing is the top element
Constructors
MinPriority
getMinPriority :: Maybe a
show/hide Instances
infinity :: MinPriority aSource
Produced by Haddock version 2.4.2