src/formula.rs

@@ -22,13 +22,11 @@ impl Formula {
         }
         outputs
     }
+    pub fn mutate(&mut self) {}
 
     pub fn modify_tree(&mut self) -> NodeModifier {
         self.tree.modify_tree()
     }
-    pub fn modify_random_node(&mut self) -> NodeModifier {
-        self.tree.modify_node()
-    }
     pub fn display_tree(&self) {
         self.display_recursion(0, vec![&self.tree]);
     }

src/learner.rs

@@ -1,10 +1,4 @@
 use crate::formula::Formula;
-use rand::random_range;
-
-const ACTION_ADD: u8 = 0;
-const ACTION_REMOVE: u8 = 1;
-const ACTION_INSERT: u8 = 2;
-const ACTION_MUTATE: u8 = 3;
 
 pub struct Learner {
     best_algorithm: Formula,
@@ -29,13 +23,7 @@ impl Learner {
             iterations: iterations.unwrap_or(200),
         }
     }
-    pub fn calculate_formula(&mut self) -> Formula {
-        for _ in 0..self.iterations {
-            self.best_algorithm = self.iterate()
-        }
-        self.best_algorithm.clone()
-    }
-    fn iterate(&self) -> Formula {
+    pub fn iterate(&self) -> Formula {
         let mut formulas: Vec<(Formula, f64)> = vec![];
         for _ in 0..self.formulas_per_iteration {
             let mut formula = self.best_algorithm.clone();
@@ -61,20 +49,8 @@ impl Learner {
             .0
             .clone()
     }
-    fn mutate_formula_randomly(formula: &mut Formula) {
-        let mut editor = formula.modify_random_node();
-        let decided_action = random_range(0..3);
-        if decided_action == ACTION_ADD {
-            editor.add_node(editor.get_random_node());
-        } else if decided_action == ACTION_REMOVE {
-            editor.remove_node(None);
-        } else if decided_action == ACTION_INSERT {
-            editor.insert_node(editor.get_random_node(), None);
-        } else if decided_action == ACTION_MUTATE {
-            editor.mutate_node();
-        }
-    }
-    pub fn get_similarity(expected_output: &Vec<f64>, real_output: &Vec<f64>) -> Result<f64, ()> {
+    fn mutate_formula_randomly(formula: &mut Formula) {}
+    fn get_similarity(expected_output: &Vec<f64>, real_output: &Vec<f64>) -> Result<f64, ()> {
         if expected_output.len() != real_output.len() {
             return Err(());
         }

src/main.rs

@@ -1,16 +1,8 @@
-use fapprox::learner::Learner;
+use crate::{formula::Formula, node::Node};
 
 mod formula;
 mod node;
 #[cfg(test)]
 mod tests;
 
-fn main() {
-    let mut learner = Learner::new(
-        vec![0., 1., 2., 3., 4., 5., 6., 7., 8., 9., 10.],
-        vec![1., 2., 3., 4., 5., 6., 7., 8., 9., 10., 11.],
-        None,
-        None,
-    );
-    println!("{:?}", learner.calculate_formula().as_text());
-}
+fn main() {}

src/node/handler.rs

@@ -7,7 +7,6 @@ pub enum NodeHandler {
         name: String,
         function: fn(Vec<f64>) -> f64,
         max_args: Option<usize>,
-        min_args: usize,
     },
     Variable,
     Empty,
@@ -21,14 +20,7 @@ impl NodeHandler {
                 function,
                 name,
                 max_args,
-                min_args,
-            } => {
-                if &inputs.len() >= min_args {
-                    function(inputs)
-                } else {
-                    0.
-                }
-            }
+            } => function(inputs),
             Self::Variable => passed_x,
             Self::Empty => inputs[0],
         }

src/node/mod.rs

@@ -43,7 +43,6 @@ impl Node {
         func_name: String,
         func: fn(Vec<f64>) -> f64,
         max_children_count: Option<usize>,
-        min_arguments: usize,
     ) -> Self {
         Self {
             children: vec![],
@@ -51,7 +50,6 @@ impl Node {
                 name: func_name,
                 function: func,
                 max_args: max_children_count,
-                min_args: min_arguments,
             },
             max_children_count,
         }
@@ -95,7 +93,6 @@ impl Node {
                 name,
                 function,
                 max_args,
-                min_args,
             } => name.clone() + "(" + children_text.as_str() + ")",
             NodeHandler::Empty => children_text,
             _ => self.to_string(),
@@ -114,7 +111,6 @@ impl fmt::Display for Node {
                     function,
                     name,
                     max_args,
-                    min_args,
                 } => name.clone(),
                 NodeHandler::Variable => "X".to_string(),
                 NodeHandler::Empty => "".to_string(),

src/node/node_modifier/mod.rs

@@ -22,43 +22,36 @@ impl<'a> NodeModifier<'a> {
                 name: "sin".to_string(),
                 function: |inputs| inputs[0].sin(),
                 max_args: Some(1),
-                min_args: 1,
             },
             NodeHandler::Function {
                 name: "cos".to_string(),
                 function: |inputs| inputs[0].cos(),
                 max_args: Some(1),
-                min_args: 1,
             },
             NodeHandler::Function {
                 name: "sum".to_string(),
                 function: |inputs| inputs.iter().sum(),
                 max_args: None,
-                min_args: 0,
             },
             NodeHandler::Function {
                 name: "-".to_string(),
                 function: |inputs| -inputs[0],
                 max_args: Some(1),
-                min_args: 1,
             },
             NodeHandler::Function {
                 name: "product".to_string(),
                 function: |inputs| inputs.iter().product(),
                 max_args: None,
-                min_args: 0,
             },
             NodeHandler::Function {
                 name: "exp".to_string(),
                 function: |inputs| inputs[0].powf(inputs[1]),
                 max_args: Some(2),
-                min_args: 2,
             },
             NodeHandler::Function {
                 name: "1/".to_string(),
                 function: |inputs| 1f64 / inputs[0],
                 max_args: Some(1),
-                min_args: 1,
             },
         ];
         let standard_number_mutation: Vec<fn(f64) -> f64> = vec![
@@ -149,9 +142,6 @@ impl<'a> NodeModifier<'a> {
             }
         }
         let children_count = self.picked_node.children.len();
-        if children_count <= 0 {
-            return Err(NodeManipulationError::NotEnoughChildren);
-        }
         let operated_index = between.unwrap_or(random_range(0..children_count));
         let moved = self.picked_node.children.remove(operated_index);
         node.children.push(moved);
@@ -177,7 +167,6 @@ impl<'a> NodeModifier<'a> {
                     function,
                     name,
                     max_args,
-                    min_args,
                 } => {
                     let selected_mutation = &self.function_mutation_pool
                         [random_range(0..self.function_mutation_pool.len())];
@@ -185,7 +174,6 @@ impl<'a> NodeModifier<'a> {
                         name,
                         function,
                         max_args,
-                        min_args,
                     } = &selected_mutation
                     {
                         self.picked_node.max_children_count = max_args.clone();
@@ -223,7 +211,6 @@ impl<'a> NodeModifier<'a> {
                     name,
                     function,
                     max_args,
-                    min_args,
                 } => max_args,
                 NodeHandler::Variable => Some(0),
                 NodeHandler::Empty => Some(1),