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.

1 files changed, 3 insertions, 1 deletions

diff --git a/nfa/src/lib.rs b/nfa/src/lib.rs
index c1906e1..4440ea6 100644
--- a/nfa/src/lib.rs
+++ b/nfa/src/lib.rs
@@ -150,15 +150,17 @@ impl<T: GraphLabel> NfaLabel<T> {
     pub fn get_value(&self) -> T {
         self.value
     }
+
     /// Retrieve the moved position from the label.
     #[inline]
     pub fn get_moved(&self) -> usize {
         self.moved
     }
+
     /// Retrieve whether or not the label comes from left-linear
     /// expansions.
     #[inline]
-    pub fn get_left_p(&self) -> bool {
+    pub fn is_left_p(&self) -> bool {
         self.left_p
     }
 }