-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsetops.go
75 lines (59 loc) · 1.24 KB
/
setops.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
package setops
import (
"cmp"
"slices"
)
func Union[T cmp.Ordered](s1, s2 []T) []T {
var r []T
m := make(map[T]struct{})
for i := 0; i < len(s1); i++ {
if _, ok := m[s1[i]]; !ok {
m[s1[i]] = struct{}{}
}
}
for i := 0; i < len(s2); i++ {
if _, ok := m[s2[i]]; !ok {
m[s2[i]] = struct{}{}
}
}
for k := range m {
r = append(r, k)
}
slices.Sort(r)
return r
}
func Intersect[T comparable](s1, s2 []T) []T {
var r []T
m := make(map[T]struct{}, len(s2))
for i := 0; i < len(s2); i++ {
m[s2[i]] = struct{}{}
}
for i := 0; i < len(s1); i++ {
if _, ok := m[s1[i]]; ok {
r = append(r, s1[i])
delete(m, s1[i])
}
}
return r
}
func Diff[T comparable](s1, s2 []T) []T {
var r []T
m := make(map[T]struct{}, len(s2))
for i := 0; i < len(s2); i++ {
m[s2[i]] = struct{}{}
}
for i := 0; i < len(s1); i++ {
if _, ok := m[s1[i]]; !ok {
r = append(r, s1[i])
}
}
return r
}
func SymDiff[T comparable](s1, s2 []T) []T {
var r []T
return r
}
func Complement[T comparable](s1, s2 []T) []T {
var r []T
return r
}