-
Notifications
You must be signed in to change notification settings - Fork 1
/
sets.go
74 lines (63 loc) · 1.29 KB
/
sets.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
package blockchain
import "sync"
// Set 用来确保添加节点是幂等的的简单方
type Set struct {
items map[string]struct{} `json:"items"`
sync.RWMutex
}
var itemExists = struct{}{}
// NewSet .
func NewSet() *Set {
return &Set{
items: make(map[string]struct{}),
}
}
// Add 添加
func (set *Set) Add(items ...string) {
set.Lock()
defer set.Unlock()
for _, item := range items {
set.items[item] = itemExists
}
}
// Remove 删除
func (set *Set) Remove(items ...string) {
set.Lock()
defer set.Unlock()
for _, item := range items {
delete(set.items, item)
}
}
// Contains 是否存在
func (set *Set) Contains(item string) bool {
set.RLock()
defer set.RUnlock()
if _, contains := set.items[item]; !contains {
return false
}
return true
}
// Empty 是否为空
func (set *Set) Empty() bool {
return set.Size() == 0
}
// Size 大小
func (set *Set) Size() int {
return len(set.items)
}
// Clear 重置
func (set *Set) Clear() {
set.Lock()
defer set.Unlock()
set.items = make(map[string]struct{})
}
// List 返回一个切片
func (set *Set) List() []string {
set.RLock()
defer set.RUnlock()
list := make([]string, 0, 100)
for node := range set.items {
list = append(list, node)
}
return list
}