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

Tidied up the checkForUnit function in solveConstraints

Browse Source
This commit is contained in:
Neil Brown 2007-12-12 14:25:24 +00:00
parent 52054dff9f
commit 1aa914e077
1 changed files with 4 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
transformations/ArrayUsageCheck.hs
View File

@ -92,16 +92,10 @@ solveConstraints p ineq
solve p = (solveUnits p >>* removeRedundant) >>= liftF checkFalsifiable >>= solveNext >>= solve
checkForUnit :: EqualityConstraintEquation -> Maybe CoeffIndex
-- checkForUnit [_] = Nothing
-- checkForUnit is = listToMaybe $ map fst $ filter (absVal1 . snd) $ zip [1..] (tail is) -- Use [1..] because we've chopped off the 0-index value
checkForUnit = listToMaybe . map fst . filter (absVal1 . snd) . tail . assocs
absVal1 :: Integer -> Bool
absVal1 1 = True
absVal1 (-1) = True
absVal1 _ = False
checkForUnit = listToMaybe . map fst . filter coeffAbsVal1 . tail . assocs
where
coeffAbsVal1 :: (a, Integer) -> Bool
coeffAbsVal1 (_,x) = (abs x) == 1
findFirstUnit :: EqualityProblem -> (Maybe (EqualityConstraintEquation,CoeffIndex),EqualityProblem)
findFirstUnit [] = (Nothing,[])