-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathtest.ink
executable file
·1215 lines (1054 loc) · 36.3 KB
/
test.ink
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
#!/usr/bin/env ink
clear := '__cleared'
` ink language test suite,
built on the suite library for testing `
s := (load('suite').suite)(
'Ink language and standard library'
)
` short helper functions on the suite `
m := s.mark
t := s.test
` load std & str once for all tests `
std := load('std')
str := load('str')
m('eval with #!/usr/bin/env ink')
(
` check that the line immediately following #!/... still runs okay `
t('eval with #!/usr/bin/env ink does not miss lines'
clear, '__cleared')
)
m('value equality')
(
` with primitives `
t('() = ()', () = (), true)
t('() = bool', () = false, false)
t('number = number', 1 = 1.000, true)
t('number = number', 100 = 1000, false)
t('empty string = empty string', '' = '', true)
t('string = string', 'val' = 'val', true)
t('string = string', '' = 'empty', false)
t('number = string', '23' = 23, false)
t('string = number', 23 = '23', false)
t('bool = bool', false = false, true)
t('bool = bool', true = false, false)
t('list = list', ['first', '_second'] = ['first', '_second'], true)
t('list = list', ['first', '_second'] = ['first', '_second', '*third'], false)
t('composite = composite', {} = {}, true)
t('composite = list', {} = [], true)
t('composite = ()', {} = (), false)
fn := () => 1
fn2 := () => 1
t('function = function', fn = fn, true)
t('function = function', fn = fn2, false)
t('builtin fn = builtin fn', len = len, true)
t('builtin fn = builtin fn', len = string, false)
` to empty identifier `
t('_ = _', _ = _, true)
t('bool = _', true = _, true)
t('_ = bool', _ = false, true)
t('number = _', 0 = _, true)
t('_ = number', _ = 3, true)
t('string = _', '' = _, true)
t('_ = string', _ = '', true)
t('() = _', () = _, true)
t('_ = ()', _ = (), true)
t('composite = _', {} = _, true)
t('_ = composite', _ = {}, true)
t('_ = list', _ = [_], true)
t('function = _', (() => ()) = _, true)
t('_ = function', _ = (() => ()), true)
t('builtin fn = _', len = _, true)
t('_ = builtin fn', _ = len, true)
)
m('composite value access')
(
obj := {
39: 'clues'
('ex' + 'pr'): 'ession'
}
` when calling a function that's a prop of a composite,
we need to remember that AccessorOp is just a binary op
and the function call precedes it in priority `
obj.fn := () => 'xyz'
obj.fz := f => f() + f()
t('calling composite property', (obj.fn)(), 'xyz')
t('composite property by string value', (obj.('fn'))(), 'xyz')
t('composite property by property access', (obj.fz)(obj.fn), 'xyzxyz')
t('nonexistent composite key is ()', obj.nonexistent, ())
t('composite property by number value', obj.(~10), ())
t('composite property by number literal', obj.39, 'clues')
t('composite property by identifier', obj.expr, 'ession')
` string index access `
t('string index access at 0', ('hello').0, 'h')
t('string index access', ('what').3, 't')
t('out of bounds string index access (negative)'
('hi').(~1), ())
t('out of bounds string index access (too large)'
('hello, world!').len('hello, world!'), ())
` nested composites `
comp := {list: ['hi', 'hello', {what: 'thing'}]}
` can't just do comp.list.2.what because
2.what is not a valid identifier.
these are some other recommended ways `
t('nested composite value access with number value'
comp.list.(2).what, 'thing')
t('nested composite value access with string value'
comp.list.('2').what, 'thing')
t('nested composite value access, parenthesized'
(comp.list.2).what, 'thing')
t('nested composite value access, double-parenthesized'
(comp.list).(2).what, 'thing')
t('string at index in computed string', comp.('li' + 'st').0, 'hi')
t('nested property access returns composite', comp.list.2, {what: 'thing'})
` modifying composite in chained accesses `
comp.list.4 := 'oom'
comp.list.(2).what := 'arg'
t('modifying composite at key leaves others unchanged', comp.list.4, 'oom')
t('modifying composite at key', comp.list.(2).what, 'arg')
)
m('function, expression, and lexical scope')
(
thing := 3
state := {
thing: 21
}
fn := () => thing := 4
fn2 := thing => thing := 24
fn3 := () => (
state.thing := 100
thing := ~3
)
fn()
fn2()
fn3()
(
thing := 200
)
t('function body forms a new scope', fn(), 4)
t('function body forms a new scope, assignment', fn2(), 24)
t('function body with expression list forms a new scope', fn3(), ~3)
t('assignment in child frames are isolated', thing, 3)
t('modifying composites in scope from child frames causes mutation', state.thing, 100)
x := 100
y := 100
z := 100
w := 100
x := 200 :: {
y := 200 -> 1000
(w := 200) -> 2000
}
nop := () => ()
nop(nop(z := 300, z := 400), z := 500, (w := 300))
t('assignment in match expression condition stays in scope', x, 200)
t('assignment in match expression target stays in scope', y, 200)
t('assignment in argument position stays in scope', z, 500)
t('assignment in exprlist in match expression target is in inner scope', w, 100)
t('assignment in exprlist in argument position is in inner scope', w, 100)
)
m('tail call optimizations and thunk unwrap order')
(
acc := ['']
appender := prefix => str => acc.0 := acc.0 + prefix + str
f1 := appender('f1_')
f2 := appender('f2_')
sub := () => (
f1('hi')
(
f2('what')
)
f3 := () => (
f2('hg')
f1('bb')
)
f1('sup')
f2('sample')
f3()
f2('xyz')
)
sub()
t('tail optimized thunks are unwrapped in correct order'
acc.0, 'f1_hif2_whatf1_supf2_samplef2_hgf1_bbf2_xyz')
)
m('match expressions')
(
x := ('what ' + string(1 + 2 + 3 + 4) :: {
'what 10' -> 'what 10'
_ -> '??'
})
t('match expression follows matched clause', x, 'what 10')
x := ('what ' + string(1 + 2 + 3 + 4) :: {
'what 11' -> 'what 11'
_ -> '??'
})
t('match expression follows through to empty identifier', x, '??')
x := (
y := {z: 9}
12 :: {
y.z + 1 + 5 - 3 -> 'correct'
12 -> 'incorrect'
10 -> 'incorrect'
_ -> 'wrong'
}
)
t('match expression target can be complex binary expressions', x, 'correct')
x := ('a' :: {
1 :: {
2 -> 'b'
1 -> 'a'
} -> 'c'
_ -> 'd'
})
t('match expression in match target position', x, 'c')
N := {
A: 1
B: 2
C: 3
D: 4
}
x := (3 :: {
N.A -> 'a'
N.B -> 'b'
N.C -> 'c'
N.D -> 'd'
})
t('match expression target can be object property', x, 'c')
x := [1, 2, [3, 4, ['thing']], {a: ['b']}]
t('composite deep equality after match expression'
x, [1, 2, [3, 4, ['thing']], {a: ['b']}])
)
m('accessing properties strangely, accessing nonexistent properties')
(
t('property access with number literal', {1: ~1}.1, ~1)
t('list access with number literal', ['y', 'z'].1, ('z'))
t('property access with bare string literal', {1: 4.2}.'1', 4.2)
t('property access with number value', {1: 4.2}.(1), 4.2)
t('property access with decimal number value', {1: 'hi'}.(1.0000), 'hi')
` also: composite parts can be empty `
t('composite parts can be empty', [_, _, 'hix'].('2'), 'hix')
t('property access with computed string'
string({test: 4200.00}.('te' + 'st')), '4200')
t('nested property access with computed string'
string({test: 4200.00}.('te' + 'st')).1, '2')
t('nested property access with computed string, nonexistent key'
string({test: 4200.00}.('te' + 'st')).10, ())
dashed := {'test-key': 14}
t('property access with string literal that is not valid identifier'
string(dashed.('test-key')), '14')
)
m('calling functions with mismatched argument length')
(
tooLong := (a, b, c, d, e) => a + b
tooShort := (a, b) => a + b
t('function call with too few arguments', tooLong(1, 2), 3)
t('function call with too many arguments', tooShort(9, 8, 7, 6, 5, 4, 3), 17)
)
m('argument order of evaluation')
(
acc := []
fn := (x, y) => (acc.len(acc) := x, y)
t('function arguments are evaluated in order, I'
fn(fn(fn(fn('i', '?'), 'h'), 'g'), 'k'), 'k')
t('function arguments are evaluated in order, II'
acc, ['i', '?', 'h', 'g'])
)
m('empty identifier "_" in arguments and functions')
(
emptySingle := _ => 'snowman'
emptyMultiple := (_, a, _, b) => a + b
t('_ is a valid argument placeholder', emptySingle(), 'snowman')
t('_ can be used multiple times in a single function as argument placeholders'
emptyMultiple('bright', 'rain', 'sky', 'bow'), 'rainbow')
)
m('comment syntaxes')
(
`` t(wrong, wrong)
ping := 'pong'
` t(wrong, more wrong) `
t('single line (line-lead) comments are recognized', ping, 'pong')
t('inline comments are recognized', `hidden` '...thing', '...thing')
t('inline comments terminate correctly', len('include `cmt` thing'), 19)
)
m('more complex pattern matching')
(
t('nested list pattern matches correctly', [_, [2, _], 6], [10, [2, 7], 6])
t(
'nested composite pattern matches correctly'
{
hi: 'hello'
bye: {
good: 'goodbye'
}
}
{
hi: _
bye: {
good: _
}
}
)
t('nested list pattern matches with empty identifiers', [_, [2, _], 6, _], [10, [2, 7], 6, _])
t('composite pattern matches with empty identifiers', {6: 9, 7: _}, {6: _, 7: _})
)
m('order of operations')
(
t('addition/subtraction', 1 + 2 - 3 + 5 - 3, 2)
t('multiplication over addition/subtraction', 1 + 2 * 3 + 5 - 3, 9)
t('multiplication/division', 10 - 2 * 16 / 4 + 3, 5)
t('parentheses', 3 + (10 - 2) * 4, 35)
t('parentheses and negation', 1 + 2 + (4 - 2) * 3 - (~1), 10)
t('negating parenthesized expressions', 1 - ~(10 - 3 * 3), 2)
t('modulus in bare expressions', 10 - 2 * 24 % 20 / 8 - 1 + 5 + 10 / 10, 14)
t('logical operators', 1 & 5 | 4 ^ 1, (1 & 5) | (4 ^ 1))
t('logical operators, arithmetic, and parentheses', 1 + 1 & 5 % 3 * 10, (1 + 1) & ((5 % 3) * 10))
)
m('string lexicographical comparisons')
(
t('less-than, I', 'a' < 'b', true)
t('less-than, II', 'x' < 'A', false)
` shorter strings are lesser `
t('less-than, III', 'x long str' < 'A', false)
t('greater-than, I', 'E' > 'A', true)
t('greater-than, II', '0' > '_', false)
t('greater-than, III', 'xxxxx' > 'xxx', true)
t('empty strings', '' < ' ', true)
t('uppercase < lowercase', 'S' < 's', true)
t('non-printed byte arrays', char(253) > char(252), true)
)
m('bitwise operations on byte strings')
(
Z := char(0)
ZZ := Z + Z
ZZZ := ZZ + Z
` of the same lengths `
a := 'ABCDEFG'
b := 'abcdEFg'
t('bitwise & of byte strings'
a & b, 'ABCDEFG')
t('bitwise | of byte strings'
a | b, 'abcdEFg')
t('bitwise ^ of byte strings'
a ^ b, ' ' + ZZ + ' ')
` of different lengths (byte strings are zero-extended at lower bytes) `
a := 'ABCD'
b := 'abcdXYZ'
t('bitwise & of diff length byte strings'
a & b, 'ABCD' + ZZZ)
t('bitwise | of diff length byte strings'
a | b, 'abcdXYZ')
t('bitwise ^ of diff length byte strings'
a ^ b, ' XYZ')
t('bitwise & of diff length byte strings, reverse order'
b & a, 'ABCD' + ZZZ)
t('bitwise | of diff length byte strings, reverse order'
b | a, 'abcdXYZ')
t('bitwise ^ of diff length byte strings, reverse order'
b ^ a, ' XYZ')
` of same byte strings `
a := 'some_byte'
t('bitwise & of same byte string'
a & a, a)
t('bitwise | of same byte string'
a | a, a)
t('bitwise ^ of same byte string'
a ^ a, ZZZ + ZZZ + ZZZ)
)
m('min/max')
(
min := std.min
max := std.max
t('min of list of 1', min([~30]), ~30)
t('minimum of list', min([39, 254, 5, ~2, 0, 3]), ~2)
t('max of list of 1', max([101]), 101)
t('maximum of list', max([39, 254, 5, ~2, 0, 3]), 254)
t('min of array of same', min([2, 2, 2, 2, 2, 2, 2, 2]), 2)
t('max of array of same', min([2, 2, 2, 2, 2, 2, 2, 2]), 2)
)
m('logic composition correctness, std.some/std.every')
(
` and `
t('number & number, I', 1 & 4, 0)
t('number & number, II', 2 & 3, 2)
t('t & t', true & true, true)
t('t & f', true & false, false)
t('f & t', false & true, false)
t('f & f', false & false, false)
` or `
t('number | number, I', 1 | 4, 5)
t('number | number, II', 2 | 3, 3)
t('t | t', true | true, true)
t('t | f', true | false, true)
t('f | t', false | true, true)
t('f | f', false | false, false)
` xor `
t('number ^ number, I', 2 ^ 7, 5)
t('number ^ number, II', 2 ^ 3, 1)
t('t ^ t', true ^ true, false)
t('t ^ f', true ^ false, true)
t('f ^ t', false ^ true, true)
t('f ^ f', false ^ false, false)
` std.some and std.every `
some := std.some
every := std.every
t('std.some() of empty list is false', some([]), false)
t('std.every() of empty list is true', every([]), true)
t('std.some() is true if at least one in list is true'
some([false, false, true, false]), true)
t('std.some() is false if none in list is true'
some([false, false, false, false]), false)
t('std.every() is true if all in list is true'
every([true, true, true, true, true]), true)
t('std.every() is false if at least one in list is false'
every([true, true, true, false, true]), false)
)
m('object keys / list, mutable strings, std.clone')
(
clone := std.clone
obj := {
first: 1
second: 2
third: 3
}
list := ['red', 'green', 'blue']
ks := {
first: false
second: false
third: false
}
ky := keys(obj)
` keys are allowed to be out of insertion order
-- composites are unordered maps`
ks.(ky.0) := true
ks.(ky.1) := true
ks.(ky.2) := true
t('keys() builtin for composite returns keys'
[ks.first, ks.second, ks.third], [true, true, true])
t('keys() builtin for composite returns all keys'
len(keys(obj)), 3)
cobj := clone(obj)
obj.fourth := 4
clist := clone(list)
list.len(list) := 'alpha'
t('std.clone does not affect original composite', len(keys(obj)), 4)
t('std.clone creates a new copy of composite', len(keys(cobj)), 3)
t('std.clone does not affect original list', len(list), 4)
t('std.clone creates a new copy of list', len(clist), 3)
` len() should count the number of keys on a composite,
not just integer indexes like ECMAScript `
t('len() builtin on manually indexed composite', len({
0: 1
1: 'order'
2: 'natural'
}), 3)
t('len() builtin on non-number keyed composite', len({
hi: 'h'
hello: 'he'
thing: 'th'
what: 'w'
}), 4)
t('len() builtin counts non-consecutive integer keys', len({
0: 'hi'
'1': 100
3: 'x'
5: []
'word': 0
}), 5)
str := 'hello'
twin := str
ccpy := str + '' ` should yield a new copy `
tcpy := '' + twin
copy := clone(str)
str.2 := 'xx'
copy.2 := 'yy'
t('std.clone does not affect original string', str, 'hexxo')
t('define op does not create a copy of string', twin, 'hexxo')
t('concatenation via + creates a copy of string, I', ccpy, 'hello')
t('concatenation via + creates a copy of string, II', tcpy, 'hello')
t('std.clone creates a copy of string', copy, 'heyyo')
)
m('string/composite pass by reference / mutation check')
(
clone := std.clone
obj := [1, 2, 3]
twin := obj ` by reference `
clone := clone(obj) ` cloned (by value) `
obj.len(obj) := 4
obj.len(obj) := 5
obj.len(obj) := 6
t('std.clone does not affect original composite', len(obj), 6)
t('define op does not create a copy of composite', len(twin), 6)
t('std.clone creates a copy of composite', len(clone), 3)
t('assignment to composite key returns composite itself, updated', clone.hi := 'x', {
0: 1
1: 2
2: 3
hi: 'x'
})
str := 'hello, world'
str2 := '' + str
str.5 := '!'
str.8 := 'lx'
str.2 := ''
str.3 := ''
str.len(str) := 'x?'
t('assigning to string indexes mutates original string', str, 'hello! wlxldx?')
t('concatenating to string with + creates a copy of string', str2, 'hello, world')
str := 'hi'
t('assigning to string index returns the string itself, updated', str.1 := 'what', 'hwhat')
t('assigning to string index modifies itself', str, 'hwhat')
str := '00000000'
mut := (i, s) => (
str.(i) := s
)
mut(4, 'AAA')
t('assigning to string index with more than one char modifies multiple indexes'
str, '0000AAA0')
mut(8, 'YYY')
t('assigning to string index with more than one char appends as necessary'
str, '0000AAA0YYY')
)
m('number & composite/list -> string conversions')
(
stringList := std.stringList
t('string(number) uses least number of digits necessary, integer'
string(42), '42')
t('string(number) uses least number of digits necessary, short decimal'
string(3.14), '3.14')
t('string(number) uses least number of digits necessary, long decimal'
string(5 / 3), '1.6666666666666667')
` speed of light in microns per second `
t('string(number) uses least number of digits necessary, large number'
string(299792458000000), '299792458000000')
t('string(number) uses least number of digits necessary, small exponential'
string(0.0000000001), '1e-10')
t('string(number) uses least number of digits necessary, big exponential'
string(2997924580000000000000), '2.99792458e+21')
t('string(true)', string(true), 'true')
t('string(false)', string(false), 'false')
t('string(string) returns itself', string('hello'), 'hello')
t('string(list) returns string(composite)', string([0]), '{0: 0}')
t('number(string) correctly parses decimal number', number('3.14'), 3.14)
t('number(string) deals with leading and trailing zeroes', number('03.140000'), 3.14)
t('number(string) deals with negative numbers', number('-42'), ~42)
t('number(string) with large exponent', number('3e10'), 30000000000)
t('number(string) with small exponent', number('3e-9'), 0.000000003)
t('number(true) = 1', number(true), 1)
t('number(false) = 0', number(false), 0)
t('number(composite) = 0', number([]), 0)
t('number(function) = 0', number(() => 100), 0)
t('number(builtin fn) = 0', number(len), 0)
t('string(composite)', string({a: 3.14}), '{a: 3.14}')
result := string([3, 'two'])
p1 := '{0: 3, 1: \'two\'}'
p2 := '{1: \'two\', 0: 3}'
t('string(composite) containing string and multiple keys', result = p1 | result = p2, true)
t('stringList(list) for nested list', stringList(['fine', ['not']]), '[fine, {0: \'not\'}]')
)
m('function/composite equality checks')
(
` function equality `
fn1 := () => (3 + 4, 'hello')
fnc := fn1
fn2 := () => (3 + 4, 'hello')
t('functions are equal if they are the same function'
fn1 = fnc, true)
t('functions are different if they are defined separately, even if same effect'
fn1 = fn2, false)
` composite equality `
comp1 := {1: 2, hi: '4'}
comp2 := {1: 2, hi: '4'}
list1 := [1, 2, 3, 4, 5]
list2 := [1, 2, 3, 4, 5]
complist := {0: 1, 1: 2, 2: 3, 3: 4, 4: 5}
t('deep composite equality', comp1 = comp2, true)
t('deep list equality', list1 = list2, true)
t('deep composite inequality, I', comp1 = list1, false)
t('deep composite inequality, II', comp1 = {1: '4', 2: 2}, false)
t('composite = {}', comp1 = {}, false)
t('deep list inequality, I', list1 = [1, 2, 3], false)
t('deep list inequality, II', list1 = complist, true)
)
m('type() builtin function')
(
t('type(string)', type('hi'), 'string')
t('type(number)', type(3.14), 'number')
t('type(list) (composite)', type([0, 1, 2]), 'composite')
t('type(composite)', type({hi: 'what'}), 'composite')
t('type(function)', type(() => 'hi'), 'function')
t('type(builtin fn) (function), I', type(type), 'function')
t('type(builtin fn) (function), II', type(out), 'function')
t('type(()) = ()', type(()), '()')
)
m('std.range/slice/append/join/cat and stringList')
(
stringList := std.stringList
range := std.range
reverse := std.reverse
slice := std.slice
join := std.join
cat := std.cat
` slice returns copies `
(
st := '12345'
li := [1, 2, 3, 4, 5]
stc := slice(st, 0, len(st))
lic := slice(li, 0, len(li))
stc.2 := 'x'
lic.2 := 'x'
t('slice(string) should make a copy', st, '12345')
t('slice(string) should return a copy', stc, '12x45')
t('slice(list) should make a copy', li, [1, 2, 3, 4, 5])
t('slice(list) should return a copy', lic, [1, 2, 'x', 4, 5])
)
sl := (l, s, e) => stringList(slice(l, s, e))
list := range(10, ~1, ~1)
str := 'abracadabra'
t('slice(list)', sl(list, 0, 5), '[10, 9, 8, 7, 6]')
t('slice with OOB lower bound', sl(list, ~5, 2), '[10, 9]')
t('slice with OOB upper bound', sl(list, 7, 20), '[3, 2, 1, 0]')
t('slice with OOB both bounds', sl(list, 20, 1), '[]')
` redefine list using range and reverse, to t those `
list := reverse(range(0, 11, 1))
t('join() homogeneous lists', stringList(join(
slice(list, 0, 5), slice(list, 5, 200)
)), '[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]')
t('join() heterogeneous lists', stringList(join(
[1, 2, 3]
join([4, 5, 6], ['a', 'b', 'c'])
)), '[1, 2, 3, 4, 5, 6, a, b, c]')
t('slice() from 0', slice(str, 0, 5), 'abrac')
t('slice() from nonzero', slice(str, 2, 4), 'ra')
t('slice() with OOB lower bound', slice(str, ~5, 2), 'ab')
t('slice() with OOB upper bound', slice(str, 7, 20), 'abra')
t('slice() with OOB both bounds', slice(str, 20, 1), '')
t('cat() empty list', cat([], '--'), '')
t('cat() single-element list', cat(['hello'], '--'), 'hello')
t('cat() double-element list', cat(['hello', 'world'], '--'), 'hello--world')
t('cat() list containing delimiter', cat(['hello', 'world,hi'], ','), 'hello,world,hi')
t('cat() with empty string delimiter', cat(['good', 'bye', 'friend'], ''), 'goodbyefriend')
t('cat() with comma separator', cat(['good', 'bye', 'friend'], ', '), 'good, bye, friend')
t('cat() with manually indexed composite', cat({
0: 'first'
1: 'last'
}, ' and '), 'first and last')
)
m('hexadecimal conversions, hex & xeh')
(
hex := std.hex
xeh := std.xeh
` base cases `
t('hex(0)', hex(0), '0')
t('hex(42)', hex(66), '42')
t('hex(256)', hex(256), '100')
t('hex(1998)', hex(1998), '7ce')
t('hex(3141592)', hex(3141592), '2fefd8')
t('xeh(fff)', xeh('fff'), 4095)
t('xeh(a2)', xeh('a2'), 162)
` hex should floor non-integer inputs `
t('hex() of fractional number, I', hex(16.8), '10')
t('hex() of fractional number, II', hex(1998.123), '7ce')
` recoverability `
t('xeh(hex()), I', xeh(hex(390420)), 390420)
t('xeh(hex()), II', xeh(hex(9230423903)), 9230423903)
t('hex(xeh()), I', hex(xeh('fffab123')), 'fffab123')
t('hex(xeh()), II', hex(xeh('0000ab99ff33')), 'ab99ff33')
t('hex(xeh(hex(xeh()))), I', hex(xeh(hex(xeh('aabbef')))), 'aabbef')
t('hex(xeh(hex(xeh()))), II', xeh(hex(xeh(hex(201900123)))), 201900123)
)
m('ascii <-> char point conversions and string encode/decode')
(
encode := std.encode
decode := std.decode
s1 := 'this is a long piece of string
with weird line
breaks
'
s2 := ''
s3 := 'AaBbCcDdZzYyXx123456789!@#$%^&*()_+-='
` note: at this point, we only care about ascii, not full Unicode `
t('point(a)', point('a'), 97)
t('char(65)', char(65), 'A')
t('encode(ab)', encode('ab'), [97, 98])
t('decode() => ACB', decode([65, 67, 66]), 'ACB')
t('repeated decode/encode, I', decode(encode(decode(encode(s1)))), s1)
t('repeated decode/encode, II', decode(encode(decode(encode(s2)))), s2)
t('repeated decode/encode, III', decode(encode(decode(encode(s3)))), s3)
)
m('std list: map/filter/reduce[Back]/each/reverse/flatten, join/append')
(
map := std.map
filter := std.filter
reduce := std.reduce
reduceBack := std.reduceBack
each := std.each
reverse := std.reverse
flatten := std.flatten
append := std.append
join := std.join
list := [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
t('std.map', map(list, n => n * n), [1, 4, 9, 16, 25, 36, 49, 64, 81, 100])
t('std.filter', filter(list, n => n % 2 = 0), [2, 4, 6, 8, 10])
t('std.reduce', reduce(list, (acc, n) => acc + string(n), '')
'12345678910')
t('std.reduceBack', reduceBack(list, (acc, n) => acc + string(n), '')
'10987654321')
t('std.flatten', flatten([[1, 2, 3], [4], [], [[5], 6, 7, [8, 9, 10]]])
[1, 2, 3, 4, [5], 6, 7, [8, 9, 10]])
t('std.reverse', reverse(list), [10, 9, 8, 7, 6, 5, 4, 3, 2, 1])
t('std.join', join(list, list), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10
1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
` degenerate cases on reverse `
t('std.reverse on empty', reverse([]), [])
t('std.reverse on len 1', reverse(['a']), ['a'])
t('std.reverse on len 2', reverse(['b', 'a']), ['a', 'b'])
t('std.reverse on reversed', reverse(reverse(list)), list)
` passing index in callback `
t('std.map passes index to callback', map(list, (_, i) => i)
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
t('std.filter passes index to callback', filter(list, (_, i) => i % 2 = 1)
[2, 4, 6, 8, 10])
t('std.reduce passes index to callback'
reduce(list, (acc, _, i) => acc + string(i), ''), '0123456789')
t('std.reduceBack passes index to callback'
reduceBack(list, (acc, _, i) => acc + string(i), ''), '9876543210')
(
eachAcc := []
each(list, (_, i) => eachAcc.len(eachAcc) := i)
t('std.each passes index to callback', eachAcc
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
)
` each doesn't return anything meaningful `
acc := {
str: ''
}
twice := f => x => (f(x), f(x))
each(list, twice(n => acc.str := acc.str + string(n)))
t('std.each', acc.str, '1122334455667788991010')
` append mutates `
append(list, list)
t('std.append', list, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10
1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
)
m('std.format -- the standard library formatter / templater')
(
f := std.format
stringList := std.stringList
values := {
first: 'ABC'
'la' + 'st': 'XYZ'
thingOne: 1
thingTwo: stringList([5, 4, 3, 2, 1])
'magic+eye': 'add_sign'
}
t('std.format empty string', f('', {}), '')
t('std.format single value', f('one two {{ first }} four', values), 'one two ABC four')
t('std.format with newlines in string', f('new
{{ sup }} line', {sup: 42}), 'new
42 line')
t('std.format with non-terminated slot ignores rest'
f('now {{ then now', {then: 'then'}), 'now ')
t('std.format with unusual (tighter) spacing', f(
' {{thingTwo}}+{{ magic+eye }} '
values
), ' [5, 4, 3, 2, 1]+add_sign ')
t('std.format with unusual (tighter) spacing and more replacements', f(
'{{last }} {{ first}} {{ thing One }} {{ thing Two }}'
values
), 'XYZ ABC 1 [5, 4, 3, 2, 1]')
t(
'std.format with non-format braces'
f('{ { this is not } {{ thingOne } wut } {{ nonexistent }}', values)
'{ { this is not } 1 ()'
)
)
m('uuid -- uuid v4 generator')
(
uuid := load('uuid').uuid
xeh := std.xeh
range := std.range
map := std.map
every := std.every
reduce := std.reduce
split := str.split
uuids := map(range(0, 200, 1), uuid)
` every character should be a hex character or "-" `
isValidChar := s => s :: {
'-' -> true
_ -> ~(xeh(s) = ())
}
everyCharIsHex := every(map(
uuids
u => every(map(split(u, ''), c => isValidChar(c)))
))
t('uuid() validity, hexadecimal range set', everyCharIsHex, true)
` test for uniqueness (kinda) `
collisions? := reduce(
map(range(0, 200, 1), () => [uuid(), uuid()])
(acc, us) => acc | us.0 = us.1
false
)
t('uuid() validity, rare collisions', collisions?, false)
` correct length, formatting `
format? := u => map(u, x => x) = [
_, _, _, _, _, _, _, _, '-'
_, _, _, _, '-'
_, _, _, _, '-'
_, _, _, _, '-'
_, _, _, _, _, _, _, _, _, _, _, _
]
everyIsFormatted := every(map(
uuids
u => format?(u)
))
t('uuid() validity, correct string formatting', everyIsFormatted, true)
)
m('json ser/de')
(
clone := std.clone
json := load('json')
ser := json.ser
de := json.de
` primitives `
t('ser null', ser(()), 'null')
t('ser ""', ser(''), '""')
t('ser string', ser('world'), '"world"')
t('ser escaped string', ser('es"c \\a"pe
me'), '"es\\"c \\\\a\\"pe\\nme"')
t('ser true', ser(true), 'true')
t('ser false', ser(false), 'false')
t('ser number', ser(12), '12')
t('ser fractional number', ser(3.14), string(3.14))
t('ser negative number', ser(~2.4142), string(~2.4142))
t('ser function => null', ser(x => x), 'null')
t('ser empty composite', ser({}), '{}')
t('ser empty list => composite', ser([]), '{}')
t('de null', de('null'), ())
t('de invalid JSON, null-ish', de('neh'), ())
t('de true', de('true'), true)
t('de invalid JSON, true-ish, I', de('trxx'), ())
t('de false', de('false'), false)
t('de invalid JSON, false-ish', de('fah'), ())
t('de invalid JSON, true-ish, II', de('true_32'), true)
t('de string', de('"thing"'), 'thing')
t('de escaped string', de('"es\\"c a\\"pe\\nme"'), 'es"c a"pe
me')
t('de empty string', de('""'), '')
t('de interrupted string', de('"my"what"'), 'my')
t('de negative number', de('-59.413'), ~59.413)
t('de interrupted number', de('10-14.2'), 10)
t('de invalid number', de('1.2.3'), ())
t('de list of numbers', de('[50, -100]'), [50, ~100])
` strange whitespace, commas, broken input `
t('de string with surrounding whitespace', de(' " string" '), ' string')
t('de number with surrounding whitespace and decimal point', de(' 6.'), 6)
t('de fractional number without leading zero', de(' .90'), 0.9)
t('de list with surrounding whitespace', de(' ["first", 2, true, ] '), ['first', 2, true])
t('de non-terminated string', de('"start '), ())
t('de invalid object values', de('{"a": b, "12": 3.41}'), ())
t('de non-terminated object literal', de('{"a": b "12": 3.41 '), ())
t('de non-terminated literal symbols', de('[1, 2 3.24.253, fals}'), ())
t('de non-terminated list literal', de('[1, 2, 3.24.253, false'), ())
` serialize light object `
s := ser({a: 'b', c: ~4.251})
first := '{"a":"b","c":-4.251}'
second := '{"c":-4.251,"a":"b"}'
t('ser composite', s = first | s = second, true)
s := ser([2, false])
first := '{"0":2,"1":false}'
second := '{"1":false,"0":2}'
t('ser list', s = first | s = second, true)
` complex serde `
obj := {
ser: 'de'
'\\': 3
'esc\\': 'back\\slash'
apple: 'dessert'
func: () => ()
x: ['train', false, 'car', true, {x: ['y', 'z']}]
32: 'thirty-two'
nothing: ()