polynomint 0.5.3

A no-dependency library for working with integer polynomials
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

use std::ops::{Mul, MulAssign};

use crate::Polynomial;

impl Mul for Polynomial {
    type Output = Self;
    fn mul(self, rhs: Self) -> Self::Output {
        let sdeg = self.degree();
        let rdeg = rhs.degree();
        if self.is_zero() || rhs.is_zero() {
            return Self::zero();
        }
        let mut coeffs = Vec::new();
        for i in 0..=(sdeg + rdeg) {
            let mut acc = 0;
            for n in 0..=i {
                if n <= self.degree() && (i - n) <= rhs.degree() {
                    acc += self.coeffs[n as usize] * rhs.coeffs[(i - n) as usize];
                }
            }
            coeffs.push(acc);
        }
        let mut output = Self { coeffs };
        output.reduce();
        output
    }
}

impl<'a> Mul<&'a Polynomial> for &'a Polynomial {
    type Output = Polynomial;
    fn mul(self, rhs: Self) -> Self::Output {
        if self.is_zero() || rhs.is_zero() {
            return Polynomial::zero();
        }
        let mut coeffs = Vec::new();
        for i in 0..=(self.degree() + rhs.degree()) {
            let mut acc = 0;
            for n in 0..=i {
                if n <= self.degree() && (i - n) <= rhs.degree() {
                    acc += self.coeffs[n as usize] * rhs.coeffs[(i - n) as usize];
                }
            }
            coeffs.push(acc);
        }
        let mut output = Polynomial::new(coeffs);
        output.reduce();
        output
    }
}

impl Mul<isize> for Polynomial {
    type Output = Self;
    fn mul(mut self, rhs: isize) -> Self::Output {
        if self.is_zero() || rhs == 0 {
            Polynomial::zero()
        } else {
            for i in 0..=self.degree() {
                self.coeffs[i as usize] *= rhs;
            }
            self
        }
    }
}

impl<'a> Mul<isize> for &'a Polynomial {
    type Output = Polynomial;
    fn mul(self, rhs: isize) -> Self::Output {
        if self.is_zero() || rhs == 0 {
            Polynomial::zero()
        } else {
            let mut coeffs = self.coeffs.clone();
            for i in 0..=self.degree() {
                coeffs[i as usize] *= rhs;
            }
            Polynomial { coeffs }
        }
    }
}

impl MulAssign for Polynomial {
    fn mul_assign(&mut self, rhs: Self) {
        if self.is_zero() || rhs.is_zero() {
            *self = Polynomial::zero();
        }
        let mut coeffs = Vec::new();
        for i in 0..=(self.degree() + rhs.degree()) {
            let mut acc = 0;
            for n in 0..=i {
                if n <= self.degree() && (i - n) <= rhs.degree() {
                    acc += self.coeffs[n as usize] * rhs.coeffs[(i - n) as usize];
                }
            }
            coeffs.push(acc);
        }
        *self = Polynomial { coeffs };
        self.reduce();
    }
}

impl<'a> MulAssign<&'a Polynomial> for Polynomial {
    fn mul_assign(&mut self, rhs: &Self) {
        if self.is_zero() || rhs.is_zero() {
            *self = Polynomial::zero();
        }
        let mut coeffs = Vec::new();
        for i in 0..=(self.degree() + rhs.degree()) {
            let mut acc = 0;
            for n in 0..=i {
                if n <= self.degree() && (i - n) <= rhs.degree() {
                    acc += self.coeffs[n as usize] * rhs.coeffs[(i - n) as usize];
                }
            }
            coeffs.push(acc);
        }
        *self = Polynomial { coeffs };
        self.reduce();
    }
}

impl MulAssign<isize> for Polynomial {
    fn mul_assign(&mut self, rhs: isize) {
        if self.is_zero() || rhs == 0 {
            *self = Polynomial::zero();
        } else {
            for i in 0..=self.degree() {
                self.coeffs[i as usize] *= rhs;
            }
        }
    }
}