Struct cycle::Rational

pub struct Rational { /* fields omitted */ }

Implementations

impl Rational

pub const fn new(num: Integer, den: Integer) -> Rational

pub fn zero() -> Rational

pub fn one() -> Rational

pub fn trunc(&self) -> Rational

pub fn fract(&self) -> Rational

pub fn is_positive(&self) -> bool

pub fn is_negative(&self) -> bool

Trait Implementations

impl Add<Rational> for Rational

type Output = Rational

The resulting type after applying the + operator.

fn add(self, o: Self) -> Self::Output

a/b + c/d = (a*lcm/b + c*lcm/d)/lcm where lcm = lcm(b,d)

impl Clone for Rational

fn clone(&self) -> Rational

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Rational

impl Debug for Rational

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

Formats the value using the given formatter.

impl Div<Rational> for Rational

type Output = Rational

The resulting type after applying the / operator.

fn div(self, o: Self) -> Self::Output

a/b / c/d = (a/gcd_ac)*(d/gcd_bd) / ((c/gcd_ac)*(b/gcd_bd))

impl Domain for Rational

fn name(&self) -> String

fn num(&self) -> i128

fn den(&self) -> i128

fn gcd(u: &Self, v: &Self) -> Self

gcd(a/b, c/d) = gcd(a*d, c*b)/(b*d)

fn lcm(u: &Self, v: &Self) -> Self

lcm(a/b, c/d) = lcm(a, c)/gcd(b, d)

fn cofactors(&self, u: &Self, v: &Self) -> (Self, Self, Self)

impl Eq for Rational

impl Field for Rational

impl From<i128> for Rational

fn from(n: Integer) -> Self

Performs the conversion.

impl Hash for Rational

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl Mul<Rational> for Rational

type Output = Rational

The resulting type after applying the * operator.

fn mul(self, o: Self) -> Self::Output

a/b * c/d = (a/gcd_ad)*(c/gcd_bc) / ((d/gcd_ad)*(b/gcd_bc))

impl Neg for Rational

type Output = Rational

The resulting type after applying the - operator.

fn neg(self) -> Rational

Performs the unary - operation.

impl Ord for Rational

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

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl PartialEq<Rational> for Rational

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl PartialOrd<Rational> for Rational

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

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

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

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

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

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

impl Ring for Rational

impl Sub<Rational> for Rational

type Output = Rational

The resulting type after applying the - operator.

fn sub(self, o: Self) -> Self::Output

a/b - c/d = (lcm/b*a - lcm/d*c)/lcm, where lcm = lcm(b,d)