pink_runtime/engine/
eval.rs

1use std::collections::{BTreeSet, VecDeque};
2
3use super::{Expression, Runtime};
4
5impl Runtime {
6    fn get_lower_neighbours(&self, expression: Expression) -> BTreeSet<Expression> {
7        let mut neighbours = BTreeSet::new();
8
9        for size in 1..=expression.tokens.len() {
10            for (window_start, window) in expression.tokens.windows(size).enumerate() {
11                // let starts_with_paren = window.starts_with(&[Token::Literal("(".to_owned())]);
12                // let ends_with_paren = window.ends_with(&[Token::Literal(")".to_owned())]);
13
14                // // Count the number of open and closed parentheses
15                // let open_parens = window
16                //     .iter()
17                //     .filter(|token| token == &&Token::Literal("(".to_owned()))
18                //     .count();
19
20                // let closed_parens = window
21                //     .iter()
22                //     .filter(|token| token == &&Token::Literal(")".to_owned()))
23                //     .count();
24
25                // // if starts_with_paren && ends_with_paren {
26                // if starts_with_paren && ends_with_paren && open_parens == closed_parens {
27                //     let lowered_window =
28                //         self.eval(Expression::new(window[1..window.len() - 1].to_vec()));
29                //     let mut lowered = expression.tokens[..window_start].to_vec();
30                //     lowered.extend(lowered_window.tokens);
31                //     lowered.extend(expression.tokens[window_start + size..].to_vec());
32
33                //     neighbours.insert(Expression::new(lowered));
34                //     continue;
35                // }
36
37                for definition in self.definitions() {
38                    if let Some(lowered_window) = definition.lower(window) {
39                        let mut lowered = expression.tokens[..window_start].to_vec();
40                        lowered.extend(lowered_window.tokens);
41                        lowered.extend(expression.tokens[window_start + size..].to_vec());
42
43                        neighbours.insert(Expression::new(lowered));
44                        break;
45                    }
46                }
47            }
48        }
49
50        neighbours
51    }
52
53    /// Returns the lowest possible evaluation
54    pub fn eval(&self, expression: Expression) -> Expression {
55        self.evaluations(expression)
56            .iter()
57            .next()
58            .expect("Should have at least the original expression")
59            .clone()
60    }
61
62    /// Returns a set of all possible evaluations
63    pub fn evaluations(&self, expression: Expression) -> BTreeSet<Expression> {
64        let mut visited = BTreeSet::new();
65        let mut queue = VecDeque::new();
66
67        queue.push_back(expression);
68
69        while !queue.is_empty() {
70            let expression = queue.pop_front().unwrap();
71
72            // println!("Visiting: {}", expression);
73
74            if visited.contains(&expression) {
75                continue;
76            }
77
78            visited.insert(expression.clone());
79
80            for neighbour in self.get_lower_neighbours(expression) {
81                queue.push_back(neighbour);
82            }
83        }
84
85        visited
86    }
87}
pink_runtime/engine/eval.rs

pink_runtime/engine/
eval.rs
