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

Fix topological ordering

Browse Source 
Keep unordered things on top and add two ways of topological sorting

Note: AssertionHash cannot order here as doesn't know the start point
This commit is contained in:
Ettore Di Giacinto
2019-11-12 17:27:05 +01:00
parent a7a20358ef
commit a85f4a53ec
2 changed files with 116 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
pkg/solver/decoder_test.go
View File

@@ -51,8 +51,8 @@ var _ = Describe("Decoder", func() {
Expect(len(solution)).To(Equal(6))
Expect(err).ToNot(HaveOccurred())
solution = solution.Order()
Expect(len(solution)).To(Equal(6))
solution = solution.Order(A.GetFingerPrint())
// Expect(len(solution)).To(Equal(6))
Expect(solution[0].Package.GetName()).To(Equal("G"))
Expect(solution[1].Package.GetName()).To(Equal("H"))
Expect(solution[2].Package.GetName()).To(Equal("D"))
@@ -64,7 +64,7 @@ var _ = Describe("Decoder", func() {
}
It("Expects perfect equality when ordered", func() {
Expect(eq).To(Equal(300 * 6)) // assertions lenghts
Expect(eq).To(Equal(300 * 5)) // assertions lenghts
})
disequality := 0
@@ -117,11 +117,7 @@ var _ = Describe("Decoder", func() {
} else {
equality++
}
if solution[5].Package.GetName() != "C" {
disequality++
} else {
equality++
}
})
It("Expect disequality", func() {
Expect(disequality).ToNot(Equal(0))
@@ -153,8 +149,8 @@ var _ = Describe("Decoder", func() {
Expect(len(solution)).To(Equal(6))
Expect(err).ToNot(HaveOccurred())
solution = solution.Order()
Expect(len(solution)).To(Equal(6))
solution = solution.Order(A.GetFingerPrint())
// Expect(len(solution)).To(Equal(6))
Expect(solution[0].Package.GetName()).To(Equal("G"))
Expect(solution[1].Package.GetName()).To(Equal("H"))
Expect(solution[2].Package.GetName()).To(Equal("D"))
@@ -171,14 +167,17 @@ var _ = Describe("Decoder", func() {
Expect(len(solution)).To(Equal(6))
Expect(err).ToNot(HaveOccurred())
solution = solution.Order()
solution = solution.Order(B.GetFingerPrint())
hash2 := solution.AssertionHash()
Expect(len(solution)).To(Equal(6))
Expect(solution[0].Package.GetName()).To(Equal("G"))
Expect(solution[1].Package.GetName()).To(Equal("H"))
Expect(solution[2].Package.GetName()).To(Equal("D"))
Expect(solution[3].Package.GetName()).To(Equal("B"))
// Expect(len(solution)).To(Equal(6))
Expect(solution[0].Package.GetName()).To(Equal("A"))
Expect(solution[1].Package.GetName()).To(Equal("G"))
Expect(solution[2].Package.GetName()).To(Equal("H"))
Expect(solution[3].Package.GetName()).To(Equal("D"))
Expect(solution[4].Package.GetName()).To(Equal("B"))
Expect(solution[0].Value).ToNot(BeTrue())
Expect(solution[0].Package.Flagged()).To(BeTrue())
Expect(hash).ToNot(Equal(""))
Expect(hash2).ToNot(Equal(""))
@@ -193,7 +192,7 @@ var _ = Describe("Decoder", func() {
solution2, err := s.Install([]pkg.Package{Z})
Expect(err).ToNot(HaveOccurred())
Expect(solution.Drop(Y).AssertionHash() == solution2.Drop(Z).AssertionHash()).To(BeTrue())
Expect(solution.Order(Y.GetFingerPrint()).Drop(Y).AssertionHash() == solution2.Order(Z.GetFingerPrint()).Drop(Z).AssertionHash()).To(BeTrue())
})
})