-
Notifications
You must be signed in to change notification settings - Fork 2
/
stringset.go
91 lines (75 loc) · 1.49 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
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
package goset
import "sort"
var none = struct{}{}
type StringSet struct {
Map map[string]struct{}
}
func NewStringSet(values ... string) *StringSet {
a := new(StringSet)
a.Map = make(map[string]struct{}, len(values))
for _,v := range values{
a.Map[v] = none
}
return a
}
func (a *StringSet) Add(elements ...string) *StringSet {
for _, e := range elements {
a.Map[e] = none
}
return a
}
func (a *StringSet) Remove(elements ...string) *StringSet {
for _, e := range elements {
delete(a.Map, e)
}
return a
}
func (a *StringSet) Contains(elements ...string) bool {
for _, e := range elements {
if _, ok := a.Map[e]; !ok{
return false
}
}
return true
}
func (a *StringSet)ContainsSet(b *StringSet) bool{
for element, _ := range b.Map{
if _, ok := a.Map[element]; !ok {
return false
}
}
return true
}
func (a *StringSet) Size() int {
return len(a.Map)
}
func (a *StringSet) RemoveSet(b *StringSet) *StringSet {
for element, _ := range b.Map {
delete(a.Map, element)
}
return a
}
func (a *StringSet) AddSet(b *StringSet) *StringSet {
for element, _ := range b.Map {
a.Map[element] = none
}
return a
}
func (a *StringSet) InterSection(b *StringSet) *StringSet {
for element, _ := range a.Map {
if _, ok := b.Map[element]; !ok {
delete(a.Map, element)
}
}
return a
}
func (a *StringSet) ToSortedSlice() []string {
slice := make([]string, len(a.Map))
i := 0
for element, _ := range a.Map {
slice[i] = element
i++
}
sort.Strings(slice)
return slice
}