mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-24 05:43:53 +00:00
9cacd33f47
This first step deals with the consequences of such removal.
The removal itself will happen in stage 2. That step will
add "is" to the prolog module in the library.
compiler/add_pred.m:
Prepare for "is" being in the prolog module.
compiler/options.m:
Add a way to test whether the change to add_pred.m is in the
installed compiler.
tests/accumulator/base.m:
tests/accumulator/call_in_base.m:
tests/accumulator/chain.m:
tests/accumulator/commutative.m:
tests/accumulator/construct_test.m:
tests/accumulator/dcg.m:
tests/accumulator/deconstruct_test.m:
tests/accumulator/disj.m:
tests/accumulator/func.m:
tests/accumulator/heuristic.m:
tests/accumulator/highorder.m:
tests/accumulator/identity.m:
tests/accumulator/inter.m:
tests/accumulator/nonrec.m:
tests/accumulator/out_to_in.m:
tests/accumulator/qsort.m:
tests/accumulator/simple.m:
tests/accumulator/split.m:
tests/accumulator/swap.m:
tests/benchmarks/cqueens.m:
tests/benchmarks/crypt.m:
tests/benchmarks/deriv.m:
tests/benchmarks/deriv2.m:
tests/benchmarks/nrev.m:
tests/benchmarks/poly.m:
tests/benchmarks/primes.m:
tests/benchmarks/qsort.m:
tests/benchmarks/query.m:
tests/benchmarks/tak.m:
tests/debugger/interactive.m:
tests/declarative_debugger/Mercury.options:
tests/declarative_debugger/io_read_bug.m:
tests/declarative_debugger/queens.exp:
tests/declarative_debugger/queens.m:
tests/dppd/imperative_solve_impl.m:
tests/dppd/map_impl.m:
tests/dppd/max_length_impl.m:
tests/dppd/sum.m:
tests/dppd/upto_sum_impl.m:
tests/par_conj/dep_par_21.m:
tests/tabling/seq.m:
tests/term/dds3_14.m:
tests/term/mmatrix.m:
tests/term/money.m:
tests/term/occur.m:
tests/term/pl4_5_2.m:
tests/term/queens.m:
tests/typeclasses/inference_test.m:
tests/typeclasses/inference_test_2.m:
tests/valid/lazy_list.m:
tests/warnings/duplicate_const.m:
Replace calls to "is" with unifications. In many places,
bring programming style up to date.
81 lines
1.6 KiB
Mathematica
81 lines
1.6 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module upto_sum_impl.
|
|
|
|
:- interface.
|
|
|
|
:- pred sumsquaresupto(int::in, int::out) is det.
|
|
|
|
:- type tree(T)
|
|
---> leaf(T)
|
|
; branch(tree(T), tree(T)).
|
|
|
|
:- pred sumtrsquaretr(tree(int)::in, int::out) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module int.
|
|
:- import_module list.
|
|
|
|
sumsquaresupto(N, S) :-
|
|
upto(1, N, Ns),
|
|
squares(Ns, SONs),
|
|
sum(SONs, S).
|
|
|
|
sumtrsquaretr(XT, S) :-
|
|
squaretr(XT, SOXt),
|
|
sumtr(SOXt, S).
|
|
|
|
:- pred upto(int::in, int::in, list(int)::out) is det.
|
|
|
|
upto(M, N, Ms) :-
|
|
( if M > N then
|
|
Ms = []
|
|
else
|
|
M1 = M + 1,
|
|
upto(M1, N, Ms1),
|
|
Ms = [M | Ms1]
|
|
).
|
|
|
|
:- pred sum(list(int)::in, int::out) is det.
|
|
|
|
sum(Ns, S) :-
|
|
sum1(Ns, 0, S).
|
|
|
|
:- pred sum1(list(int)::in, int::in, int::out) is det.
|
|
|
|
sum1([], S, S).
|
|
sum1([N | Ns], A, S) :-
|
|
A1 = A + N,
|
|
sum1(Ns, A1, S).
|
|
|
|
:- pred square(int::in, int::out) is det.
|
|
|
|
square(N, SON) :-
|
|
SON = N * N.
|
|
|
|
:- pred squares(list(int)::in, list(int)::out) is det.
|
|
|
|
squares([], []).
|
|
squares([N | Ns], [SON | SONs]) :-
|
|
square(N, SON),
|
|
squares(Ns, SONs).
|
|
|
|
:- pred sumtr(tree(int)::in, int::out) is det.
|
|
|
|
sumtr(leaf(X), X).
|
|
sumtr(branch(Xt, Yt), S) :-
|
|
sumtr(Xt, SX),
|
|
sumtr(Yt, SY),
|
|
S = SX + SY.
|
|
|
|
:- pred squaretr(tree(int)::in, tree(int)::out) is det.
|
|
|
|
squaretr(leaf(X), leaf(SOX)) :-
|
|
square(X, SOX).
|
|
squaretr(branch(Xt, Yt), branch(SOXt, SOYt)) :-
|
|
squaretr(Xt, SOXt),
|
|
squaretr(Yt, SOYt).
|