a prototype of an item derivation forest

It seems to be complete now, but still awaits more tests to see where
the errors are, which should be plenty, haha.

2 files changed, 7 insertions, 5 deletions

diff --git a/nfa/src/default/nfa.rs b/nfa/src/default/nfa.rs
index 8d657d5..6b1e56f 100644
--- a/nfa/src/default/nfa.rs
+++ b/nfa/src/default/nfa.rs
@@ -147,9 +147,11 @@ impl<T: GraphLabel + Display> Nfa<T> for DefaultNFA<T> {
 
         let mut builder: DLGBuilder<LabelType<T>> = Builder::with_capacity(nfa_len);
 
-        for _ in 0..nfa_len {
-            builder.add_vertex();
-        }
+        builder.add_vertices(nfa_len);
+
+        // for _ in 0..nfa_len {
+        //     builder.add_vertex();
+        // }
 
         let default = LabelType::new(DOption(default), total_regexps_len, false);
 
diff --git a/nfa/src/default/regex.rs b/nfa/src/default/regex.rs
index 1e3e87b..9e1ed5c 100644
--- a/nfa/src/default/regex.rs
+++ b/nfa/src/default/regex.rs
@@ -879,9 +879,9 @@ mod test_des_rec {
 
     use crate::desrec::DesRec;
 
-    #[allow(dead_code, unused)]
+    #[allow(dead_code)]
     fn test_scanner<'a, 'b, T>(
-        parser: &'b DefaultRegParser<T>,
+        _parser: &'b DefaultRegParser<T>,
         input: &'a str,
     ) -> Result<Option<(usize, RegexType<char>, ParseDirection)>, ParseError>
     where