Files
mercury/tests/declarative_debugger/binary_search.m
Zoltan Somogyi 33eb3028f5 Clean up the tests in half the test directories.
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.
2015-02-14 20:14:03 +11:00

73 lines
1.3 KiB
Mathematica

%---------------------------------------------------------------------------%
% vim: ts=4 sw=4 et ft=mercury
%---------------------------------------------------------------------------%
:- module binary_search.
:- interface.
:- import_module bool.
:- import_module int.
:- import_module io.
:- pred main(io::di, io::uo) is det.
:- pred silly_even(int::in, bool::out) is det.
:- implementation.
:- import_module binary_search_1.
:- import_module list.
main(!IO) :-
a(A),
b(B),
add1s([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], L),
write(A, !IO),
write(B, !IO),
write(L, !IO),
nl(!IO).
:- pred a(bool::out) is det.
a(X) :-
binary_search.silly_even(1001, X).
:- pred b(bool::out) is det.
b(X) :-
binary_search.silly_even(1003, X).
silly_even(N, R) :-
(
N > 0
->
(
(N =< 600 , N >= 405 ; N mod 3 = 0)
->
binary_search_1.sillier_even(N, R)
;
(
N = 619
->
binary_search.silly_even(N-1, R)
;
binary_search.silly_even(N-2, R)
)
)
;
(
N = 0
->
R = yes
;
R = no
)
).
:- pred add1s(list(int)::in, list(int)::out) is det.
add1s([], []).
add1s([H0 | T0], [H0+1 | T]) :-
add1s(T0, T).