-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.go
120 lines (105 loc) · 1.88 KB
/
set.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
package set
import (
"fmt"
"strings"
)
type Set[T comparable] map[T]struct{}
func New[T comparable]() Set[T] {
return make(Set[T])
}
func (s Set[T]) String() string {
items := make([]string, 0, len(s))
for elem := range s {
items = append(items, fmt.Sprintf("%v", elem))
}
return fmt.Sprintf("Set{%s}", strings.Join(items, ", "))
}
func (s Set[T]) Clone() Set[T] {
clonedSet := New[T]()
for elem := range s {
clonedSet.Add(elem)
}
return clonedSet
}
func (s Set[T]) Equal(other Set[T]) bool {
if len(s) != len(other) {
return false
}
for elem := range s {
if !other.Contains(elem) {
return false
}
}
return true
}
func (s Set[T]) Add(v ...T) {
for _, val := range v {
s[val] = struct{}{}
}
}
func (s Set[T]) Pop() (v T, ok bool) {
for item := range s {
delete(s, item)
return item, true
}
return v, false
}
func (s Set[T]) Contains(v T) (ok bool) {
_, ok = s[v]
return ok
}
func (s Set[T]) Difference(other Set[T]) Set[T] {
diff := New[T]()
for elem := range s {
if !other.Contains(elem) {
diff.Add(elem)
}
}
return diff
}
func (s Set[T]) SymmetricDifference(other Set[T]) Set[T] {
sd := New[T]()
for elem := range s {
if !other.Contains(elem) {
sd.Add(elem)
}
}
for elem := range other {
if !s.Contains(elem) {
sd.Add(elem)
}
}
return sd
}
func (s Set[T]) Union(other Set[T]) Set[T] {
n := len(s)
if len(other) > n {
n = len(other)
}
unionedSet := make(Set[T], n)
for elem := range s {
unionedSet.Add(elem)
}
for elem := range other {
unionedSet.Add(elem)
}
return unionedSet
}
func (s Set[T]) Intersection(other Set[T]) Set[T] {
intersection := New[T]()
// loop over smaller set
if len(s) < len(other) {
for elem := range s {
if other.Contains(elem) {
intersection.Add(elem)
}
}
} else {
for elem := range other {
if s.Contains(elem) {
intersection.Add(elem)
}
}
}
return intersection
}