Modulecabal-install-solver-3.12.1.0Haskell2010

Distribution.Solver.Modular.Solver

2 types
1 value

Packagecabal-install-solver-3.12.1.0
Exports3
LanguageHaskell2010
LicenceBSD-3-Clause
SourceSolver.hs

datadata SolverConfig

Various options for the modular solver.

Constructors

SolverConfig
- reorderGoals :: ReorderGoals
- countConflicts :: CountConflicts
- fineGrainedConflicts :: FineGrainedConflicts
- minimizeConflictSet :: MinimizeConflictSet
- independentGoals :: IndependentGoals
- avoidReinstalls :: AvoidReinstalls
- shadowPkgs :: ShadowPkgs
- strongFlags :: StrongFlags
- onlyConstrained :: OnlyConstrained
- maxBackjumps :: Maybe Int
- enableBackjumping :: EnableBackjumping
- solveExecutables :: SolveExecutables
- goalOrder :: Maybe (Variable QPN -> Variable QPN -> Ordering)
- solverVerbosity :: Verbosity
- pruneAfterFirstSuccess :: PruneAfterFirstSuccess

valuesolve

:: SolverConfig
solver parameters
-> CompilerInfo
-> Index
all available packages as an index
-> PkgConfigDb
available pkg-config pkgs
-> (PN -> PackagePreferences)
preferences
-> Map PN [LabeledPackageConstraint]
global constraints
-> Set PN
global goals
-> RetryLog Message SolverFailure (Assignment, RevDepMap)

Run all solver phases.

In principle, we have a valid tree after validationPhase, which means that every Done node should correspond to valid solution.

There is one exception, though, and that is cycle detection, which has been added relatively recently. Cycles are only removed directly before exploration.

newtypenewtype PruneAfterFirstSuccess

Whether to remove all choices after the first successful choice at each level in the search tree.

Constructors

PruneAfterFirstSuccess Bool