tree-automata 0.1.2

Term Rewriting Systems
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

extern crate terms;
extern crate tree_automata as ta;

use terms::Pattern;
use ta::Automaton;

#[test]
fn add_simple_configurations() {
    let mut a = Automaton::new();
    let conf = Pattern::cons((), &[]);

    assert!(a.states_for_configuration(&conf).next().is_none());
    a.add(conf.clone(), (), ());
    assert!(*a.states_for_configuration(&conf).next().unwrap() == ((), ()))
}

#[test]
fn add_multiple_configurations() {
    let mut a = Automaton::new();

    let confs = [
        Pattern::cons("f", &[]),
        Pattern::cons("g", &[]),
        Pattern::cons("h", &[]),
        Pattern::cons("i", &[])
    ];

    for conf in confs.iter() {
        a.add(conf.clone(), (), ());
    }

    for conf in confs.iter() {
        assert!(*a.states_for_configuration(&conf).next().unwrap() == ((), ()));
        assert!(a.configurations_for_state(&()).find(|(c, _)| c == conf).is_some());
    }
}