-
Notifications
You must be signed in to change notification settings - Fork 34
/
jsony.nim
932 lines (859 loc) · 22.5 KB
/
jsony.nim
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
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
import jsony/objvar, std/json, std/options, std/parseutils, std/sets,
std/strutils, std/tables, std/typetraits, std/unicode
type JsonError* = object of ValueError
const
whiteSpace = {' ', '\n', '\t', '\r'}
hex = "0123456789abcdef"
when defined(release):
{.push checks: off, inline.}
type
SomeTable*[K, V] = Table[K, V] | OrderedTable[K, V] |
TableRef[K, V] | OrderedTableRef[K, V]
RawJson* = distinct string
proc parseHook*[T](s: string, i: var int, v: var seq[T])
proc parseHook*[T: enum](s: string, i: var int, v: var T)
proc parseHook*[T: object|ref object](s: string, i: var int, v: var T)
proc parseHook*[K: string | enum, V](s: string, i: var int, v: var SomeTable[K, V])
proc parseHook*[T](s: string, i: var int, v: var (SomeSet[T]|set[T]))
proc parseHook*[T: tuple](s: string, i: var int, v: var T)
proc parseHook*[T: array](s: string, i: var int, v: var T)
proc parseHook*[T: not object](s: string, i: var int, v: var ref T)
proc parseHook*(s: string, i: var int, v: var JsonNode)
proc parseHook*(s: string, i: var int, v: var char)
proc parseHook*[T: distinct](s: string, i: var int, v: var T)
template error(msg: string, i: int) =
## Shortcut to raise an exception.
raise newException(JsonError, msg & " At offset: " & $i)
template eatSpace*(s: string, i: var int) =
## Will consume whitespace.
while i < s.len:
let c = s[i]
if c notin whiteSpace:
break
inc i
template eatChar*(s: string, i: var int, c: char) =
## Will consume space before and then the character `c`.
## Will raise an exception if `c` is not found.
eatSpace(s, i)
if i >= s.len:
error("Expected " & c & " but end reached.", i)
if s[i] == c:
inc i
else:
error("Expected " & c & " but got " & s[i] & " instead.", i)
proc parseSymbol*(s: string, i: var int): string =
## Will read a symbol and return it.
## Used for numbers and booleans.
eatSpace(s, i)
var j = i
while i < s.len:
case s[i]
of ',', '}', ']', whiteSpace:
break
else:
discard
inc i
return s[j ..< i]
proc parseHook*(s: string, i: var int, v: var bool) =
## Will parse boolean true or false.
when nimvm:
case parseSymbol(s, i)
of "true":
v = true
of "false":
v = false
else:
error("Boolean true or false expected.", i)
else:
# Its faster to do char by char scan:
eatSpace(s, i)
if i + 3 < s.len and
s[i+0] == 't' and
s[i+1] == 'r' and
s[i+2] == 'u' and
s[i+3] == 'e':
i += 4
v = true
elif i + 4 < s.len and
s[i+0] == 'f' and
s[i+1] == 'a' and
s[i+2] == 'l' and
s[i+3] == 's' and
s[i+4] == 'e':
i += 5
v = false
else:
error("Boolean true or false expected.", i)
proc parseHook*(s: string, i: var int, v: var SomeUnsignedInt) =
## Will parse unsigned integers.
when nimvm:
v = type(v)(parseInt(parseSymbol(s, i)))
else:
eatSpace(s, i)
var
v2: uint64 = 0
startI = i
while i < s.len and s[i] in {'0'..'9'}:
v2 = v2 * 10 + (s[i].ord - '0'.ord).uint64
inc i
if startI == i:
error("Number expected.", i)
v = type(v)(v2)
proc parseHook*(s: string, i: var int, v: var SomeSignedInt) =
## Will parse signed integers.
when nimvm:
v = type(v)(parseInt(parseSymbol(s, i)))
else:
eatSpace(s, i)
if i < s.len and s[i] == '+':
inc i
if i < s.len and s[i] == '-':
var v2: uint64
inc i
parseHook(s, i, v2)
v = -type(v)(v2)
else:
var v2: uint64
parseHook(s, i, v2)
try:
v = type(v)(v2)
except:
error("Number type to small to contain the number.", i)
proc parseHook*(s: string, i: var int, v: var SomeFloat) =
## Will parse float32 and float64.
var f: float
eatSpace(s, i)
let chars = parseutils.parseFloat(s, f, i)
if chars == 0:
error("Failed to parse a float.", i)
i += chars
v = f
proc validRuneAt(s: string, i: int): Option[Rune] =
# Based on fastRuneAt from std/unicode
template ones(n: untyped): untyped = ((1 shl n)-1)
if uint(s[i]) <= 127:
result = some(Rune(uint(s[i])))
elif uint(s[i]) shr 5 == 0b110:
if i <= s.len - 2:
let valid = (uint(s[i+1]) shr 6 == 0b10)
if valid:
result = some(Rune(
(uint(s[i]) and (ones(5))) shl 6 or
(uint(s[i+1]) and ones(6))
))
elif uint(s[i]) shr 4 == 0b1110:
if i <= s.len - 3:
let valid =
(uint(s[i+1]) shr 6 == 0b10) and
(uint(s[i+2]) shr 6 == 0b10)
if valid:
result = some(Rune(
(uint(s[i]) and ones(4)) shl 12 or
(uint(s[i+1]) and ones(6)) shl 6 or
(uint(s[i+2]) and ones(6))
))
elif uint(s[i]) shr 3 == 0b11110:
if i <= s.len - 4:
let valid =
(uint(s[i+1]) shr 6 == 0b10) and
(uint(s[i+2]) shr 6 == 0b10) and
(uint(s[i+3]) shr 6 == 0b10)
if valid:
result = some(Rune(
(uint(s[i]) and ones(3)) shl 18 or
(uint(s[i+1]) and ones(6)) shl 12 or
(uint(s[i+2]) and ones(6)) shl 6 or
(uint(s[i+3]) and ones(6))
))
proc parseUnicodeEscape(s: string, i: var int): int =
inc i
if i + 4 > s.len:
error("Expected unicode escape hex but end reached.", i)
result = parseHexInt(s[i ..< i + 4])
i += 3
# Deal with UTF-16 surrogates. Most of the time strings are encoded as utf8
# but some APIs will reply with UTF-16 surrogate pairs which needs to be dealt
# with.
if (result and 0xfc00) == 0xd800:
inc i
if s[i] != '\\':
error("Found an Orphan Surrogate.", i)
inc i
if s[i] != 'u':
error("Found an Orphan Surrogate.", i)
inc i
let nextRune = parseHexInt(s[i ..< i + 4])
i += 3
if (nextRune and 0xfc00) == 0xdc00:
result = 0x10000 + (((result - 0xd800) shl 10) or (nextRune - 0xdc00))
proc parseHook*(s: string, i: var int, v: var string) =
## Parse string.
eatSpace(s, i)
if i + 3 < s.len and
s[i+0] == 'n' and
s[i+1] == 'u' and
s[i+2] == 'l' and
s[i+3] == 'l':
i += 4
return
eatChar(s, i, '"')
template doCopy() =
if i > copyStart:
let numBytes = i - copyStart
when nimvm:
for p in 0 ..< numBytes:
v.add s[copyStart + p]
else:
when defined(js):
for p in 0 ..< numBytes:
v.add s[copyStart + p]
else:
let vLen = v.len
v.setLen(vLen + numBytes)
copyMem(v[vLen].addr, s[copyStart].unsafeAddr, numBytes)
copyStart = i
var copyStart = i
while i < s.len:
let c = s[i]
if (cast[uint8](c) and 0b10000000) == 0:
# When the high bit is not set this is a single-byte character (ASCII)
case c
of '"':
break
of '\\':
if i + 1 >= s.len:
error("Expected escaped character but end reached.", i)
doCopy()
inc i
copyStart = i
let c = s[i]
case c
of '"', '\\', '/': v.add(c)
of 'b': v.add '\b'
of 'f': v.add '\f'
of 'n': v.add '\n'
of 'r': v.add '\r'
of 't': v.add '\t'
of 'u':
v.add(Rune(parseUnicodeEscape(s, i)))
else:
v.add(c)
inc i
copyStart = i
else:
inc i
else: # Multi-byte characters
let r = s.validRuneAt(i)
if r.isSome:
i += r.unsafeGet.size
else: # Not a valid rune
error("Found invalid UTF-8 character.", i)
doCopy()
eatChar(s, i, '"')
proc parseHook*(s: string, i: var int, v: var char) =
var str: string
s.parseHook(i, str)
if str.len != 1:
error("String can't fit into a char.", i)
v = str[0]
proc parseHook*[T](s: string, i: var int, v: var seq[T]) =
## Parse seq.
eatChar(s, i, '[')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == ']':
break
var element: T
parseHook(s, i, element)
v.add(element)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
else:
break
eatChar(s, i, ']')
proc parseHook*[T: array](s: string, i: var int, v: var T) =
eatSpace(s, i)
eatChar(s, i, '[')
for value in v.mitems:
eatSpace(s, i)
parseHook(s, i, value)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, ']')
proc parseHook*[T: not object](s: string, i: var int, v: var ref T) =
eatSpace(s, i)
if i + 3 < s.len and
s[i+0] == 'n' and
s[i+1] == 'u' and
s[i+2] == 'l' and
s[i+3] == 'l':
i += 4
return
new(v)
parseHook(s, i, v[])
proc skipValue*(s: string, i: var int) =
## Used to skip values of extra fields.
eatSpace(s, i)
if i < s.len and s[i] == '{':
eatChar(s, i, '{')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == '}':
break
skipValue(s, i)
eatChar(s, i, ':')
skipValue(s, i)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, '}')
elif i < s.len and s[i] == '[':
eatChar(s, i, '[')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == ']':
break
skipValue(s, i)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, ']')
elif i < s.len and s[i] == '"':
var str: string
parseHook(s, i, str)
else:
discard parseSymbol(s, i)
proc snakeCaseDynamic(s: string): string =
if s.len == 0:
return
var prevCap = false
for i, c in s:
if c in {'A'..'Z'}:
if result.len > 0 and result[result.len-1] != '_' and not prevCap:
result.add '_'
prevCap = true
result.add c.toLowerAscii()
else:
prevCap = false
result.add c
template snakeCase(s: string): string =
const k = snakeCaseDynamic(s)
k
proc parseObjectInner[T](s: string, i: var int, v: var T) =
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == '}':
break
var key: string
parseHook(s, i, key)
eatChar(s, i, ':')
when compiles(renameHook(v, key)):
renameHook(v, key)
block all:
for k, v in v.fieldPairs:
if k == key or snakeCase(k) == key:
var v2: type(v)
parseHook(s, i, v2)
v = v2
break all
skipValue(s, i)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
else:
break
when compiles(postHook(v)):
postHook(v)
proc parseHook*[T: tuple](s: string, i: var int, v: var T) =
eatSpace(s, i)
when T.isNamedTuple():
if i < s.len and s[i] == '{':
eatChar(s, i, '{')
parseObjectInner(s, i, v)
eatChar(s, i, '}')
return
eatChar(s, i, '[')
for name, value in v.fieldPairs:
eatSpace(s, i)
parseHook(s, i, value)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, ']')
proc parseHook*[T: enum](s: string, i: var int, v: var T) =
eatSpace(s, i)
var strV: string
if i < s.len and s[i] == '"':
parseHook(s, i, strV)
when compiles(enumHook(strV, v)):
enumHook(strV, v)
else:
try:
v = parseEnum[T](strV)
except:
error("Can't parse enum.", i)
else:
try:
strV = parseSymbol(s, i)
v = T(parseInt(strV))
except:
error("Can't parse enum.", i)
proc parseHook*[T: object|ref object](s: string, i: var int, v: var T) =
## Parse an object or ref object.
eatSpace(s, i)
if i + 3 < s.len and
s[i+0] == 'n' and
s[i+1] == 'u' and
s[i+2] == 'l' and
s[i+3] == 'l':
i += 4
return
eatChar(s, i, '{')
when not v.isObjectVariant:
when compiles(newHook(v)):
newHook(v)
elif compiles(new(v)):
new(v)
else:
# Try looking for the discriminatorFieldName, then parse as normal object.
eatSpace(s, i)
var saveI = i
while i < s.len:
var key: string
parseHook(s, i, key)
eatChar(s, i, ':')
when compiles(renameHook(v, key)):
renameHook(v, key)
if key == v.discriminatorFieldName:
var discriminator: type(v.discriminatorField)
parseHook(s, i, discriminator)
new(v, discriminator)
when compiles(newHook(v)):
newHook(v)
break
skipValue(s, i)
if i < s.len and s[i] != '}':
eatChar(s, i, ',')
else:
when compiles(newHook(v)):
newHook(v)
elif compiles(new(v)):
new(v)
break
i = saveI
parseObjectInner(s, i, v)
eatChar(s, i, '}')
proc parseHook*[T](s: string, i: var int, v: var Option[T]) =
## Parse an Option.
eatSpace(s, i)
if i + 3 < s.len and
s[i+0] == 'n' and
s[i+1] == 'u' and
s[i+2] == 'l' and
s[i+3] == 'l':
i += 4
return
var e: T
parseHook(s, i, e)
v = some(e)
proc parseHook*[K: string | enum, V](s: string, i: var int, v: var SomeTable[K, V]) =
## Parse an object.
when compiles(new(v)):
new(v)
eatChar(s, i, '{')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == '}':
break
var key: K
parseHook(s, i, key)
eatChar(s, i, ':')
var element: V
parseHook(s, i, element)
v[key] = element
if i < s.len and s[i] == ',':
inc i
else:
break
eatChar(s, i, '}')
proc parseHook*[T](s: string, i: var int, v: var (SomeSet[T]|set[T])) =
## Parses `HashSet`, `OrderedSet`, or a built-in `set` type.
eatSpace(s, i)
eatChar(s, i, '[')
while true:
eatSpace(s, i)
if i < s.len and s[i] == ']':
break
var e: T
parseHook(s, i, e)
v.incl(e)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, ']')
proc parseHook*(s: string, i: var int, v: var JsonNode) =
## Parses a regular json node.
eatSpace(s, i)
if i < s.len and s[i] == '{':
v = newJObject()
eatChar(s, i, '{')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == '}':
break
var k: string
parseHook(s, i, k)
eatChar(s, i, ':')
var e: JsonNode
parseHook(s, i, e)
v[k] = e
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, '}')
elif i < s.len and s[i] == '[':
v = newJArray()
eatChar(s, i, '[')
while i < s.len:
eatSpace(s, i)
if i < s.len and s[i] == ']':
break
var e: JsonNode
parseHook(s, i, e)
v.add(e)
eatSpace(s, i)
if i < s.len and s[i] == ',':
inc i
eatChar(s, i, ']')
elif i < s.len and s[i] == '"':
var str: string
parseHook(s, i, str)
v = newJString(str)
else:
var data = parseSymbol(s, i)
if data == "null":
v = newJNull()
elif data == "true":
v = newJBool(true)
elif data == "false":
v = newJBool(false)
elif data.len > 0 and data[0] in {'0'..'9', '-', '+'}:
try:
v = newJInt(parseInt(data))
except ValueError:
try:
v = newJFloat(parseFloat(data))
except ValueError:
error("Invalid number.", i)
else:
error("Unexpected.", i)
proc parseHook*[T: distinct](s: string, i: var int, v: var T) =
var x: T.distinctBase
parseHook(s, i, x)
v = cast[T](x)
proc fromJson*[T](s: string, x: typedesc[T]): T =
## Takes json and outputs the object it represents.
## * Extra json fields are ignored.
## * Missing json fields keep their default values.
## * `proc newHook(foo: var ...)` Can be used to populate default values.
var i = 0
result = default(T)
s.parseHook(i, result)
eatSpace(s, i)
if i != s.len:
error("Found non-whitespace character after JSON data.", i)
proc fromJson*(s: string): JsonNode =
## Takes json parses it into `JsonNode`s.
var i = 0
s.parseHook(i, result)
eatSpace(s, i)
if i != s.len:
error("Found non-whitespace character after JSON data.", i)
proc dumpHook*(s: var string, v: bool)
proc dumpHook*(s: var string, v: uint|uint8|uint16|uint32|uint64)
proc dumpHook*(s: var string, v: int|int8|int16|int32|int64)
proc dumpHook*(s: var string, v: SomeFloat)
proc dumpHook*(s: var string, v: string)
proc dumpHook*(s: var string, v: char)
proc dumpHook*(s: var string, v: tuple)
proc dumpHook*(s: var string, v: enum)
type t[T] = tuple[a: string, b: T]
proc dumpHook*[N, T](s: var string, v: array[N, t[T]])
proc dumpHook*[N, T](s: var string, v: array[N, T])
proc dumpHook*[T](s: var string, v: seq[T])
proc dumpHook*(s: var string, v: object)
proc dumpHook*(s: var string, v: ref)
proc dumpHook*[T: distinct](s: var string, v: T)
proc dumpHook*[T: distinct](s: var string, v: T) =
var x = cast[T.distinctBase](v)
s.dumpHook(x)
proc dumpHook*(s: var string, v: bool) =
if v:
s.add "true"
else:
s.add "false"
const lookup = block:
## Generate 00, 01, 02 ... 99 pairs.
var s = ""
for i in 0 ..< 100:
if ($i).len == 1:
s.add("0")
s.add($i)
s
proc dumpNumberSlow(s: var string, v: uint|uint8|uint16|uint32|uint64) =
s.add $v.uint64
proc dumpNumberFast(s: var string, v: uint|uint8|uint16|uint32|uint64) =
# Its faster to not allocate a string for a number,
# but to write it out the digits directly.
if v == 0:
s.add '0'
return
# Max size of a uin64 number is 20 digits.
var digits: array[20, char]
var v = v
var p = 0
while v != 0:
# Its faster to look up 2 digits at a time, less int divisions.
let idx = v mod 100
digits[p] = lookup[idx*2+1]
inc p
digits[p] = lookup[idx*2]
inc p
v = v div 100
var at = s.len
if digits[p-1] == '0':
dec p
s.setLen(s.len + p)
dec p
while p >= 0:
s[at] = digits[p]
dec p
inc at
proc dumpHook*(s: var string, v: uint|uint8|uint16|uint32|uint64) =
when nimvm:
s.dumpNumberSlow(v)
else:
when defined(js):
s.dumpNumberSlow(v)
else:
s.dumpNumberFast(v)
proc dumpHook*(s: var string, v: int|int8|int16|int32|int64) =
if v < 0:
s.add '-'
dumpHook(s, 0.uint64 - v.uint64)
else:
dumpHook(s, v.uint64)
proc dumpHook*(s: var string, v: SomeFloat) =
s.add $v
proc dumpHook*(s: var string, v: string) =
s.add '"'
template doCopy() =
if i > copyStart:
let numBytes = i - copyStart
when nimvm:
for p in 0 ..< numBytes:
s.add v[copyStart + p]
else:
when defined(js):
for p in 0 ..< numBytes:
s.add v[copyStart + p]
else:
let sLen = s.len
s.setLen(sLen + numBytes)
copyMem(s[sLen].addr, v[copyStart].unsafeAddr, numBytes)
copyStart = i
var i, copyStart: int
while i < v.len:
let c = v[i]
if (cast[uint8](c) and 0b10000000) == 0:
# When the high bit is not set this is a single-byte character (ASCII)
# Does this character need escaping?
if c < 32.char or c == '\\' or c == '"':
doCopy()
case c:
of '\\': s.add r"\\"
of '\b': s.add r"\b"
of '\f': s.add r"\f"
of '\n': s.add r"\n"
of '\r': s.add r"\r"
of '\t': s.add r"\t"
of '\v': s.add r"\u000b"
of '"': s.add r"\"""
of '\0'..'\7', '\14'..'\31':
s.add r"\u00"
s.add hex[c.int shr 4]
s.add hex[c.int and 0xf]
else:
discard # Not possible
inc i
copyStart = i
else:
inc i
else: # Multi-byte characters
let r = v.validRuneAt(i)
if r.isSome:
i += r.unsafeGet.size
else: # Not a valid rune, use replacement character
doCopy()
s.add Rune(0xfffd)
inc i
copyStart = i
doCopy()
s.add '"'
template dumpKey(s: var string, v: string) =
const v2 = v.toJson() & ":"
s.add v2
proc dumpHook*(s: var string, v: char) =
s.add '"'
s.add v
s.add '"'
proc dumpHook*(s: var string, v: tuple) =
s.add '['
var i = 0
for _, e in v.fieldPairs:
if i > 0:
s.add ','
s.dumpHook(e)
inc i
s.add ']'
proc dumpHook*(s: var string, v: enum) =
s.dumpHook($v)
proc dumpHook*[N, T](s: var string, v: array[N, T]) =
s.add '['
var i = 0
for e in v:
if i != 0:
s.add ','
s.dumpHook(e)
inc i
s.add ']'
proc dumpHook*[T](s: var string, v: seq[T]) =
s.add '['
for i, e in v:
if i != 0:
s.add ','
s.dumpHook(e)
s.add ']'
proc dumpHook*[T](s: var string, v: Option[T]) =
if v.isNone:
s.add "null"
else:
s.dumpHook(v.get())
proc dumpHook*(s: var string, v: object) =
s.add '{'
var i = 0
when compiles(for k, e in v.pairs: discard):
# Tables and table like objects.
for k, e in v.pairs:
if i > 0:
s.add ','
s.dumpHook(k)
s.add ':'
s.dumpHook(e)
inc i
else:
# Normal objects.
for k, e in v.fieldPairs:
when compiles(skipHook(type(v), k)):
when skipHook(type(v), k):
discard
else:
if i > 0:
s.add ','
s.dumpKey(k)
s.dumpHook(e)
inc i
else:
if i > 0:
s.add ','
s.dumpKey(k)
s.dumpHook(e)
inc i
s.add '}'
proc dumpHook*[N, T](s: var string, v: array[N, t[T]]) =
s.add '{'
var i = 0
# Normal objects.
for (k, e) in v:
if i > 0:
s.add ','
s.dumpHook(k)
s.add ':'
s.dumpHook(e)
inc i
s.add '}'
proc dumpHook*(s: var string, v: ref) =
if v == nil:
s.add "null"
else:
s.dumpHook(v[])
proc dumpHook*[T](s: var string, v: SomeSet[T]|set[T]) =
s.add '['
var i = 0
for e in v:
if i != 0:
s.add ','
s.dumpHook(e)
inc i
s.add ']'
proc dumpHook*(s: var string, v: JsonNode) =
## Dumps a regular json node.
if v == nil:
s.add "null"
else:
case v.kind:
of JObject:
s.add '{'
var i = 0
for k, e in v.pairs:
if i != 0:
s.add ","
s.dumpHook(k)
s.add ':'
s.dumpHook(e)
inc i
s.add '}'
of JArray:
s.add '['
var i = 0
for e in v:
if i != 0:
s.add ","
s.dumpHook(e)
inc i
s.add ']'
of JNull:
s.add "null"
of JInt:
s.dumpHook(v.getInt)
of JFloat:
s.dumpHook(v.getFloat)
of JString:
s.dumpHook(v.getStr)
of JBool:
s.dumpHook(v.getBool)
proc parseHook*(s: string, i: var int, v: var RawJson) =
let oldI = i
skipValue(s, i)
v = s[oldI ..< i].RawJson
proc dumpHook*(s: var string, v: RawJson) =
s.add v.string
proc toJson*[T](v: T): string =
dumpHook(result, v)
template toStaticJson*(v: untyped): static[string] =
## This will turn v into json at compile time and return the json string.
const s = v.toJson()
s
# A compiler bug prevents this from working. Otherwise toStaticJson and toJson
# can be same thing.
# TODO: Figure out the compiler bug.
# proc toJsonDynamic*[T](v: T): string =
# dumpHook(result, v)
# template toJson*[T](v: static[T]): string =
# ## This will turn v into json at compile time and return the json string.
# const s = v.toJsonDynamic()
# s
when defined(release):
{.pop.}