st/lama_byterun
1
0
Fork 0
mirror of https://github.com/ProgramSnail/Lama.git synced 2025-12-22 14:48:46 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Better error reporting; synched with ostap

Browse source
This commit is contained in:
Dmitry Boulytchev 2020-01-05 22:54:09 +03:00
parent 290c124be6
commit b6180d8634
13 changed files with 59 additions and 68 deletions
Download patch file Download diff file Expand all files Collapse all files

33
stdlib/regression/test006.expr Normal file
View file

@ -0,0 +1,33 @@
fun f (x) {
return fun (y) {return x + y}
}
write (compare (1, 2));
write (compare (2, 1));
write (compare (3, 3));
write (compare (2, "abc"));
write (compare ("abc", 2));
write (compare ("abc", "abc"));
write (compare ("ab", "abc"));
write (compare ("abc", "ab"));
write (compare ([], []));
write (compare (A, A));
write (compare (A, B));
write (compare (B, A));
write (compare (A (1), A (1, 1)));
write (compare (A (1, 1), A (1)));
-- not stable: write (compare (f, f));
-- not stable: write (compare (f, f(5)));
-- not stable: write (compare (f(5), f));
-- not stable: write (compare (f(5), f(5)));
-- not stable: write (compare (f(5), f(6)));
-- not stable: write (compare (f(6), f(5)));
write (compare ({1, 2, 3}, {1, 2, 3}));
write (compare ({1, [2], [[3]]}, {1, [2], [[3]]}));
write (compare ({1, [2], [[3]]}, {1, [2], [3]}));
write (compare ({1, [2], [3]}, {1, [2], [[3]]}))

23
stdlib/regression/test01.expr Normal file
View file

@ -0,0 +1,23 @@
import Collection;
local tree = {}, i;
for i := 100, i >= 1, i := i-1 do
tree := insert (tree, i, i);
printf ("Inserting: %s\n", i.string);
printf ("Result : %s\n", tree.string)
od;
tree := {};
for i := 1, i <= 100, i := i+2 do
tree := insert (tree, i, i);
printf ("Inserting: %s\n", i.string);
printf ("Result : %s\n", tree.string)
od;
for i := 2, i <= 100, i := i+2 do
tree := insert (tree, i, i);
printf ("Inserting: %s\n", i.string);
printf ("Result : %s\n", tree.string)
od