logisheets_controller 0.6.0

the core of LogiSheets
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

use im::hashmap::HashMap;
use logisheets_base::{Addr, CellId, NameId, SheetId};
use logisheets_parser::ast;

use super::{calculator::calculator::calc, get_cell_id_from_vertex};
use crate::formula_manager::Vertex;

use super::{
    calculator::calc_vertex::{CalcValue, Value},
    connector::Connector,
};

pub struct CycleCalculator<'a, C>
where
    C: Connector,
{
    pub vertices: Vec<Vertex>,
    pub error: f32,
    pub iter_limit: u16,
    pub connector: &'a mut C,
    pub names: &'a HashMap<NameId, ast::Node>,
    pub formulas: &'a HashMap<(SheetId, CellId), ast::Node>,
}

impl<'a, C> CycleCalculator<'a, C>
where
    C: Connector,
{
    pub fn start(self) {
        let mut times = 0_u16;
        let mut finish = false;
        let connector = self.connector;
        let formulas = self.formulas;
        let nodes = self
            .vertices
            .into_iter()
            .map(|v| get_cell_id_from_vertex(&v, connector))
            .flatten()
            .collect::<Vec<_>>();
        let error = self.error;
        let mut last_calc = vec![CalcValue::Scalar(Value::Blank); nodes.len()];
        while times < self.iter_limit && !finish {
            let mut this_calc = Vec::<CalcValue>::with_capacity(nodes.len());
            nodes.iter().for_each(|v| match formulas.get(v) {
                Some(node) => {
                    let curr_sheet = v.0;
                    let curr_addr = connector
                        .get_cell_idx(curr_sheet, &v.1)
                        .map_or(Addr::default(), |(row, col)| Addr { row, col });
                    connector.set_curr_cell(curr_sheet, curr_addr);
                    let res = calc(node, connector);
                    connector.commit_calc_values(v.clone(), res.clone());
                    this_calc.push(res);
                }
                None => this_calc.push(CalcValue::Scalar(Value::Blank)),
            });
            if last_calc
                .iter()
                .zip(this_calc.iter())
                .all(|(l, t)| meet_error(l, t, error))
            {
                finish = true;
            }
            times += 1;
            last_calc = this_calc;
        }
    }
}

fn meet_error(v1: &CalcValue, v2: &CalcValue, error: f32) -> bool {
    match (v1, v2) {
        (CalcValue::Scalar(s1), CalcValue::Scalar(s2)) => match (s1, s2) {
            (Value::Blank, Value::Blank) => true,
            (Value::Number(n1), Value::Number(n2)) => (*n1 - *n2).abs() < error as f64,
            (Value::Text(t1), Value::Text(t2)) => t1 == t2,
            (Value::Boolean(b1), Value::Boolean(b2)) => *b1 == *b2,
            (Value::Error(e1), Value::Error(e2)) => e1 == e2,
            _ => false,
        },
        (CalcValue::Range(_), CalcValue::Range(_)) => true,
        (CalcValue::Cube(_), CalcValue::Cube(_)) => true,
        _ => false,
    }
}