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

use l1_dfa::{DFA};

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

   assert!( d.is_empty() );
}

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

   assert!( !d.is_empty() );
}

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

   assert!( !d.is_empty() );
}

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

   assert!( !d.is_empty() );
}

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

   assert!( d.is_empty() );
}