Module

# Math.Interval

Package
purescript-intervals
Repository
colehaus/purescript-intervals

### #InfiniteSource

``data Infinite n``

#### Constructors

• `Finite n`
• `Infinity`

#### Instances

• `(Generic n) => Generic (Infinite n)`
• `(Eq n) => Eq (Infinite n)`
• `(Ord n) => Ord (Infinite n)`
• `(Generic n) => Show (Infinite n)`

### #boundAboveSource

``boundAbove :: forall n. Ord n => n -> Openness -> NonEmpty n -> Maybe (Interval n)``

### #boundBelowSource

``boundBelow :: forall n. Ord n => n -> Openness -> NonEmpty n -> Maybe (Interval n)``

### #certainlySource

``certainly :: forall a. Ord a => (forall b. Ord b => b -> b -> Boolean) -> NonEmpty a -> NonEmpty a -> Boolean``

### #emptySource

``empty :: forall n. Interval n``

### #eqEverywhereSource

``eqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #forgetSource

``forget :: forall n. NonEmpty n -> Interval n``

### #greaterThanEverywhereSource

``greaterThanEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #greaterThanOrEqEverywhereSource

``greaterThanOrEqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #lessThanEverywhereSource

``lessThanEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #lessThanOrEqEverywhereSource

``lessThanOrEqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #makeSource

``make :: forall n. Ord n => Lower n -> Upper n -> Maybe (NonEmpty n)``

### #memberSource

``member :: forall n. Ord n => n -> Interval n -> Boolean``

### #nonEmptySource

``nonEmpty :: forall n. Interval n -> Maybe (NonEmpty n)``

### #normalizedWidthSource

``normalizedWidth :: forall n. EuclideanRing n => Ring n => Interval n -> Infinite n``

Where both exist and are finite, upper bound divided by lower bound

### #notEqEverywhereSource

``notEqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean``

### #nullSource

``null :: forall a. Interval a -> Boolean``

### #singletonSource

``singleton :: forall n. n -> NonEmpty n``

### #unmakeSource

``unmake :: forall n. NonEmpty n -> { lower :: Lower n, upper :: Upper n }``

### #widthSource

``width :: forall n. Ring n => Interval n -> Infinite n``

### #(/=!)Source

Operator alias for Math.Interval.notEqEverywhere (non-associative / precedence 4)

### #(<!)Source

Operator alias for Math.Interval.lessThanEverywhere (non-associative / precedence 4)

### #(<=!)Source

Operator alias for Math.Interval.lessThanOrEqEverywhere (non-associative / precedence 4)

### #(==!)Source

Operator alias for Math.Interval.eqEverywhere (non-associative / precedence 4)

### #(>!)Source

Operator alias for Math.Interval.greaterThanEverywhere (non-associative / precedence 4)

### #(>=!)Source

Operator alias for Math.Interval.greaterThanOrEqEverywhere (non-associative / precedence 4)

## Re-exports from Math.Interval.Internal

### #IntervalSource

``newtype Interval n``

#### Instances

• `(Generic n) => Generic (Interval n)`
• `Newtype (Interval n) _`
• `(Eq n) => Eq (Interval n)`
• `(Ord n) => Ord (Interval n)`
• `(Generic n) => Show (Interval n)`
• `(Ord n) => JoinSemilattice (Interval n)`
• `(Ord n) => BoundedJoinSemilattice (Interval n)`
• `(Ord n) => MeetSemilattice (Interval n)`
• `(Ord n) => BoundedMeetSemilattice (Interval n)`
• `(Ord n) => Lattice (Interval n)`
• `(Ord n) => BoundedLattice (Interval n)`