/
tag.go
121 lines (106 loc) · 3.02 KB
/
tag.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
/*
Copyright 2015 Shlomi Noach, courtesy Booking.com
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package inst
import (
"fmt"
"regexp"
"strings"
)
type Tag struct {
TagName string
TagValue string
HasValue bool
Negate bool
}
var (
negateTagEqualsRegexp = regexp.MustCompile("^~([^=]+)=(.*)$")
TagEqualsRegexp = regexp.MustCompile("^([^=]+)=(.*)$")
negateTagExistsRegexp = regexp.MustCompile("^~([^=]+)$")
tagExistsRegexp = regexp.MustCompile("^([^=]+)$")
)
func NewTag(tagName string, tagValue string) (*Tag, error) {
tagName = strings.TrimSpace(tagName)
if tagName == "" {
return nil, fmt.Errorf("NewTag: empty tag name")
}
return &Tag{TagName: tagName, TagValue: tagValue}, nil
}
func ParseTag(tagString string) (*Tag, error) {
tagString = strings.Replace(tagString, "!", "~", -1)
tagString = strings.TrimSpace(tagString)
if submatch := negateTagEqualsRegexp.FindStringSubmatch(tagString); len(submatch) > 0 {
return &Tag{
TagName: submatch[1],
TagValue: submatch[2],
HasValue: true,
Negate: true,
}, nil
} else if submatch := TagEqualsRegexp.FindStringSubmatch(tagString); len(submatch) > 0 {
return &Tag{
TagName: submatch[1],
TagValue: submatch[2],
HasValue: true,
}, nil
} else if submatch := negateTagExistsRegexp.FindStringSubmatch(tagString); len(submatch) > 0 {
return &Tag{
TagName: submatch[1],
Negate: true,
}, nil
} else if submatch := tagExistsRegexp.FindStringSubmatch(tagString); len(submatch) > 0 {
return &Tag{
TagName: submatch[1],
}, nil
}
return nil, fmt.Errorf("Unable to parse tag: %s", tagString)
}
func (tag *Tag) String() string {
return fmt.Sprintf("%s=%s", tag.TagName, tag.TagValue)
}
func (tag *Tag) Display() string {
if tag.TagValue == "" {
return tag.TagName
}
return fmt.Sprintf("%s=%s", tag.TagName, tag.TagValue)
}
func ParseIntersectTags(tagsString string) (tags [](*Tag), err error) {
for _, tagString := range strings.Split(tagsString, ",") {
tag, err := ParseTag(tagString)
if err != nil {
return tags, err
}
tags = append(tags, tag)
}
return tags, nil
}
type InstanceTag struct {
Key InstanceKey
T Tag
}
func GetInstanceKeysByTags(tagsString string) (tagged *InstanceKeyMap, err error) {
tags, err := ParseIntersectTags(tagsString)
if err != nil {
return tagged, err
}
for i, tag := range tags {
taggedByTag, err := GetInstanceKeysByTag(tag)
if err != nil {
return tagged, err
}
if i == 0 {
tagged = taggedByTag
} else {
tagged = tagged.Intersect(taggedByTag)
}
}
return tagged, nil
}