idempotent-0.1.2: Idempotent monoids

Safe Haskell	Safe-Inferred

Data.Monoid.Extrema

Description

Extrema (minimum and maximum) monoids.

Synopsis

Documentation

newtype Min x Source

Monoid under minimum.

Constructors

Min
Fields getMin :: x

Instances

Eq x => Eq (Min x)
Ord x => Ord (Min x)
Read x => Read (Min x)
Show x => Show (Min x)
(Bounded x, Ord x) => Monoid (Min x)
(Bounded x, Ord x) => Idempotent (Min x)

newtype Max x Source

Monoid under maximum.

Constructors

Max
Fields getMax :: x

Instances

Eq x => Eq (Max x)
Ord x => Ord (Max x)
Read x => Read (Max x)
Show x => Show (Max x)
(Bounded x, Ord x) => Monoid (Max x)
(Bounded x, Ord x) => Idempotent (Max x)