stern-brocot-0.1.0.0: Positive rational numbers represented as paths in the Stern-Brocot tree

Safe HaskellNone
LanguageHaskell2010

Numeric.Rational.Positive

Documentation

data Qp Source #

Instances
Eq Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(==) :: Qp -> Qp -> Bool #

(/=) :: Qp -> Qp -> Bool #

Num Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(+) :: Qp -> Qp -> Qp #

(-) :: Qp -> Qp -> Qp #

(*) :: Qp -> Qp -> Qp #

negate :: Qp -> Qp #

abs :: Qp -> Qp #

signum :: Qp -> Qp #

fromInteger :: Integer -> Qp #

Ord Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

compare :: Qp -> Qp -> Ordering #

(<) :: Qp -> Qp -> Bool #

(<=) :: Qp -> Qp -> Bool #

(>) :: Qp -> Qp -> Bool #

(>=) :: Qp -> Qp -> Bool #

max :: Qp -> Qp -> Qp #

min :: Qp -> Qp -> Qp #

Show Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

showsPrec :: Int -> Qp -> ShowS #

show :: Qp -> String #

showList :: [Qp] -> ShowS #

Preord Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(≤) :: Qp -> Qp -> Bool #

(≥) :: Qp -> Qp -> Bool #

(<) :: Qp -> Qp -> Bool #

(>) :: Qp -> Qp -> Bool #

PartialEq Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(≡) :: Qp -> Qp -> Bool #

(≢) :: Qp -> Qp -> Bool #

Eq Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

PartialOrd Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

tryCompare :: Qp -> Qp -> Maybe Ordering #

Ord Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

compare :: Qp -> Qp -> Ordering #

Universe Qp Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

universe :: [Qp] #

Semigroup (Sum Qp) Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(<>) :: Sum Qp -> Sum Qp -> Sum Qp #

sconcat :: NonEmpty (Sum Qp) -> Sum Qp #

stimes :: Integral b => b -> Sum Qp -> Sum Qp #

Semigroup (Product Qp) Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

(<>) :: Product Qp -> Product Qp -> Product Qp #

sconcat :: NonEmpty (Product Qp) -> Product Qp #

stimes :: Integral b => b -> Product Qp -> Product Qp #

Monoid (Product Qp) Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

mempty :: Product Qp #

mappend :: Product Qp -> Product Qp -> Product Qp #

mconcat :: [Product Qp] -> Product Qp #

Group (Product Qp) Source # 
Instance details

Defined in Numeric.Rational.Positive

Methods

invert :: Product Qp -> Product Qp #

fromFraction :: (Natural, Natural) -> Qp Source #

toFraction :: Qp -> (Natural, Natural) Source #

fromRational :: Ratio Natural -> Qp Source #

toRational :: Qp -> Ratio Natural Source #