/
labelset.go
67 lines (56 loc) · 1.05 KB
/
labelset.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
package promtail
import (
"fmt"
"hash/fnv"
"sort"
"strings"
)
type LabelSet map[string]string
func (ls LabelSet) Append(label string, value string) LabelSet {
ls[label] = value
return ls
}
func (ls LabelSet) Copy() LabelSet {
c := make(LabelSet, len(ls))
for k, v := range ls {
c[k] = v
}
return c
}
func (ls LabelSet) String() string {
d := make([]string, 0, len(ls))
for k, v := range ls {
d = append(d, fmt.Sprintf("%s=%q", k, v))
}
sort.Strings(d)
return fmt.Sprintf("{%s}", strings.Join(d, ", "))
}
func (ls LabelSet) WithExtras(extra LabelSet) LabelSet {
d := make(LabelSet, len(ls))
for k, v := range ls {
d[k] = v
}
for k, v := range extra {
d[k] = v
}
return d
}
func hash(arr []string) uint64 {
h := fnv.New64a()
for _, s := range arr {
_, _ = h.Write([]byte(s))
}
return h.Sum64()
}
func (ls LabelSet) Fingerprint() uint64 {
if len(ls) == 0 {
return 0
}
var labels []string
for k, v := range ls {
labels = append(labels, fmt.Sprintf("%s:%s", k, v))
}
sort.Strings(labels)
hash := hash(labels)
return hash
}