-
Notifications
You must be signed in to change notification settings - Fork 116
/
labels.go
106 lines (95 loc) · 2.35 KB
/
labels.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
package parser
import (
"fmt"
"strings"
)
const (
NoLabel = "NoLabel"
)
// LabelsFromString "key1=value1,key2,key3=value3" to a key-value map.
func LabelsFromString(str string) (map[string]string, error) {
if len(str) == 0 {
return nil, nil
}
labels := strings.Split(str, ",")
m := make(map[string]string, len(labels))
for _, v := range labels {
if strings.Contains(v, "=") {
label := strings.SplitN(v, "=", 2)
if len(label) != 2 {
return m, fmt.Errorf("Malformed label: %s", v)
}
if _, ok := m[label[0]]; ok {
return m, fmt.Errorf("Duplicate label: %s", v)
}
m[label[0]] = label[1]
} else if len(v) != 0 {
m[v] = ""
}
}
return m, nil
}
// LabeToString convert key-value map to "key1=value1,key2,key3=value3"
func LabelsToString(labels map[string]string) string {
l := ""
for k, v := range labels {
if len(l) != 0 {
l += ","
}
if len(v) != 0 {
l += k + "=" + v
} else if len(k) != 0 {
l += k
}
}
return l
}
// MergeLabels merge 2 key-value map to single key value map, overriding keys in old.
func MergeLabels(old map[string]string, new map[string]string) map[string]string {
if old == nil {
return new
}
if new == nil {
return old
}
m := make(map[string]string, len(old)+len(new))
for k, v := range old {
m[k] = v
}
for k, v := range new {
m[k] = v
}
return m
}
func hasLabels(set, subset map[string]string, matchValue bool) bool {
for k, v1 := range subset {
if v2, ok := set[k]; !ok || (matchValue && v1 != v2) {
return false
}
}
return true
}
// HasLabels returns true if subset kv mappings exist in set
func HasLabels(set, subset map[string]string) bool {
return hasLabels(set, subset, true)
}
// HasLabelKeys returns true if subset keys exist in set
func HasLabelKeys(set, subset map[string]string) bool {
return hasLabels(set, subset, false)
}
func hasAnyLabel(set, subset map[string]string, matchValue bool) bool {
for k, v1 := range subset {
if v2, ok := set[k]; ok && (!matchValue || v1 == v2) {
return true
}
}
return false
}
// HasAnyLabel returns true if atleast of kv pair of subset exists in set.
func HasAnyLabel(set, subset map[string]string) bool {
return hasAnyLabel(set, subset, true)
}
// HasAnyLabel returns true if atleast one key from subset exists in set.
func HasAnyLabelKey(set, subset map[string]string) bool {
return hasAnyLabel(set, subset, false)
}