-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.go
119 lines (100 loc) · 1.87 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
package golib
import "sync"
var (
keyExists = struct{}{}
)
type Set interface {
Add(items ...interface{})
Remove(items ...interface{})
Pop() interface{}
Has(items ...interface{}) bool
Size() int
Clear()
Each(f func(interface{}) bool)
List() []interface{}
}
type set struct {
items map[interface{}]struct{}
mutex sync.RWMutex
}
func NewSet(items ...interface{}) Set {
s := &set{mutex: sync.RWMutex{}}
s.items = make(map[interface{}]struct{})
s.Add(items...)
return s
}
func (s *set) Add(items ...interface{}) {
if len(items) == 0 {
return
}
s.mutex.Lock()
defer s.mutex.Unlock()
for _, item := range items {
s.items[item] = keyExists
}
}
func (s *set) Remove(items ...interface{}) {
if len(items) == 0 {
return
}
s.mutex.Lock()
defer s.mutex.Unlock()
for _, item := range items {
delete(s.items, item)
}
}
func (s *set) Pop() interface{} {
s.mutex.RLock()
for item := range s.items {
s.mutex.RUnlock()
s.mutex.Lock()
delete(s.items, item)
s.mutex.Unlock()
return item
}
s.mutex.RUnlock()
return nil
}
func (s *set) Has(items ...interface{}) bool {
// assume checked for empty item, which not exist
if len(items) == 0 {
return false
}
s.mutex.RLock()
defer s.mutex.RUnlock()
has := true
for _, item := range items {
if _, has = s.items[item]; !has {
break
}
}
return has
}
func (s *set) Size() int {
s.mutex.RLock()
defer s.mutex.RUnlock()
return len(s.items)
}
func (s *set) Clear() {
s.mutex.Lock()
defer s.mutex.Unlock()
s.items = make(map[interface{}]struct{})
}
func (s *set) Each(f func(item interface{}) bool) {
s.mutex.RLock()
defer s.mutex.RUnlock()
for item := range s.items {
if !f(item) {
break
}
}
}
func (s *set) List() []interface{} {
s.mutex.RLock()
defer s.mutex.RUnlock()
list := make([]interface{}, 0, len(s.items))
for item := range s.items {
list = append(list, item)
}
return list
}