-
Notifications
You must be signed in to change notification settings - Fork 1.6k
/
stringset.go
58 lines (46 loc) · 1.41 KB
/
stringset.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
/*
Copyright 2020 The Skaffold Authors
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 stringset
import "sort"
type unit struct{}
// StringSet helps to de-duplicate a set of strings.
type StringSet map[string]unit
// New returns a new StringSet object.
func New() StringSet {
return make(map[string]unit)
}
// Insert adds strings to the set.
func (s StringSet) Insert(strings ...string) {
for _, item := range strings {
s[item] = unit{}
}
}
// ToList returns the sorted list of inserted strings.
func (s StringSet) ToList() []string {
var res []string
for item := range s {
res = append(res, item)
}
sort.Strings(res)
return res
}
// Delete deletes the specified string in the set
// if set is nil or string is not present, its a no-op
func (s StringSet) Delete(str string) {
delete(s, str)
}
// Contains checks if a specified string is present in the set.
func (s StringSet) Contains(str string) bool {
_, ok := s[str]
return ok
}