forked from aymerick/raymond
-
Notifications
You must be signed in to change notification settings - Fork 10
/
json_visitor.go
353 lines (320 loc) · 9.22 KB
/
json_visitor.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
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
package raymond
import (
"encoding/json"
"github.com/mailgun/raymond/v2/ast"
"strings"
)
type list []interface{}
func (l *list) Add(item interface{}) {
*l = append(*l, item)
}
func (l *list) Get() interface{} {
return (*l)[0]
}
func (l *list) Len() int {
return len(*l)
}
func newList(item interface{}) *list {
l := new(list)
l.Add(item)
return l
}
type JSONVisitor struct {
JSON map[string]interface{}
ctx *handlebarsContext
}
func newJSONVisitor() *JSONVisitor {
j := map[string]interface{}{}
v := &JSONVisitor{JSON: j, ctx: newHandlebarsContext()}
return v
}
func ToJSON(node ast.Node) string {
visitor := newJSONVisitor()
node.Accept(visitor)
b, _ := json.Marshal(visitor.JSON)
return string(b)
}
func (v *JSONVisitor) VisitProgram(node *ast.Program) interface{} {
for _, n := range node.Body {
n.Accept(v)
}
return v.JSON
}
func (v *JSONVisitor) VisitMustache(node *ast.MustacheStatement) interface{} {
node.Expression.Accept(v)
return nil
}
func (v *JSONVisitor) VisitBlock(node *ast.BlockStatement) interface{} {
var action string
fp := node.Expression.FieldPath()
if fp != nil {
action = node.Expression.HelperName()
}
if action == "with" || action == "each" {
blockParamsPath := make([]string, 0)
blockParams := make([]string, 0)
for _, params := range node.Expression.Params {
// Extract block params from nested nodes.
if pe, ok := params.(*ast.PathExpression); ok {
blockParamsPath = append(blockParamsPath, pe.Parts...)
}
}
if node.Program != nil {
if len(node.Program.BlockParams) > 0 {
blockParams = append(node.Program.BlockParams)
}
}
if action == "each" {
blockParamsPath = append(blockParamsPath, "[0]")
}
if len(blockParams) > 0 {
v.ctx.AddMemberContext(strings.Join(blockParamsPath, "."), strings.Join(blockParams, "."))
} else {
v.ctx.AddMemberContext(strings.Join(blockParamsPath, "."), "")
}
if node.Program != nil {
node.Program.Accept(v)
}
if node.Inverse != nil {
node.Inverse.Accept(v)
}
v.ctx.MoveUpContext()
} else {
for _, param := range node.Expression.Params {
param.Accept(v)
}
if node.Program != nil {
node.Program.Accept(v)
}
if node.Inverse != nil {
node.Inverse.Accept(v)
}
}
return nil
}
func (v *JSONVisitor) VisitPartial(node *ast.PartialStatement) interface{} {
return nil
}
func (v *JSONVisitor) VisitContent(node *ast.ContentStatement) interface{} {
return nil
}
func (v *JSONVisitor) VisitComment(node *ast.CommentStatement) interface{} {
return nil
}
func (v *JSONVisitor) VisitExpression(node *ast.Expression) interface{} {
var action string
fp := node.FieldPath()
if fp != nil {
if len(fp.Parts) > 0 {
action = node.HelperName()
if action == "lookup" {
if len(node.Params) > 0 {
path, ok := node.Params[0].(*ast.PathExpression)
if ok {
depth := path.Depth
tmpPath := []string{}
for _, p := range path.Parts {
tmpPath = append(tmpPath, p)
}
for _, n := range node.Params[1:] {
pe, ok := n.(*ast.PathExpression)
if ok {
pe.Depth = depth
pe.Parts = append(tmpPath, pe.Parts...)
pe.Accept(v)
}
}
return nil
}
}
}
}
}
node.Path.Accept(v)
for _, n := range node.Params {
n.Accept(v)
}
return nil
}
func (v *JSONVisitor) VisitSubExpression(node *ast.SubExpression) interface{} {
node.Expression.Accept(v)
return nil
}
func (v *JSONVisitor) VisitPath(node *ast.PathExpression) interface{} {
if node.Data {
data := node.Parts[len(node.Parts)-1]
if data == "index" {
node.Parts[len(node.Parts)-1] = "[0]"
}
}
if node.Scoped {
if strings.HasPrefix(node.Original, ".") && !strings.HasPrefix(node.Original, "..") {
if len(node.Parts) == 0 {
node.Parts = []string{""}
}
}
}
res := v.ctx.GetMappedContext(node.Parts, node.Depth)
v.appendToJSON(res)
return nil
}
func (v *JSONVisitor) VisitString(node *ast.StringLiteral) interface{} {
return nil
}
func (v *JSONVisitor) VisitBoolean(node *ast.BooleanLiteral) interface{} {
return nil
}
func (v *JSONVisitor) VisitNumber(node *ast.NumberLiteral) interface{} {
return nil
}
func (v *JSONVisitor) VisitHash(node *ast.Hash) interface{} {
return nil
}
func (v *JSONVisitor) VisitHashPair(node *ast.HashPair) interface{} {
return nil
}
func (v *JSONVisitor) appendToJSON(templateLabels []string) {
var tmp interface{}
tmp = v.JSON
for idx, name := range templateLabels {
var onArrayLabel, isArray, isLastLabel bool
//Figure out if name is an array Label.
if strings.HasPrefix(name, "[") {
onArrayLabel = true
}
//Figure out if we are on a simple last label.
if idx == len(templateLabels)-1 {
isLastLabel = true
}
//Figure out if the next label is an array label.
if !isLastLabel {
if strings.HasPrefix(templateLabels[idx+1], "[") {
isArray = true
}
}
//Complex isLastLabel check.
//Since we skip onArrayLabels not nested with another array.
//foo.[0].[0] would not skip first array label.
//This allows us to know it's a nested array
//and not a struct value with an array.
// foo.[0].baz would skip array label.
// If isArray and is not isLastLabel and if
// the idx is equal to the length of the slice - 2
// We know this is actually the last label as we skip single instances
// of an array label.
if isArray && !isLastLabel {
if idx == len(templateLabels)-2 {
isLastLabel = true
}
}
//If onArrayLabel and not isArray
//Skip this iteration because we only care about
// array labels for nested arrays.
if onArrayLabel && !isArray {
continue
}
switch c := tmp.(type) {
case map[string]interface{}:
if _, ok := c[name]; !ok {
//If the name does not exist in the map
//And is the last label.
if isLastLabel {
//If that last label is an array.
if isArray {
//Use the provided name to make a new list and mock the string value.
c[name] = newList(mockStringValue(name))
} else {
//If it is not an array. Add the value as a mocked string value set to the current name.
c[name] = mockStringValue(name)
}
} else {
//If it is not the last label.
// And the label value is an array.
if isArray {
//Set the label name to a new list value
c[name] = new(list)
} else {
//If the value is not an array and it is not the last value.
//It must be a map
c[name] = map[string]interface{}{}
}
}
} else {
//If the name does exist in the map lets determine its type.
if li, ok := c[name].(list); ok {
//If it's a list and is the last value.
//Set the the 0 index of the list to name
//If it is not already set.
if isLastLabel && li.Len() == 0 {
li.Add(mockStringValue(name))
}
} else if _, ok := c[name].(string); ok {
//If c[name]'s value is a string and it is not the last label
//c[name] had been used in an if or other reference that made us
// determine it was a string value. That is false turn it into a map.
if !isLastLabel {
c[name] = map[string]interface{}{}
}
}
}
//Update tmp to the next deepest value
tmp = c[name]
case *list:
//If type is list.
//If it is the last label and is array and on array label.
//This is a special case where we know our final value is an array.
//So we can just add the array and the final value.
//However cause these arrays are nested at an unknown depth we use test_value
//Rather than replacing it with name, because name is actually an array label.
if isLastLabel && isArray && onArrayLabel {
if c.Len() == 0 {
c.Add(newList("test_value"))
}
} else if isArray && isLastLabel {
//If isArray and isLastLabel.
//We know that it is safe to use name for the value.
//So we set it as such.
if c.Len() == 0 {
c.Add(mockStringValue(name))
}
} else if isArray {
//If it is not the last item just add an array.
if c.Len() == 0 {
c.Add(new(list))
}
} else {
if c.Len() == 0 {
if isLastLabel {
//If already in an array and no string values have been applied above.
//Then this indicates a map to end this label resolution
c.Add(map[string]interface{}{name: mockStringValue(name)})
} else {
//If not last label and not a future nested array as determined above.
//Then make this a map.
c.Add(map[string]interface{}{name: map[string]interface{}{}})
}
} else {
//If c.Len is greater than zero we have already added to this array.
//The only case that should fall through here is a previously created map.
if _, ok := (*c)[0].(map[string]interface{}); ok {
if isLastLabel {
//If this is the last label assign it to the map and mock it's value.
(*c)[0].(map[string]interface{})[name] = mockStringValue(name)
} else {
//If it's not the last label. Add just the map.
(*c)[0].(map[string]interface{})[name] = (map[string]interface{}{})
}
}
}
//If we had to mess with maps assign tmp the map value matching name within the array.
tmp = (*c)[0].(map[string]interface{})[name]
continue
}
//Assign tmp to the 0 index of the array. *Note we should never have any arrays larger than a length of 1.
tmp = (*c)[0]
}
}
}
func mockStringValue(name string) string {
return "test_" + name
}