mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-21 20:33:55 +00:00
tests/invalid/*.{m,err_exp}:
tests/misc_tests/*.m:
tests/mmc_make/*.m:
tests/par_conj/*.m:
tests/purity/*.m:
tests/stm/*.m:
tests/string_format/*.m:
tests/structure_reuse/*.m:
tests/submodules/*.m:
tests/tabling/*.m:
tests/term/*.m:
tests/trailing/*.m:
tests/typeclasses/*.m:
tests/valid/*.m:
tests/warnings/*.{m,exp}:
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 tests
that check compiler error messages, expect the new line numbers.
browser/cterm.m:
browser/tree234_cc.m:
Import only one module per line.
tests/hard_coded/boyer.m:
Fix something I missed.
134 lines
2.8 KiB
Mathematica
134 lines
2.8 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module spurious_mode_error.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io__state::di, io__state::uo) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module char.
|
|
:- import_module float.
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module maybe.
|
|
:- import_module string.
|
|
|
|
:- type opt(T)
|
|
---> a(pred(int, T, T))
|
|
; b(pred(string, T, T))
|
|
; c(pred(float, T, T)).
|
|
|
|
:- inst opt == bound((
|
|
a(pred(in, in, out) is det)
|
|
; b(pred(in, in, out) is det)
|
|
; c(pred(in, in, out) is det)
|
|
)).
|
|
|
|
:- type f(T)
|
|
---> f(
|
|
maybe(pred(int, T, T)),
|
|
maybe(pred(string, T, T)),
|
|
maybe(pred(float, T, T))
|
|
).
|
|
|
|
:- inst m(I) == bound((no ; yes(I))).
|
|
|
|
:- inst f == bound(f(
|
|
m(pred(in, in, out) is det),
|
|
m(pred(in, in, out) is det),
|
|
m(pred(in, in, out) is det)
|
|
)).
|
|
|
|
main -->
|
|
{ makeit([a(foo), b(bar), c(baz)], f(no, no, no), Thing) },
|
|
{ foldit([i(23), s("42"), f(4.2)], Thing, 0, Stuff) },
|
|
write(Stuff).
|
|
|
|
:- pred foldit(list(string__poly_type), f(T), T, T).
|
|
:- mode foldit(in, in(f), in, out) is det.
|
|
|
|
foldit([], _F, T, T).
|
|
foldit([X | Xs], F, T0, T) :-
|
|
(
|
|
X = i(I),
|
|
(
|
|
F = f(no, _, _),
|
|
T1 = T0
|
|
;
|
|
F = f(yes(Z), _, _),
|
|
call(Z, I, T0, T1)
|
|
)
|
|
;
|
|
X = s(S),
|
|
(
|
|
F = f(_, no, _),
|
|
T1 = T0
|
|
;
|
|
F = f(_, yes(Z), _),
|
|
call(Z, S, T0, T1)
|
|
)
|
|
;
|
|
X = f(W),
|
|
(
|
|
F = f(_, _, no),
|
|
T1 = T0
|
|
;
|
|
F = f(_, _, yes(Z)),
|
|
call(Z, W, T0, T1)
|
|
)
|
|
;
|
|
X = c(J),
|
|
foobie(J, T0, T1)
|
|
),
|
|
foldit(Xs, F, T1, T).
|
|
|
|
:- pred makeit(list(opt(T)), f(T), f(T)).
|
|
:- mode makeit(in(list_skel(opt)), in(f), out(f)) is det.
|
|
|
|
makeit([], F, F).
|
|
makeit([Opt | Opts], F0, F) :-
|
|
add_opt(Opt, F0, F1),
|
|
makeit(Opts, F1, F).
|
|
|
|
:- pred add_opt(opt(T), f(T), f(T)).
|
|
:- mode add_opt(in(opt), in(f), out(f)) is det.
|
|
|
|
add_opt(a(Z), F0, F) :-
|
|
F0 = f(_, B, C),
|
|
F = f(yes(Z), B, C).
|
|
add_opt(b(Z), F0, F) :-
|
|
F0 = f(A, _, C),
|
|
F = f(A, yes(Z), C).
|
|
add_opt(c(Z), F0, F) :-
|
|
F0 = f(A, B, _),
|
|
F = f(A, B, yes(Z)).
|
|
|
|
:- pred foo(int, T, T).
|
|
:- mode foo(in, in, out) is det.
|
|
|
|
foo(_, T, T).
|
|
|
|
:- pred bar(string, T, T).
|
|
:- mode bar(in, in, out) is det.
|
|
|
|
bar(_, T, T).
|
|
|
|
:- pred baz(float, T, T).
|
|
:- mode baz(in, in, out) is det.
|
|
|
|
baz(_, T, T).
|
|
|
|
/* XXX to make the bug go away, uncomment this predicate!
|
|
:- pred foobie(char, T, T).
|
|
:- mode foobie(in, in, out) is det.
|
|
|
|
foobie(_, T, T).
|
|
*/
|
|
|