monoids-0.1.2: Lots of Monoids
Source code
Contents
Index
Data.Ring.Semi.Ord
Documentation
module
Data.Ring.Semi
newtype
Order
a
Source
Constructors
Order
getOrder
:: a
Instances
Functor
Order
Pointed
Order
Copointed
Order
(
Bounded
a,
Ord
a) =>
Reducer
a (
Order
a)
Bounded
a =>
Bounded
(
Order
a)
Eq
a =>
Eq
(
Order
a)
Ord
a =>
Ord
(
Order
a)
Read
a =>
Read
(
Order
a)
Show
a =>
Show
(
Order
a)
Arbitrary
a =>
Arbitrary
(
Order
a)
(
Bounded
a,
Ord
a) =>
Monoid
(
Order
a)
(
Bounded
a,
Ord
a) =>
MultiplicativeMonoid
(
Order
a)
(
Bounded
a,
Ord
a) =>
Seminearring
(
Order
a)
(
Bounded
a,
Ord
a) =>
Semiring
(
Order
a)
data
Priority
a
Source
Constructors
MinBound
Priority
a
MaxBound
Instances
Functor
Priority
Pointed
Priority
Ord
a =>
Reducer
a (
Priority
a)
Bounded
(
Priority
a)
Eq
a =>
Eq
(
Priority
a)
Ord
a =>
Ord
(
Priority
a)
Read
a =>
Read
(
Priority
a)
Show
a =>
Show
(
Priority
a)
Arbitrary
a =>
Arbitrary
(
Priority
a)
Ord
a =>
Monoid
(
Priority
a)
Ord
a =>
MultiplicativeMonoid
(
Priority
a)
Ord
a =>
Seminearring
(
Priority
a)
Ord
a =>
Semiring
(
Priority
a)
Ord
a =>
Reducer
(
MinPriority
a) (
Priority
a)
Ord
a =>
Reducer
(
MaxPriority
a) (
Priority
a)
Produced by
Haddock
version 2.4.2