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 r l n. { bound :: n, openness :: Openness } -> Core n l r

#finite Source

finite :: forall t r l n. 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 t r n l. 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

(Generic n) => Generic (Upper n)
Newtype (Upper n) _
(Eq n) => Eq (Upper n)
(Ord n) => Ord (Upper n)
(Generic n) => Show (Upper n)
(Ord n) => JoinSemilattice (Upper n)
(Ord n) => MeetSemilattice (Upper n)
(Ord n) => BoundedMeetSemilattice (Upper n)
(Ord n) => Lattice (Upper n)

#PosInf Source

data PosInf

Constructors

MkPosInf

Instances

Generic PosInf
Eq PosInf
Ord PosInf
Show PosInf
(Ord n) => BoundedMeetSemilattice (Core n l PosInf)
(Ord n) => BoundedLattice (Core n NegInf PosInf)

#NegInf Source

data NegInf

Constructors

MkNegInf

Instances

Generic NegInf
Eq NegInf
Ord NegInf
Show NegInf
(Ord n) => BoundedJoinSemilattice (Core n NegInf r)
(Ord n) => BoundedLattice (Core n NegInf PosInf)

#Lower Source

newtype Lower n

Instances

(Generic n) => Generic (Lower n)
Newtype (Lower n) _
(Eq n) => Eq (Lower n)
(Ord n) => Ord (Lower n)
(Generic n) => Show (Lower n)
(Ord n) => JoinSemilattice (Lower n)
(Ord n) => BoundedJoinSemilattice (Lower n)
(Ord n) => MeetSemilattice (Lower n)
(Ord n) => Lattice (Lower n)

#Finite Source

newtype Finite n

Constructors

MkFinite { bound :: n, openness :: Openness }

Instances

(Generic n) => Generic (Finite n)
Newtype (Finite n) _
(Eq n) => Eq (Finite n)
(Ord n) => Ord (Finite n)
(Generic n) => Show (Finite n)
(Ord n) => JoinSemilattice (Finite n)
(Ord n) => MeetSemilattice (Finite n)
(Ord n) => Lattice (Finite n)

#Bound Source

newtype Bound n

Instances

(Generic n) => Generic (Bound n)
Newtype (Bound n) _
(Eq n) => Eq (Bound n)
(Ord n) => Ord (Bound n)
(Generic n) => Show (Bound n)
(Ord n) => Bounded (Bound n)
(Ord n) => JoinSemilattice (Bound n)
(Ord n) => BoundedJoinSemilattice (Bound n)
(Ord n) => MeetSemilattice (Bound n)
(Ord n) => BoundedMeetSemilattice (Bound n)
(Ord n) => Lattice (Bound n)
(Ord n) => BoundedLattice (Bound n)

Modules: Math.Interval; Math.Interval.Bound; Math.Interval.Bound.Internal; Math.Interval.Internal; Math.Interval.Openness