Data.UnBounded

Documentation

data Top a

`Top a` represents the type a, together with a Top element, i.e. an element that is greater than any other element. We can think of `Top a` being defined as:

>>> data Top a = ValT a | Top

Instances

Monad Top

Functor Top

Applicative Top

Foldable Top

Traversable Top

Eq a => Eq (Top a)

Ord a => Ord (Top a)

Show a => Show (Top a)

topToMaybe :: Top a -> Maybe a

pattern ValT :: t -> Top t

pattern Top :: Top t

data Bottom a

`Bottom a` represents the type a, together with a Bottom element, i.e. an element that is smaller than any other element. We can think of `Bottom a` being defined as:

>>> data Bottom a = ValB

Instances

Monad Bottom

Functor Bottom

Applicative Bottom

Foldable Bottom

Traversable Bottom

Eq a => Eq (Bottom a)

Ord a => Ord (Bottom a)

Show a => Show (Bottom a)

bottomToMaybe :: Bottom a -> Maybe a

pattern Bottom :: Bottom t

pattern ValB :: t -> Bottom t

data UnBounded a

`UnBounded a` represents the type a, together with an element MaxInfinity larger than any other element, and an element MinInfinity, smaller than any other element.

Constructors

MinInfinity

Val

Fields

_unUnBounded :: a

MaxInfinity

Instances

Functor UnBounded

Foldable UnBounded

Traversable UnBounded

Eq a => Eq (UnBounded a)

Fractional a => Fractional (UnBounded a)

Num a => Num (UnBounded a)

Ord a => Ord (UnBounded a)

Show a => Show (UnBounded a)

unUnBounded :: forall a a. Traversal (UnBounded a) (UnBounded a) a a

unBoundedToMaybe :: UnBounded a -> Maybe a