/
set.go
99 lines (78 loc) · 1.37 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
package kind
type Set[V comparable] interface {
Add(value V) (isNew bool)
Del(list ...V) (delNum int)
Exists(value V) (exists bool)
Length() (length int)
List() (list Slice[V])
Pop() (value V)
Rand() (value V)
}
// set hash set,非线程安全
type set[V comparable] struct {
data map[V]struct{}
}
func NewSet[V comparable](initSize uint) Set[V] {
return &set[V]{
data: make(map[V]struct{}, initSize),
}
}
func (s *set[V]) Add(value V) (isNew bool) {
_, exists := s.data[value]
if !exists {
s.data[value] = Empty
}
isNew = !exists
return
}
func (s *set[V]) Del(list ...V) (delNum int) {
if len(list) < 1 {
return
}
for _, value := range list {
_, exists := s.data[value]
if exists {
delete(s.data, value)
delNum++
}
}
return
}
func (s *set[V]) Exists(value V) (exists bool) {
_, exists = s.data[value]
return
}
func (s *set[V]) Length() (length int) {
return len(s.data)
}
func (s *set[V]) List() (list Slice[V]) {
list = make(Slice[V], len(s.data))
if len(s.data) < 1 {
return
}
i := 0
for value, _ := range s.data {
list[i] = value
i++
}
return
}
func (s *set[V]) Pop() (value V) {
if s.Length() < 1 {
return
}
for val, _ := range s.data {
value = val
delete(s.data, value)
}
return
}
func (s *set[V]) Rand() (value V) {
if s.Length() < 1 {
return
}
for val, _ := range s.data {
return val
}
return
}