removed dead code (#40)

src/environment.rs

@@ -1,6 +1,4 @@
-#![allow(dead_code)]
-
-use std::collections::btree_map::{Iter, IterMut};
+use std::collections::btree_map::IterMut;
 use std::collections::BTreeMap;
 
 use anyhow::bail;
@@ -39,10 +37,6 @@ impl Identifier {
         id.chars().all(|c| c.is_alphanumeric() || c == '_')
             && id.starts_with(|c: char| c.is_alphabetic() || c == '_')
     }
-
-    pub fn get(&self) -> &str {
-        &self.id
-    }
 }
 
 impl ToString for Identifier {
@@ -131,10 +125,6 @@ impl<T: MatrixNumber> Environment<T> {
         self.env.get(id)
     }
 
-    pub fn iter(&self) -> Iter<'_, Identifier, Type<T>> {
-        self.env.iter()
-    }
-
     pub fn iter_mut(&mut self) -> IterMut<'_, Identifier, Type<T>> {
         self.env.iter_mut()
     }

src/locale.rs

@@ -2,7 +2,6 @@ use lazy_static::lazy_static;
 use std::collections::HashMap;
 use std::fmt::Display;
 
-#[allow(dead_code)]
 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
 pub enum Language {
     English,
@@ -31,7 +30,6 @@ impl Language {
     }
 }
 
-#[allow(dead_code)]
 pub struct Locale {
     language: Language,
     translation_map: &'static HashMap<String, String>,
@@ -64,7 +62,6 @@ impl Locale {
         Self::unwrap_or_default(self.translation_map.get(s), s)
     }
 
-    #[allow(dead_code)]
     pub fn get_translated_from(&self, s: String) -> String {
         self.get_translated(&s)
     }

src/matrices.rs

@@ -159,7 +159,6 @@ impl<T: MatrixNumber> Matrix<T> {
     /// // | 3 4 |
     /// // | 5 6 |
     /// ```
-    #[allow(dead_code)]
     pub fn reshape(&self, (rows, cols): (usize, usize)) -> anyhow::Result<Self> {
         let (h, w) = self.get_shape();
         if h * w != rows * cols {
@@ -233,7 +232,6 @@ impl<T: MatrixNumber> Matrix<T> {
     /// // | 1 1 1 |
     /// // | 1 1 1 |
     /// ```
-    #[allow(dead_code)] // TODO: Remove this when used
     pub fn ones((h, w): (usize, usize)) -> Self {
         Self::filled((h, w), |_, _| T::one())
     }
@@ -598,7 +596,7 @@ impl<T: MatrixNumber> Matrix<T> {
     pub fn concat(mut self, other: Self) -> anyhow::Result<Self> {
         let (rows, columns) = self.get_shape();
         if rows != other.get_shape().0 {
-            anyhow::bail!("Cannot concatenate matrices with different number of rows!");
+            bail!("Cannot concatenate matrices with different number of rows!");
         }
 
         std::iter::zip(self.data.iter_mut(), other.data.into_iter())
@@ -622,7 +620,7 @@ impl<T: MatrixNumber> Matrix<T> {
     pub fn split(mut self, column: usize) -> anyhow::Result<(Self, Self)> {
         let (_, columns) = self.get_shape();
         if column > columns {
-            anyhow::bail!("Cannot split matrix at column {}!", column);
+            bail!("Cannot split matrix at column {}!", column);
         }
 
         let right = Self::new_unsafe(

src/matrix_algorithms.rs

@@ -8,7 +8,6 @@ pub struct Aftermath<T: MatrixNumber> {
     pub steps: Vec<String>,
 }
 
-#[allow(dead_code)]
 impl<T: MatrixNumber> Matrix<T> {
     /// Returns a copy of the matrix which is in the row echelon form along
     /// with all steps represented in human-friendly LaTeX notation.

src/parser.rs

@@ -1,5 +1,3 @@
-#![allow(dead_code)]
-
 use std::collections::VecDeque;
 use std::fmt::{Display, Formatter};