robocop

commit a8b9844fce17fde97cfe04680cd06e1ac9bf8733
parent 4008864ee70978bd1539aff3b45c0bfb938b9441
Author: Christian Grothoff <christian@grothoff.org>
Date:   Tue, 10 Jun 2025 13:41:56 +0200

DCE

Diffstat:
M
src/main.rs
 | 
10
----------

1 file changed, 0 insertions(+), 10 deletions(-)
diff --git a/src/main.rs b/src/main.rs
@@ -80,11 +80,8 @@ fn parse_args() -> Option<String> {
 }
 
 
-// Finite State Machine for efficient string matching
 #[derive(Debug, Clone)]
 struct Matching {
-    // Maps (state, char) -> new_state
-    transitions: HashMap<(usize, char), usize>,
     // Final states with their associated values and costs
     final_states: HashMap<usize, (String, usize)>,
     max_state: usize,
@@ -93,7 +90,6 @@ struct Matching {
 impl Matching {
     fn new() -> Self {
         Self {
-            transitions: HashMap::new(),
             final_states: HashMap::new(),
             max_state: 0,
         }
@@ -119,12 +115,6 @@ impl Matching {
             );
         }
 
-        // Build transitions for exact matches
-        for (i, &ch) in chars.iter().enumerate() {
-            let current_state = state_ids[i];
-            let next_state = state_ids[i + 1];
-            self.transitions.insert((current_state, ch), next_state);
-        }
     }