@@ -37,7 +37,7 @@ import Data.List (intersperse, partition)
37
37
import Data.List.NonEmpty (NonEmpty (.. ), toList )
38
38
import Data.List.NonEmpty qualified as NE
39
39
import Data.Map qualified as Map
40
- import Data.Maybe (catMaybes , fromMaybe , isJust , mapMaybe )
40
+ import Data.Maybe (catMaybes , fromMaybe , mapMaybe )
41
41
import Data.Sequence (Seq , (|>) )
42
42
import Data.Set qualified as Set
43
43
import Data.Text as Text (Text , pack )
@@ -393,12 +393,6 @@ applyRule pat@Pattern{ceilConditions} rule =
393
393
withPatternContext rewritten $
394
394
return (rule, rewritten)
395
395
where
396
- -- extract substitution items from a list of generic predicates. Return empty substitution if none are found
397
- partitionPredicates :: [Predicate ] -> (Substitution , [Predicate ])
398
- partitionPredicates ps =
399
- let (substItems, normalPreds) = partition (isJust . destructEq) ps
400
- in (Map. fromList . mapMaybe destructEq $ substItems, normalPreds)
401
-
402
396
-- Given known predicates, a known substitution and a newly acquired substitution (from the ensures clause):
403
397
-- - apply the new substitution to the old substitution
404
398
-- - simplify the substituted old substitution, assuming known truth
0 commit comments