Struct num::rational::Ratio[src]

pub struct Ratio<T> {
    // some fields omitted
}

Represents the ratio between 2 numbers.

Methods

impl<T: Clone + Integer + PartialOrd> Ratio<T>

fn from_integer(t: T) -> Ratio<T>

Create a ratio representing the integer t.

fn new_raw(numer: T, denom: T) -> Ratio<T>

Create a ratio without checking for denom == 0 or reducing.

fn new(numer: T, denom: T) -> Ratio<T>

Create a new Ratio. Fails if denom == 0.

fn to_integer(&self) -> T

Convert to an integer.

fn numer<'a>(&'a self) -> &'a T

Gets an immutable reference to the numerator.

fn denom<'a>(&'a self) -> &'a T

Gets an immutable reference to the denominator.

fn is_integer(&self) -> bool

Return true if the rational number is an integer (denominator is 1).

fn reduced(&self) -> Ratio<T>

Return a reduced copy of self.

fn recip(&self) -> Ratio<T>

Return the reciprocal

fn floor(&self) -> Ratio<T>

fn ceil(&self) -> Ratio<T>

fn round(&self) -> Ratio<T>

fn trunc(&self) -> Ratio<T>

fn fract(&self) -> Ratio<T>

impl Ratio<BigInt>

fn from_float<T: Float>(f: T) -> Option<BigRational>

Converts a float into a rational number

Trait Implementations

impl<T: Mul<T, T> + PartialEq> PartialEq for Ratio<T>

fn eq(&self, other: &Ratio<T>) -> bool

fn ne(&self, other: &Ratio<T>) -> bool

impl<T: Mul<T, T> + PartialOrd> PartialOrd for Ratio<T>

fn lt(&self, other: &Ratio<T>) -> bool

fn gt(&self, other: &Ratio<T>) -> bool

fn le(&self, other: &Ratio<T>) -> bool

fn ge(&self, other: &Ratio<T>) -> bool

impl<T: Mul<T, T> + Eq> Eq for Ratio<T>

fn assert_receiver_is_total_eq(&self)

impl<T: Mul<T, T> + Ord> Ord for Ratio<T>

fn cmp(&self, other: &Ratio<T>) -> Ordering

impl<T: Clone + Integer + PartialOrd> Mul<Ratio<T>, Ratio<T>> for Ratio<T>

fn mul(&self, rhs: &Ratio<T>) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Div<Ratio<T>, Ratio<T>> for Ratio<T>

fn div(&self, rhs: &Ratio<T>) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Add<Ratio<T>, Ratio<T>> for Ratio<T>

fn add(&self, rhs: &Ratio<T>) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Sub<Ratio<T>, Ratio<T>> for Ratio<T>

fn sub(&self, rhs: &Ratio<T>) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Rem<Ratio<T>, Ratio<T>> for Ratio<T>

fn rem(&self, rhs: &Ratio<T>) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Neg<Ratio<T>> for Ratio<T>

fn neg(&self) -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Zero for Ratio<T>

fn zero() -> Ratio<T>

fn is_zero(&self) -> bool

impl<T: Clone + Integer + PartialOrd> One for Ratio<T>

fn one() -> Ratio<T>

impl<T: Clone + Integer + PartialOrd> Num for Ratio<T>

impl<T: Show> Show for Ratio<T>

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

Renders as numer/denom.

impl<T: ToStrRadix> ToStrRadix for Ratio<T>

fn to_str_radix(&self, radix: uint) -> String

Renders as numer/denom where the numbers are in base radix.

impl<T: FromStr + Clone + Integer + PartialOrd> FromStr for Ratio<T>

fn from_str(s: &str) -> Option<Ratio<T>>

Parses numer/denom.

impl<T: FromStrRadix + Clone + Integer + PartialOrd> FromStrRadix for Ratio<T>

fn from_str_radix(s: &str, radix: uint) -> Option<Ratio<T>>

Parses numer/denom where the numbers are in base radix.

Derived Implementations

impl<T: Clone> Clone for Ratio<T>

fn clone(&self) -> Ratio<T>

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