mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-16 01:43:35 +00:00
fdd141bf77
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.
70 lines
1.6 KiB
Mathematica
70 lines
1.6 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module constr_inst_syntax.
|
|
:- interface.
|
|
|
|
:- typeclass foo(T) where [].
|
|
:- typeclass bar(T) where [].
|
|
:- instance bar(int).
|
|
|
|
:- type list(T)
|
|
---> []
|
|
; [T | list(T)].
|
|
:- inst list_skel(I)
|
|
---> []
|
|
; [I | list_skel(I)].
|
|
|
|
% The example from the reference manual.
|
|
%
|
|
:- pred append(list(T), list(T), list(T)).
|
|
:- (mode append(in(list_skel(I)), in(list_skel(I)),
|
|
out(list_skel(I))) is det) <= I =< ground.
|
|
|
|
% Check that inst constraints can be combined with
|
|
% typeclass constraints in predmode decls.
|
|
%
|
|
:- pred predmode_1(T::in(I), T::in(I), T::out(I))
|
|
is det <= (I =< any, foo(T)).
|
|
|
|
% A more complicated example using inst and type class
|
|
% constraints.
|
|
%
|
|
:- some [U]
|
|
(impure pred predmode_2(T::in(I), U::out, T::out(I)) is det => bar(U))
|
|
<= (foo(T), I =< any).
|
|
|
|
% Multiple inst constraints.
|
|
%
|
|
:- pred multi_inst_constrs(T, T, U, U).
|
|
:- (mode multi_inst_constrs(in(I), out(I), in(J), out(J)) is det)
|
|
<= (I =< ground, J =< any).
|
|
|
|
% Inst constraints and functions.
|
|
%
|
|
:- func id(T) = T.
|
|
:- (mode id(in(I)) = out(I) is det) <= I =< ground.
|
|
|
|
:- func id2(T::in(I), U::in(J)) = (T::out(I)) is det
|
|
<= (foo(T), I =< ground, J =< any).
|
|
|
|
:- implementation.
|
|
|
|
:- instance bar(int) where [].
|
|
|
|
append([], Zs, Zs).
|
|
append([ X | Xs ], Ys, [ X | Zs ]) :-
|
|
append(Xs, Ys, Zs).
|
|
|
|
predmode_1(X, _, X).
|
|
|
|
multi_inst_constrs(A, A, B, B).
|
|
|
|
predmode_2(X, 3, X) :-
|
|
impure impure_true.
|
|
|
|
id(X) = X.
|
|
|
|
id2(X, _) = X.
|