fixup! wip: thread compiler

Author: angerman

cabal-install-solver/src/Distribution/Solver/Modular/Explore.hs

@@ -188,12 +188,12 @@ assign tree = go tree (A M.empty M.empty M.empty M.empty)
     go :: Tree d c -> Assignment -> Tree Assignment c
     go (Fail c fr)            _                  = Fail c fr
     go (Done rdm _)           a                  = Done rdm a
-    go (PChoice qpn rdm y       ts) (A pa fa sa) = PChoice qpn rdm y       $ W.mapWithKey f (fmap go ts)
-        where f (POption k _) r = r (A (M.insert qpn k pa) fa sa)
-    go (FChoice qfn rdm y t m d ts) (A pa fa sa) = FChoice qfn rdm y t m d $ W.mapWithKey f (fmap go ts)
-        where f k             r = r (A pa (M.insert qfn k fa) sa)
-    go (SChoice qsn rdm y t     ts) (A pa fa sa) = SChoice qsn rdm y t     $ W.mapWithKey f (fmap go ts)
-        where f k             r = r (A pa fa (M.insert qsn k sa))
+    go (PChoice qpn rdm y       ts) (A pa ca fa sa) = PChoice qpn rdm y       $ W.mapWithKey f (fmap go ts)
+        where f (POption k _) r = r (A (M.insert qpn k pa) ca fa sa)
+    go (FChoice qfn rdm y t m d ts) (A pa ca fa sa) = FChoice qfn rdm y t m d $ W.mapWithKey f (fmap go ts)
+        where f k             r = r (A pa ca (M.insert qfn k fa) sa)
+    go (SChoice qsn rdm y t     ts) (A pa ca fa sa) = SChoice qsn rdm y t     $ W.mapWithKey f (fmap go ts)
+        where f k             r = r (A pa ca fa (M.insert qsn k sa))
     go (GoalChoice  rdm         ts) a            = GoalChoice  rdm         $ fmap ($ a) (fmap go ts)
 
 -- | A tree traversal that simultaneously propagates conflict sets up