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

Removed the changeAllButOneDifferent function and replaced it with simpler code

Browse Source
This commit is contained in:
Neil Brown 2007-12-12 17:48:30 +00:00
parent 88f7d1ec92
commit 4eae0ede18
1 changed files with 1 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
transformations/ArrayUsageCheck.hs
View File

@ -156,7 +156,7 @@ solveConstraints p ineq
a_k = e ! k
m = (abs a_k) + 1
sign_a_k = signum a_k
x_k_eq = changeAllButOneDifferent (k,(- sign_a_k) * m) (\a_i -> sign_a_k * (a_i `mymod` m)) e
x_k_eq = amap (\a_i -> sign_a_k * (a_i `mymod` m)) e // [(k,(- sign_a_k) * m)]
-- I think this is probably equivalent to mod, but let's follow the maths:
mymod x y = x - (y * (floordivplushalf x y))
@ -165,11 +165,6 @@ solveConstraints p ineq
floordivplushalf :: Integer -> Integer -> Integer
floordivplushalf x y = floor ((fromInteger x / fromInteger y) + (0.5 :: Double))
changeAllButOneDifferent :: (IArray a e, IArray a e', Ix i) => (i,e') -> (e -> e') -> a i e -> a i e'
changeAllButOneDifferent (specialI,specialE) f = arrayMapWithIndex f'
where
f' i e = if i == specialI then specialE else f e
-- Removes all equations where the coefficients are all zero
removeRedundant :: EqualityProblem -> EqualityProblem
removeRedundant = mapMaybe (boolToMaybe (not . isRedundant))