This repository has been archived by the owner on Oct 10, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 194
/
strings.go
85 lines (74 loc) · 1.52 KB
/
strings.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
// Copyright 2022 VMware, Inc. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
// Package sets provides sets of different types, e.g. StringSet.
package sets
type StringSet map[string]struct{}
func Strings(ss ...string) StringSet {
r := make(StringSet, len(ss))
return r.Add(ss...)
}
func (set StringSet) Add(ss ...string) StringSet {
for _, s := range ss {
set[s] = struct{}{}
}
return set
}
func (set StringSet) Remove(ss ...string) StringSet {
for _, s := range ss {
delete(set, s)
}
return set
}
func (set StringSet) Has(s string) bool {
_, has := set[s]
return has
}
func (set StringSet) Intersect(others ...StringSet) StringSet {
return set.Filter(func(s string) bool {
for _, other := range others {
if !other.Has(s) {
return false
}
}
return true
})
}
func (set StringSet) Map(f func(s string) string) StringSet {
r := make(StringSet, len(set))
for s := range set {
r[f(s)] = struct{}{}
}
return r
}
func (set StringSet) Filter(f func(s string) bool) StringSet {
r := make(StringSet, len(set))
for s := range set {
if f(s) {
r[s] = struct{}{}
}
}
return r
}
func (set StringSet) Union(sets ...StringSet) StringSet {
sets = append(sets, set)
sizeBound := 0
for _, aSet := range sets {
sizeBound += len(aSet)
}
r := make(StringSet, sizeBound)
for _, aSet := range sets {
for s := range aSet {
r[s] = struct{}{}
}
}
return r
}
func (set StringSet) Slice() []string {
r := make([]string, len(set))
i := 0
for key := range set {
r[i] = key
i++
}
return r
}