before a major refactor

I decide to adopt a new approach of recording and updating item
derivation forests.  Since this affects a lot of things, I decide to
commit before the refactor, so that I can create a branch for that
refactor.

1 files changed, 0 insertions, 24 deletions

diff --git a/nfa/src/lib.rs b/nfa/src/lib.rs
index 07bbd5a..de71f25 100644
--- a/nfa/src/lib.rs
+++ b/nfa/src/lib.rs
@@ -210,17 +210,6 @@ pub trait Nfa<T: GraphLabel>: LabelExtGraph<T> {
     /// different type for the result type.
     type FromRegex<S: GraphLabel + Display + Default>;
 
-    // FIXME: This should not be needed.
-    /// Remove all empty transitions from the nondeterministic finite
-    /// automaton.
-    #[inline]
-    fn remove_epsilon<F>(&mut self, _f: F) -> Result<(), Error>
-    where
-        F: FnMut(T) -> bool,
-    {
-        unimplemented!("deprecated")
-    }
-
     /// Return a state-minimal NFA equivalent with the original one.
     ///
     /// This is not required.  It is just to allow me to experiment
@@ -299,19 +288,6 @@ pub trait Nfa<T: GraphLabel>: LabelExtGraph<T> {
     /// edges.  We can call this "a poor man's removal of nodes".
     fn remove_dead(&mut self, reserve: impl FnMut(usize) -> bool) -> Result<(), Error>;
 
-    // FIXME: This should not be needed.
-    /// For each edge from A to B whose edge is considered nullable by
-    /// a function `f`, and for every edge from B to C, add an edge
-    /// from A to C.
-    ///
-    /// This is needed specifically by the algorithm to produce a set
-    /// of atomic languages that represent "null-closed" derived
-    /// languages.
-    #[inline]
-    fn nulling(&mut self, _f: impl FnMut(T) -> bool) -> Result<(), Error> {
-        unimplemented!("deprecated")
-    }
-
     /// Return the *closure* of the nondeterministic finite automaton.
     ///
     /// # Definition