We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c301169 commit 6e47771Copy full SHA for 6e47771
src/DFAMin.hs
@@ -13,7 +13,7 @@ import Data.IntSet (IntSet)
13
import qualified Data.IntSet as IS
14
import Data.IntMap (IntMap)
15
import qualified Data.IntMap as IM
16
-import Data.List as List
+import qualified Data.List as List
17
18
19
-- Hopcroft's Algorithm for DFA minimization (cut/pasted from Wikipedia):
@@ -104,7 +104,7 @@ groupEquivStates DFA { dfa_states = statemap }
104
-- group the accepting states into equivalence classes
105
accept_map :: Map [Accept a] [Int]
106
accept_map = {-# SCC "accept_map" #-}
107
- foldl' (\m (n,s) -> Map.insertWith (++) (state_acc s) [n] m)
+ List.foldl' (\m (n,s) -> Map.insertWith (++) (state_acc s) [n] m)
108
Map.empty
109
(Map.toList accepting)
110
0 commit comments