@@ -207,6 +207,7 @@ minimalUsage deps
207-- In the implementation, this is phase-shifted. We first reduce the set
207-- In the implementation, this is phase-shifted. We first reduce the set
208-- of constraints, given the newly reachable nodes from the previous iteration,
208-- of constraints, given the newly reachable nodes from the previous iteration,
209-- and then compute the set of currently reachable nodes.
209-- and then compute the set of currently reachable nodes.
210+-- Then we decide whether to iterate further.
210forwardChain
211forwardChain
211 :: Map Node IntSet -- ^ node index
212 :: Map Node IntSet -- ^ node index
212 -> DepSet -- ^ all reachable nodes found so far
213 -> DepSet -- ^ all reachable nodes found so far