forked from vmware-archive/atc
-
Notifications
You must be signed in to change notification settings - Fork 0
/
build_set.go
83 lines (64 loc) · 1.25 KB
/
build_set.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
package algorithm
import (
"fmt"
"sort"
"strings"
)
type BuildSet map[int]struct{}
func (set BuildSet) Contains(buildID int) bool {
_, found := set[buildID]
return found
}
func (set BuildSet) Union(otherSet BuildSet) BuildSet {
newSet := BuildSet{}
for buildID, _ := range set {
newSet[buildID] = struct{}{}
}
for buildID, _ := range otherSet {
newSet[buildID] = struct{}{}
}
return newSet
}
func (set BuildSet) Intersect(otherSet BuildSet) BuildSet {
result := BuildSet{}
for key, val := range set {
_, found := otherSet[key]
if found {
result[key] = val
}
}
return result
}
func (set BuildSet) Overlaps(otherSet BuildSet) bool {
check := set
against := otherSet
if len(check) > len(against) {
check, against = against, check
}
for key, _ := range check {
_, found := against[key]
if found {
return true
}
}
return false
}
func (set BuildSet) Equal(otherSet BuildSet) bool {
if len(set) != len(otherSet) {
return false
}
for x, _ := range set {
if !otherSet.Contains(x) {
return false
}
}
return true
}
func (set BuildSet) String() string {
xs := []string{}
for x, _ := range set {
xs = append(xs, fmt.Sprintf("%v", x))
}
sort.Strings(xs)
return fmt.Sprintf("{%s}", strings.Join(xs, " "))
}