-
Notifications
You must be signed in to change notification settings - Fork 446
/
Copy pathstd.jsonnet
1800 lines (1637 loc) · 62.6 KB
/
std.jsonnet
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
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright 2015 Google Inc. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
/* This is the Jsonnet standard library, at least the parts of it that are written in Jsonnet.
*
* There are some native methods as well, which are defined in the interpreter and added to this
* file. It is never necessary to import std.jsonnet, it is embedded into the interpreter at
* compile-time and automatically imported into all other Jsonnet programs.
*/
{
local std = self,
local id = function(x) x,
local go_only_function = error 'This function is only supported in go version of jsonnet. See /~https://github.com/google/go-jsonnet',
isString(v):: std.type(v) == 'string',
isNumber(v):: std.type(v) == 'number',
isBoolean(v):: std.type(v) == 'boolean',
isObject(v):: std.type(v) == 'object',
isArray(v):: std.type(v) == 'array',
isFunction(v):: std.type(v) == 'function',
toString(a)::
if std.type(a) == 'string' then a else '' + a,
substr(str, from, len)::
assert std.isString(str) : 'substr first parameter should be a string, got ' + std.type(str);
assert std.isNumber(from) : 'substr second parameter should be a string, got ' + std.type(from);
assert std.isNumber(len) : 'substr third parameter should be a string, got ' + std.type(len);
assert len >= 0 : 'substr third parameter should be greater than zero, got ' + len;
std.join('', std.makeArray(std.max(0, std.min(len, std.length(str) - from)), function(i) str[i + from])),
startsWith(a, b)::
if std.length(a) < std.length(b) then
false
else
std.substr(a, 0, std.length(b)) == b,
endsWith(a, b)::
if std.length(a) < std.length(b) then
false
else
std.substr(a, std.length(a) - std.length(b), std.length(b)) == b,
lstripChars(str, chars)::
if std.length(str) > 0 && std.member(chars, str[0]) then
std.lstripChars(str[1:], chars) tailstrict
else
str,
rstripChars(str, chars)::
local len = std.length(str);
if len > 0 && std.member(chars, str[len - 1]) then
std.rstripChars(str[:len - 1], chars) tailstrict
else
str,
stripChars(str, chars)::
std.lstripChars(std.rstripChars(str, chars), chars),
stringChars(str)::
std.makeArray(std.length(str), function(i) str[i]),
local parse_nat(str, base) =
assert base > 0 && base <= 16 : 'integer base %d invalid' % base;
// These codepoints are in ascending order:
local zero_code = std.codepoint('0');
local upper_a_code = std.codepoint('A');
local lower_a_code = std.codepoint('a');
local addDigit(aggregate, char) =
local code = std.codepoint(char);
local digit = if code >= lower_a_code then
code - lower_a_code + 10
else if code >= upper_a_code then
code - upper_a_code + 10
else
code - zero_code;
assert digit >= 0 && digit < base : '%s is not a base %d integer' % [str, base];
base * aggregate + digit;
std.foldl(addDigit, std.stringChars(str), 0),
parseInt(str)::
assert std.isString(str) : 'Expected string, got ' + std.type(str);
assert std.length(str) > 0 && str != '-' : 'Not an integer: "%s"' % [str];
if str[0] == '-' then
-parse_nat(str[1:], 10)
else
parse_nat(str, 10),
parseOctal(str)::
assert std.isString(str) : 'Expected string, got ' + std.type(str);
assert std.length(str) > 0 : 'Not an octal number: ""';
parse_nat(str, 8),
parseHex(str)::
assert std.isString(str) : 'Expected string, got ' + std.type(str);
assert std.length(str) > 0 : 'Not hexadecimal: ""';
parse_nat(str, 16),
split(str, c)::
assert std.isString(str) : 'std.split first parameter must be a String, got ' + std.type(str);
assert std.isString(c) : 'std.split second parameter must be a String, got ' + std.type(c);
assert std.length(c) >= 1 : 'std.split second parameter must have length 1 or greater, got ' + std.length(c);
std.splitLimit(str, c, -1),
splitLimit(str, c, maxsplits)::
assert std.isString(str) : 'str.splitLimit first parameter must be a String, got ' + std.type(str);
assert std.isString(c) : 'str.splitLimit second parameter must be a String, got ' + std.type(c);
assert std.length(c) >= 1 : 'std.splitLimit second parameter must have length 1 or greater, got ' + std.length(c);
assert std.isNumber(maxsplits) : 'str.splitLimit third parameter must be a Number, got ' + std.type(maxsplits);
local strLen = std.length(str);
local cLen = std.length(c);
local aux(idx, ret, val) =
if idx >= strLen then
ret + [val]
else if str[idx:idx + cLen:1] == c &&
(maxsplits == -1 || std.length(ret) < maxsplits) then
aux(idx + cLen, ret + [val], '')
else
aux(idx + 1, ret, val + str[idx]);
aux(0, [], ''),
splitLimitR(str, c, maxsplits)::
assert std.isString(str) : 'str.splitLimitR first parameter must be a String, got ' + std.type(str);
assert std.isString(c) : 'str.splitLimitR second parameter must be a String, got ' + std.type(c);
assert std.length(c) >= 1 : 'std.splitLimitR second parameter must have length 1 or greater, got ' + std.length(c);
assert std.isNumber(maxsplits) : 'str.splitLimitR third parameter must be a Number, got ' + std.type(maxsplits);
if maxsplits == -1 then
std.splitLimit(str, c, -1)
else
local revStr(str) = std.join('', std.reverse(std.stringChars(str)));
std.map(function(e) revStr(e), std.reverse(std.splitLimit(revStr(str), revStr(c), maxsplits))),
strReplace(str, from, to)::
assert std.isString(str);
assert std.isString(from);
assert std.isString(to);
assert from != '' : "'from' string must not be zero length.";
// Cache for performance.
local str_len = std.length(str);
local from_len = std.length(from);
// True if from is at str[i].
local found_at(i) = str[i:i + from_len] == from;
// Return the remainder of 'str' starting with 'start_index' where
// all occurrences of 'from' after 'curr_index' are replaced with 'to'.
local replace_after(start_index, curr_index, acc) =
if curr_index > str_len then
acc + str[start_index:curr_index]
else if found_at(curr_index) then
local new_index = curr_index + std.length(from);
replace_after(new_index, new_index, acc + str[start_index:curr_index] + to) tailstrict
else
replace_after(start_index, curr_index + 1, acc) tailstrict;
// if from_len==1, then we replace by splitting and rejoining the
// string which is much faster than recursing on replace_after
if from_len == 1 then
std.join(to, std.split(str, from))
else
replace_after(0, 0, ''),
asciiUpper(str)::
local cp = std.codepoint;
local up_letter(c) = if cp(c) >= 97 && cp(c) < 123 then
std.char(cp(c) - 32)
else
c;
std.join('', std.map(up_letter, std.stringChars(str))),
asciiLower(str)::
local cp = std.codepoint;
local down_letter(c) = if cp(c) >= 65 && cp(c) < 91 then
std.char(cp(c) + 32)
else
c;
std.join('', std.map(down_letter, std.stringChars(str))),
range(from, to)::
std.makeArray(to - from + 1, function(i) i + from),
repeat(what, count)::
local joiner =
if std.isString(what) then ''
else if std.isArray(what) then []
else error 'std.repeat first argument must be an array or a string';
std.join(joiner, std.makeArray(count, function(i) what)),
slice(indexable, index, end, step)::
local invar =
// loop invariant with defaults applied
{
indexable: indexable,
index:
if index == null
then 0
else
if index < 0
then std.max(0, std.length(indexable) + index)
else index,
end:
if end == null
then std.length(indexable)
else
if end < 0
then std.length(indexable) + end
else end,
step:
if step == null
then 1
else step,
length: std.length(indexable),
type: std.type(indexable),
};
assert invar.step >= 0 : 'got [%s:%s:%s] but negative steps are not supported' % [invar.index, invar.end, invar.step];
assert step != 0 : 'got %s but step must be greater than 0' % step;
assert std.isString(indexable) || std.isArray(indexable) : 'std.slice accepts a string or an array, but got: %s' % std.type(indexable);
local build(slice, cur) =
if cur >= invar.end || cur >= invar.length then
slice
else
build(
if invar.type == 'string' then
slice + invar.indexable[cur]
else
slice + [invar.indexable[cur]],
cur + invar.step
) tailstrict;
build(if invar.type == 'string' then '' else [], invar.index),
member(arr, x)::
if std.isArray(arr) then
std.count(arr, x) > 0
else if std.isString(arr) then
std.length(std.findSubstr(x, arr)) > 0
else error 'std.member first argument must be an array or a string',
count(arr, x):: std.length(std.filter(function(v) v == x, arr)),
mod(a, b)::
if std.isNumber(a) && std.isNumber(b) then
std.modulo(a, b)
else if std.isString(a) then
std.format(a, b)
else
error 'Operator % cannot be used on types ' + std.type(a) + ' and ' + std.type(b) + '.',
// this is the most precision that will fit in a f64
pi:: 3.14159265358979311600,
deg2rad(x):: x * std.pi / 180,
rad2deg(x):: x * 180 / std.pi,
log2(x):: std.log(x) / std.log(2),
log10(x):: std.log(x) / std.log(10),
map(func, arr)::
if !std.isFunction(func) then
error ('std.map first param must be function, got ' + std.type(func))
else if !std.isArray(arr) && !std.isString(arr) then
error ('std.map second param must be array / string, got ' + std.type(arr))
else
std.makeArray(std.length(arr), function(i) func(arr[i])),
mapWithIndex(func, arr)::
if !std.isFunction(func) then
error ('std.mapWithIndex first param must be function, got ' + std.type(func))
else if !std.isArray(arr) && !std.isString(arr) then
error ('std.mapWithIndex second param must be array, got ' + std.type(arr))
else
std.makeArray(std.length(arr), function(i) func(i, arr[i])),
mapWithKey(func, obj)::
if !std.isFunction(func) then
error ('std.mapWithKey first param must be function, got ' + std.type(func))
else if !std.isObject(obj) then
error ('std.mapWithKey second param must be object, got ' + std.type(obj))
else
{ [k]: func(k, obj[k]) for k in std.objectFields(obj) },
flatMap(func, arr)::
if !std.isFunction(func) then
error ('std.flatMap first param must be function, got ' + std.type(func))
else if std.isArray(arr) then
std.flattenArrays(std.makeArray(std.length(arr), function(i) func(arr[i])))
else if std.isString(arr) then
std.join('', std.makeArray(std.length(arr), function(i) func(arr[i])))
else error ('std.flatMap second param must be array / string, got ' + std.type(arr)),
join(sep, arr)::
local aux(arr, i, first, running) =
if i >= std.length(arr) then
running
else if arr[i] == null then
aux(arr, i + 1, first, running) tailstrict
else if std.type(arr[i]) != std.type(sep) then
error 'expected %s but arr[%d] was %s ' % [std.type(sep), i, std.type(arr[i])]
else if first then
aux(arr, i + 1, false, running + arr[i]) tailstrict
else
aux(arr, i + 1, false, running + sep + arr[i]) tailstrict;
if !std.isArray(arr) then
error 'join second parameter should be array, got ' + std.type(arr)
else if std.isString(sep) then
aux(arr, 0, true, '')
else if std.isArray(sep) then
aux(arr, 0, true, [])
else
error 'join first parameter should be string or array, got ' + std.type(sep),
lines(arr)::
std.join('\n', arr + ['']),
deepJoin(arr)::
if std.isString(arr) then
arr
else if std.isArray(arr) then
std.join('', [std.deepJoin(x) for x in arr])
else
error 'Expected string or array, got %s' % std.type(arr),
format(str, vals)::
/////////////////////////////
// Parse the mini-language //
/////////////////////////////
local try_parse_mapping_key(str, i) =
assert i < std.length(str) : 'Truncated format code.';
local c = str[i];
if c == '(' then
local consume(str, j, v) =
if j >= std.length(str) then
error 'Truncated format code.'
else
local c = str[j];
if c != ')' then
consume(str, j + 1, v + c)
else
{ i: j + 1, v: v };
consume(str, i + 1, '')
else
{ i: i, v: null };
local try_parse_cflags(str, i) =
local consume(str, j, v) =
assert j < std.length(str) : 'Truncated format code.';
local c = str[j];
if c == '#' then
consume(str, j + 1, v { alt: true })
else if c == '0' then
consume(str, j + 1, v { zero: true })
else if c == '-' then
consume(str, j + 1, v { left: true })
else if c == ' ' then
consume(str, j + 1, v { blank: true })
else if c == '+' then
consume(str, j + 1, v { plus: true })
else
{ i: j, v: v };
consume(str, i, { alt: false, zero: false, left: false, blank: false, plus: false });
local try_parse_field_width(str, i) =
if i < std.length(str) && str[i] == '*' then
{ i: i + 1, v: '*' }
else
local consume(str, j, v) =
assert j < std.length(str) : 'Truncated format code.';
local c = str[j];
if c == '0' then
consume(str, j + 1, v * 10 + 0)
else if c == '1' then
consume(str, j + 1, v * 10 + 1)
else if c == '2' then
consume(str, j + 1, v * 10 + 2)
else if c == '3' then
consume(str, j + 1, v * 10 + 3)
else if c == '4' then
consume(str, j + 1, v * 10 + 4)
else if c == '5' then
consume(str, j + 1, v * 10 + 5)
else if c == '6' then
consume(str, j + 1, v * 10 + 6)
else if c == '7' then
consume(str, j + 1, v * 10 + 7)
else if c == '8' then
consume(str, j + 1, v * 10 + 8)
else if c == '9' then
consume(str, j + 1, v * 10 + 9)
else
{ i: j, v: v };
consume(str, i, 0);
local try_parse_precision(str, i) =
assert i < std.length(str) : 'Truncated format code.';
local c = str[i];
if c == '.' then
try_parse_field_width(str, i + 1)
else
{ i: i, v: null };
// Ignored, if it exists.
local try_parse_length_modifier(str, i) =
assert i < std.length(str) : 'Truncated format code.';
local c = str[i];
if c == 'h' || c == 'l' || c == 'L' then
i + 1
else
i;
local parse_conv_type(str, i) =
assert i < std.length(str) : 'Truncated format code.';
local c = str[i];
if c == 'd' || c == 'i' || c == 'u' then
{ i: i + 1, v: 'd', caps: false }
else if c == 'o' then
{ i: i + 1, v: 'o', caps: false }
else if c == 'x' then
{ i: i + 1, v: 'x', caps: false }
else if c == 'X' then
{ i: i + 1, v: 'x', caps: true }
else if c == 'e' then
{ i: i + 1, v: 'e', caps: false }
else if c == 'E' then
{ i: i + 1, v: 'e', caps: true }
else if c == 'f' then
{ i: i + 1, v: 'f', caps: false }
else if c == 'F' then
{ i: i + 1, v: 'f', caps: true }
else if c == 'g' then
{ i: i + 1, v: 'g', caps: false }
else if c == 'G' then
{ i: i + 1, v: 'g', caps: true }
else if c == 'c' then
{ i: i + 1, v: 'c', caps: false }
else if c == 's' then
{ i: i + 1, v: 's', caps: false }
else if c == '%' then
{ i: i + 1, v: '%', caps: false }
else
error 'Unrecognised conversion type: ' + c;
// Parsed initial %, now the rest.
local parse_code(str, i) =
assert i < std.length(str) : 'Truncated format code.';
local mkey = try_parse_mapping_key(str, i);
local cflags = try_parse_cflags(str, mkey.i);
local fw = try_parse_field_width(str, cflags.i);
local prec = try_parse_precision(str, fw.i);
local len_mod = try_parse_length_modifier(str, prec.i);
local ctype = parse_conv_type(str, len_mod);
{
i: ctype.i,
code: {
mkey: mkey.v,
cflags: cflags.v,
fw: fw.v,
prec: prec.v,
ctype: ctype.v,
caps: ctype.caps,
},
};
// Parse a format string (containing none or more % format tags).
local parse_codes(str, i, out, cur) =
if i >= std.length(str) then
out + [cur]
else
local c = str[i];
if c == '%' then
local r = parse_code(str, i + 1);
parse_codes(str, r.i, out + [cur, r.code], '') tailstrict
else
parse_codes(str, i + 1, out, cur + c) tailstrict;
local codes = parse_codes(str, 0, [], '');
///////////////////////
// Format the values //
///////////////////////
// Useful utilities
local padding(w, s) =
local aux(w, v) =
if w <= 0 then
v
else
aux(w - 1, v + s);
aux(w, '');
// Add s to the left of str so that its length is at least w.
local pad_left(str, w, s) =
padding(w - std.length(str), s) + str;
// Add s to the right of str so that its length is at least w.
local pad_right(str, w, s) =
str + padding(w - std.length(str), s);
// Render a sign & magnitude integer (radix ranges from decimal to binary).
// neg should be a boolean, and when true indicates that we should render a negative number.
// mag must always be a whole number >= 0, it's the magnitude of the integer to render
// min_chars must be a whole number >= 0
// It is the field width, i.e. std.length() of the result should be >= min_chars
// min_digits must be a whole number >= 0. It's the number of zeroes to pad with.
// blank must be a boolean, if true adds an additional ' ' in front of a positive number, so
// that it is aligned with negative numbers with the same number of digits.
// plus must be a boolean, if true adds a '+' in front of a positive number, so that it is
// aligned with negative numbers with the same number of digits. This takes precedence over
// blank, if both are true.
// radix must be a whole number >1 and <= 10. It is the base of the system of numerals.
// zero_prefix is a string prefixed before the sign to all numbers that are not 0.
local render_int(neg, mag, min_chars, min_digits, blank, plus, radix, zero_prefix) =
// dec is the minimal string needed to represent the number as text.
local dec =
if mag == 0 then
'0'
else
local aux(n) =
if n == 0 then
zero_prefix
else
aux(std.floor(n / radix)) + (n % radix);
aux(mag);
local zp = min_chars - (if neg || blank || plus then 1 else 0);
local zp2 = std.max(zp, min_digits);
local dec2 = pad_left(dec, zp2, '0');
(if neg then '-' else if plus then '+' else if blank then ' ' else '') + dec2;
// Render an integer in hexadecimal.
local render_hex(n__, min_chars, min_digits, blank, plus, add_zerox, capitals) =
local numerals = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
+ if capitals then ['A', 'B', 'C', 'D', 'E', 'F']
else ['a', 'b', 'c', 'd', 'e', 'f'];
local n_ = std.abs(n__);
local aux(n) =
if n == 0 then
''
else
aux(std.floor(n / 16)) + numerals[n % 16];
local hex = if std.floor(n_) == 0 then '0' else aux(std.floor(n_));
local neg = n__ < 0;
local zp = min_chars - (if neg || blank || plus then 1 else 0)
- (if add_zerox then 2 else 0);
local zp2 = std.max(zp, min_digits);
local hex2 = (if add_zerox then (if capitals then '0X' else '0x') else '')
+ pad_left(hex, zp2, '0');
(if neg then '-' else if plus then '+' else if blank then ' ' else '') + hex2;
local strip_trailing_zero(str) =
local aux(str, i) =
if i < 0 then
''
else
if str[i] == '0' then
aux(str, i - 1)
else
std.substr(str, 0, i + 1);
aux(str, std.length(str) - 1);
// Render floating point in decimal form
local render_float_dec(n__, zero_pad, blank, plus, ensure_pt, trailing, prec) =
local n_ = std.abs(n__);
local whole = std.floor(n_);
// Represent the rounded number as an integer * 1/10**prec.
// Note that it can also be equal to 10**prec and we'll need to carry
// over to the wholes. We operate on the absolute numbers, so that we
// don't have trouble with the rounding direction.
local denominator = std.pow(10, prec);
local numerator = std.abs(n_) * denominator + 0.5;
local whole = std.sign(n_) * std.floor(numerator / denominator);
local frac = std.floor(numerator) % denominator;
local dot_size = if prec == 0 && !ensure_pt then 0 else 1;
local zp = zero_pad - prec - dot_size;
local str = render_int(n__ < 0, whole, zp, 0, blank, plus, 10, '');
if prec == 0 then
str + if ensure_pt then '.' else ''
else
if trailing || frac > 0 then
local frac_str = render_int(false, frac, prec, 0, false, false, 10, '');
str + '.' + if !trailing then strip_trailing_zero(frac_str) else frac_str
else
str;
// Render floating point in scientific form
local render_float_sci(n__, zero_pad, blank, plus, ensure_pt, trailing, caps, prec) =
local exponent = if n__ == 0 then 0 else std.floor(std.log(std.abs(n__)) / std.log(10));
local suff = (if caps then 'E' else 'e')
+ render_int(exponent < 0, std.abs(exponent), 3, 0, false, true, 10, '');
local mantissa = if exponent == -324 then
// Avoid a rounding error where std.pow(10, -324) is 0
// -324 is the smallest exponent possible.
n__ * 10 / std.pow(10, exponent + 1)
else
n__ / std.pow(10, exponent);
local zp2 = zero_pad - std.length(suff);
render_float_dec(mantissa, zp2, blank, plus, ensure_pt, trailing, prec) + suff;
// Render a value with an arbitrary format code.
local format_code(val, code, fw, prec_or_null, i) =
local cflags = code.cflags;
local fpprec = if prec_or_null != null then prec_or_null else 6;
local iprec = if prec_or_null != null then prec_or_null else 0;
local zp = if cflags.zero && !cflags.left then fw else 0;
if code.ctype == 's' then
std.toString(val)
else if code.ctype == 'd' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
render_int(val <= -1, std.floor(std.abs(val)), zp, iprec, cflags.blank, cflags.plus, 10, '')
else if code.ctype == 'o' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
local zero_prefix = if cflags.alt then '0' else '';
render_int(val <= -1, std.floor(std.abs(val)), zp, iprec, cflags.blank, cflags.plus, 8, zero_prefix)
else if code.ctype == 'x' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
render_hex(std.floor(val),
zp,
iprec,
cflags.blank,
cflags.plus,
cflags.alt,
code.caps)
else if code.ctype == 'f' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
render_float_dec(val,
zp,
cflags.blank,
cflags.plus,
cflags.alt,
true,
fpprec)
else if code.ctype == 'e' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
render_float_sci(val,
zp,
cflags.blank,
cflags.plus,
cflags.alt,
true,
code.caps,
fpprec)
else if code.ctype == 'g' then
if std.type(val) != 'number' then
error 'Format required number at '
+ i + ', got ' + std.type(val)
else
local exponent = if val != 0 then std.floor(std.log(std.abs(val)) / std.log(10)) else 0;
if exponent < -4 || exponent >= fpprec then
render_float_sci(val,
zp,
cflags.blank,
cflags.plus,
cflags.alt,
cflags.alt,
code.caps,
fpprec - 1)
else
local digits_before_pt = std.max(1, exponent + 1);
render_float_dec(val,
zp,
cflags.blank,
cflags.plus,
cflags.alt,
cflags.alt,
fpprec - digits_before_pt)
else if code.ctype == 'c' then
if std.type(val) == 'number' then
std.char(val)
else if std.type(val) == 'string' then
if std.length(val) == 1 then
val
else
error '%c expected 1-sized string got: ' + std.length(val)
else
error '%c expected number / string, got: ' + std.type(val)
else
error 'Unknown code: ' + code.ctype;
// Render a parsed format string with an array of values.
local format_codes_arr(codes, arr, i, j, v) =
if i >= std.length(codes) then
if j < std.length(arr) then
error ('Too many values to format: ' + std.length(arr) + ', expected ' + j)
else
v
else
local code = codes[i];
if std.type(code) == 'string' then
format_codes_arr(codes, arr, i + 1, j, v + code) tailstrict
else
local tmp = if code.fw == '*' then {
j: j + 1,
fw: if j >= std.length(arr) then
error ('Not enough values to format: ' + std.length(arr) + ', expected at least ' + j)
else
arr[j],
} else {
j: j,
fw: code.fw,
};
local tmp2 = if code.prec == '*' then {
j: tmp.j + 1,
prec: if tmp.j >= std.length(arr) then
error ('Not enough values to format: ' + std.length(arr) + ', expected at least ' + tmp.j)
else
arr[tmp.j],
} else {
j: tmp.j,
prec: code.prec,
};
local j2 = tmp2.j;
local val =
if j2 < std.length(arr) then
arr[j2]
else
error ('Not enough values to format: ' + std.length(arr) + ', expected more than ' + j2);
local s =
if code.ctype == '%' then
'%'
else
format_code(val, code, tmp.fw, tmp2.prec, j2);
local s_padded =
if code.cflags.left then
pad_right(s, tmp.fw, ' ')
else
pad_left(s, tmp.fw, ' ');
local j3 =
if code.ctype == '%' then
j2
else
j2 + 1;
format_codes_arr(codes, arr, i + 1, j3, v + s_padded) tailstrict;
// Render a parsed format string with an object of values.
local format_codes_obj(codes, obj, i, v) =
if i >= std.length(codes) then
v
else
local code = codes[i];
if std.type(code) == 'string' then
format_codes_obj(codes, obj, i + 1, v + code) tailstrict
else
local f =
if code.mkey == null then
error 'Mapping keys required.'
else
code.mkey;
local fw =
if code.fw == '*' then
error 'Cannot use * field width with object.'
else
code.fw;
local prec =
if code.prec == '*' then
error 'Cannot use * precision with object.'
else
code.prec;
local val =
if std.objectHasAll(obj, f) then
obj[f]
else
error 'No such field: ' + f;
local s =
if code.ctype == '%' then
'%'
else
format_code(val, code, fw, prec, f);
local s_padded =
if code.cflags.left then
pad_right(s, fw, ' ')
else
pad_left(s, fw, ' ');
format_codes_obj(codes, obj, i + 1, v + s_padded) tailstrict;
if std.isArray(vals) then
format_codes_arr(codes, vals, 0, 0, '')
else if std.isObject(vals) then
format_codes_obj(codes, vals, 0, '')
else
format_codes_arr(codes, [vals], 0, 0, ''),
foldr(func, arr, init)::
local aux(func, arr, running, idx) =
if idx < 0 then
running
else
aux(func, arr, func(arr[idx], running), idx - 1) tailstrict;
aux(func, arr, init, std.length(arr) - 1),
foldl(func, arr, init)::
local aux(func, arr, running, idx) =
if idx >= std.length(arr) then
running
else
aux(func, arr, func(running, arr[idx]), idx + 1) tailstrict;
aux(func, arr, init, 0),
filterMap(filter_func, map_func, arr)::
if !std.isFunction(filter_func) then
error ('std.filterMap first param must be function, got ' + std.type(filter_func))
else if !std.isFunction(map_func) then
error ('std.filterMap second param must be function, got ' + std.type(map_func))
else if !std.isArray(arr) then
error ('std.filterMap third param must be array, got ' + std.type(arr))
else
std.map(map_func, std.filter(filter_func, arr)),
assertEqual(a, b)::
// If the values are strings, escape them for printing.
// If not, they'll be JSON-stringified anyway by the later string concatenation.
local astr = if std.type(a) == 'string' then std.escapeStringJson(a) else a;
local bstr = if std.type(b) == 'string' then std.escapeStringJson(b) else b;
if a == b then
true
else
error 'Assertion failed. ' + astr + ' != ' + bstr,
abs(n)::
if !std.isNumber(n) then
error 'std.abs expected number, got ' + std.type(n)
else
if n > 0 then n else -n,
sign(n)::
if !std.isNumber(n) then
error 'std.sign expected number, got ' + std.type(n)
else
if n > 0 then
1
else if n < 0 then
-1
else 0,
max(a, b)::
if !std.isNumber(a) then
error 'std.max first param expected number, got ' + std.type(a)
else if !std.isNumber(b) then
error 'std.max second param expected number, got ' + std.type(b)
else
if a > b then a else b,
min(a, b)::
if !std.isNumber(a) then
error 'std.min first param expected number, got ' + std.type(a)
else if !std.isNumber(b) then
error 'std.min second param expected number, got ' + std.type(b)
else
if a < b then a else b,
clamp(x, minVal, maxVal)::
if x < minVal then minVal
else if x > maxVal then maxVal
else x,
flattenArrays(arrs)::
std.foldl(function(a, b) a + b, arrs, []),
flattenDeepArray(value)::
if std.isArray(value) then
[y for x in value for y in std.flattenDeepArray(x)]
else
[value],
manifestIni(ini)::
local body_lines(body) =
std.join([], [
local value_or_values = body[k];
if std.isArray(value_or_values) then
['%s = %s' % [k, value] for value in value_or_values]
else
['%s = %s' % [k, value_or_values]]
for k in std.objectFields(body)
]);
local section_lines(sname, sbody) = ['[%s]' % [sname]] + body_lines(sbody),
main_body = if std.objectHas(ini, 'main') then body_lines(ini.main) else [],
all_sections = [
section_lines(k, ini.sections[k])
for k in std.objectFields(ini.sections)
];
std.join('\n', main_body + std.flattenArrays(all_sections) + ['']),
manifestToml(value):: std.manifestTomlEx(value, ' '),
manifestTomlEx(value, indent)::
local
escapeStringToml = std.escapeStringJson,
escapeKeyToml(key) =
local bare_allowed = std.set(std.stringChars('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_-'));
if std.setUnion(std.set(std.stringChars(key)), bare_allowed) == bare_allowed then key else escapeStringToml(key),
isTableArray(v) = std.isArray(v) && std.length(v) > 0 && std.all(std.map(std.isObject, v)),
isSection(v) = std.isObject(v) || isTableArray(v),
renderValue(v, indexedPath, inline, cindent) =
if v == true then
'true'
else if v == false then
'false'
else if v == null then
error 'Tried to manifest "null" at ' + indexedPath
else if std.isNumber(v) then
'' + v
else if std.isString(v) then
escapeStringToml(v)
else if std.isFunction(v) then
error 'Tried to manifest function at ' + indexedPath
else if std.isArray(v) then
if std.length(v) == 0 then
'[]'
else
local range = std.range(0, std.length(v) - 1);
local new_indent = if inline then '' else cindent + indent;
local separator = if inline then ' ' else '\n';
local lines = ['[' + separator]
+ std.join([',' + separator],
[
[new_indent + renderValue(v[i], indexedPath + [i], true, '')]
for i in range
])
+ [separator + (if inline then '' else cindent) + ']'];
std.join('', lines)
else if std.isObject(v) then
local lines = ['{ ']
+ std.join([', '],
[
[escapeKeyToml(k) + ' = ' + renderValue(v[k], indexedPath + [k], true, '')]
for k in std.objectFields(v)
])
+ [' }'];
std.join('', lines),
renderTableInternal(v, path, indexedPath, cindent) =
local kvp = std.flattenArrays([
[cindent + escapeKeyToml(k) + ' = ' + renderValue(v[k], indexedPath + [k], false, cindent)]
for k in std.objectFields(v)
if !isSection(v[k])
]);
local sections = [std.join('\n', kvp)] + [
(
if std.isObject(v[k]) then
renderTable(v[k], path + [k], indexedPath + [k], cindent)
else
renderTableArray(v[k], path + [k], indexedPath + [k], cindent)
)
for k in std.objectFields(v)
if isSection(v[k])
];
std.join('\n\n', sections),
renderTable(v, path, indexedPath, cindent) =
cindent + '[' + std.join('.', std.map(escapeKeyToml, path)) + ']'
+ (if v == {} then '' else '\n')
+ renderTableInternal(v, path, indexedPath, cindent + indent),
renderTableArray(v, path, indexedPath, cindent) =
local range = std.range(0, std.length(v) - 1);
local sections = [
(cindent + '[[' + std.join('.', std.map(escapeKeyToml, path)) + ']]'
+ (if v[i] == {} then '' else '\n')
+ renderTableInternal(v[i], path, indexedPath + [i], cindent + indent))
for i in range
];
std.join('\n\n', sections);
if std.isObject(value) then
renderTableInternal(value, [], [], '')
else
error 'TOML body must be an object. Got ' + std.type(value),
escapeStringJson(str_)::