hgeometry-0.5.0.0: Geometric Algorithms, Data structures, and Data types.

Data.UnBounded

Synopsis

# Documentation

data Top a Source

`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

 Source Source Source Source Source Eq a => Eq (Top a) Source Ord a => Ord (Top a) Source Show a => Show (Top a) Source

pattern ValT :: t -> Top t Source

pattern Top :: Top t Source

data Bottom a Source

`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

 Source Source Source Source Source Eq a => Eq (Bottom a) Source Ord a => Ord (Bottom a) Source Show a => Show (Bottom a) Source

pattern Bottom :: Bottom t Source

pattern ValB :: t -> Bottom t Source

data UnBounded a Source

`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

 Source Source Source Eq a => Eq (UnBounded a) Source Source Num a => Num (UnBounded a) Source Ord a => Ord (UnBounded a) Source Show a => Show (UnBounded a) Source

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