NumHask.Data.Positive

Positive numbers.

Positivity is enforced via the positive constructor

Documentation

data Positive a

Wrapper for positive numbers. Note that the constructor is not exported.

Instances

(Ord a, UpperBoundedField a) => Bounded (Positive a)

Defined in NumHask.Data.Positive

Methods

minBound :: Positive a

maxBound :: Positive a

Eq a => Eq (Positive a)

Defined in NumHask.Data.Positive

Methods

(==) :: Positive a -> Positive a -> Bool

(/=) :: Positive a -> Positive a -> Bool

Ord a => Ord (Positive a)

Defined in NumHask.Data.Positive

Methods

compare :: Positive a -> Positive a -> Ordering

(<) :: Positive a -> Positive a -> Bool

(<=) :: Positive a -> Positive a -> Bool

(>) :: Positive a -> Positive a -> Bool

(>=) :: Positive a -> Positive a -> Bool

max :: Positive a -> Positive a -> Positive a

min :: Positive a -> Positive a -> Positive a

Show a => Show (Positive a)

Defined in NumHask.Data.Positive

Methods

showsPrec :: Int -> Positive a -> ShowS

show :: Positive a -> String

showList :: [Positive a] -> ShowS

(Ord a, Subtractive a) => Subtractive (Positive a)

Defined in NumHask.Data.Positive

Methods

negate :: Positive a -> Positive a

(-) :: Positive a -> Positive a -> Positive a

Additive a => Additive (Positive a)

Defined in NumHask.Data.Positive

Methods

(+) :: Positive a -> Positive a -> Positive a

zero :: Positive a

Divisive a => Divisive (Positive a)

Defined in NumHask.Data.Positive

Methods

recip :: Positive a -> Positive a

(/) :: Positive a -> Positive a -> Positive a

Multiplicative a => Multiplicative (Positive a)

Defined in NumHask.Data.Positive

Methods

(*) :: Positive a -> Positive a -> Positive a

one :: Positive a

(Additive a, Multiplicative a) => Distributive (Positive a)

Defined in NumHask.Data.Positive

Integral a => Integral (Positive a)

Defined in NumHask.Data.Positive

Methods

div :: Positive a -> Positive a -> Positive a

mod :: Positive a -> Positive a -> Positive a

divMod :: Positive a -> Positive a -> (Positive a, Positive a)

quot :: Positive a -> Positive a -> Positive a

rem :: Positive a -> Positive a -> Positive a

quotRem :: Positive a -> Positive a -> (Positive a, Positive a)

(Ord a, TrigField a) => TrigField (Positive a)

Defined in NumHask.Data.Positive

Methods

pi :: Positive a

sin :: Positive a -> Positive a

cos :: Positive a -> Positive a

tan :: Positive a -> Positive a

asin :: Positive a -> Positive a

acos :: Positive a -> Positive a

atan :: Positive a -> Positive a

atan2 :: Positive a -> Positive a -> Positive a

sinh :: Positive a -> Positive a

cosh :: Positive a -> Positive a

tanh :: Positive a -> Positive a

asinh :: Positive a -> Positive a

acosh :: Positive a -> Positive a

atanh :: Positive a -> Positive a

(Ord a, UpperBoundedField a) => UpperBoundedField (Positive a)

Defined in NumHask.Data.Positive

Methods

infinity :: Positive a

nan :: Positive a

(Ord a, ExpField a) => ExpField (Positive a)

Defined in NumHask.Data.Positive

Methods

exp :: Positive a -> Positive a

log :: Positive a -> Positive a

logBase :: Positive a -> Positive a -> Positive a

(**) :: Positive a -> Positive a -> Positive a

sqrt :: Positive a -> Positive a

(Ord a, Subtractive a, Divisive a) => Field (Positive a)

Defined in NumHask.Data.Positive

MeetSemiLattice a => MeetSemiLattice (Positive a)

Defined in NumHask.Data.Positive

Methods

(/\) :: Positive a -> Positive a -> Positive a

JoinSemiLattice a => JoinSemiLattice (Positive a)

Defined in NumHask.Data.Positive

Methods

(\/) :: Positive a -> Positive a -> Positive a

(Ord a, Epsilon a) => Epsilon (Positive a)

Defined in NumHask.Data.Positive

Methods

epsilon :: Positive a

nearZero :: Positive a -> Bool

aboutEqual :: Positive a -> Positive a -> Bool

Signed a => Signed (Positive a)

Defined in NumHask.Data.Positive

Methods

sign :: Positive a -> Positive a

abs :: Positive a -> Positive a

(Ord a, QuotientField a Integer) => QuotientField (Positive a) (Positive Integer)

Defined in NumHask.Data.Positive

Methods

properFraction :: Positive a -> (Positive Integer, Positive a)

round :: Positive a -> Positive Integer

ceiling :: Positive a -> Positive Integer

floor :: Positive a -> Positive Integer

truncate :: Positive a -> Positive Integer

positive :: (Ord a, Additive a) => a -> Positive a

Construct a Positive, throwing an error if the input is negative.

positive_ :: (Ord a, Additive a) => a -> Maybe (Positive a)

maybe construct a Positive