forked from dasfaha/sky
-
Notifications
You must be signed in to change notification settings - Fork 0
/
query_selection.go
322 lines (278 loc) · 8.87 KB
/
query_selection.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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
package skyd
import (
"bytes"
"errors"
"fmt"
)
//------------------------------------------------------------------------------
//
// Typedefs
//
//------------------------------------------------------------------------------
// A selection step aggregates data in a query.
type QuerySelection struct {
query *Query
functionName string
mergeFunctionName string
Name string
Dimensions []string
Fields []*QuerySelectionField
}
//------------------------------------------------------------------------------
//
// Constructors
//
//------------------------------------------------------------------------------
// Creates a new selection.
func NewQuerySelection(query *Query) *QuerySelection {
id := query.NextIdentifier()
return &QuerySelection{
query: query,
functionName: fmt.Sprintf("a%d", id),
mergeFunctionName: fmt.Sprintf("m%d", id),
}
}
//------------------------------------------------------------------------------
//
// Accessors
//
//------------------------------------------------------------------------------
// Retrieves the query this selection is associated with.
func (s *QuerySelection) Query() *Query {
return s.query
}
// Retrieves the function name used during codegen.
func (s *QuerySelection) FunctionName() string {
return s.functionName
}
// Retrieves the merge function name used during codegen.
func (s *QuerySelection) MergeFunctionName() string {
return s.mergeFunctionName
}
// Retrieves the child steps.
func (s *QuerySelection) GetSteps() QueryStepList {
return []QueryStep{}
}
//------------------------------------------------------------------------------
//
// Methods
//
//------------------------------------------------------------------------------
//--------------------------------------
// Serialization
//--------------------------------------
// Encodes a query selection into an untyped map.
func (s *QuerySelection) Serialize() map[string]interface{} {
fields := []interface{}{}
for _, field := range s.Fields {
fields = append(fields, field.Serialize())
}
obj := map[string]interface{}{
"type": QueryStepTypeSelection,
"name": s.Name,
"dimensions": s.Dimensions,
"fields": fields,
}
return obj
}
// Decodes a query selection from an untyped map.
func (s *QuerySelection) Deserialize(obj map[string]interface{}) error {
if obj == nil {
return errors.New("skyd.QuerySelection: Unable to deserialize nil.")
}
if obj["type"] != QueryStepTypeSelection {
return fmt.Errorf("skyd.QuerySelection: Invalid step type: %v", obj["type"])
}
// Deserialize "name".
if name, ok := obj["name"].(string); ok {
s.Name = name
} else if obj["name"] == nil {
s.Name = ""
} else {
return fmt.Errorf("skyd.QuerySelection: Invalid name: %v", obj["name"])
}
// Deserialize "dimensions".
if dimensions, ok := obj["dimensions"].([]interface{}); ok {
s.Dimensions = []string{}
for _, dimension := range dimensions {
if str, ok := dimension.(string); ok {
s.Dimensions = append(s.Dimensions, str)
} else {
return fmt.Errorf("skyd.QuerySelection: Invalid dimension: %v", dimension)
}
}
} else {
if obj["dimension"] == nil {
s.Dimensions = []string{}
} else {
return fmt.Errorf("skyd.QuerySelection: Invalid dimensions: %v", obj["dimensions"])
}
}
// Deserialize "fields".
if fields, ok := obj["fields"].([]interface{}); ok {
s.Fields = []*QuerySelectionField{}
for _, field := range fields {
if fieldMap, ok := field.(map[string]interface{}); ok {
f := NewQuerySelectionField("", "")
f.Deserialize(fieldMap)
s.Fields = append(s.Fields, f)
} else {
return fmt.Errorf("skyd.QuerySelection: Invalid field: %v", field)
}
}
} else {
if obj["field"] == nil {
s.Fields = []*QuerySelectionField{}
} else {
return fmt.Errorf("skyd.QuerySelection: Invalid fields: %v", obj["fields"])
}
}
return nil
}
//--------------------------------------
// Code Generation
//--------------------------------------
// Generates Lua code for the selection aggregation.
func (s *QuerySelection) CodegenAggregateFunction() (string, error) {
buffer := new(bytes.Buffer)
// Generate main function.
fmt.Fprintf(buffer, "function %s(cursor, data)\n", s.FunctionName())
// Add selection name.
if s.Name != "" {
fmt.Fprintf(buffer, " if data[\"%s\"] == nil then data[\"%s\"] = {} end\n", s.Name, s.Name)
fmt.Fprintf(buffer, " data = data[\"%s\"]\n\n", s.Name)
}
// Group by dimension.
for _, dimension := range s.Dimensions {
fmt.Fprintf(buffer, " dimension = cursor.event:%s()\n", dimension)
fmt.Fprintf(buffer, " if data.%s == nil then data.%s = {} end\n", dimension, dimension)
fmt.Fprintf(buffer, " if data.%s[dimension] == nil then data.%s[dimension] = {} end\n", dimension, dimension)
fmt.Fprintf(buffer, " data = data.%s[dimension]\n\n", dimension)
}
// Select fields.
for _, field := range s.Fields {
exp, err := field.CodegenExpression()
if err != nil {
return "", err
}
fmt.Fprintln(buffer, " "+exp)
}
// End function definition.
fmt.Fprintln(buffer, "end")
return buffer.String(), nil
}
// Generates Lua code for the selection merge.
func (s *QuerySelection) CodegenMergeFunction() (string, error) {
buffer := new(bytes.Buffer)
// Generate nested functions first.
code, err := s.CodegenInnerMergeFunction(0)
if err != nil {
return "", err
}
buffer.WriteString(code + "\n")
// Generate main function.
fmt.Fprintf(buffer, "function %s(result, data)\n", s.MergeFunctionName())
if s.Name != "" {
fmt.Fprintf(buffer, " if result[\"%s\"] == nil then result[\"%s\"] = {} end\n", s.Name, s.Name)
fmt.Fprintf(buffer, " %sn0(result[\"%s\"], data[\"%s\"])\n", s.MergeFunctionName(), s.Name, s.Name)
} else {
fmt.Fprintf(buffer, " %sn0(result, data)\n", s.MergeFunctionName())
}
fmt.Fprintf(buffer, "end\n")
return buffer.String(), nil
}
// Generates Lua code for the inner merge.
func (s *QuerySelection) CodegenInnerMergeFunction(index int) (string, error) {
buffer := new(bytes.Buffer)
// Generate next nested function first.
if index < len(s.Dimensions) {
code, err := s.CodegenInnerMergeFunction(index + 1)
if err != nil {
return "", err
}
buffer.WriteString(code + "\n")
}
// Generate a rollup if our index points at a dimension. Otherwise generate
// the leaf merge.
fmt.Fprintf(buffer, "function %sn%d(result, data)\n", s.MergeFunctionName(), index)
if index < len(s.Dimensions) {
dimension := s.Dimensions[index]
fmt.Fprintf(buffer, " if data ~= nil and data.%s ~= nil then\n", dimension)
fmt.Fprintf(buffer, " if result.%s == nil then result.%s = {} end\n", dimension, dimension)
fmt.Fprintf(buffer, " for k,v in pairs(data.%s) do\n", dimension)
fmt.Fprintf(buffer, " if result.%s[k] == nil then result.%s[k] = {} end\n", dimension, dimension)
fmt.Fprintf(buffer, " %sn%d(result.%s[k], v)\n", s.MergeFunctionName(), (index + 1), dimension)
fmt.Fprintf(buffer, " end\n")
fmt.Fprintf(buffer, " end\n")
} else {
// Merge fields.
for _, field := range s.Fields {
exp, err := field.CodegenMergeExpression()
if err != nil {
return "", err
}
fmt.Fprintln(buffer, " "+exp)
}
}
fmt.Fprintf(buffer, "end\n")
return buffer.String(), nil
}
//--------------------------------------
// Factorization
//--------------------------------------
// Converts factorized fields back to their original strings.
func (s *QuerySelection) Defactorize(data interface{}) error {
if m, ok := data.(map[interface{}]interface{}); ok {
// If this is a named selection then drill in first.
if s.Name != "" {
if m2, ok := m[s.Name].(map[interface{}]interface{}); ok {
m = m2
} else {
return nil
}
}
// Recursively defactorize dimensions and then fields.
return s.defactorize(m, 0)
}
return nil
}
// Recursively defactorizes dimensions.
func (s *QuerySelection) defactorize(data interface{}, index int) error {
if index >= len(s.Dimensions) {
return nil
}
// Ignore any values that are nil or not maps.
inner, ok := data.(map[interface{}]interface{})
if !ok || data == nil {
return nil
}
// Retrieve property.
dimension := s.Dimensions[index]
property := s.query.table.propertyFile.GetPropertyByName(dimension)
if property == nil {
return fmt.Errorf("skyd.QuerySelection: Property not found: %s", dimension)
}
// Defactorize.
if outer, ok := inner[dimension].(map[interface{}]interface{}); ok {
copy := map[interface{}]interface{}{}
for k, v := range outer {
if property.DataType == FactorDataType {
if sequence, ok := normalize(k).(int64); ok {
stringValue, err := s.query.factors.Defactorize(s.query.table.Name, dimension, uint64(sequence))
if err != nil {
return err
}
copy[stringValue] = v
} else {
return fmt.Errorf("Invalid factor sequence: %v", k)
}
} else {
copy[k] = v
}
// Defactorize next dimension.
s.defactorize(v, index+1)
}
inner[dimension] = copy
}
return nil
}