l1-dfa 0.1.1

Deterministic Finite-State Automata Library for Rust, written in L1
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114

use l1_dfa::{DFA};

#[test]
fn subset_ea1() {
   let l = DFA {
      states: vec![false],
      transitions: std::collections::HashMap::new(),
   };
   let r = DFA {
      states: vec![true],
      transitions: std::collections::HashMap::new(),
   };

   assert!( l.is_subset_of(&r) );
   assert!( !r.is_subset_of(&l) );
}

#[test]
fn subset_ea2() {
   let l = DFA {
      states: vec![false],
      transitions: std::collections::HashMap::new(),
   };
   let mut r = DFA {
      states: vec![true],
      transitions: std::collections::HashMap::new(),
   };
   r.transitions.insert((0,'a'),0);

   assert!( l.is_subset_of(&r) );
   assert!( !r.is_subset_of(&l) );
}

#[test]
fn subset_ea3() {
   let mut l = DFA {
      states: vec![true,false],
      transitions: std::collections::HashMap::new(),
   };
   l.transitions.insert((0,'a'),1);
   let mut r = DFA {
      states: vec![true],
      transitions: std::collections::HashMap::new(),
   };
   r.transitions.insert((0,'a'),0);

   assert!( l.is_subset_of(&r) );
   assert!( !r.is_subset_of(&l) );
}

#[test]
fn subset_ea4() {
   let mut l = DFA {
      states: vec![false,true],
      transitions: std::collections::HashMap::new(),
   };
   l.transitions.insert((0,'a'),1);
   let mut r = DFA {
      states: vec![true],
      transitions: std::collections::HashMap::new(),
   };
   r.transitions.insert((0,'a'),0);

   assert!( l.is_subset_of(&r) );
   assert!( !r.is_subset_of(&l) );
}

#[test]
fn subset_ea5() {
   let mut l = DFA {
      states: vec![false,false,true],
      transitions: std::collections::HashMap::new(),
   };
   l.transitions.insert((0,'a'),1);
   l.transitions.insert((1,'a'),2);
   l.transitions.insert((2,'a'),2);
   let mut r = DFA {
      states: vec![false,true],
      transitions: std::collections::HashMap::new(),
   };
   r.transitions.insert((0,'a'),1);
   r.transitions.insert((1,'a'),1);

   assert!( l.is_subset_of(&r) );
   assert!( !r.is_subset_of(&l) );
}

#[test]
fn subset_ea6() {
   let mut l = DFA {
      states: vec![false,true],
      transitions: std::collections::HashMap::new(),
   };
   l.transitions.insert((0,'a'),1);
   l.transitions.insert((1,'a'),1);
   let mut r = DFA {
      states: vec![false,true],
      transitions: std::collections::HashMap::new(),
   };
   r.transitions.insert((0,'a'),1);
   r.transitions.insert((1,'a'),1);

   assert!( l.is_subset_of(&r) );
   assert!( r.is_subset_of(&l) );
}