Module
Math.Interval
- Package
- purescript-intervals
- Repository
- colehaus/purescript-intervals
#greaterThanEverywhere Source
greaterThanEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean
#greaterThanOrEqEverywhere Source
greaterThanOrEqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean
#lessThanEverywhere Source
lessThanEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean
#lessThanOrEqEverywhere Source
lessThanOrEqEverywhere :: forall a. Ord a => NonEmpty a -> NonEmpty a -> Boolean
#normalizedWidth Source
normalizedWidth :: forall n. EuclideanRing n => Ring n => Interval n -> Infinite n
Where both exist and are finite, upper bound divided by lower bound
#(<=!) Source
Operator alias for Math.Interval.lessThanOrEqEverywhere (non-associative / precedence 4)
#(>=!) Source
Operator alias for Math.Interval.greaterThanOrEqEverywhere (non-associative / precedence 4)
Re-exports from Math.Interval.Internal
#Interval Source
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)