-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset.go
98 lines (80 loc) · 1.44 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
package set
import (
"errors"
"sync"
)
var (
ErrAlreadyExists error = errors.New("item already exists")
ErrKeyDoesNotExist error = errors.New("key does not exist")
)
type (
Key func() string
Set struct {
sync.RWMutex
set sync.Map
}
Iterator func() (item interface{}, lastItem bool)
)
func (s *Set) Add(key Key, item interface{}) (err error) {
_, loaded := s.set.LoadOrStore(key(), item)
if loaded {
err = ErrAlreadyExists
}
return
}
func (s *Set) Iterator() (iterator Iterator) {
items := s.getItemsSlice()
c := 0
iterator = func() (item interface{}, lastItem bool) {
if c < len(items) {
item = items[c]
c++
}
lastItem = c == len(items)
return
}
return
}
func (s *Set) getItemsSlice() (items []interface{}) {
items = make([]interface{}, s.Count())
c := 0
catchingItems := func(key, value interface{}) bool {
items[c] = value
c++
return true
}
s.set.Range(catchingItems)
return
}
func (s *Set) Peek(key Key) (item interface{}, err error) {
s.Lock()
s.Unlock()
item, ok := s.set.Load(key())
if !ok {
err = ErrKeyDoesNotExist
}
return
}
func (s *Set) Pop(key Key) (item interface{}, err error) {
item, err = s.Peek(key)
if err != nil {
return
}
s.Lock()
defer s.Unlock()
s.set.Delete(key())
return
}
func (s *Set) Count() (count int) {
count = 0
f := func(key, value interface{}) bool {
count++
return true
}
s.set.Range(f)
return
}
func (s *Set) Clear() {
s.set = sync.Map{}
return
}