-
Notifications
You must be signed in to change notification settings - Fork 10
/
timecache.go
60 lines (49 loc) · 837 Bytes
/
timecache.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
package timecache
import (
"container/list"
"time"
)
type TimeCache struct {
Q *list.List
M map[string]time.Time
span time.Duration
}
func NewTimeCache(span time.Duration) *TimeCache {
return &TimeCache{
Q: list.New(),
M: make(map[string]time.Time),
span: span,
}
}
func (tc *TimeCache) Add(s string) {
_, ok := tc.M[s]
if ok {
panic("putting the same entry twice not supported")
}
tc.sweep()
tc.M[s] = time.Now()
tc.Q.PushFront(s)
}
func (tc *TimeCache) sweep() {
for {
back := tc.Q.Back()
if back == nil {
return
}
v := back.Value.(string)
t, ok := tc.M[v]
if !ok {
panic("inconsistent cache state")
}
if time.Since(t) > tc.span {
tc.Q.Remove(back)
delete(tc.M, v)
} else {
return
}
}
}
func (tc *TimeCache) Has(s string) bool {
_, ok := tc.M[s]
return ok
}