[make bindingFreeVars always return an IdSet
John Meacham <john@repetae.net>**20060409041101] hunk ./E/Inline.hs 128
-    mp = G.stronglyConnComp [ (v,i,bindingFreeVars t e) | v@(t@TVr { tvrIdent = i },e) <- bs]
+    mp = G.stronglyConnComp [ (v,i, idSetToList $ bindingFreeVars t e) | v@(t@TVr { tvrIdent = i },e) <- bs]
hunk ./E/Rules.hs 278
+bindingFreeVars :: TVr -> E -> IdSet
hunk ./E/Traverse.hs 363
-    zs = [ ((t,e), tvrIdent t, bindingFreeVars t e ) |  (t,e) <- ds ]
+    zs = [ ((t,e), tvrIdent t, idSetToList $ bindingFreeVars t e ) |  (t,e) <- ds ]
hunk ./Main.hs 379
-        let graph = (newGraph cds' (\ (b,_) -> tvrIdent b) (\ (b,c) -> bindingFreeVars b c))
+        let graph = (newGraph cds' (\ (b,_) -> tvrIdent b) (\ (b,c) -> idSetToList $ bindingFreeVars b c))
hunk ./Main.hs 414
-    let graph =  (newGraph (programDs prog) (\ (b,_) -> tvrIdent b) (\ (b,c) -> bindingFreeVars b c))
+    let graph =  (newGraph (programDs prog) (\ (b,_) -> tvrIdent b) (\ (b,c) -> idSetToList $ bindingFreeVars b c))
hunk ./Main.hs 432
-        let graph =  (newGraph (programDs prog) (\ (b,_) -> tvrIdent b) (\ (b,c) -> bindingFreeVars b c))
+        let graph =  (newGraph (programDs prog) (\ (b,_) -> tvrIdent b) (\ (b,c) -> idSetToList $ bindingFreeVars b c))
hunk ./Main.hs 448
-    ds' = reachable (newGraph (programDs prog) (tvrIdent . fst) (\ (t,e) -> bindingFreeVars t e)) (map tvrIdent $ progEntryPoints prog)
+    ds' = reachable (newGraph (programDs prog) (tvrIdent . fst) (\ (t,e) -> idSetToList $ bindingFreeVars t e)) (map tvrIdent $ progEntryPoints prog)
hunk ./Main.hs 893
-
-