kairos/luet
1
0
Fork 0
mirror of https://github.com/mudler/luet.git synced 2025-09-02 07:45:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Do not call solver multiple times, reuse same assertion

Browse Source 
Introduce Cut(), it allows to filter in the assertion to achieve the same hashes
This commit is contained in:
Ettore Di Giacinto
2019-12-14 15:00:16 +01:00
parent c4b83605ef
commit fe608469d8
4 changed files with 50 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
pkg/compiler/compiler.go
View File

@@ -442,17 +442,13 @@ func (cs *LuetCompiler) ComputeDepTree(p CompilationSpec) (solver.PackagesAssert
dependencies := solution.Order(cs.Database, p.GetPackage().GetFingerPrint())
assertions := solver.PackagesAssertions{}
for _, assertion := range dependencies { //highly dependent on the order
if assertion.Value {
nthsolution, err := s.Install([]pkg.Package{assertion.Package})
if err != nil {
return nil, errors.Wrap(err, "While computing a solution for "+p.GetPackage().GetName())
}
nthsolution := dependencies.Cut(assertion.Package)
assertion.Hash = solver.PackageHash{
BuildHash: nthsolution.Order(cs.Database, assertion.Package.GetFingerPrint()).Drop(assertion.Package).AssertionHash(),
PackageHash: nthsolution.Order(cs.Database, assertion.Package.GetFingerPrint()).AssertionHash(),
BuildHash: nthsolution.Drop(assertion.Package).AssertionHash(),
PackageHash: nthsolution.AssertionHash(),
}
assertions = append(assertions, assertion)
}