reform 0.1.0

A symbolic manipulation toolkit which aims to handle expressions with billions of terms, taking up terabytes of diskspace.
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166

use poly::exponent::Exponent;
use poly::raw::multivar::MultivariateMonomialView;
use poly::ring::Ring;
use std::cmp::Ordering;
use std::mem;
use std::ops::{Add, Div, Mul, Neg, Sub};

/// A monomial class. Equality and ordering is only considering the exponent.
#[derive(Debug, Clone)]
pub struct Monomial<R: Ring, E: Exponent> {
    pub coefficient: R,
    pub exponents: Vec<E>,
}

impl<R: Ring, E: Exponent> Monomial<R, E> {
    #[inline]
    pub fn new(coefficient: R, exponents: Vec<E>) -> Monomial<R, E> {
        Monomial {
            coefficient,
            exponents,
        }
    }

    #[inline]
    pub fn divides(&self, other: &Monomial<R, E>) -> bool {
        self.exponents
            .iter()
            .zip(&other.exponents)
            .all(|(a, b)| a >= b)
            && (other.coefficient.is_one()
                || (self.coefficient.clone() % other.coefficient.clone()).is_zero())
    }
}

impl<R: Ring, E: Exponent> Div for Monomial<R, E> {
    type Output = Self;

    fn div(mut self, mut other: Self) -> Self::Output {
        for (ee, er) in self.exponents.iter_mut().zip(other.exponents.drain(..)) {
            *ee = *ee - er;
        }

        Monomial {
            coefficient: self.coefficient / other.coefficient,
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<'a, R: Ring, E: Exponent> Div<&'a Monomial<R, E>> for Monomial<R, E> {
    type Output = Self;

    fn div(mut self, other: &Self) -> Self::Output {
        for (ee, er) in self.exponents.iter_mut().zip(&other.exponents) {
            *ee = *ee - *er;
        }

        Monomial {
            coefficient: self.coefficient / other.coefficient.clone(),
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<R: Ring, E: Exponent> Mul for Monomial<R, E> {
    type Output = Self;

    fn mul(mut self, mut other: Self) -> Self::Output {
        for (ee, er) in self.exponents.iter_mut().zip(other.exponents.drain(..)) {
            *ee = *ee + er;
        }

        Monomial {
            coefficient: self.coefficient * other.coefficient,
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<'a, R: Ring, E: Exponent> Mul<&'a Monomial<R, E>> for Monomial<R, E> {
    type Output = Self;

    fn mul(mut self, other: &Self) -> Self::Output {
        for (ee, er) in self.exponents.iter_mut().zip(&other.exponents) {
            *ee = *ee + *er;
        }

        Monomial {
            coefficient: self.coefficient * other.coefficient.clone(),
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<'a, R: Ring, E: Exponent> Mul<MultivariateMonomialView<'a, R, E>> for Monomial<R, E> {
    type Output = Self;

    fn mul(mut self, other: MultivariateMonomialView<R, E>) -> Self::Output {
        for (ee, er) in self.exponents.iter_mut().zip(other.exponents) {
            *ee = *ee + *er;
        }

        Monomial {
            coefficient: self.coefficient * other.coefficient.clone(),
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<R: Ring, E: Exponent> Add for Monomial<R, E> {
    type Output = Self;

    fn add(mut self, other: Self) -> Self::Output {
        debug_assert_eq!(self.exponents, other.exponents);
        Monomial {
            coefficient: self.coefficient + other.coefficient,
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<R: Ring, E: Exponent> Sub for Monomial<R, E> {
    type Output = Self;

    fn sub(mut self, other: Self) -> Self::Output {
        debug_assert_eq!(self.exponents, other.exponents);
        Monomial {
            coefficient: self.coefficient + (-other.coefficient),
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<R: Ring, E: Exponent> Neg for Monomial<R, E> {
    type Output = Self;

    fn neg(mut self) -> Self::Output {
        Monomial {
            coefficient: -self.coefficient,
            exponents: mem::replace(&mut self.exponents, vec![]),
        }
    }
}

impl<R: Ring, E: Exponent> PartialOrd for Monomial<R, E> {
    #[inline]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        self.exponents.partial_cmp(&other.exponents)
    }
}

impl<R: Ring, E: Exponent> Ord for Monomial<R, E> {
    #[inline]
    fn cmp(&self, other: &Self) -> Ordering {
        self.partial_cmp(other).unwrap()
    }
}

impl<R: Ring, E: Exponent> PartialEq for Monomial<R, E> {
    #[inline]
    fn eq(&self, other: &Self) -> bool {
        self.exponents.eq(&other.exponents)
    }
}

impl<R: Ring, E: Exponent> Eq for Monomial<R, E> {}