Struct Rational 

pub struct Rational { /* private fields */ }

Rational number in canonical form.

Implementations

impl Rational

pub const ZERO: Self

The zero constant.

pub const ONE: Self

The one constant.

pub fn new(p: i32, q: i32) -> Self

Finds the irreducible fraction of numerator p and denominator q.

Panics

Panics if denominator is zero.

pub const fn p(&self) -> i32

The numerator.

pub const fn q(&self) -> i32

The denominator.

pub fn inv(&self) -> Self

Inverts the fraction.

Panics

Panics if numerator is zero.

pub const fn abs(&self) -> Self

The absolute.

pub const fn is_negative(&self) -> bool

Whether this rational number is negative.

pub const fn is_positive(&self) -> bool

Whether this rational number is positive.

pub const fn is_one(&self) -> bool

Whether this rational number is one.

pub const fn is_zero(&self) -> bool

Whether this rational number is zero.

pub fn pow(&self, exp: i32) -> Self

Power.

Trait Implementations

impl Add<Rational> for i32

type Output = Rational

The resulting type after applying the + operator.

fn add(self, other: Rational) -> Rational

Performs the + operation.

impl Add<i32> for Rational

type Output = Rational

The resulting type after applying the + operator.

fn add(self, other: i32) -> Self

Performs the + operation.

impl Add for Rational

type Output = Rational

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self

Performs the + operation.

impl AddAssign<i32> for Rational

fn add_assign(&mut self, other: i32)

Performs the += operation.

impl AddAssign for Rational

fn add_assign(&mut self, other: Self)

Performs the += operation.

impl Clone for Rational

fn clone(&self) -> Rational

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Rational

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Rational

fn default() -> Self

Returns the “default value” for a type.

impl Display for Rational

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Div<Rational> for Polynomial

type Output = Polynomial

The resulting type after applying the / operator.

fn div(self, other: Rational) -> Self::Output

Performs the / operation.

impl Div<Rational> for i32

type Output = Rational

The resulting type after applying the / operator.

fn div(self, other: Rational) -> Rational

Performs the / operation.

impl Div<i32> for Rational

type Output = Rational

The resulting type after applying the / operator.

fn div(self, other: i32) -> Self

Performs the / operation.

impl Div for Rational

type Output = Rational

The resulting type after applying the / operator.

fn div(self, other: Self) -> Self

Performs the / operation.

impl DivAssign<Rational> for Polynomial

fn div_assign(&mut self, other: Rational)

Performs the /= operation.

impl DivAssign<i32> for Rational

fn div_assign(&mut self, other: i32)

Performs the /= operation.

impl DivAssign for Rational

fn div_assign(&mut self, other: Self)

Performs the /= operation.

impl Factor for Rational

const ZERO: Self = Self::ZERO

The zero constant.

fn gcd(self, other: Self) -> Self

Finds the greatest common divisor (GCD) of self and other.

fn lcm(self, other: Self) -> Self

Finds the least common multiple (LCM) of self and other.

fn gcd_lcm(self, other: Self) -> (Self, Self)

Returns (Self::gcd(), Self::lcm()) of self and other.

fn gcd_bulk(r: impl IntoIterator<Item = Self>) -> Self

Finds the GCD of iterator over Self.

fn lcm_bulk(r: impl IntoIterator<Item = Self>) -> Self

Finds the LCM of iterator over Self.

fn signed( f: impl Fn(Self, Self) -> Self, r: impl IntoIterator<Item = Self>, ) -> Self

where Self: Neg<Output = Self> + PartialOrd + Ord,

Finds the Self::gcd or Self::lcm and the predominant sign of iterator over Self.

impl From<(i32, i32)> for Rational

fn from((p, q): (i32, i32)) -> Self

Converts to this type from the input type.

impl<B: Algebra> From<Rational> for Multivector<B>

fn from(r: Rational) -> Self

Converts to this type from the input type.

impl From<Rational> for Tree

fn from(r: Rational) -> Self

Converts to this type from the input type.

impl From<i32> for Rational

fn from(p: i32) -> Self

Converts to this type from the input type.

impl Mul<Rational> for Polynomial

type Output = Polynomial

The resulting type after applying the * operator.

fn mul(self, other: Rational) -> Self::Output

Performs the * operation.

impl Mul<Rational> for i32

type Output = Rational

The resulting type after applying the * operator.

fn mul(self, other: Rational) -> Rational

Performs the * operation.

impl Mul<i32> for Rational

type Output = Rational

The resulting type after applying the * operator.

fn mul(self, other: i32) -> Self

Performs the * operation.

impl Mul for Rational

type Output = Rational

The resulting type after applying the * operator.

fn mul(self, other: Self) -> Self

Performs the * operation.

impl MulAssign<Rational> for Polynomial

fn mul_assign(&mut self, other: Rational)

Performs the *= operation.

impl MulAssign<i32> for Rational

fn mul_assign(&mut self, other: i32)

Performs the *= operation.

impl MulAssign for Rational

fn mul_assign(&mut self, other: Self)

Performs the *= operation.

impl Neg for Rational

type Output = Rational

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl Ord for Rational

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Rational

fn eq(&self, other: &Rational) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Rational

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Sub<Rational> for i32

type Output = Rational

The resulting type after applying the - operator.

fn sub(self, other: Rational) -> Rational

Performs the - operation.

impl Sub<i32> for Rational

type Output = Rational

The resulting type after applying the - operator.

fn sub(self, other: i32) -> Self

Performs the - operation.

impl Sub for Rational

type Output = Rational

The resulting type after applying the - operator.

fn sub(self, other: Self) -> Self

Performs the - operation.

impl SubAssign<i32> for Rational

fn sub_assign(&mut self, other: i32)

Performs the -= operation.

impl SubAssign for Rational

fn sub_assign(&mut self, other: Self)

Performs the -= operation.

impl Copy for Rational

impl Eq for Rational

impl StructuralPartialEq for Rational