-
-
Notifications
You must be signed in to change notification settings - Fork 1
/
set.go
218 lines (180 loc) · 3.95 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
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
// Copyright © by Jeff Foley 2021-2022. All rights reserved.
// Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
// SPDX-License-Identifier: Apache-2.0
package stringset
import (
"os"
"runtime"
"sync"
"time"
"github.com/dgraph-io/badger"
)
type nothing struct{}
type Set struct {
sync.Mutex
elements map[string]nothing
memSaveState bool
db *badger.DB
dbPath string
done chan struct{}
}
// Deduplicate utilizes the Set type to generate a unique list of strings from the input slice.
func Deduplicate(input []string) []string {
ss := New(input...)
defer ss.Close()
return ss.Slice()
}
// New returns a Set containing the values provided in the arguments.
func New(initial ...string) *Set {
s := &Set{
elements: make(map[string]nothing, 50),
done: make(chan struct{}, 2),
}
for _, v := range initial {
s.Insert(v)
}
go s.checkMemory()
return s
}
func (s *Set) Close() {
s.Lock()
defer s.Unlock()
s.done <- struct{}{}
s.elements = make(map[string]nothing)
if s.memSaveState {
s.db.Close()
os.RemoveAll(s.dbPath)
s.memSaveState = false
}
}
// Has returns true if the receiver Set already contains the element string argument.
func (s *Set) Has(element string) bool {
s.Lock()
defer s.Unlock()
if s.memSaveState {
return s.storeHas(element)
}
return s.memHas(element)
}
// Insert adds the element string argument to the receiver Set.
func (s *Set) Insert(element string) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeInsert(element)
return
}
s.memInsert(element)
}
// InsertMany adds all the elements strings into the receiver Set.
func (s *Set) InsertMany(elements ...string) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeInsertMany(elements...)
return
}
s.memInsertMany(elements...)
}
// Remove will delete the element string from the receiver Set.
func (s *Set) Remove(element string) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeRemove(element)
return
}
s.memRemove(element)
}
// Slice returns a string slice that contains all the elements in the Set.
func (s *Set) Slice() []string {
s.Lock()
defer s.Unlock()
if s.memSaveState {
return s.storeSlice()
}
return s.memSlice()
}
// Union adds all the elements from the other Set argument into the receiver Set.
func (s *Set) Union(other *Set) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeUnion(other)
return
}
s.memUnion(other)
}
// Len returns the number of elements in the receiver Set.
func (s *Set) Len() int {
s.Lock()
defer s.Unlock()
if s.memSaveState {
return s.storeLen()
}
return s.memLen()
}
// Subtract removes all elements in the other Set argument from the receiver Set.
func (s *Set) Subtract(other *Set) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeSubtract(other)
return
}
s.memSubtract(other)
}
// Intersect causes the receiver Set to only contain elements also found in the
// other Set argument.
func (s *Set) Intersect(other *Set) {
s.Lock()
defer s.Unlock()
if s.memSaveState {
s.storeIntersect(other)
return
}
s.memIntersect(other)
}
// Set implements the flag.Value interface.
func (s *Set) String() string {
s.Lock()
defer s.Unlock()
if s.memSaveState {
return s.storeString()
}
return s.memString()
}
// Set implements the flag.Value interface.
func (s *Set) Set(input string) error {
s.Lock()
defer s.Unlock()
if s.memSaveState {
return s.storeSet(input)
}
return s.memSet(input)
}
func (s *Set) checkMemory() {
max := 750 * uint64(1<<20) // MB
var m runtime.MemStats
t := time.NewTicker(10 * time.Second)
defer t.Stop()
for {
select {
case <-t.C:
if state, elen := s.getStateAndLength(); !state && elen > 1000 {
runtime.ReadMemStats(&m)
if m.Alloc >= max {
s.setMemSaveState()
return
}
}
case <-s.done:
return
}
}
}
func (s *Set) getStateAndLength() (bool, int) {
s.Lock()
defer s.Unlock()
return s.memSaveState, len(s.elements)
}