-
Notifications
You must be signed in to change notification settings - Fork 0
/
bulk.go
167 lines (140 loc) · 2.5 KB
/
bulk.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
package rest
import (
"sync"
"time"
"github.com/labstack/echo/v4"
)
type fakeDoer struct{}
func (f fakeDoer) Do(a []any) error {
return nil
}
type ServiceLayer interface {
Do([]any) error
}
type BulkProcessor struct {
mu sync.RWMutex
mm map[uint64]Shard
svc ServiceLayer
}
func NewBulkProcessor() *BulkProcessor {
return &BulkProcessor{
mm: make(map[uint64]Shard),
svc: &fakeDoer{},
}
}
func (bp *BulkProcessor) DoStuff(c echo.Context) error {
shard, running, clean := bp.FindShard(50)
if !running {
go shard.BulkRequests(10*time.Millisecond, 150, clean)
}
shard.ch <- 1
return nil
}
type Shard struct {
ch chan int
svc ServiceLayer
}
func (s Shard) BulkRequests(timeout time.Duration, maxSize int, fnClose func()) {
var reqs []any
tt := time.NewTimer(timeout)
defer func() {
if !tt.Stop() {
<-tt.C
}
}()
loop:
for {
select {
case req, ok := <-s.ch:
if !ok {
if len(reqs) > 0 {
s.svc.Do(reqs)
}
break loop
}
reqs = append(reqs, req)
if len(reqs) >= maxSize {
fnClose()
s.svc.Do(reqs)
break loop
}
case <-time.After(timeout):
fnClose()
s.svc.Do(reqs)
break loop
}
}
}
func (bp *BulkProcessor) FindShard(id uint64) (ch Shard, running bool, clean func()) {
bp.mu.RLock()
if ch, ok := bp.mm[id]; ok {
bp.mu.RUnlock()
return ch, true, func() {
bp.mu.Lock()
defer bp.mu.Unlock()
close(bp.mm[id].ch)
delete(bp.mm, id)
}
}
bp.mu.RUnlock()
bp.mu.Lock()
defer bp.mu.Unlock()
bp.mm[id] = Shard{
ch: make(chan int, 1),
svc: bp.svc,
}
return ch, false, func() {
bp.mu.Lock()
defer bp.mu.Unlock()
close(bp.mm[id].ch)
delete(bp.mm, id)
}
}
type SafeMap[K comparable, V any] struct {
mu sync.RWMutex
m map[K]V
}
func NewSafeMap[K comparable, V any](size int) *SafeMap[K, V] {
return &SafeMap[K, V]{
m: make(map[K]V, size),
}
}
func (sm *SafeMap[K, V]) Get(k K) (v V, ok bool) {
sm.mu.RLock()
v, ok = sm.m[k]
sm.mu.RUnlock()
return
}
func (sm *SafeMap[K, V]) Set(k K, v V) {
sm.mu.Lock()
sm.m[k] = v
sm.mu.Unlock()
}
func (sm *SafeMap[K, V]) Delete(k K) {
sm.mu.Lock()
delete(sm.m, k)
sm.mu.Unlock()
}
func (sm *SafeMap[K, V]) GetOrSet1(k K, v V) (V, bool) {
sm.mu.RLock()
val, ok := sm.m[k]
if ok {
sm.mu.RUnlock()
return val, ok
}
sm.mu.RUnlock()
sm.mu.Lock()
sm.m[k] = v
sm.mu.Unlock()
return v, true
}
func (sm *SafeMap[K, V]) GetOrSet2(k K, v V) (V, bool) {
sm.mu.Lock()
defer sm.mu.Unlock()
val, ok := sm.m[k]
if !ok {
sm.m[k] = v
return val, ok
}
return val, ok
}