Struct Rational

Source

pub struct Rational<T>where
    T: Signed,{
    pub num: T,
    pub den: T,
}

Fields§

§num: T§den: T

Implementations§

Source §

impl<T> Rational<T>
where T: Signed,

Source

pub fn new(num: T, den: T) -> Self

Examples found in repository ?

crates/competitive/src/num/rational.rs (line 82)

78    pub fn map<U>(self, mut f: impl FnMut(T) -> U) -> Rational<U>
79    where
80        U: Signed,
81    {
82        Rational::new(f(self.num), f(self.den))
83    }
84    pub fn map_unchecked<U>(self, mut f: impl FnMut(T) -> U) -> Rational<U>
85    where
86        U: Signed,
87    {
88        Rational::new_unchecked(f(self.num), f(self.den))
89    }
90    pub fn map_eval<U>(self, mut f: impl FnMut(T) -> U) -> <U as Div>::Output
91    where
92        U: Div,
93    {
94        f(self.num) / f(self.den)
95    }
96}
97
98impl<T> Bounded for Rational<T>
99where
100    T: Signed,
101{
102    fn maximum() -> Self {
103        Self::new_unchecked(T::one(), T::zero())
104    }
105    fn minimum() -> Self {
106        Self::new_unchecked(-T::one(), T::zero())
107    }
108}
109
110impl<T> Zero for Rational<T>
111where
112    T: Signed,
113{
114    fn zero() -> Self {
115        Self::new_unchecked(T::zero(), T::one())
116    }
117}
118impl<T> One for Rational<T>
119where
120    T: Signed,
121{
122    fn one() -> Self {
123        Self::new_unchecked(T::one(), T::one())
124    }
125}
126
127impl<T> Add for Rational<T>
128where
129    T: Signed,
130{
131    type Output = Self;
132    fn add(self, rhs: Self) -> Self::Output {
133        Self::new(self.num * rhs.den + self.den * rhs.num, self.den * rhs.den)
134    }
135}
136impl<T> Sub for Rational<T>
137where
138    T: Signed,
139{
140    type Output = Self;
141    fn sub(self, rhs: Self) -> Self::Output {
142        Self::new(self.num * rhs.den - self.den * rhs.num, self.den * rhs.den)
143    }
144}
145impl<T> Mul for Rational<T>
146where
147    T: Signed,
148{
149    type Output = Self;
150    fn mul(self, rhs: Self) -> Self::Output {
151        Self::new(self.num * rhs.num, self.den * rhs.den)
152    }
153}
154impl<T> Div for Rational<T>
155where
156    T: Signed,
157{
158    type Output = Self;
159    fn div(self, rhs: Self) -> Self::Output {
160        Self::new(self.num * rhs.den, self.den * rhs.num)
161    }

Source

pub fn new_unchecked(num: T, den: T) -> Self

Examples found in repository ?

crates/competitive/src/num/rational.rs (line 67)

64    pub fn new(num: T, den: T) -> Self {
65        let g = num.abs().unsigned().gcd(den.abs().unsigned()).signed();
66        let g = if den.is_negative() { -g } else { g };
67        Self::new_unchecked(num / g, den / g)
68    }
69    pub fn new_unchecked(num: T, den: T) -> Self {
70        Self { num, den }
71    }
72    pub fn abs(self) -> Self {
73        Self::new_unchecked(self.num.abs(), self.den)
74    }
75    pub fn eval(self) -> T {
76        self.num / self.den
77    }
78    pub fn map<U>(self, mut f: impl FnMut(T) -> U) -> Rational<U>
79    where
80        U: Signed,
81    {
82        Rational::new(f(self.num), f(self.den))
83    }
84    pub fn map_unchecked<U>(self, mut f: impl FnMut(T) -> U) -> Rational<U>
85    where
86        U: Signed,
87    {
88        Rational::new_unchecked(f(self.num), f(self.den))
89    }
90    pub fn map_eval<U>(self, mut f: impl FnMut(T) -> U) -> <U as Div>::Output
91    where
92        U: Div,
93    {
94        f(self.num) / f(self.den)
95    }
96}
97
98impl<T> Bounded for Rational<T>
99where
100    T: Signed,
101{
102    fn maximum() -> Self {
103        Self::new_unchecked(T::one(), T::zero())
104    }
105    fn minimum() -> Self {
106        Self::new_unchecked(-T::one(), T::zero())
107    }
108}
109
110impl<T> Zero for Rational<T>
111where
112    T: Signed,
113{
114    fn zero() -> Self {
115        Self::new_unchecked(T::zero(), T::one())
116    }
117}
118impl<T> One for Rational<T>
119where
120    T: Signed,
121{
122    fn one() -> Self {
123        Self::new_unchecked(T::one(), T::one())
124    }
125}
126
127impl<T> Add for Rational<T>
128where
129    T: Signed,
130{
131    type Output = Self;
132    fn add(self, rhs: Self) -> Self::Output {
133        Self::new(self.num * rhs.den + self.den * rhs.num, self.den * rhs.den)
134    }
135}
136impl<T> Sub for Rational<T>
137where
138    T: Signed,
139{
140    type Output = Self;
141    fn sub(self, rhs: Self) -> Self::Output {
142        Self::new(self.num * rhs.den - self.den * rhs.num, self.den * rhs.den)
143    }
144}
145impl<T> Mul for Rational<T>
146where
147    T: Signed,
148{
149    type Output = Self;
150    fn mul(self, rhs: Self) -> Self::Output {
151        Self::new(self.num * rhs.num, self.den * rhs.den)
152    }
153}
154impl<T> Div for Rational<T>
155where
156    T: Signed,
157{
158    type Output = Self;
159    fn div(self, rhs: Self) -> Self::Output {
160        Self::new(self.num * rhs.den, self.den * rhs.num)
161    }
162}
163impl<T> Neg for Rational<T>
164where
165    T: Signed,
166{
167    type Output = Self;
168    fn neg(self) -> Self::Output {
169        Self::new_unchecked(-self.num, self.den)
170    }