Module

# Math.Interval.Bound

Package
purescript-intervals
Repository
colehaus/purescript-intervals

### #boundSource

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

### #eqSource

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

### #finCoreSource

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

### #finiteSource

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

### #greaterThanSource

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

### #greaterThanOrEqSource

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

### #injectLowerSource

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

### #injectUpperSource

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

### #lessThanSource

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

### #lessThanOrEqSource

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

### #lowerSource

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

### #negInfSource

negInf :: forall n. Bound n -> Boolean

### #notEqSource

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

### #posInfSource

posInf :: forall n. Bound n -> Boolean

### #projectLowerSource

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

### #projectUpperSource

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

### #rawSource

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

### #upperSource

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

newtype Upper n

data PosInf

data NegInf

newtype Lower n

newtype Finite n

newtype Bound n