After new pull requests fix

StarknetCongo · Mar 19, 2024 · a221547 · a221547
1 parent 67dafd7
commit a221547
Show file tree

Hide file tree

Showing 2 changed files with 17 additions and 14 deletions.
diff --git a/baby-stark/src/main.rs b/baby-stark/src/main.rs
@@ -3,7 +3,7 @@ use baby_stark_math_lib;
 use crate::field::FieldElement;
 
 mod field;
-mod polynomial;
+// mod polynomial;
 
 fn main() {
     println!("Hello, world!");

diff --git a/baby-stark/src/polynomial.rs b/baby-stark/src/polynomial.rs
@@ -42,58 +42,61 @@ impl Polynomial {
         )
     }
 
-    pub fn __add__(self, other : Polynomial) -> Polynomial{
+    pub fn __add__(self, other: Polynomial) -> Polynomial {
         if self.degree() == -1 {
             return other;
         } else if other.degree() == -1 {
             return self;
-        } 
+        }
         let field = self.coeficients.get(0).unwrap().field;
 
         let zero_vec = [field.zero(); 10].to_vec();
         let largest_vec = max(self.coeficients.len(), other.coeficients.len());
         let coeffs = vector_scalar_multiplication(zero_vec, largest_vec as i128);
-
     }
 
-    pub fn __sub__(self, other : Polynomial) -> Polynomial{
+    pub fn __sub__(self, other: Polynomial) -> Polynomial {
         self.__add__(other.__neg__())
     }
 
-    pub fn __mul__(self, other : Polynomial) -> Polynomial{
+    pub fn __mul__(self, other: Polynomial) -> Polynomial {
         let field = self.coeficients.get(0).unwrap().field;
         let zero = field.zero();
         let mut coeffs = vec![zero; self.coeficients.len() + other.coeficients.len() - 1];
         for i in 0..self.coeficients.len() {
             for j in 0..other.coeficients.len() {
-                coeffs[i+j] = coeffs[i+j].__add__(self.coeficients[i].__mul__(other.coeficients[j]));
+                coeffs[i + j] =
+                    coeffs[i + j].__add__(self.coeficients[i].__mul__(other.coeficients[j]));
             }
         }
         Polynomial::from(coeffs)
-  }
-  
-    pub fn __eq__(self, other : Polynomial) -> bool{
+    }
+
+    pub fn __eq__(self, other: Polynomial) -> bool {
         if self.degree() != other.degree() {
             return false;
         }
         if self.degree() == -1 {
             return true;
         }
-        self.coeficients.iter().zip(other.coeficients.iter()).all(|(a, b)| a == b)
+        self.coeficients
+            .iter()
+            .zip(other.coeficients.iter())
+            .all(|(a, b)| a == b)
     }
 
-    pub fn __neq__(self, other : Polynomial) -> bool{
+    pub fn __neq__(self, other: Polynomial) -> bool {
         !self.__eq__(other)
     }
 
-    pub fn is_zero(self) -> bool{
+    pub fn is_zero(self) -> bool {
         if self.degree() == -1 {
             return true;
         }
         return false;
     }
 
-    pub fn leading_coefficient(self){
+    pub fn leading_coefficient(self) {
         self.coeficients[self.degree()]
     }
 }