move tests and implement dag
This commit is contained in:
130
src/poly/flat.rs
130
src/poly/flat.rs
@@ -53,7 +53,7 @@ impl<V: Var, U: Into<Mono<V>>> FromIterator<(i32, U)> for Poly<V> {
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Clone, Debug, Default, PartialEq, Eq, Hash)]
|
||||
#[derive(Clone, Debug, Default, PartialEq, Eq, Hash, PartialOrd, Ord)]
|
||||
pub struct Mono<V: Var> {
|
||||
pub term: Vec<(V, u32)>,
|
||||
}
|
||||
@@ -103,9 +103,11 @@ impl<V: Var, U: Into<V>> FromIterator<(U, u32)> for Mono<V> {
|
||||
term.sort();
|
||||
|
||||
// Check duplicate variables
|
||||
assert!((term[..])
|
||||
.windows(2)
|
||||
.all(|window| window[0].0 != window[1].0));
|
||||
assert!(
|
||||
(term[..])
|
||||
.windows(2)
|
||||
.all(|window| window[0].0 != window[1].0)
|
||||
);
|
||||
|
||||
Mono { term }
|
||||
}
|
||||
@@ -195,6 +197,22 @@ impl<V: Var> Mul<Mono<V>> for i32 {
|
||||
}
|
||||
}
|
||||
|
||||
impl<V: Var> Mul for Poly<V> {
|
||||
type Output = Poly<V>;
|
||||
|
||||
fn mul(self, other: Poly<V>) -> Self::Output {
|
||||
let mut result = Poly::default();
|
||||
for (m1, c1) in &self.mono {
|
||||
for (m2, c2) in &other.mono {
|
||||
let entry = result.mono.entry(m1.clone() * m2.clone()).or_insert(0);
|
||||
*entry += c1 * c2;
|
||||
}
|
||||
}
|
||||
result.mono.retain(|_, &mut c| c != 0);
|
||||
result
|
||||
}
|
||||
}
|
||||
|
||||
impl<V: Var> Add for Poly<V> {
|
||||
type Output = Poly<V>;
|
||||
|
||||
@@ -220,107 +238,3 @@ impl<V: Var> Sub for Poly<V> {
|
||||
self
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
|
||||
#[test]
|
||||
fn test_mono_contains() {
|
||||
let a: Mono<StaticVar> = [("x", 2), ("y", 1)].into();
|
||||
|
||||
// Lower exponent of same variable is contained
|
||||
assert!(a.contains(&Mono::from([("x", 1)])));
|
||||
|
||||
// Higher exponent of same variable is not contained
|
||||
assert!(!a.contains(&Mono::from([("x", 3)])));
|
||||
|
||||
// Identical monomial is contained
|
||||
assert!(a.contains(&Mono::from([("x", 2), ("y", 1)])));
|
||||
|
||||
// Variable absent from self is not contained
|
||||
assert!(!a.contains(&Mono::from([("x", 2), ("z", 1)])));
|
||||
|
||||
// Subset of variables with lower exponents is contained
|
||||
assert!(a.contains(&Mono::from([("x", 1), ("y", 1)])));
|
||||
|
||||
// Single variable with exact exponent is contained
|
||||
assert!(a.contains(&Mono::from([("x", 2)])));
|
||||
|
||||
// Insufficient exponent in self means not contained
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1)]).contains(&Mono::from([("x", 2)])));
|
||||
|
||||
// Missing variable in self means not contained
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1), ("y", 1)]).contains(&Mono::from([("x", 2)])));
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1)]).contains(&Mono::from([("x", 1), ("y", 1)])));
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_mono_mul() {
|
||||
// Same variable: exponents add
|
||||
let a: Mono<StaticVar> = [("x", 2)].into();
|
||||
let b: Mono<StaticVar> = [("x", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 5)]));
|
||||
|
||||
// Disjoint variables: both appear in result
|
||||
let a: Mono<StaticVar> = [("x", 2)].into();
|
||||
let b: Mono<StaticVar> = [("y", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 2), ("y", 3)]));
|
||||
|
||||
// Mixed: shared and disjoint variables
|
||||
let a: Mono<StaticVar> = [("x", 1), ("y", 2)].into();
|
||||
let b: Mono<StaticVar> = [("y", 1), ("z", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 1), ("y", 3), ("z", 3)]));
|
||||
|
||||
// Commutativity
|
||||
let a: Mono<StaticVar> = [("x", 2), ("z", 1)].into();
|
||||
let b: Mono<StaticVar> = [("y", 3)].into();
|
||||
assert_eq!(a.clone() * b.clone(), b * a);
|
||||
|
||||
// Multiply by constant monomial (empty term vec = 1)
|
||||
let a: Mono<StaticVar> = [("x", 4)].into();
|
||||
let one: Mono<StaticVar> = Mono { term: vec![] };
|
||||
assert_eq!(a.clone() * one, a);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_poly_add() {
|
||||
// Distinct monomials are collected as separate terms
|
||||
let a: Poly<StaticVar> = [(1, [("x", 2)]), (2, [("y", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("z", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(1, [("x", 2)]), (2, [("y", 1)]), (3, [("z", 1)])].into();
|
||||
assert_eq!(a + b, expected);
|
||||
|
||||
// Coefficients of matching monomials are summed
|
||||
let a: Poly<StaticVar> = [(2, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(5, [("x", 1)])].into();
|
||||
assert_eq!(a + b, expected);
|
||||
|
||||
// Terms that cancel sum to zero are dropped
|
||||
let a: Poly<StaticVar> = [(1, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(-1, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = Poly::default();
|
||||
assert_eq!(a + b, expected);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_poly_sub() {
|
||||
// Distinct monomials are collected as separate terms with negated rhs coefficients
|
||||
let a: Poly<StaticVar> = [(3, [("x", 2)])].into();
|
||||
let b: Poly<StaticVar> = [(1, [("y", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(3, [("x", 2)]), (-1, [("y", 1)])].into();
|
||||
assert_eq!(a - b, expected);
|
||||
|
||||
// Coefficients of matching monomials are subtracted
|
||||
let a: Poly<StaticVar> = [(5, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(2, [("x", 1)])].into();
|
||||
assert_eq!(a - b, expected);
|
||||
|
||||
// Subtracting equal polynomials yields zero
|
||||
let a: Poly<StaticVar> = [(4, [("x", 2)]), (1, [("y", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(4, [("x", 2)]), (1, [("y", 1)])].into();
|
||||
assert_eq!(a - b, Poly::default());
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1,2 +1,5 @@
|
||||
pub mod flat;
|
||||
pub mod var;
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests;
|
||||
|
||||
102
src/poly/tests.rs
Normal file
102
src/poly/tests.rs
Normal file
@@ -0,0 +1,102 @@
|
||||
|
||||
use super::flat::{Mono, Poly};
|
||||
use super::var::StaticVar;
|
||||
|
||||
#[test]
|
||||
fn test_mono_contains() {
|
||||
let a: Mono<StaticVar> = [("x", 2), ("y", 1)].into();
|
||||
|
||||
// Lower exponent of same variable is contained
|
||||
assert!(a.contains(&Mono::from([("x", 1)])));
|
||||
|
||||
// Higher exponent of same variable is not contained
|
||||
assert!(!a.contains(&Mono::from([("x", 3)])));
|
||||
|
||||
// Identical monomial is contained
|
||||
assert!(a.contains(&Mono::from([("x", 2), ("y", 1)])));
|
||||
|
||||
// Variable absent from self is not contained
|
||||
assert!(!a.contains(&Mono::from([("x", 2), ("z", 1)])));
|
||||
|
||||
// Subset of variables with lower exponents is contained
|
||||
assert!(a.contains(&Mono::from([("x", 1), ("y", 1)])));
|
||||
|
||||
// Single variable with exact exponent is contained
|
||||
assert!(a.contains(&Mono::from([("x", 2)])));
|
||||
|
||||
// Insufficient exponent in self means not contained
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1)]).contains(&Mono::from([("x", 2)])));
|
||||
|
||||
// Missing variable in self means not contained
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1), ("y", 1)]).contains(&Mono::from([("x", 2)])));
|
||||
assert!(!Mono::<StaticVar>::from([("x", 1)]).contains(&Mono::from([("x", 1), ("y", 1)])));
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_mono_mul() {
|
||||
// Same variable: exponents add
|
||||
let a: Mono<StaticVar> = [("x", 2)].into();
|
||||
let b: Mono<StaticVar> = [("x", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 5)]));
|
||||
|
||||
// Disjoint variables: both appear in result
|
||||
let a: Mono<StaticVar> = [("x", 2)].into();
|
||||
let b: Mono<StaticVar> = [("y", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 2), ("y", 3)]));
|
||||
|
||||
// Mixed: shared and disjoint variables
|
||||
let a: Mono<StaticVar> = [("x", 1), ("y", 2)].into();
|
||||
let b: Mono<StaticVar> = [("y", 1), ("z", 3)].into();
|
||||
assert_eq!(a * b, Mono::from([("x", 1), ("y", 3), ("z", 3)]));
|
||||
|
||||
// Commutativity
|
||||
let a: Mono<StaticVar> = [("x", 2), ("z", 1)].into();
|
||||
let b: Mono<StaticVar> = [("y", 3)].into();
|
||||
assert_eq!(a.clone() * b.clone(), b * a);
|
||||
|
||||
// Multiply by constant monomial (empty term vec = 1)
|
||||
let a: Mono<StaticVar> = [("x", 4)].into();
|
||||
let one: Mono<StaticVar> = Mono { term: vec![] };
|
||||
assert_eq!(a.clone() * one, a);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_poly_add() {
|
||||
// Distinct monomials are collected as separate terms
|
||||
let a: Poly<StaticVar> = [(1, [("x", 2)]), (2, [("y", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("z", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(1, [("x", 2)]), (2, [("y", 1)]), (3, [("z", 1)])].into();
|
||||
assert_eq!(a + b, expected);
|
||||
|
||||
// Coefficients of matching monomials are summed
|
||||
let a: Poly<StaticVar> = [(2, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(5, [("x", 1)])].into();
|
||||
assert_eq!(a + b, expected);
|
||||
|
||||
// Terms that cancel sum to zero are dropped
|
||||
let a: Poly<StaticVar> = [(1, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(-1, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = Poly::default();
|
||||
assert_eq!(a + b, expected);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_poly_sub() {
|
||||
// Distinct monomials are collected as separate terms with negated rhs coefficients
|
||||
let a: Poly<StaticVar> = [(3, [("x", 2)])].into();
|
||||
let b: Poly<StaticVar> = [(1, [("y", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(3, [("x", 2)]), (-1, [("y", 1)])].into();
|
||||
assert_eq!(a - b, expected);
|
||||
|
||||
// Coefficients of matching monomials are subtracted
|
||||
let a: Poly<StaticVar> = [(5, [("x", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(3, [("x", 1)])].into();
|
||||
let expected: Poly<StaticVar> = [(2, [("x", 1)])].into();
|
||||
assert_eq!(a - b, expected);
|
||||
|
||||
// Subtracting equal polynomials yields zero
|
||||
let a: Poly<StaticVar> = [(4, [("x", 2)]), (1, [("y", 1)])].into();
|
||||
let b: Poly<StaticVar> = [(4, [("x", 2)]), (1, [("y", 1)])].into();
|
||||
assert_eq!(a - b, Poly::default());
|
||||
}
|
||||
@@ -17,7 +17,15 @@ impl Display for StaticVar {
|
||||
let num_indices = self.indices.len();
|
||||
match num_indices {
|
||||
0 => write!(fmt, "{}", self.name),
|
||||
_ => write!(fmt, "{}{}", self.name, self.indices.iter().map(|x| num_to_subscript(x.to_string())).join(",")),
|
||||
_ => write!(
|
||||
fmt,
|
||||
"{}{}",
|
||||
self.name,
|
||||
self.indices
|
||||
.iter()
|
||||
.map(|x| num_to_subscript(x.to_string()))
|
||||
.join(",")
|
||||
),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user