Module

Math.Interval.Bound

Package
purescript-intervals
Repository
colehaus/purescript-intervals

#bound Source

bound :: forall n. Either3 NegInf (Finite n) PosInf -> Bound n

#eq Source

eq :: forall n. Eq n => n -> Bound n -> Boolean

#finCore Source

finCore :: forall n l r. { bound :: n, openness :: Openness } -> Core n l r

#finite Source

finite :: forall n l r t. Newtype t (Core n l r) => t -> Maybe (Finite n)

#greaterThan Source

greaterThan :: forall n. Ord n => n -> Bound n -> Boolean

#greaterThanOrEq Source

greaterThanOrEq :: forall n. Ord n => n -> Bound n -> Boolean

#injectLower Source

injectLower :: forall n. Lower n -> Bound n

#injectUpper Source

injectUpper :: forall n. Upper n -> Bound n

#lessThan Source

lessThan :: forall n. Ord n => n -> Bound n -> Boolean

#lessThanOrEq Source

lessThanOrEq :: forall n. Ord n => n -> Bound n -> Boolean

#lower Source

lower :: forall n. Either NegInf (Finite n) -> Lower n

#negInf Source

negInf :: forall n. Bound n -> Boolean

#notEq Source

notEq :: forall n. Eq n => n -> Bound n -> Boolean

#posInf Source

posInf :: forall n. Bound n -> Boolean

#projectLower Source

projectLower :: forall n. Bound n -> Maybe (Lower n)

#projectUpper Source

projectUpper :: forall n. Bound n -> Maybe (Upper n)

#raw Source

raw :: forall l n r t. Newtype (t n) (Core n l r) => t n -> Either3 l { bound :: n, openness :: Openness } r

#upper Source

upper :: forall n. Either (Finite n) PosInf -> Upper n

Re-exports from Math.Interval.Bound.Internal

#Upper Source

newtype Upper n

Instances

#Lower Source

newtype Lower n

Instances

#Finite Source

newtype Finite n

Constructors

Instances

#Bound Source

newtype Bound n

Instances