[print covered I/Os of rule in order, output correct totla number of Hypos
martin.hofmann@uni-bamberg.de**20090528144145] hunk ./expl/Examples.hs 127
-droP :: Peano -> [a] -> [a]
+takE, droP :: Peano -> [a] -> [a]
hunk ./expl/Examples.hs 129
-droP Z             [a]     = [a]
-droP Z             [a,b]   = [a,b]
+--droP Z             [a]     = [a]
+--droP Z             [a,b]   = [a,b]
hunk ./expl/Examples.hs 132
-droP (S Z)         []      = []
+--droP (S Z)         []      = []
hunk ./expl/Examples.hs 136
-droP (S (S Z))     []      = []
-droP (S (S Z))     [a]     = []
+--droP (S (S Z))     []      = []
+--droP (S (S Z))     [a]     = []
hunk ./expl/Examples.hs 139
---droP (S (S Z))     [a,b,c] = [c]
-droP (S (S (S Z))) []      = []
-droP (S (S (S Z))) [a]     = []
-droP (S (S (S Z))) [a,b]   = []
---droP (S (S (S Z))) [a,b,c] = []
+droP (S (S Z))     [a,b,c] = [c]
+--droP (S (S (S Z))) []      = []
+--droP (S (S (S Z))) [a]     = []
+--droP (S (S (S Z))) [a,b]   = []
+droP (S (S (S Z))) [a,b,c] = []
+
+takE Z             []      = []
+takE Z             [a]     = []
+takE Z             [a,b]   = []
+--takE Z             [a,b,c] = []
+takE (S Z)         []      = []
+takE (S Z)         [a]     = [a]
+takE (S Z)         [a,b]   = [a]
+--takE (S Z)         [a,b,c] = [a]
+takE (S (S Z))     []      = []
+takE (S (S Z))     [a]     = [a]
+takE (S (S Z))     [a,b]   = [a,b]
+--takE (S (S Z))     [a,b,c] = [a,b]
+takE (S (S (S Z))) []      = []
+takE (S (S (S Z))) [a]     = [a]
+takE (S (S (S Z))) [a,b]   = [a,b]
+--takE (S (S (S Z))) [a,b,c] = [a,b,c]
hunk ./igor2.cabal 20
-       ghc-options:       -O2
+       ghc-options:       -O4
hunk ./src/Data/HypoSpace.hs 215
-                        text "Total Hypos:"     <+> int (hypoCounter hsp) <$>
+                        text "Total Hypos:"     <+> (int.S.size.S.fromList.M.elems.ruleIdsMap $ hsp) <$>
hunk ./src/Data/IOData.hs 21
-import Data.List (intersect)
+import Data.List (intersect, sort)
hunk ./src/Data/IOData.hs 159
-    indices      = nub $ concatMap covr cruls
+    indices      = sort $ nub $ concatMap covr cruls
hunk ./src/Logging/PrettyPrinter.hs 89
-    lparen <> (pretty a) <+> ((text "|->" ) <+> ( align (pretty b) <> rparen))
+    lparen <> (pretty a) <+> ((text "|->" ) <+> softbreak <> (pretty b) <> rparen)
hunk ./src/Logging/PrettyPrinter.hs 92
-    lparen <> (pretty a) <+> ((text "<~" ) <+> ( align (pretty b) <> rparen))
+    lparen <> (pretty a) <+> ((text "<~" ) <+> softbreak <> (pretty b) <> rparen)
hunk ./src/RuleDevelopment/Partition.hs 44
-partitionAt rfs p = return $ S.fromList $ map fuse bins
+partitionAt crs p = 
+    --return $ S.fromList $ map fuse bins
+    -- reverse is only for nicer output 
+    return $ S.fromList $ map fuse bins
+
hunk ./src/RuleDevelopment/Partition.hs 51
-    case foldl' bin [] rfs of    
-     [(x:xs)] -> [] --[[x],xs]
-     (x1:x2:xs)   -> (x1:x2:xs)   
+    case foldl' bin [] crs of    
+     [_p]       -> [] -- partitioning a single rule results in no partitions
+     (x1:x2:xs) -> (x1:x2:xs)   
hunk ./src/RuleDevelopment/Partition.hs 59
-      else (x:xs):(bin done e)        
+      else (x:xs):(bin done e)  
+        