-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset.go
55 lines (45 loc) · 761 Bytes
/
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
package sets
import (
"fmt"
)
type Set[T comparable] map[T]struct{}
func NewSet[T comparable](elems ...T) Set[T] {
s := Set[T]{}
s.Add(elems...)
return s
}
func (s *Set[T]) Add(elems ...T) {
for _, elem := range elems {
(*s)[elem] = struct{}{}
}
}
func (s *Set[T]) Remove(elems ...T) {
for _, elem := range elems {
delete(*s, elem)
}
}
func (s *Set[T]) Contains(elem T) bool {
_, ok := (*s)[elem]
return ok
}
func (s *Set[T]) Len() int {
return len(*s)
}
func (s *Set[T]) List() (ret []T) {
for elem := range *s {
ret = append(ret, elem)
}
return
}
func (s *Set[T]) IsEmpty() bool {
return s.Len() == 0
}
func (s *Set[T]) Print() {
ret := make([]T, s.Len())
i := 0
for k := range *s {
ret[i] = k
i++
}
fmt.Println(ret)
}