mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-24 05:43:53 +00:00
33eb3028f5
tests/accumulator/*.m:
tests/analysis_*/*.m:
tests/benchmarks*/*.m:
tests/debugger*/*.{m,exp,inp}:
tests/declarative_debugger*/*.{m,exp,inp}:
tests/dppd*/*.m:
tests/exceptions*/*.m:
tests/general*/*.m:
tests/grade_subdirs*/*.m:
tests/hard_coded*/*.m:
Make these tests use four-space indentation, and ensure that
each module is imported on its own line. (I intend to use the latter
to figure out which subdirectories' tests can be executed in parallel.)
These changes usually move code to different lines. For the debugger tests,
specify the new line numbers in .inp files and expect them in .exp files.
174 lines
3.3 KiB
Mathematica
174 lines
3.3 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module print_table.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io.state::di, io.state::uo) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module float.
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module maybe.
|
|
:- import_module solutions.
|
|
:- import_module string.
|
|
|
|
main -->
|
|
{ p(5, 5, P55) },
|
|
{ p(4, 3, P43) },
|
|
{ p(2, 2, P22) },
|
|
{ p(1, 0, P10) },
|
|
{ q(3, 2, Q32) ->
|
|
MaybeQ32 = yes(Q32)
|
|
;
|
|
MaybeQ32 = no
|
|
},
|
|
{ q(4, 2, Q42) ->
|
|
MaybeQ42 = yes(Q42)
|
|
;
|
|
MaybeQ42 = no
|
|
},
|
|
{ r(3, R3) },
|
|
{ s(3.5, 1, "abc", 1, SA, TA) },
|
|
{ s(3.5, 2, "abc", 2, SB, TB) },
|
|
{ s(3.5, 2, "xyz", 3, SC, TC) },
|
|
{ s(3.5, 2, "xyz", 4, SD, TD) },
|
|
{ s(9.2, 2, "def", 5, SE, TE) },
|
|
{ solutions(t(1, 2), T12) },
|
|
{ solutions(t(2, 2), T22) },
|
|
{ tdone },
|
|
{ solutions(u(1, 2, 2), U12) },
|
|
{ solutions(u(2, 2, 2), U22) },
|
|
{ udone },
|
|
io.write_int(P55),
|
|
io.nl,
|
|
io.write_int(P43),
|
|
io.nl,
|
|
io.write_int(P22),
|
|
io.nl,
|
|
io.write_int(P10),
|
|
io.nl,
|
|
io.write(MaybeQ32),
|
|
io.nl,
|
|
io.write(MaybeQ42),
|
|
io.nl,
|
|
io.write_int(R3),
|
|
io.nl,
|
|
io.write_string(SA),
|
|
io.write_string(" "),
|
|
io.write_float(TA),
|
|
io.nl,
|
|
io.write_string(SB),
|
|
io.write_string(" "),
|
|
io.write_float(TB),
|
|
io.nl,
|
|
io.write_string(SC),
|
|
io.write_string(" "),
|
|
io.write_float(TC),
|
|
io.nl,
|
|
io.write_string(SD),
|
|
io.write_string(" "),
|
|
io.write_float(TD),
|
|
io.nl,
|
|
io.write_string(SE),
|
|
io.write_string(" "),
|
|
io.write_float(TE),
|
|
io.nl,
|
|
io.write(T12),
|
|
io.nl,
|
|
io.write(T22),
|
|
io.nl,
|
|
io.write(U12),
|
|
io.nl,
|
|
io.write(U22),
|
|
io.nl.
|
|
|
|
:- pred p(int::in, int::in, int::out) is det.
|
|
:- pragma memo(p/3).
|
|
|
|
p(A, B, S) :-
|
|
( B = 0 ->
|
|
S = 0
|
|
;
|
|
p(A, B - 1, S0),
|
|
S = A * B + S0
|
|
).
|
|
|
|
:- pred q(int::in, int::in, int::out) is semidet.
|
|
:- pragma memo(q/3).
|
|
|
|
q(A, B, S) :-
|
|
( B = 0 ->
|
|
S = 0
|
|
; A = 4 * B ->
|
|
fail
|
|
;
|
|
q(A, B - 1, S0),
|
|
S = A * B + S0
|
|
).
|
|
|
|
:- pred r(int::in, int::out) is det.
|
|
:- pragma memo(r/2).
|
|
|
|
r(A, S) :-
|
|
( A = 0 ->
|
|
S = 0
|
|
;
|
|
r(A - 1, S0),
|
|
S = A + S0
|
|
).
|
|
|
|
:- pred s(float::in, int::in, string::in, int::in, string::out, float::out)
|
|
is det.
|
|
:- pragma memo(s/6).
|
|
|
|
s(A, B, C, D, S, T) :-
|
|
string__format("%3.1f", [f(A)], AS),
|
|
string__int_to_string(B, BS),
|
|
string__append_list(["[", AS, C, BS, "]"], S0),
|
|
S = from_char_list(list__condense(
|
|
list__duplicate(D, to_char_list(S0)))),
|
|
T = A + float(D).
|
|
|
|
:- pred t(int::in, int::in, int::out) is nondet.
|
|
:- pragma memo(t/3).
|
|
|
|
t(A, B, C) :-
|
|
( A = 1 ->
|
|
(
|
|
C = (A * 100) + (B * 10)
|
|
;
|
|
C = (B * 100) + (A * 10)
|
|
)
|
|
;
|
|
fail
|
|
).
|
|
|
|
:- pred tdone is det.
|
|
|
|
tdone.
|
|
|
|
:- pred u(int::in, int::in, int::in, int::out) is nondet.
|
|
:- pragma memo(u/4, [specified([value, value, promise_implied, output])]).
|
|
|
|
u(A, B, Bcopy, C) :-
|
|
( A = 1 ->
|
|
(
|
|
C = (A * 100) + (B * 10)
|
|
;
|
|
C = (Bcopy * 100) + (A * 10)
|
|
)
|
|
;
|
|
fail
|
|
).
|
|
|
|
:- pred udone is det.
|
|
|
|
udone.
|