-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathversion.go
114 lines (97 loc) · 1.89 KB
/
version.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
package main
import (
"fmt"
"regexp"
"strconv"
)
type version struct {
major, minor, patch int
pkg string
}
type versionMap map[string]version
func (v *version) String() string {
return fmt.Sprintf("%d.%d.%d", v.major, v.minor, v.patch)
}
func (v *version) isLargerThan(w version) bool {
if v.major > w.major {
return true
} else if w.major > v.major {
return false
}
if v.minor > w.minor {
return true
} else if w.minor > v.minor {
return false
}
if v.patch > w.patch {
return true
} else if w.patch > v.patch {
return false
}
return false
}
// if they are the same return w
func versionMax(v, w version) version {
if v.isLargerThan(w) {
return v
}
return w
}
func getMajorMinorPatch(major, minor, patch string) (int, int, int, error) {
maj, min, pat := 0, 0, 0
var err error
maj, err = strconv.Atoi(major)
if err != nil {
return maj, min, pat, err
}
min, err = strconv.Atoi(minor)
if err != nil {
return maj, min, pat, err
}
pat, err = strconv.Atoi(patch)
if err != nil {
return maj, min, pat, err
}
return maj, min, pat, err
}
func filterKmps(kmps []string) (versionMap, error) {
have := make(versionMap)
re := regexp.MustCompile(`^kmod-drbd-(\d+)\.(\d+)\.(\d+)_(.*)-.*\.rpm$`)
for _, file := range kmps {
matches := re.FindStringSubmatch(file)
if len(matches) != 5 {
continue
}
major, minor, patch, err := getMajorMinorPatch(matches[1], matches[2], matches[3])
if err != nil {
continue
}
v := version{
major: major,
minor: minor,
patch: patch,
pkg: matches[0],
}
kpart := matches[4]
ev, ok := have[kpart]
if ok {
have[kpart] = versionMax(ev, v)
} else {
have[kpart] = v
}
}
vmax := version{
major: 0,
minor: 0,
patch: 0,
}
for _, v := range have {
vmax = versionMax(vmax, v)
}
for k, v := range have {
if vmax.isLargerThan(v) {
delete(have, k)
}
}
return have, nil
}