[make strictness analysis more efficient
John Meacham <john@repetae.net>**20051013050811] hunk ./E/Strictness.hs 138
-        return $ Map.fromAscList [ (i,L) | (i,v) <- Map.toAscList sm, i `notElem` ts]
+        --return $ Map.fromAscList [ (i,L) | (i,v) <- Map.toAscList sm, i `notElem` ts]
+        return $ Map.map (const L) $ Map.filterWithKey (\i _ -> i `notElem` ts) sm -- Map.fromAscList [ (i,L) | (i,v) <- Map.toAscList sm, i `notElem` ts]
hunk ./E/Strictness.hs 141
-        return $ Map.fromAscList [ (i,v) | (i,v) <- Map.toAscList sm, i `notElem` ts]
+        return $ Map.filterWithKey (\i _ -> i `notElem` ts) sm -- Map.fromAscList [ (i,v) | (i,v) <- Map.toAscList sm, i `notElem` ts]
hunk ./E/Strictness.hs 144
+        las = length as
hunk ./E/Strictness.hs 148
-            return $ Map.fromAscList [ (i,saIf t (length as) v L) | (i,v) <- Map.toAscList samap, i `notElem`  as]
+            -- return $ Map.fromAscList [ (i,saIf t (length as) v L) | (i,v) <- Map.toAscList samap, i `notElem`  as]
+            return $ Map.map (\v -> saIf t las v L) $  Map.filterWithKey (\i _ -> i `notElem` as) samap -- Map.fromAscList [ (i,saIf t (length as) v L) | (i,v) <- Map.toAscList samap, i `notElem`  as]