fix doc tests

Author: Marvin-Beckmann

src/integer/mat_poly_over_z/arithmetic/mul.rs

@@ -67,7 +67,7 @@ impl Mul<&MatPolynomialRingZq> for &MatPolyOverZ {
     /// use std::str::FromStr;
     ///
     /// let mat_1 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
-    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     ///
     /// let mat_3 = &mat_1 * &mat_2;
     /// ```
@@ -151,7 +151,7 @@ impl MatPolyOverZ {
     /// use std::str::FromStr;
     ///
     /// let mat_1 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
-    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     ///
     /// let mat_3 = &mat_1.mul_mat_poly_ring_zq_safe(&mat_2).unwrap();
     /// ```

src/integer/mat_poly_over_z/arithmetic/sub.rs

@@ -108,7 +108,7 @@ impl Sub<&MatPolynomialRingZq> for &MatPolyOverZ {
     /// use std::str::FromStr;
     ///
     /// let mat_1 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
-    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     ///
     /// let mat_3 = &mat_1 - &mat_2;
     /// ```
@@ -192,7 +192,7 @@ impl MatPolyOverZ {
     /// use std::str::FromStr;
     ///
     /// let mat_1 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
-    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_2 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     ///
     /// let mat_3 = &mat_1.sub_mat_poly_ring_zq_safe(&mat_2).unwrap();
     /// ```

src/integer_mod_q/mat_polynomial_ring_zq/arithmetic/add.rs

@@ -150,7 +150,7 @@ impl Add<&MatPolyOverZ> for &MatPolynomialRingZq {
     /// use qfall_math::integer::MatPolyOverZ;
     /// use std::str::FromStr;
     ///
-    /// let mat_1 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_1 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     /// let mat_2 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
     ///
     /// let mat_3 = &mat_1 + &mat_2;
@@ -252,7 +252,7 @@ impl MatPolynomialRingZq {
     /// use qfall_math::integer::MatPolyOverZ;
     /// use std::str::FromStr;
     ///
-    /// let mat_1 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 3 mod 17").unwrap();
+    /// let mat_1 = MatPolynomialRingZq::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]] / 3  1 2 1 mod 17").unwrap();
     /// let mat_2 = MatPolyOverZ::from_str("[[2  1 42, 1  17],[1  8, 2  5 6]]").unwrap();
     ///
     /// let mat_3 = &mat_1.add_mat_poly_over_z_safe(&mat_2).unwrap();

src/integer_mod_q/modulus_polynomial_ring_zq/coefficient_embedding.rs

@@ -37,7 +37,7 @@ impl IntoCoefficientEmbedding<MatZq> for &ModulusPolynomialRingZq {
     ///
     /// let poly = ModulusPolynomialRingZq::from_str("3  17 3 1 mod 19").unwrap();
     /// let vector = poly.into_coefficient_embedding(4);
-    /// let cmp_vector = MatZq::from_str("[[17],[3],[-5],[0]] mod 19").unwrap();
+    /// let cmp_vector = MatZq::from_str("[[17],[3],[1],[0]] mod 19").unwrap();
     /// assert_eq!(cmp_vector, vector);
     /// ```
     ///
@@ -82,7 +82,7 @@ impl FromCoefficientEmbedding<&MatZq> for ModulusPolynomialRingZq {
     ///     traits::FromCoefficientEmbedding,
     /// };
     ///
-    /// let vector = MatZq::from_str("[[17],[3],[-5]] mod 19").unwrap();
+    /// let vector = MatZq::from_str("[[17],[3],[1]] mod 19").unwrap();
     /// let poly = ModulusPolynomialRingZq::from_coefficient_embedding(&vector);
     /// let cmp_poly = ModulusPolynomialRingZq::from_str("3  17 3 1 mod 19").unwrap();
     /// assert_eq!(cmp_poly, poly);

src/integer_mod_q/modulus_polynomial_ring_zq/from.rs

@@ -36,7 +36,7 @@ impl<Mod: Into<Modulus>> From<(&PolyOverZ, Mod)> for ModulusPolynomialRingZq {
     /// use qfall_math::integer::PolyOverZ;
     /// use std::str::FromStr;
     ///
-    /// let poly = PolyOverZ::from_str("4  0 1 102 3").unwrap();
+    /// let poly = PolyOverZ::from_str("4  0 1 102 1").unwrap();
     ///
     /// let mod_poly = ModulusPolynomialRingZq::from((&poly, 100));
     ///
@@ -72,7 +72,7 @@ impl<Mod: Into<Modulus>> From<(PolyOverZ, Mod)> for ModulusPolynomialRingZq {
     /// use qfall_math::integer::PolyOverZ;
     /// use std::str::FromStr;
     ///
-    /// let poly = PolyOverZ::from_str("4  0 1 102 3").unwrap();
+    /// let poly = PolyOverZ::from_str("4  0 1 102 1").unwrap();
     ///
     /// let mod_poly = ModulusPolynomialRingZq::from((poly, 100));
     ///

src/integer_mod_q/modulus_polynomial_ring_zq/norm.rs

@@ -22,7 +22,7 @@ impl ModulusPolynomialRingZq {
     /// use qfall_math::{integer::Z, integer_mod_q::ModulusPolynomialRingZq};
     /// use std::str::FromStr;
     ///
-    /// let poly = ModulusPolynomialRingZq::from_str("3  1 2 1 mod 11").unwrap();
+    /// let poly = ModulusPolynomialRingZq::from_str("3  3 2 1 mod 11").unwrap();
     ///
     /// let sqrd_2_norm = poly.norm_eucl_sqrd();
     ///
@@ -43,7 +43,7 @@ impl ModulusPolynomialRingZq {
     /// use qfall_math::{integer::Z, integer_mod_q::ModulusPolynomialRingZq};
     /// use std::str::FromStr;
     ///
-    /// let poly = ModulusPolynomialRingZq::from_str("3  1 2 1 mod 7").unwrap();
+    /// let poly = ModulusPolynomialRingZq::from_str("3  4 2 1 mod 7").unwrap();
     ///
     /// let infty_norm = poly.norm_infty();
     ///