-
Notifications
You must be signed in to change notification settings - Fork 111
/
pack.go
161 lines (146 loc) · 3.53 KB
/
pack.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
package library
import (
"container/heap"
"errors"
"github.com/nytlabs/gojee"
"github.com/nytlabs/streamtools/st/blocks" // blocks
"github.com/nytlabs/streamtools/st/util"
"time"
)
// specify those channels we're going to use to communicate with streamtools
type Pack struct {
blocks.Block
queryrule chan chan interface{}
inrule chan interface{}
in chan interface{}
out chan interface{}
quit chan interface{}
}
// we need to build a simple factory so that streamtools can make new blocks of this kind
func NewPack() blocks.BlockInterface {
return &Pack{}
}
// Setup is called once before running the block. We build up the channels and specify what kind of block this is.
func (b *Pack) Setup() {
b.Kind = "Pack"
b.Desc = "groups messages together based on a common value, similar to 'group-by' in other languages"
b.in = b.InRoute("in")
b.inrule = b.InRoute("rule")
b.queryrule = b.QueryRoute("rule")
b.quit = b.Quit()
b.out = b.Broadcast()
}
// Run is the block's main loop. Here we listen on the different channels we set up.
func (b *Pack) Run() {
var tree *jee.TokenTree
var emitAfter, path string
var err error
afterDuration := time.Duration(0)
waitTimer := time.NewTimer(100 * time.Millisecond)
bunches := make(map[string][]interface{})
pq := &PriorityQueue{}
heap.Init(pq)
for {
select {
case ruleI := <-b.inrule:
// set a parameter of the block
rule, ok := ruleI.(map[string]interface{})
if !ok {
b.Error(errors.New("coudln't assert rule to map"))
continue
}
path, err = util.ParseString(rule, "Path")
if err != nil {
b.Error(err)
continue
}
token, err := jee.Lexer(path)
if err != nil {
b.Error(err)
continue
}
tree, err = jee.Parser(token)
if err != nil {
b.Error(err)
continue
}
emitAfter, err = util.ParseString(rule, "EmitAfter")
if err != nil {
b.Error(err)
continue
}
afterDuration, err = time.ParseDuration(emitAfter)
if err != nil {
b.Error(err)
continue
}
case <-b.quit:
// quit the block
return
case msg := <-b.in:
// deal with inbound data
if tree == nil {
break
}
id, err := jee.Eval(tree, msg)
if err != nil {
b.Error(err)
continue
}
idStr, ok := id.(string)
if !ok {
b.Error(errors.New("could not assert id to string"))
break
}
if len(bunches[idStr]) > 0 {
bunches[idStr] = append(bunches[idStr], msg)
} else {
bunches[idStr] = []interface{}{msg}
}
val := map[string]interface{}{
"id": idStr,
"length": len(bunches[idStr]),
}
queueMessage := &PQMessage{
val: val,
t: time.Now(),
}
heap.Push(pq, queueMessage)
case c := <-b.queryrule:
// deal with a query request
c <- map[string]interface{}{
"Path": path,
"EmitAfter": emitAfter,
}
}
for {
pqMsg, diff := pq.PeekAndShift(time.Now(), afterDuration)
if pqMsg == nil {
// either the queue is empty, or it's not time to emit
waitTimer.Reset(diff)
break
}
v := pqMsg.(*PQMessage).val.(map[string]interface{})
l, ok := v["length"]
if !ok {
b.Error(errors.New("couldn't find length in message"))
continue
}
lInt := l.(int)
id, ok := v["id"]
if !ok {
b.Error(errors.New("couldn't find id in message"))
continue
}
idStr := id.(string)
if lInt == len(bunches[idStr]) {
// we've not seen anything since putting this message in the queue
msg := map[string]interface{}{
"pack": bunches[idStr],
}
b.out <- msg
delete(bunches, idStr)
}
}
}
}