-
Notifications
You must be signed in to change notification settings - Fork 13
Expand file tree
/
Copy pathencoders.go
More file actions
329 lines (289 loc) · 9.83 KB
/
encoders.go
File metadata and controls
329 lines (289 loc) · 9.83 KB
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
package gotoon
import (
"fmt"
"sort"
)
// encodeValue encodes a normalized value to TOON format
func encodeValue(value interface{}, opts *EncodeOptions) string {
if isPrimitive(value) {
return encodePrimitive(value, opts.Delimiter)
}
writer := NewLineWriter(opts.Indent)
if arr, ok := value.([]interface{}); ok {
encodeArray("", arr, writer, 0, opts)
} else if obj, ok := value.(map[string]interface{}); ok {
encodeObject(obj, writer, 0, opts)
}
return writer.String()
}
// encodeObject encodes an object (map) to TOON format
func encodeObject(obj map[string]interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
// Sort keys for deterministic output
keys := make([]string, 0, len(obj))
for k := range obj {
keys = append(keys, k)
}
sort.Strings(keys)
for _, key := range keys {
encodeKeyValuePair(key, obj[key], writer, depth, opts)
}
}
// encodeKeyValuePair encodes a single key-value pair
func encodeKeyValuePair(key string, value interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
encodedKey := encodeKey(key)
if isPrimitive(value) {
writer.Push(depth, fmt.Sprintf("%s: %s", encodedKey, encodePrimitive(value, opts.Delimiter)))
} else if arr, ok := value.([]interface{}); ok {
encodeArray(key, arr, writer, depth, opts)
} else if obj, ok := value.(map[string]interface{}); ok {
keys := make([]string, 0, len(obj))
for k := range obj {
keys = append(keys, k)
}
if len(keys) == 0 {
// Empty object
writer.Push(depth, encodedKey+Colon)
} else {
writer.Push(depth, encodedKey+Colon)
encodeObject(obj, writer, depth+1, opts)
}
}
}
// encodeArray encodes an array with various strategies based on content
func encodeArray(key string, arr []interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
if len(arr) == 0 {
header := formatHeader(0, headerOptions{
key: key,
delimiter: opts.Delimiter,
lengthMarker: opts.LengthMarker,
})
writer.Push(depth, header)
return
}
// Strategy 1: Primitive array (inline)
if isArrayOfPrimitives(arr) {
encodeInlinePrimitiveArray(key, arr, writer, depth, opts)
return
}
// Strategy 2: Array of arrays (all primitives)
if isArrayOfArrays(arr) {
allPrimitiveArrays := true
for _, item := range arr {
if itemArr, ok := item.([]interface{}); ok {
if !isArrayOfPrimitives(itemArr) {
allPrimitiveArrays = false
break
}
}
}
if allPrimitiveArrays {
encodeArrayOfArraysAsListItems(key, arr, writer, depth, opts)
return
}
}
// Strategy 3: Array of objects (try tabular format)
if isArrayOfObjects(arr) {
objects := make([]map[string]interface{}, len(arr))
for i, item := range arr {
objects[i] = item.(map[string]interface{})
}
header := detectTabularHeader(objects)
if header != nil {
encodeArrayOfObjectsAsTabular(key, objects, header, writer, depth, opts)
} else {
encodeMixedArrayAsListItems(key, arr, writer, depth, opts)
}
return
}
// Strategy 4: Mixed array (fallback to list format)
encodeMixedArrayAsListItems(key, arr, writer, depth, opts)
}
// encodeInlinePrimitiveArray encodes a primitive array in inline format
func encodeInlinePrimitiveArray(prefix string, values []interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
formatted := formatInlineArray(values, opts.Delimiter, prefix, opts.LengthMarker)
writer.Push(depth, formatted)
}
// encodeArrayOfArraysAsListItems encodes an array of primitive arrays in list format
func encodeArrayOfArraysAsListItems(prefix string, arrays []interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
header := formatHeader(len(arrays), headerOptions{
key: prefix,
delimiter: opts.Delimiter,
lengthMarker: opts.LengthMarker,
})
writer.Push(depth, header)
for _, item := range arrays {
if arr, ok := item.([]interface{}); ok && isArrayOfPrimitives(arr) {
inline := formatInlineArray(arr, opts.Delimiter, "", opts.LengthMarker)
writer.Push(depth+1, ListItemPrefix+inline)
}
}
}
// detectTabularHeader detects if an array of objects can use tabular format
func detectTabularHeader(objects []map[string]interface{}) []string {
if len(objects) == 0 {
return nil
}
// Get keys from first object
firstObj := objects[0]
if len(firstObj) == 0 {
return nil
}
// Extract and sort keys for deterministic output
firstKeys := make([]string, 0, len(firstObj))
for k := range firstObj {
firstKeys = append(firstKeys, k)
}
sort.Strings(firstKeys)
// Check if all objects have the same keys with primitive values
if isTabularArray(objects, firstKeys) {
return firstKeys
}
return nil
}
// isTabularArray checks if all objects have the same keys and only primitive values
func isTabularArray(objects []map[string]interface{}, header []string) bool {
for _, obj := range objects {
// All objects must have the same number of keys
if len(obj) != len(header) {
return false
}
// Check that all header keys exist and values are primitives
for _, key := range header {
value, exists := obj[key]
if !exists {
return false
}
if !isPrimitive(value) {
return false
}
}
}
return true
}
// encodeArrayOfObjectsAsTabular encodes an array of uniform objects in tabular format
func encodeArrayOfObjectsAsTabular(prefix string, objects []map[string]interface{}, header []string, writer *LineWriter, depth int, opts *EncodeOptions) {
headerStr := formatHeader(len(objects), headerOptions{
key: prefix,
fields: header,
delimiter: opts.Delimiter,
lengthMarker: opts.LengthMarker,
})
writer.Push(depth, headerStr)
writeTabularRows(objects, header, writer, depth+1, opts)
}
// writeTabularRows writes the data rows for a tabular array
func writeTabularRows(objects []map[string]interface{}, header []string, writer *LineWriter, depth int, opts *EncodeOptions) {
for _, obj := range objects {
values := make([]interface{}, len(header))
for i, key := range header {
values[i] = obj[key]
}
joined := joinEncodedValues(values, opts.Delimiter)
writer.Push(depth, joined)
}
}
// encodeMixedArrayAsListItems encodes a mixed array in list format
func encodeMixedArrayAsListItems(prefix string, items []interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
header := formatHeader(len(items), headerOptions{
key: prefix,
delimiter: opts.Delimiter,
lengthMarker: opts.LengthMarker,
})
writer.Push(depth, header)
for _, item := range items {
if isPrimitive(item) {
// Direct primitive as list item
writer.Push(depth+1, ListItemPrefix+encodePrimitive(item, opts.Delimiter))
} else if arr, ok := item.([]interface{}); ok {
// Direct array as list item
if isArrayOfPrimitives(arr) {
inline := formatInlineArray(arr, opts.Delimiter, "", opts.LengthMarker)
writer.Push(depth+1, ListItemPrefix+inline)
}
} else if obj, ok := item.(map[string]interface{}); ok {
// Object as list item
encodeObjectAsListItem(obj, writer, depth+1, opts)
}
}
}
// encodeObjectAsListItem encodes an object as a list item
func encodeObjectAsListItem(obj map[string]interface{}, writer *LineWriter, depth int, opts *EncodeOptions) {
// Sort keys for deterministic output
keys := make([]string, 0, len(obj))
for k := range obj {
keys = append(keys, k)
}
sort.Strings(keys)
if len(keys) == 0 {
writer.Push(depth, ListItemMarker)
return
}
// First key-value on the same line as "- "
firstKey := keys[0]
encodedKey := encodeKey(firstKey)
firstValue := obj[firstKey]
if isPrimitive(firstValue) {
writer.Push(depth, fmt.Sprintf("%s%s: %s", ListItemPrefix, encodedKey, encodePrimitive(firstValue, opts.Delimiter)))
} else if arr, ok := firstValue.([]interface{}); ok {
if isArrayOfPrimitives(arr) {
// Inline format for primitive arrays
formatted := formatInlineArray(arr, opts.Delimiter, firstKey, opts.LengthMarker)
writer.Push(depth, ListItemPrefix+formatted)
} else if isArrayOfObjects(arr) {
// Check if array of objects can use tabular format
objects := make([]map[string]interface{}, len(arr))
for i, item := range arr {
objects[i] = item.(map[string]interface{})
}
header := detectTabularHeader(objects)
if header != nil {
// Tabular format
headerStr := formatHeader(len(arr), headerOptions{
key: firstKey,
fields: header,
delimiter: opts.Delimiter,
lengthMarker: opts.LengthMarker,
})
writer.Push(depth, ListItemPrefix+headerStr)
writeTabularRows(objects, header, writer, depth+1, opts)
} else {
// Fall back to list format
writer.Push(depth, fmt.Sprintf("%s%s[%d]:", ListItemPrefix, encodedKey, len(arr)))
for _, item := range arr {
if itemObj, ok := item.(map[string]interface{}); ok {
encodeObjectAsListItem(itemObj, writer, depth+1, opts)
}
}
}
} else {
// Complex arrays on separate lines
writer.Push(depth, fmt.Sprintf("%s%s[%d]:", ListItemPrefix, encodedKey, len(arr)))
for _, item := range arr {
if isPrimitive(item) {
writer.Push(depth+1, ListItemPrefix+encodePrimitive(item, opts.Delimiter))
} else if itemArr, ok := item.([]interface{}); ok && isArrayOfPrimitives(itemArr) {
inline := formatInlineArray(itemArr, opts.Delimiter, "", opts.LengthMarker)
writer.Push(depth+1, ListItemPrefix+inline)
} else if itemObj, ok := item.(map[string]interface{}); ok {
encodeObjectAsListItem(itemObj, writer, depth+1, opts)
}
}
}
} else if nestedObj, ok := firstValue.(map[string]interface{}); ok {
nestedKeys := make([]string, 0, len(nestedObj))
for k := range nestedObj {
nestedKeys = append(nestedKeys, k)
}
if len(nestedKeys) == 0 {
writer.Push(depth, ListItemPrefix+encodedKey+Colon)
} else {
writer.Push(depth, ListItemPrefix+encodedKey+Colon)
encodeObject(nestedObj, writer, depth+2, opts)
}
}
// Remaining keys on indented lines
for i := 1; i < len(keys); i++ {
key := keys[i]
encodeKeyValuePair(key, obj[key], writer, depth+1, opts)
}
}