lib_xch 0.13.0

Crate xch-ceb's official lib
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

// Copyright 2017-2019 LEXUGE
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

// Overall: This is the source code of the Delta-3 Parser.

use std::collections::HashMap;
// inside use(s)
use super::atomdict::AtomDict;
use crate::public::traits::CheckedType;

// This is the data structure of describing the result of Delta-3 Parser.
// This is the form of the `list`:
// |     \     | formula_1 | formula_2 | ...       | formula_n |
// | element_1 | ...       | ...       | ...       | ...       |
// | element_2 | ...       | ...       | ...       | ...       |
// | ...       | ...       | ...       | ...       | ...       |
// | element_n | ...       | ...       | ...       | ...       |
pub struct TableDesc<T: CheckedType> {
    elements_table: HashMap<String, usize>, // store the index of elements
    list: Vec<Vec<T>>,
    formula_sum: usize,
}

impl<T: CheckedType> TableDesc<T> {
    pub fn store_in_table(&mut self, atomdict: &AtomDict<T>, location: usize, neg: bool) {
        for (k, v) in atomdict.get_dict().iter() {
            if !self.elements_table.contains_key(k) {
                let len = self.elements_table.len();
                self.elements_table.insert(k.to_string(), len);
                self.list.push(generate_vec(self.formula_sum));
            }
            // store data in table
            let value = if neg { -(*v) } else { *v };
            self.list[self.elements_table[k]][location] += value;
        }
    }

    pub fn get_list(&self) -> Vec<Vec<T>> {
        (self.list).to_vec()
    }

    pub fn new(formula_sum: usize) -> Self {
        Self {
            elements_table: HashMap::new(),
            list: Vec::new(),
            formula_sum,
        }
    }
}

fn generate_vec<T: CheckedType>(capacity: usize) -> Vec<T> {
    vec![T::zero(); capacity]
}