-
Notifications
You must be signed in to change notification settings - Fork 2
/
cmp.go
249 lines (232 loc) · 5.63 KB
/
cmp.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
package sets
// Difference returns a set of objects that are not in s2
// For example:
// s1 = {a1, a2, a3}
// s2 = {a1, a2, a4, a5}
// s1.Difference(s2) = {a3}
// s2.Difference(s1) = {a4, a5}.
func (s Set[T]) Difference(s2 Set[T]) Set[T] {
result := newSet[T](len(s))
for key := range s {
if !s2.Contains(key) {
result[key] = struct{}{}
}
}
return result
}
// Union returns a new set which includes items in either s1 or s2.
// For example:
// s1 = {a1, a2}
// s2 = {a3, a4}
// s1.Union(s2) = {a1, a2, a3, a4}
// s2.Union(s1) = {a1, a2, a3, a4}.
func (s Set[T]) Union(s2 Set[T]) Set[T] {
result := newSet[T](len(s) + len(s2))
for key := range s {
result[key] = struct{}{}
}
for key := range s2 {
result[key] = struct{}{}
}
return result
}
// Intersection returns a new set which includes the item in BOTH s1 and s2
// For example:
// s1 = {a1, a2}
// s2 = {a2, a3}
// s1.Intersection(s2) = {a2}.
func (s Set[T]) Intersection(s2 Set[T]) Set[T] {
var walk, other Set[T]
if s.Len() < s2.Len() {
walk = s
other = s2
} else {
walk = s2
other = s
}
ret := newSet[T](min(len(s), len(s2)))
for key := range walk {
if other.Contains(key) {
ret[key] = struct{}{}
}
}
return ret
}
// Vary returns s vary of s2, return added, removed sets
// with the given s2 set.
// For example:
// s1 = {a1, a3, a5, a7}
// s2 = {a3, a4, a5, a6}
// added = {a4, a6}
// removed = {a1, a7}
func (s Set[T]) Vary(s2 Set[T]) (added, removed Set[T]) {
removed = newSet[T](len(s))
added = newSet[T](len(s2))
for key := range s {
if !s2.Contains(key) {
removed[key] = struct{}{}
}
}
for key := range s2 {
if !s.Contains(key) {
added[key] = struct{}{}
}
}
return added, removed
}
// DiffVary returns s vary of s2, return added, removed sets
// with the given s2 set.
//
// Deprecated: use Vary instead.
func (s Set[T]) DiffVary(s2 Set[T]) (added, removed Set[T]) {
return s.Vary(s2)
}
// VaryIntersection returns s vary of s2, return added, removed, remained sets with the given s2 set.
// For example:
// s1 = {a1, a3, a5, a7}
// s2 = {a3, a4, a5, a6}
// added = {a4, a6}
// removed = {a1, a7}
// remained = {a3, a6}
func (s Set[T]) VaryIntersection(s2 Set[T]) (added, removed, remained Set[T]) {
removed = newSet[T](len(s))
added = newSet[T](len(s2))
remained = newSet[T](len(s))
for key := range s {
if s2.Contains(key) {
remained[key] = struct{}{}
} else {
removed[key] = struct{}{}
}
}
for key := range s2 {
if !s.Contains(key) {
added[key] = struct{}{}
}
}
return added, removed, remained
}
// Diff returns s vary of s2, return added, removed, remained sets with the given s2 set.
//
// Deprecated: use VaryIntersection instead.
func (s Set[T]) Diff(s2 Set[T]) (added, removed, remained Set[T]) {
return s.VaryIntersection(s2)
}
//* diff slices
// DifferenceSlice returns a slices of objects that are not in s2
// For example:
// s1 = {a1, a2, a3}
// s2 = {a1, a2, a4, a5}
// s1.Difference(s2) = {a3}
// s2.Difference(s1) = {a4, a5}.
func (s Set[T]) DifferenceSlice(s2 Set[T]) []T {
result := make([]T, 0, len(s))
for key := range s {
if !s2.Contains(key) {
result = append(result, key)
}
}
return result
}
// UnionSlice returns a slice which includes items in either s1 or s2.
// For example:
// s1 = {a1, a2}
// s2 = {a3, a4}
// s1.Union(s2) = {a1, a2, a3, a4}
// s2.Union(s1) = {a1, a2, a3, a4}.
func (s Set[T]) UnionSlice(s2 Set[T]) []T {
result := make([]T, 0, len(s)+len(s2))
for key := range s {
result = append(result, key)
}
for key := range s2 {
if !s.Contains(key) {
result = append(result, key)
}
}
return result
}
// IntersectionSlice returns a slice which includes the item in BOTH s1 and s2
// For example:
// s1 = {a1, a2}
// s2 = {a2, a3}
// s1.Intersection(s2) = {a2}.
func (s Set[T]) IntersectionSlice(s2 Set[T]) []T {
var walk, other Set[T]
if s.Len() < s2.Len() {
walk = s
other = s2
} else {
walk = s2
other = s
}
ret := make([]T, 0, min(len(s), len(s2)))
for key := range walk {
if other.Contains(key) {
ret = append(ret, key)
}
}
return ret
}
// VarySlice returns s vary of s2, return added, removed slices
// with the given s2 set.
// For example:
// s1 = {a1, a3, a5, a7}
// s2 = {a3, a4, a5, a6}
// added = {a4, a6}
// removed = {a1, a7}
func (s Set[T]) VarySlice(s2 Set[T]) (added, removed []T) {
removed = make([]T, 0, len(s))
added = make([]T, 0, len(s2))
for key := range s {
if !s2.Contains(key) {
removed = append(removed, key)
}
}
for key := range s2 {
if !s.Contains(key) {
added = append(added, key)
}
}
return added, removed
}
// DiffVarySlice returns s vary of s2, return added, removed slices
// with the given s2 set.
//
// Deprecated: use VarySlice instead.
func (s Set[T]) DiffVarySlice(s2 Set[T]) (added, removed []T) {
return s.VarySlice(s2)
}
// DiffSlice returns s vary of s2, return added, removed, remained slices
// with the given s2 set.
// For example:
// s1 = {a1, a3, a5, a7}
// s2 = {a3, a4, a5, a6}
// added = {a4, a6}
// removed = {a1, a7}
// remained = {a3, a6}
func (s Set[T]) VaryIntersectionSlice(s2 Set[T]) (added, removed, remained []T) {
removed = make([]T, 0, len(s))
added = make([]T, 0, len(s2))
remained = make([]T, 0, len(s))
for key := range s {
if s2.Contains(key) {
remained = append(remained, key)
} else {
removed = append(removed, key)
}
}
for key := range s2 {
if !s.Contains(key) {
added = append(added, key)
}
}
return added, removed, remained
}
// DiffSlice returns s vary of s2, return added, removed, remained slices
// with the given s2 set.
//
// Deprecated: use VaryIntersectionSlice instead.
func (s Set[T]) DiffSlice(s2 Set[T]) (added, removed, remained []T) {
return s.VaryIntersectionSlice(s2)
}