/
gen_struct.go
325 lines (255 loc) · 6.27 KB
/
gen_struct.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
package main
import (
"code.cloudfoundry.org/go-pubsub"
"hash/crc64"
)
func StructTravTraverse(data interface{}) pubsub.Paths {
return _a(data)
}
func done(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
return 0, nil, false
})
}
func hashBool(data bool) uint64 {
// 0 is reserved
if data {
return 2
}
return 1
}
func hashUint64(data uint64) uint64 {
// 0 is reserved
if data == 0 {
return 1
}
return data
}
var tableECMA = crc64.MakeTable(crc64.ECMA)
func _a(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(_b), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).a), tableECMA)), pubsub.TreeTraverser(_b), true
default:
return 0, nil, false
}
})
}
func _b(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0,
pubsub.TreeTraverser(func(data interface{}) pubsub.Paths {
return ___w_x
}), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).b), tableECMA)),
pubsub.TreeTraverser(func(data interface{}) pubsub.Paths {
return ___w_x
}), true
default:
return 0, nil, false
}
})
}
func ___w_x(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
if data.(*someType).w == nil {
return 0, pubsub.TreeTraverser(done), true
}
return 1, pubsub.TreeTraverser(_w_i), true
case 1:
if data.(*someType).x == nil {
return 0, pubsub.TreeTraverser(done), true
}
return 2, pubsub.TreeTraverser(_x_i), true
default:
return 0, nil, false
}
}
func _w(data interface{}) pubsub.Paths {
if data.(*someType).w == nil {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(done), true
default:
return 0, nil, false
}
})
}
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 1, pubsub.TreeTraverser(_w_i), true
default:
return 0, nil, false
}
})
}
func _w_i(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(_w_j), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).w.i), tableECMA)), pubsub.TreeTraverser(_w_j), true
default:
return 0, nil, false
}
})
}
func _w_j(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(done), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).w.j), tableECMA)), pubsub.TreeTraverser(done), true
default:
return 0, nil, false
}
})
}
func _x(data interface{}) pubsub.Paths {
if data.(*someType).x == nil {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(done), true
default:
return 0, nil, false
}
})
}
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 1, pubsub.TreeTraverser(_x_i), true
default:
return 0, nil, false
}
})
}
func _x_i(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(_x_j), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).x.i), tableECMA)), pubsub.TreeTraverser(_x_j), true
default:
return 0, nil, false
}
})
}
func _x_j(data interface{}) pubsub.Paths {
return pubsub.Paths(func(idx int, data interface{}) (path uint64, nextTraverser pubsub.TreeTraverser, ok bool) {
switch idx {
case 0:
return 0, pubsub.TreeTraverser(done), true
case 1:
return hashUint64(crc64.Checksum([]byte(data.(*someType).x.j), tableECMA)), pubsub.TreeTraverser(done), true
default:
return 0, nil, false
}
})
}
type someTypeFilter struct {
a *string
b *string
w *wFilter
x *xFilter
}
type wFilter struct {
i *string
j *string
}
type xFilter struct {
i *string
j *string
}
func StructTravCreatePath(f *someTypeFilter) []uint64 {
if f == nil {
return nil
}
var path []uint64
var count int
if f.w != nil {
count++
}
if f.x != nil {
count++
}
if count > 1 {
panic("Only one field can be set")
}
if f.a != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.a), tableECMA)))
} else {
path = append(path, 0)
}
if f.b != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.b), tableECMA)))
} else {
path = append(path, 0)
}
path = append(path, createPath__w(f.w)...)
path = append(path, createPath__x(f.x)...)
for i := len(path) - 1; i >= 1; i-- {
if path[i] != 0 {
break
}
path = path[:i]
}
return path
}
func createPath__w(f *wFilter) []uint64 {
if f == nil {
return nil
}
var path []uint64
path = append(path, 1)
var count int
if count > 1 {
panic("Only one field can be set")
}
if f.i != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.i), tableECMA)))
} else {
path = append(path, 0)
}
if f.j != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.j), tableECMA)))
} else {
path = append(path, 0)
}
return path
}
func createPath__x(f *xFilter) []uint64 {
if f == nil {
return nil
}
var path []uint64
path = append(path, 2)
var count int
if count > 1 {
panic("Only one field can be set")
}
if f.i != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.i), tableECMA)))
} else {
path = append(path, 0)
}
if f.j != nil {
path = append(path, hashUint64(crc64.Checksum([]byte(*f.j), tableECMA)))
} else {
path = append(path, 0)
}
return path
}