From d5a9829b0ff6a939e413459d4ff808f3a6c687ab Mon Sep 17 00:00:00 2001 From: Neil Brown Date: Wed, 9 Jan 2008 14:56:26 +0000 Subject: [PATCH] Fixed the brute-force problems function so that it properly uses all inequalities not just the left-overs --- transformations/ArrayUsageCheck.hs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/transformations/ArrayUsageCheck.hs b/transformations/ArrayUsageCheck.hs index be37608..a6d8952 100644 --- a/transformations/ArrayUsageCheck.hs +++ b/transformations/ArrayUsageCheck.hs @@ -667,11 +667,11 @@ fmElimination vm ineq = fmElimination' vm (presentItems ineq) ineq getBruteForceProblems :: Int -> InequalityProblem -> [(EqualityProblem,InequalityProblem)] getBruteForceProblems k ineqs = concatMap setLowerBound eqB where - (eqA,eqB,eqC) = splitBounds k ineqs + (eqA,eqB,_) = splitBounds k ineqs largestUpperA = maximum $ map fst eqA - setLowerBound (b,beta) = map (\i -> ([addConstant (-i) (beta // [(k,b)])],eqC)) [0 .. max] + setLowerBound (b,beta) = map (\i -> ([addConstant (-i) (beta // [(k,b)])],ineqs)) [0 .. max] where max = ((largestUpperA * b) - largestUpperA - b) `div` largestUpperA