diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
| commit | 18d7955b7d84c00467ede38baae53f4ce1fb6908 (patch) | |
| tree | 97d0746b82816a21d980636e50f8cdbeb804b518 /nfa/src/default/nfa.rs | |
| parent | 8f8d3d1a3c276be4be2e5d2e767ada564c47279a (diff) | |
chain: a prototype is added.
I have an ostensibly working prototype now.
Further tests are needed to make sure that the algorithm meets the
time complexity requirement, though.
Diffstat (limited to 'nfa/src/default/nfa.rs')
| -rw-r--r-- | nfa/src/default/nfa.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/nfa/src/default/nfa.rs b/nfa/src/default/nfa.rs index a23c056..8d657d5 100644 --- a/nfa/src/default/nfa.rs +++ b/nfa/src/default/nfa.rs @@ -212,7 +212,7 @@ impl<T: GraphLabel + Display> Nfa<T> for DefaultNFA<T> { let top_label = regex.vertex_label(top_index)?; let nfa_start = offset + 2 * top_index; - let nfa_end = offset + 2 * top_index + 1; + let nfa_end = nfa_start + 1; match top_label { RegexType::Kleene => { |