[started working on new heuristic, still commented
martin.hofmann@uni-bamberg.de**20091014113825] hunk ./src/Data/Hypotheses.hs 253
+--instance Rateable Hypo where
+--    rate h = let (cd,bs) = simplifiedBindings h
+--                 allRs = concatMap (S.toList . snd) bs
+--                 numFs  = length bs
+--                 numRs  = length allRs
+--                 numPs  = numberOfPartitions allRs         
+--                 numCs = cycles cd
+--                 numLs = loops cd
+--                 fracs = map divide [(numRs,numFs) -- functions per rule
+--                                    ,(numRs,numPs) -- partitions per rule
+----                                    ,(numCs,numFs) -- cycles per function
+--                           --         ,(numLs,numFs) -- loops per function
+--                                    ]
+--             in mkRatingData fracs ((sum fracs)/fromIntegral(length fracs))
+--    
+--divide = uncurry ((/) `on` fromIntegral)
+
hunk ./src/Data/Hypotheses.hs 271
-    rate h       = 
+    rate h       =
hunk ./src/Data/Hypotheses.hs 280
-          --numPartitions + numCycles + numOpenRules
+         --numPartitions + numCycles + numOpenRules,
hunk ./src/Data/Hypotheses.hs 282
-         -- numCycles
-         -- numOpenRules
+         -- numCycles,
+          numOpenRules
hunk ./src/Data/Hypotheses.hs 286
-          numFVarPerRule
+          -- numFVarPerRule
hunk ./src/Data/Hypotheses.hs 289
+
hunk ./src/Data/Hypotheses.hs 304
-numberOfPartitions = length . (foldl' leastPatterns []) . (filter (not . hasHO)) . S.toList . allRules 
+numberOfPartitions = length . (foldl' leastPatterns []) . (filter (not . hasHO)) . S.toList . allRules
hunk ./src/Rating/Rateable.hs 20
-data RatingData = RD Int Int Int Float  deriving (Eq,Show)
+data RatingData = RD Int Int Int Int  deriving (Eq,Show)