-
Notifications
You must be signed in to change notification settings - Fork 5
/
any.go
96 lines (81 loc) · 1.68 KB
/
any.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
package set
type AnyHashSet map[interface{}]struct{}
func NewAnyHashSet(items ...interface{}) AnyHashSet {
set := AnyHashSet{}
for _, item := range items {
set[item] = struct{}{}
}
return set
}
func (s AnyHashSet) Add(items ...interface{}) {
for _, item := range items {
s[item] = struct{}{}
}
}
func (s AnyHashSet) Remove(items ...interface{}) {
for _, item := range items {
delete(s, item)
}
}
func (s AnyHashSet) Values() []interface{} {
values := make([]interface{}, 0, len(s))
for k := range s {
values = append(values, k)
}
return values
}
func (s AnyHashSet) Range(fn func(item interface{})) {
for k := range s {
fn(k)
}
}
func (s AnyHashSet) Contains(item string) bool {
_, ok := s[item]
return ok
}
func (s AnyHashSet) ContainAll(items ...interface{}) bool {
for _, item := range items {
if _, ok := s[item]; !ok {
return false
}
}
return true
}
func (s AnyHashSet) ContainAny(items ...string) bool {
for _, item := range items {
if _, ok := s[item]; ok {
return true
}
}
return false
}
func (s AnyHashSet) Size() int {
return len(s)
}
func (s AnyHashSet) Union(o AnyHashSet) AnyHashSet {
n := NewAnyHashSet(s.Values()...)
for k := range o {
n[k] = struct{}{}
}
return n
}
func (s AnyHashSet) InterSection(o AnyHashSet) AnyHashSet {
n := NewAnyHashSet()
for k := range s {
if _, ok := o[k]; ok {
n[k] = struct{}{}
}
}
return n
}
func (s AnyHashSet) Difference(o AnyHashSet) AnyHashSet {
n := NewAnyHashSet(s.Values()...)
n.Remove(o.Values()...)
return n
}
func (s AnyHashSet) IsSuperSet(o AnyHashSet) bool {
return s.ContainAll(o.Values()...)
}
func (s AnyHashSet) IsSubSet(o AnyHashSet) bool {
return o.ContainAll(s.Values()...)
}