Lines
100 %
Functions
Branches
use crate::{Denominator, Numerator, Q};
use core::ops::Mul;
use typenum::{Gcd, Gcf, PartialDiv, Prod};
pub trait PrivateMulHelper<Rhs> {
type Output;
}
impl<Nl, Dl, Nr, Dr, No, Do> PrivateMulHelper<Q<Nr, Dr>> for Q<Nl, Dl>
where
Nl: Numerator<Dl> + Mul<Nr>,
Dl: Denominator + Mul<Dr>,
Nr: Numerator<Dr>,
Dr: Denominator,
No: Numerator<Do>,
Do: Denominator,
Prod<Nl, Nr>: Gcd<Prod<Dl, Dr>> + PartialDiv<Gcf<Prod<Nl, Nr>, Prod<Dl, Dr>>, Output = No>,
Prod<Dl, Dr>: PartialDiv<Gcf<Prod<Nl, Nr>, Prod<Dl, Dr>>, Output = Do>,
{
type Output = Q<No, Do>;
impl<Nl, Dl, Nr, Dr, No, Do> Mul<Q<Nr, Dr>> for Q<Nl, Dl>
Self: PrivateMulHelper<Q<Nr, Dr>, Output = Q<No, Do>>,
Nl: Numerator<Dl>,
Dl: Denominator,
fn mul(self, rhs: Q<Nr, Dr>) -> Self::Output {
let _ = rhs;
Self::Output::new()
#[cfg(test)]
mod tests {
use super::*;
use typenum::consts::*;
#[test]
fn test_mul() {
// zero * zero
assert!(Q::<Z0>::new() * Q::<Z0>::new() == Q::<Z0>::new());
// zero * negative
assert!(Q::<Z0>::new() * Q::<N3, P2>::new() == Q::<Z0>::new());
// positive * positive
assert!(Q::<P2, P3>::new() * Q::<P3, P2>::new() == Q::<P1>::new());
// positive * negative
assert!(Q::<P2, P3>::new() * Q::<N3, P2>::new() == Q::<N1>::new());
// negative * zero
assert!(Q::<N2, P3>::new() * Q::<Z0>::new() == Q::<Z0>::new());
// negative * positive
assert!(Q::<N2, P3>::new() * Q::<P3, P2>::new() == Q::<N1>::new());
// negative * negative
assert!(Q::<N2, P3>::new() * Q::<N3, P2>::new() == Q::<P1>::new());