mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-16 01:43:35 +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.
353 lines
6.3 KiB
Mathematica
353 lines
6.3 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ft=mercury ts=4 sw=4 et
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The code of this test is identical to the code of string_switch and
|
|
% string_switch3, but we compile them with different compilation options.
|
|
|
|
:- module string_switch2.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module solutions.
|
|
:- import_module string.
|
|
|
|
main(!IO) :-
|
|
Keys =
|
|
["a", "b", "c",
|
|
"aa", "ab", "ac",
|
|
"ba", "bb", "bc",
|
|
"ca", "cb", "cc"],
|
|
|
|
% Test jump tables.
|
|
list.foldl(test_jump, Keys, !IO),
|
|
|
|
% Test semidet and det lookup tables.
|
|
list.foldl(test_one, Keys, !IO),
|
|
list.foldl(test_one_known, Keys, !IO),
|
|
|
|
% Test nondet and multi lookup tables.
|
|
list.foldl(test_several, Keys, !IO),
|
|
list.foldl(test_several_known, Keys, !IO),
|
|
list.foldl(test_several_nested, Keys, !IO).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- pred test_jump(string::in, io::di, io::uo) is det.
|
|
|
|
test_jump(S, !IO) :-
|
|
( jump(S, 50, N) ->
|
|
io.format("jump %s -> %d\n", [s(S), i(N)], !IO)
|
|
;
|
|
io.format("jump %s failed\n", [s(S)], !IO)
|
|
).
|
|
|
|
:- pred test_one(string::in, io::di, io::uo) is det.
|
|
|
|
test_one(S, !IO) :-
|
|
( one(S, N) ->
|
|
io.format("one %s -> %d\n", [s(S), i(N)], !IO)
|
|
;
|
|
io.format("one %s failed\n", [s(S)], !IO)
|
|
).
|
|
|
|
:- pred test_one_known(string::in, io::di, io::uo) is det.
|
|
|
|
test_one_known(S, !IO) :-
|
|
(
|
|
( S = "aa"
|
|
; S = "bb"
|
|
),
|
|
one(S, N)
|
|
->
|
|
io.format("one known %s -> %d\n", [s(S), i(N)], !IO)
|
|
;
|
|
io.format("one known %s failed\n", [s(S)], !IO)
|
|
).
|
|
|
|
:- pred test_several(string::in, io::di, io::uo) is det.
|
|
|
|
test_several(S, !IO) :-
|
|
solutions(several_unknown(S), Solns),
|
|
io.format("several %s -> ", [s(S)], !IO),
|
|
io.write(Solns, !IO),
|
|
io.nl(!IO).
|
|
|
|
:- pred test_several_known(string::in, io::di, io::uo) is det.
|
|
|
|
test_several_known(S, !IO) :-
|
|
solutions(several_known(S), Solns),
|
|
io.format("several known %s -> ", [s(S)], !IO),
|
|
io.write(Solns, !IO),
|
|
io.nl(!IO).
|
|
|
|
:- pred test_several_nested(string::in, io::di, io::uo) is det.
|
|
|
|
test_several_nested(S, !IO) :-
|
|
solutions(several_nested(S), Solns),
|
|
io.format("several nested %s -> ", [s(S)], !IO),
|
|
io.write(Solns, !IO),
|
|
io.nl(!IO).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- pred jump(string::in, int::in, int::out) is semidet.
|
|
|
|
jump(S, N0, N) :-
|
|
(
|
|
S = "a",
|
|
N = N0 + 1
|
|
;
|
|
S = "b",
|
|
N = N0 + 2
|
|
;
|
|
( S = "aa"
|
|
; S = "ab"
|
|
),
|
|
N = 11
|
|
;
|
|
( S = "ba"
|
|
; S = "bb"
|
|
),
|
|
N = N0 + 12
|
|
;
|
|
( S = "ca"
|
|
; S = "cd"
|
|
; S = "ce"
|
|
),
|
|
N = 13
|
|
;
|
|
S = "xxx",
|
|
N = 21
|
|
;
|
|
S = "xxy",
|
|
N = 22
|
|
;
|
|
S = "xxz",
|
|
N = 23
|
|
;
|
|
S = "xyx",
|
|
N = 24
|
|
).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- inst aa_bb
|
|
---> "aa" ; "bb".
|
|
|
|
:- pred one(string, int).
|
|
:- mode one(in(aa_bb), out) is det.
|
|
:- mode one(in, out) is semidet.
|
|
|
|
one(S, N) :-
|
|
(
|
|
S = "a",
|
|
N = 1
|
|
;
|
|
S = "b",
|
|
N = 2
|
|
;
|
|
( S = "aa"
|
|
; S = "ab"
|
|
),
|
|
N = 11
|
|
;
|
|
( S = "ba"
|
|
; S = "bb"
|
|
),
|
|
N = 12
|
|
;
|
|
( S = "ca"
|
|
; S = "cd"
|
|
; S = "ce"
|
|
),
|
|
N = 13
|
|
;
|
|
S = "xxx",
|
|
N = 21
|
|
;
|
|
S = "xxy",
|
|
N = 22
|
|
;
|
|
S = "xxz",
|
|
N = 23
|
|
;
|
|
S = "xyx",
|
|
N = 24
|
|
).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- pred several_unknown(string::in, int::out) is nondet.
|
|
|
|
several_unknown(S, N) :-
|
|
several(S, N).
|
|
|
|
:- pred several_known(string::in, int::out) is nondet.
|
|
|
|
several_known(S, N) :-
|
|
( S = "aa"
|
|
; S = "bb"
|
|
),
|
|
several(S, N).
|
|
|
|
:- pred several(string, int).
|
|
:- mode several(in(aa_bb), out) is multi.
|
|
:- mode several(in, out) is nondet.
|
|
|
|
several(S, N) :-
|
|
(
|
|
S = "a",
|
|
N = 1
|
|
;
|
|
S = "b",
|
|
N = 2
|
|
;
|
|
( S = "aa"
|
|
; S = "ab"
|
|
),
|
|
( N = 11
|
|
; N = 12
|
|
)
|
|
;
|
|
( S = "ba"
|
|
; S = "bb"
|
|
),
|
|
( N = 13
|
|
; N = 14
|
|
; N = 15
|
|
)
|
|
;
|
|
( S = "ca"
|
|
; S = "cb"
|
|
; S = "cd"
|
|
; S = "ce"
|
|
),
|
|
N = 16
|
|
;
|
|
S = "xxx",
|
|
N = 21
|
|
;
|
|
S = "xxy",
|
|
N = 22
|
|
;
|
|
S = "xxz",
|
|
N = 23
|
|
;
|
|
S = "xyx",
|
|
( N = 24
|
|
; N = 25
|
|
; N = 26
|
|
)
|
|
).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- pred several_nested(string::in, int::out) is nondet.
|
|
|
|
several_nested(S0, R) :-
|
|
(
|
|
S = S0
|
|
;
|
|
S = "a" ++ S0
|
|
),
|
|
(
|
|
S = "a",
|
|
N = 1
|
|
;
|
|
S = "b",
|
|
N = 2
|
|
;
|
|
( S = "aa"
|
|
; S = "ab"
|
|
),
|
|
( N = 11
|
|
; N = 12
|
|
)
|
|
;
|
|
( S = "ba"
|
|
; S = "bb"
|
|
),
|
|
( N = 13
|
|
; N = 14
|
|
; N = 15
|
|
)
|
|
;
|
|
( S = "ca"
|
|
; S = "cb"
|
|
; S = "cd"
|
|
; S = "ce"
|
|
),
|
|
N = 16
|
|
;
|
|
S = "xxx",
|
|
N = 21
|
|
;
|
|
S = "xxy",
|
|
N = 22
|
|
;
|
|
S = "xxz",
|
|
N = 23
|
|
;
|
|
S = "xyx",
|
|
( N = 24
|
|
; N = 25
|
|
; N = 26
|
|
)
|
|
),
|
|
(
|
|
S0 = "a",
|
|
M = 1
|
|
;
|
|
S0 = "b",
|
|
M = 2
|
|
;
|
|
( S0 = "aa"
|
|
; S0 = "ab"
|
|
),
|
|
( M = 11
|
|
; M = 12
|
|
)
|
|
;
|
|
( S0 = "ba"
|
|
; S0 = "bb"
|
|
),
|
|
( M = 13
|
|
; M = 14
|
|
; M = 15
|
|
)
|
|
;
|
|
( S0 = "ca"
|
|
; S0 = "cb"
|
|
; S0 = "cd"
|
|
; S0 = "ce"
|
|
),
|
|
M = 16
|
|
;
|
|
S0 = "xxx",
|
|
M = 21
|
|
;
|
|
S0 = "xxy",
|
|
M = 22
|
|
;
|
|
S0 = "xxz",
|
|
M = 23
|
|
;
|
|
S0 = "xyx",
|
|
( M = 24
|
|
; M = 25
|
|
; M = 26
|
|
)
|
|
),
|
|
R = 1000 * N + M.
|