[code cleanups
John Meacham <john@repetae.net>**20051011023121] hunk ./E/SSimplify.hs 87
+        (e',fve,se) <- f e
hunk ./E/SSimplify.hs 90
-        let gr = newGraph (zip (fsts ds) ds') (tvrNum . fst) (gfv . fst . snd )
-        (e',fve,se) <- f e
-        let nn' = reachable gr (Set.toList fve ++ Map.keys se ++  topLevels)
+            gr = newGraph (zip (fsts ds) ds') (tvrNum . fst) (gfv . fst . snd )
+            nn' = reachable gr (Set.toList fve ++ Map.keys se ++  topLevels)
hunk ./E/SSimplify.hs 99
-
-            {-
-            calcStrictInfo t e
-                | t `Set.member` cycNodes = Strict.L
-                | Just s <- Info.lookup (tvrInfo t) = s
-                | otherwise = Strict.L
-            -}
hunk ./E/SSimplify.hs 116
-        {-
-    f (ELetRec ds e) = do
-        ds' <- mapM  (f . snd) ds
-        let gfv (_,fv,i) = fvs ++ Set.toList (mconcat (map (ruleFreeVars' rules) (fvs)))  where
-                fvs = Set.toList (Set.fromAscList (Map.keys i) `Set.union` fv)
-        let gr = newGraph (zip (fsts ds) ds') (tvrNum . fst) (gfv . snd)
-        (e',fve,se) <- f e
-        let nn = reachable gr (Set.toList fve ++ Map.keys se ++  topLevels)
-        let gr' = newGraph nn (tvrNum . fst) (gfv . snd)
-            (lb,ds'') = findLoopBreakers (\ (_,(e,_,_)) -> loopFunc e) gr'
-        let dvars = map (tvrNum . fst) ds
-            fvs = foldr Set.delete (mconcat (fve:[ fv `mappend` freeVars t | (TVr _ t,(_,fv,_)) <- ds'' ])) dvars
-            finalS = Map.union (Map.fromList [(n,LoopBreaker) | (TVr n _,_) <- lb ]) $   foldl andOM se ([ s | (_,(_,_,s)) <- ds'' ])
-        tell $ Seq.singleton (Map.fromList [ (t,Map.findWithDefault Unused n (Map.mapWithKey frules finalS)) | (t@(TVr n _),_) <- ds'' ])
-        return (eLetRec [ (v,e) | (v,(e,_,_)) <- ds'' ] e', fvs, finalS  )
-        -}