-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset_linked_sync.go
148 lines (128 loc) · 3.41 KB
/
set_linked_sync.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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
package gord
import (
"strings"
"sync"
)
// Constructs a new `SyncLinkedSet` from the provided values, deduplicating them.
func NewSyncLinkedSet(vals ...interface{}) *SyncLinkedSet {
var set SyncLinkedSet
for _, val := range vals {
set.set.Add(val)
}
return &set
}
// Concurrency-safe, slightly slower version of `LinkedSet`. Satisfies the
// `OrdSet` interface. A zero value is ready to use, but should never be
// copied. Uses a mutex.
type SyncLinkedSet struct {
lock sync.Mutex
set LinkedSet
}
// Concurrency-safe version of `LinkedSet.Len`.
func (self *SyncLinkedSet) Len() int {
if self == nil {
return 0
}
self.lock.Lock()
defer self.lock.Unlock()
return self.set.Len()
}
// Concurrency-safe version of `LinkedSet.Has`.
func (self *SyncLinkedSet) Has(val interface{}) bool {
if self == nil {
return false
}
self.lock.Lock()
defer self.lock.Unlock()
return self.set.Has(val)
}
// Concurrency-safe version of `LinkedSet.Add`.
func (self *SyncLinkedSet) Add(val interface{}) {
self.lock.Lock()
defer self.lock.Unlock()
self.set.Add(val)
}
// Concurrency-safe version of `LinkedSet.Added`.
func (self *SyncLinkedSet) Added(val interface{}) bool {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.Added(val)
}
// Concurrency-safe version of `LinkedSet.Delete`.
func (self *SyncLinkedSet) Delete(val interface{}) {
self.lock.Lock()
defer self.lock.Unlock()
self.set.Delete(val)
}
// Concurrency-safe version of `LinkedSet.Deleted`.
func (self *SyncLinkedSet) Deleted(val interface{}) bool {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.Deleted(val)
}
// Concurrency-safe version of `LinkedSet.AddFirst`.
func (self *SyncLinkedSet) AddFirst(val interface{}) {
self.lock.Lock()
defer self.lock.Unlock()
self.set.AddFirst(val)
}
// Concurrency-safe version of `LinkedSet.AddedFirst`.
func (self *SyncLinkedSet) AddedFirst(val interface{}) bool {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.AddedFirst(val)
}
// Concurrency-safe version of `LinkedSet.AddLast`.
func (self *SyncLinkedSet) AddLast(val interface{}) {
self.lock.Lock()
defer self.lock.Unlock()
self.set.AddLast(val)
}
// Concurrency-safe version of `LinkedSet.AddedLast`.
func (self *SyncLinkedSet) AddedLast(val interface{}) bool {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.AddedLast(val)
}
// Concurrency-safe version of `LinkedSet.PoppedFirst`.
func (self *SyncLinkedSet) PoppedFirst() (interface{}, bool) {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.PoppedFirst()
}
// Concurrency-safe version of `LinkedSet.PoppedLast`.
func (self *SyncLinkedSet) PoppedLast() (interface{}, bool) {
self.lock.Lock()
defer self.lock.Unlock()
return self.set.PoppedLast()
}
// Concurrency-safe version of `LinkedSet.Values`.
func (self *SyncLinkedSet) Values() []interface{} {
if self == nil {
return nil
}
self.lock.Lock()
defer self.lock.Unlock()
return self.set.Values()
}
// Concurrency-safe version of `LinkedSet.String`.
func (self *SyncLinkedSet) String() string {
if self == nil {
return `[]`
}
self.lock.Lock()
defer self.lock.Unlock()
return self.set.String()
}
// Concurrency-safe version of `LinkedSet.GoString`.
func (self *SyncLinkedSet) GoString() string {
if self == nil {
return `(*SyncLinkedSet)(nil)`
}
self.lock.Lock()
defer self.lock.Unlock()
var buf strings.Builder
buf.WriteString(`NewSyncLinkedSet`)
self.set.writeGoString(&buf)
return buf.String()
}