GC: implemented QuickCheck magic to test GC of huge object trees

[mate.git] / Mate / RegisterAllocation.hs

diff --git a/Mate/RegisterAllocation.hs b/Mate/RegisterAllocation.hs
index 7162ae6b0aec743e7368f9db7fdac2c18f16e57e..8c4e040371868adc20c6324408226e872b26a0fe 100644 (file)
--- a/Mate/RegisterAllocation.hs
+++ b/Mate/RegisterAllocation.hs
@@ -1,4 +1,3 @@
-#include "debug.h"
 module Mate.RegisterAllocation where
 
 import Data.List
@@ -24,9 +23,10 @@ edgeEq (from,to) (from',to') = from == from' && to == to'
 -- TODO: find combinator do match try semantics here
 -- Solution: use list because list is MonadPlus instance
 -- other solution add maybe monadplus implementation
-conflicts (IGraph xs) (label,anotherLabel) = let comparison  = edgeEq (label,anotherLabel)
-                                                 comparison' = edgeEq (anotherLabel,label) 
-                                             in isJust (find comparison xs) || isJust (find comparison' xs) 
+conflicts (IGraph xs) (label,anotherLabel) =
+  let comparison  = edgeEq (label,anotherLabel)
+      comparison' = edgeEq (anotherLabel,label)
+  in isJust (find comparison xs) || isJust (find comparison' xs)
 
 
 isParticipiant label (from,to) = from == label || to == label