bet 1.1.0

Helps parsing and evaluating binary expression trees
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

//! test the paths_to_atoms function

use super::*;

fn build_expr(input: &str) -> BeTree<char, char> {
    let mut expr = BeTree::new();
    for c in input.chars() {
        match c {
            '&' | '|' | '!' => expr.push_operator(c),
            ' ' => {}
            '(' => expr.open_par(),
            ')' => expr.close_par(),
            _ => expr.push_atom(c),
        }
    }
    expr
}

#[test]
fn test_paths() {
    let expr = build_expr("A & (B | C)");
    assert_eq!(
        expr.paths_to_atoms(),
        vec![
            (vec!['&'], 'A'),
            (vec!['&', '|'], 'B'),
            (vec!['&', '|'], 'C'),
        ]
    );

    let expr = build_expr("!A & !(B | C)");
    assert_eq!(
        expr.paths_to_atoms(),
        vec![
            (vec!['&', '!'], 'A'),
            (vec!['&', '!', '|'], 'B'),
            (vec!['&', '!', '|'], 'C'),
        ]
    );

    let expr = build_expr("!A & !(B | C) & D");
    assert_eq!(
        expr.paths_to_atoms(),
        vec![
            (vec!['&', '!'], 'A'),
            (vec!['&', '&', '!', '|'], 'B'),
            (vec!['&', '&', '!', '|'], 'C'),
            (vec!['&', '&'], 'D'),
        ]
    );

}