module Distribution.Solver.Modular.Log
( displayLogMessages
, SolverFailure(..)
) where
import Prelude ()
import Distribution.Solver.Compat.Prelude
import Distribution.Solver.Types.Progress
import Distribution.Solver.Modular.Dependency
import Distribution.Solver.Modular.Message
import Distribution.Solver.Modular.RetryLog
data SolverFailure =
ExhaustiveSearch ConflictSet ConflictMap
| BackjumpLimitReached
displayLogMessages :: Bool
-> RetryLog Message SolverFailure a
-> RetryLog String SolverFailure a
displayLogMessages :: forall a.
Bool
-> RetryLog Message SolverFailure a
-> RetryLog String SolverFailure a
displayLogMessages Bool
keepLog RetryLog Message SolverFailure a
lg = forall step fail done.
Progress step fail done -> RetryLog step fail done
fromProgress forall a b. (a -> b) -> a -> b
$
if Bool
keepLog
then forall a b. Progress Message a b -> Progress String a b
showMessages Progress Message SolverFailure a
progress
else forall step a fail done.
(step -> a -> a)
-> (fail -> a) -> (done -> a) -> Progress step fail done -> a
foldProgress (forall a b. a -> b -> a
const forall a. a -> a
id) forall step fail done. fail -> Progress step fail done
Fail forall step fail done. done -> Progress step fail done
Done Progress Message SolverFailure a
progress
where
progress :: Progress Message SolverFailure a
progress = forall step fail done.
RetryLog step fail done -> Progress step fail done
toProgress RetryLog Message SolverFailure a
lg