/
artifact_sort.go
154 lines (124 loc) · 3.33 KB
/
artifact_sort.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
/*
Copyright © 2022-2023 Macaroni OS Linux
See AUTHORS and LICENSE for the license details and contributors.
*/
package repository
import (
"sort"
artifact "github.com/geaaru/luet/pkg/v2/compiler/types/artifact"
)
func SortArtifactList4VersionAndRepos(artsref *[]*artifact.PackageArtifact,
rmap *map[string]*WagonRepository, reverse bool) {
arts := *artsref
mapRepos := *rmap
// Sort packages ordered for version and for repository priority.
sort.Slice(arts[:], func(i, j int) bool {
arti := arts[i]
artj := arts[j]
pi, _ := arti.GetPackage().ToGentooPackage()
pj, _ := artj.GetPackage().ToGentooPackage()
// NOTE: If i don't find the repository in the
// map i consider a priority with value 100
irprio := 100
jrprio := 100
if r, ok := mapRepos[pi.Repository]; ok {
irprio = r.Identity.Priority
}
if r, ok := mapRepos[pj.Repository]; ok {
jrprio = r.Identity.Priority
}
sameVersion, _ := pi.Equal(pj)
if sameVersion {
if reverse {
return irprio > jrprio
} else {
return irprio < jrprio
}
} else {
ans, _ := pi.LessThan(pj)
if reverse {
return !ans
} else {
return ans
}
}
})
}
func SortArtifactList4RequiresAndRepos(artsref *[]*artifact.PackageArtifact,
rmap *map[string]*WagonRepository) {
arts := *artsref
mapRepos := *rmap
// Sort packages ordered for number of requires
// and for repository priority
sort.Slice(arts[:], func(i, j int) bool {
arti := arts[i]
artj := arts[j]
pi := arti.GetPackage()
pj := artj.GetPackage()
ireq := pi.HasRequires()
jreq := pj.HasRequires()
// NOTE: If i don't find the repository in the
// map i consider a priority with value 100
irprio := 100
jrprio := 100
if r, ok := mapRepos[pi.Repository]; ok {
irprio = r.Identity.Priority
}
if r, ok := mapRepos[pj.Repository]; ok {
jrprio = r.Identity.Priority
}
if ireq && jreq {
if len(pi.PackageRequires) == len(pj.PackageRequires) {
return irprio < jrprio
}
return len(pi.PackageRequires) < len(pj.PackageRequires)
} else if !ireq && !jreq {
return irprio < jrprio
} else if !ireq {
return true
}
return false
})
}
// Sort packages ordered for repository priority,
// for number of requires and for PackageName()
func SortArtifactList4ReposAndRequires(artsref *[]*artifact.PackageArtifact,
rmap *map[string]*WagonRepository) {
arts := *artsref
mapRepos := *rmap
// Sort packages ordered for number of requires
// and for repository priority
sort.Slice(arts[:], func(i, j int) bool {
arti := arts[i]
artj := arts[j]
pi := arti.GetPackage()
pj := artj.GetPackage()
ireq := pi.HasRequires()
jreq := pj.HasRequires()
// NOTE: If i don't find the repository in the
// map i consider a priority with value 100
irprio := 100
jrprio := 100
if r, ok := mapRepos[pi.Repository]; ok {
irprio = r.Identity.Priority
}
if r, ok := mapRepos[pj.Repository]; ok {
jrprio = r.Identity.Priority
}
if irprio == jrprio {
if ireq && jreq {
if len(pi.PackageRequires) == len(pj.PackageRequires) {
return pi.PackageName() < pj.PackageName()
}
return len(pi.PackageRequires) < len(pj.PackageRequires)
} else if !ireq && !jreq {
return pi.PackageName() < pj.PackageName()
} else if !ireq {
return true
}
} else {
return irprio < jrprio
}
return false
})
}