/
mem.go
97 lines (84 loc) · 1.78 KB
/
mem.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
package ghm
import (
"context"
"log"
"sort"
"sync"
"time"
"github.com/spf13/cobra"
)
type MemoryConsumer[R any] struct {
period int
debug bool
cache map[int64]R
lock *sync.Mutex
last R
cleanup context.CancelFunc
}
type Entry map[string]any
func (mc *MemoryConsumer[R]) Setup(cmd *cobra.Command, name string) {
cmd.PersistentFlags().IntVar(&mc.period, "period", 60, "Period minutes")
}
func (mc *MemoryConsumer[R]) Init(d bool) error {
mc.cache = map[int64]R{}
mc.debug = d
mc.lock = &sync.Mutex{}
var ctx context.Context
ctx, mc.cleanup = context.WithCancel(context.Background())
go func() {
ticker := time.NewTicker(time.Minute * time.Duration(mc.period) / 4)
fl:
for {
select {
case <-ctx.Done():
break fl
case <-ticker.C:
mc.clearCache()
}
}
ticker.Stop()
}()
return nil
}
func (mc *MemoryConsumer[R]) Consume(v R) error {
mc.last = v
mc.lock.Lock()
defer mc.lock.Unlock()
mc.cache[time.Now().Unix()] = v
if mc.debug {
log.Printf("Consumed %v", v)
}
return nil
}
func (mc *MemoryConsumer[R]) Close() error { return nil }
func (mc *MemoryConsumer[R]) clearCache() {
mc.lock.Lock()
defer mc.lock.Unlock()
dl := time.Now().Add(-time.Minute * time.Duration(mc.period)).Unix()
for k := range mc.cache {
if k < dl {
delete(mc.cache, k)
}
}
}
func (mc MemoryConsumer[R]) Last() R {
return mc.last
}
func (mc MemoryConsumer[R]) Data(c ...func(R) Entry) []Entry {
var conv func(R) Entry
if len(c) == 1 {
conv = c[0]
} else {
conv = func(r R) Entry { return Entry{"value": r} }
}
mc.lock.Lock()
defer mc.lock.Unlock()
res := []Entry{}
for k, v := range mc.cache {
cv := conv(v)
cv["ts"] = k
res = append(res, cv)
}
sort.Slice(res, func(i, j int) bool { return res[i]["ts"].(int64) < res[j]["ts"].(int64) })
return res
}