Represents an arbitrary-precision ratio.

Makes a Rational from a numerator and a denominator.

Important note

If given a zero denominator, this function will error. If you don't mind a size increase, and care about safety, use ratio instead.

Converts an Integer into the equivalent Rational.

Safely constructs a Rational from a numerator and a denominator. Returns Nothing if given a zero denominator.

Returns the numerator of its argument.

Note

It is not true in general that numerator <$> ratio x y = x; this will only hold if x and y are coprime. This is due to Rational normalizing the numerator and denominator.

Returns the denominator of its argument. This will always be greater than, or equal to, 1, although the type does not describe this.

Note

It is not true in general that denominator <$> ratio x y = y; this will only hold if x and y are coprime. This is due to Rational normalizing the numerator and denominator.

round r returns the nearest Integer value to r. If r is equidistant between two values, the even value will be given.

Returns the whole-number part of its argument, dropping any leftover fractional part. More precisely, truncate r = n where (n, _) = properFraction r, but is much more efficient.

properFraction r returns the pair (n, f), such that all of the following hold:

• fromInteger n + f = r;
• n and f both have the same sign as r; and
• abs f < one.

Gives the reciprocal of the argument; specifically, for r /= zero, r * recip r = one.

Important note

The reciprocal of zero is mathematically undefined; thus, recip zero will error. Use with care.

Returns the absolute value of its argument.

Note

This is specialized for Rational; use this instead of the generic version in PlutusTx.Numeric, as said generic version produces much larger on-chain code than the specialized version here.

Produces the additive inverse of its argument.

Note

This is specialized for Rational; use this instead of the generic version of this function, as it is significantly smaller on-chain.

1. 5

Converts a GHC Rational, preserving value. Does not work on-chain.

Converts a Rational to a GHC Rational, preserving value. Does not work on-chain.

Given a numerator and denominator, produces a Rational by dividing both numerator and denominator by their greatest common divisor.

gcd x y is the non-negative factor of both x and y of which every common factor of x and y is also a factor; for example gcd 4 2 = 2, gcd (-4) 6 = 2, gcd 0 4 = 4. gcd 0 0 = 0.