clean(maths::*): move fn

src/maths.rs

@@ -3,6 +3,19 @@ use std::ops;
 pub mod evaluator;
 pub mod solver;
 
+
+fn zero() -> GaussianRational {
+    GaussianRational::new(Rational::new(0, 1), Rational::new(0, 1))
+}
+
+fn minus_one() -> GaussianRational {
+    GaussianRational::new(Rational::new(-1, 1), Rational::new(0, 1))
+}
+
+fn one() -> GaussianRational {
+    GaussianRational::new(Rational::new(1, 1), Rational::new(0, 1))
+}
+
 //TODO slow ? check Stein's algorithm (binaryGCD) + tests
 fn gcd(a: i128, b: i128) -> i128 {
     if b == 0 {

src/maths/evaluator.rs

@@ -2,18 +2,6 @@ use super::*;
 use crate::parser::Token;
 use crate::Node;
 
-fn zero() -> GaussianRational {
-    GaussianRational::new(Rational::new(0, 1), Rational::new(0, 1))
-}
-
-fn one() -> GaussianRational {
-    GaussianRational::new(Rational::new(1, 1), Rational::new(0, 1))
-}
-
-fn minus_one() -> GaussianRational {
-    GaussianRational::new(Rational::new(-1, 1), Rational::new(0, 1))
-}
-
 fn add(lhs: Vec<GaussianRational>, rhs: Vec<GaussianRational>) -> Vec<GaussianRational> {
     let mut res = Vec::new();
     let mut len = lhs.len();

src/maths/solver.rs

@@ -1,13 +1,5 @@
 use super::*;
 
-fn zero() -> GaussianRational {
-    GaussianRational::new(Rational::new(0, 1), Rational::new(0, 1))
-}
-
-fn minus_one() -> GaussianRational {
-    GaussianRational::new(Rational::new(-1, 1), Rational::new(0, 1))
-}
-
 fn degree_zero(equation: Vec<GaussianRational>) {
     println!("Polynomial degree: 0");
     if equation[0] == zero() {