monoids-0.3.2: Deprecated: Use 'reducers'

Safe HaskellSafe-Infered

Data.Monoid.Ord

Contents

Synopsis

Max

newtype Max a Source

Constructors

Max 

Fields

getMax :: a
 

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 

Fields

getMin :: a
 

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 

Fields

getMaxPriority :: Maybe a
 

Instances

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 

Fields

getMinPriority :: Maybe a
 

Instances