mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-15 17:33:38 +00:00
2bd7c5ee3e
tests/hard_coded/*.m:
Rename modules as mentioned above.
In a few cases, where the main module's name itself had a suffix,
such as "_mod_a" or "_main", remove that suffix. This entails
renaming the .exp file as well. (In some cases, this meant that
the name of a helper module was "taken over" by the main module
of the test case.)
Update all references to the moved modules.
General updates to programming style, such as
- replacing DCG notation with state var notation
- replacing (C->T;E) with (if C then T else E)
- moving pred/func declarations to just before their code
- replacing io.write/io.nl sequences with io.write_line
- replacing io.print/io.nl sequences with io.print_line
- fixing too-long lines
- fixing grammar errors in comments
tests/hard_coded/Mmakefile:
tests/hard_coded/Mercury.options:
Update all references to the moved modules.
Enable the constant_prop_int test case. The fact that it wasn't enabled
before is probably an accident. (When constant_prop_int.m was created,
the test case was added to a list in the Mmakefile, but that list
was later removed due to never being referenced.)
tests/hard_coded/constant_prop_int.{m,exp}:
Delete the calls to shift operations with negative shift amounts,
since we have added a compile-time error for these since the test
was originally created.
115 lines
2.9 KiB
Mathematica
115 lines
2.9 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ft=mercury ts=4 sw=4 et
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% This test case tests the tree234 library module's conversion of sorted lists
|
|
% directly to trees.
|
|
%
|
|
%---------------------------------------------------------------------------%
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module test234_sorted_insert.
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module assoc_list.
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module maybe.
|
|
:- import_module pair.
|
|
:- import_module string.
|
|
:- import_module tree234.
|
|
|
|
main(!IO) :-
|
|
test_upto(1000, 0, 0, Failed, !IO),
|
|
( if Failed = 0 then
|
|
io.write_string("all tests passed\n", !IO)
|
|
else
|
|
io.format("%d tests failed\n", [i(Failed)], !IO)
|
|
).
|
|
|
|
:- pred test_upto(int::in, int::in, int::in, int::out, io::di, io::uo) is det.
|
|
|
|
test_upto(Max, Cur, !Failed, !IO) :-
|
|
( if Cur > Max then
|
|
true
|
|
else
|
|
test(Cur, !Failed, !IO),
|
|
test_upto(Max, Cur + 1, !Failed, !IO)
|
|
).
|
|
|
|
:- pred test(int::in, int::in, int::out, io::di, io::uo) is det.
|
|
|
|
test(N, !Failed, !IO) :-
|
|
trace [io(!TIO), compile_time(flag("progress"))] (
|
|
io.format("test %d:\n", [i(N)], !TIO)
|
|
),
|
|
|
|
iota(N, List),
|
|
tree234.from_sorted_assoc_list(List, Tree),
|
|
|
|
trace [io(!TIO), compile_time(flag("print_tree"))] (
|
|
io.format("test %d tree:\n", [i(N)], !TIO),
|
|
io.write_line(Tree, !TIO)
|
|
),
|
|
|
|
well_formed(Tree, MaybeDepth),
|
|
tree234_to_assoc_list(Tree, TreeList),
|
|
list.sort(TreeList, SortedTreeList),
|
|
|
|
rev_iota(N, RevList),
|
|
tree234.from_rev_sorted_assoc_list(RevList, RevTree),
|
|
|
|
trace [io(!TIO), compile_time(flag("print_tree"))] (
|
|
io.format("test %d tree:\n", [i(N)], !TIO),
|
|
io.write_line(RevTree, !TIO)
|
|
),
|
|
|
|
well_formed(RevTree, RevMaybeDepth),
|
|
tree234_to_assoc_list(RevTree, RevTreeList),
|
|
list.sort(RevTreeList, RevSortedTreeList),
|
|
|
|
( if
|
|
MaybeDepth = yes(_),
|
|
RevMaybeDepth = yes(_),
|
|
TreeList = SortedTreeList,
|
|
RevTreeList = RevSortedTreeList
|
|
then
|
|
true
|
|
else
|
|
!:Failed = !.Failed + 1
|
|
),
|
|
|
|
trace [io(!TIO), compile_time(flag("progress"))] (
|
|
io.nl(!TIO)
|
|
).
|
|
|
|
:- pred iota(int::in, assoc_list(int)::out) is det.
|
|
|
|
iota(N, List) :-
|
|
iota_2(N, 1, [], RevList),
|
|
list.reverse(RevList, List).
|
|
|
|
:- pred rev_iota(int::in, assoc_list(int)::out) is det.
|
|
|
|
rev_iota(N, RevList) :-
|
|
iota_2(N, 1, [], RevList).
|
|
|
|
:- pred iota_2(int::in, int::in,
|
|
assoc_list(int, int)::in, assoc_list(int, int)::out) is det.
|
|
|
|
iota_2(Max, N, !RevList) :-
|
|
( if N > Max then
|
|
true
|
|
else
|
|
!:RevList = [N - N | !.RevList],
|
|
iota_2(Max, N + 1, !RevList)
|
|
).
|