mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-15 01:13:30 +00:00
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.
40 lines
1.3 KiB
Mathematica
40 lines
1.3 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "match.kmp" Benchmark
|
|
% Part of the DPPD Library.
|
|
%
|
|
% This is exactly like the Lam & Kusalik benchmark match, except that
|
|
% the run-time queries are more sophisticated than the ones for match.
|
|
|
|
:- module match_kmp.
|
|
|
|
:- interface.
|
|
|
|
:- pred match_kmp is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module list.
|
|
:- import_module match_impl.
|
|
|
|
match_kmp :-
|
|
match_aab([a, a, a, a, c, d, a, a, a, e, f, g, h, a, a, b, d, f]),
|
|
match_aab([a, b, a, b, a, a, a, a, c, a, a, a, a, a, a, a, a, b]),
|
|
match_aab([a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a,
|
|
a, a, a, a, a, b]),
|
|
match_aab([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s,
|
|
t, u, v, a, a, b, w, x, y, z]).
|
|
|
|
% The run-time queries
|
|
%
|
|
% :- match([a, a, b], [a, a, a, a, c, d, a, a, a, e, f, g, h, a, a, b, d, f]).
|
|
% :- match([a, a, b], [a, b, a, b, a, a, a, a, c, a, a, a, a, a, a, a, a, b]).
|
|
% :- match([a, a, b], [a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a,
|
|
% a, a, a, a, a, a, b]).
|
|
% :- match([a, a, b], [a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r,
|
|
% s, t, u, v, a, a, b, w, x, y, z]).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|