-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpoll.go
66 lines (59 loc) · 1.37 KB
/
poll.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
package sked
import (
"time"
"github.com/boltdb/bolt"
)
var (
// MinDate is the minimum date to search for.
MinDate = []byte("1900-01-01T00:00:00Z")
)
// poll will periodically check for events at the specified Options interval.
func (s *Sked) poll() {
ticker := time.NewTicker(time.Millisecond * time.Duration(s.options.CheckIntervalMS))
for {
select {
case <-s.done:
return
case <-ticker.C:
s.rw.Lock()
err := s.DB.Update(func(tx *bolt.Tx) error {
bucket := tx.Bucket([]byte(s.options.Bucket))
cur := bucket.Cursor()
now := time.Now().UTC()
max := now.Add(time.Second)
LOOP:
for k, v := cur.First(); k != nil; k, v = cur.Next() {
key, err := ParseKey(string(k))
if err != nil {
s.logger.Errorln(err)
continue LOOP
}
if key.IsExpired(now) {
if err := bucket.Delete(k); err != nil {
s.logger.Errorln(err)
}
continue LOOP
}
// test if this key is in the future, since keys are sorted we can
// just break here.
if key.Time.After(max) {
break LOOP
}
s.events <- v
if err := bucket.Delete(k); err != nil {
s.logger.Errorln(err)
}
}
return nil
})
s.rw.Unlock()
if err != nil {
s.logger.Errorln(err)
}
}
}
}
// Events returns a channel of events as they occur.
func (s *Sked) Events() chan []byte {
return s.events
}