This repository has been archived by the owner on Dec 22, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathesmf.go
249 lines (223 loc) · 6.26 KB
/
esmf.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
package esmf
import "bytes"
import "strings"
import "errors"
import "reflect"
import "log"
import "encoding/hex"
import "fmt"
type byteString []byte
func encodeString(s string) string {
l := len(s)
out := []string{}
for i := 0; i < l; i++ {
h := hex.EncodeToString([]byte(s[i : i+1]))
out = append(out, h)
}
return strings.Join(out, " ")
}
func translate(obj interface{}, buff *bytes.Buffer) {
// Wrap the original in a reflect.Value
original := reflect.ValueOf(obj)
buff.WriteString("^^ 01 ")
translateRecursive(original, buff)
buff.WriteString(" $$")
}
func translateRecursive(original reflect.Value, buff *bytes.Buffer) {
switch original.Kind() {
// The first cases handle nested structures and translate them recursively
// If it is a pointer we need to unwrap and call once again
case reflect.Ptr:
// To get the actual value of the original we have to call Elem()
// At the same time this unwraps the pointer so we don't end up in
// an infinite recursion
originalValue := original.Elem()
// Check if the pointer is nil
if !originalValue.IsValid() {
return
}
// Unwrap the newly created pointer
translateRecursive(originalValue, buff)
// If it is an interface (which is very similar to a pointer), do basically the
// same as for the pointer. Though a pointer is not the same as an interface so
// note that we have to call Elem() after creating a new object because otherwise
// we would end up with an actual pointer
case reflect.Interface:
// Get rid of the wrapping interface
originalValue := original.Elem()
// Create a new object. Now new gives us a pointer, but we want the value it
// points to, so we have to call Elem() to unwrap it
translateRecursive(originalValue, buff)
// If it is a struct we translate each field
case reflect.Struct:
//log.Println("struct")
buff.WriteString("{{ ")
for i := 0; i < original.NumField(); i += 1 {
if i != 0 {
buff.WriteString(" ,, ")
}
f := original.Field(i)
fname := original.Type().Field(i).Name
//log.Println(fmt.Sprintf("%v", original.Field(i).Name))
buff.WriteString(fmt.Sprintf("%v :: ", encodeString(fname)))
//log.Println(EncodeString(fmt.Sprintf("%v", original.Field(i).Name)))
translateRecursive(f, buff)
}
buff.WriteString(" }}")
// If it is a slice we create a new slice and translate each element
case reflect.Slice:
buff.WriteString("[[ ")
for i := 0; i < original.Len(); i += 1 {
if i != 0 {
buff.WriteString(" ,, ")
}
translateRecursive(original.Index(i), buff)
}
buff.WriteString(" ]]")
// If it is a map we create a new map and translate each value
case reflect.Map:
log.Println("map")
for _, key := range original.MapKeys() {
originalValue := original.MapIndex(key)
// New gives us a pointer, but again we want the value
translateRecursive(originalValue, buff)
}
// Otherwise we cannot traverse anywhere so this finishes the the recursion
// And everything else will simply be taken from the original
default:
//log.Println(fmt.Sprintf("%v", original))
buff.WriteString(encodeString(fmt.Sprintf("%v", original)))
}
}
//Given a go data structure, this will encode it to a string
func ToESMF(obj interface{}) string {
var buff bytes.Buffer
translate(obj, &buff)
return string(buff.Bytes())
}
func decodeString(s string) (byte, error) {
b, err := hex.DecodeString(s)
if err == nil {
return b[0], err
} else {
return byte(0), err
}
}
func decodeBasic(s string) ([]byteString, error) {
codes := strings.Split(s, " ")
var out []byteString
if codes[0] != "^^" {
return []byteString{}, errors.New("Missing ^^ at start of message, invalid format")
}
if codes[len(codes)-1] != "$$" {
return []byteString{}, errors.New("Missing $$ at start of message, invalid format")
}
for _, v := range codes {
b, err := decodeString(v)
if err != nil {
//It might be a control code
out = append(out, []byte(v))
} else {
out = append(out, byteString{b})
}
}
return out, nil
}
func joinByteStrings(b []byteString) byteString {
var out byteString
for _, v := range b {
out = append(out, v...)
}
return out
}
func buildTokens(s []byteString) []byteString {
if len(s) == 0 {
return []byteString{}
}
//fmt.Println("Builtoken from: ", s[0])
if len(s[0]) == 1 {
i := 0
for i = 0; i < len(s) && len(s[i]) == 1; i = i {
i = i + 1
}
str := joinByteStrings(s[0:i])
return append([]byteString{str}, buildTokens(s[i:])...)
}
return append([]byteString{s[0]}, buildTokens(s[1:])...)
}
func buildHash(b []byteString) (map[string]interface{}, []byteString) {
var h map[string]interface{} = map[string]interface{}{}
//Fucking unbelievable
first := string(b[0])
if first != "{{" {
return h, b
}
i := 0
for i = 0; string(b[i]) != "}}"; i = i {
key := b[i+1]
var val interface{}
val = b[i+3]
bval := b[i+1]
if string(bval) == "[[" || string(bval) == "{{" {
val, b = buildStruct(b[i+1:])
i = 0
} else {
i = i + 4
}
h[string(key)] = val
}
return h, b[i+1:]
}
func buildArray(b []byteString) (map[string]interface{}, []byteString) {
var h map[string]interface{} = map[string]interface{}{}
if string(b[0]) != "[[" {
return h, b
}
i := 0
for i = 0; string(b[i]) != "]]"; i = i {
if i > 0 && string(b[i]) != ",," {
panic("Expected ,, got " + string(b[i]))
}
key := fmt.Sprintf("%v", i)
var val interface{}
val = b[i+1]
bval := b[i+1]
//fmt.Println("bval is ", string(bval))
if string(bval) == "[[" || string(bval) == "{{" {
val, b = buildStruct(b[i+1:])
i = 0
} else {
i = i + 2
}
h[key] = val
}
return h, b[i+1:]
}
//Given a string containing a message in esmf format, this will rebuild the Go data structure, and return it as a map[string]interface{}
func FromESMF(s string) (map[string]interface{}, error) {
b, _ := decodeBasic(s)
//fmt.Println(b)
c := buildTokens(b)
//fmt.Println(c)
//for _, v := range c {
// fmt.Println(string(v))
//}
d, _ := buildStruct(c[2:])
//fmt.Println(d)
return d, nil
}
func buildStruct(b []byteString) (map[string]interface{}, []byteString) {
c := b[0]
var v map[string]interface{}
//fmt.Println("Building struct for: ", string(c))
if string(c) == "[[" {
//fmt.Println("Building array")
v, b = buildArray(b)
} else {
if string(c) == "{{" {
//fmt.Println("Building hash")
v, b = buildHash(b)
}
}
return v, b
}