suzanne.soy/tock-mirror
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixed the brute-force problems function so that it properly uses all inequalities not just the left-overs

Browse Source
This commit is contained in:
Neil Brown 2008-01-09 14:56:26 +00:00
parent 4ef97ed8b4
commit d5a9829b0f
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
transformations/ArrayUsageCheck.hs
View File

@ -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