[m-dev.] From time.m
Fergus Henderson
fjh at cs.mu.oz.au
Wed Jun 4 17:35:21 AEST 1997
Tyson Richard DOWD, you wrote:
>
> Zoltan has just spoken to me about this, and suggested that we should
> make two versions available - one that will just count the solutions
> (the present version) and one that will return the list of solutions.
> It is likely that with large solutions, the overhead of deep copying for
> some grades will dwarf the running time of the predicate being
> benchmarked.
>
> Any comments?
I don't think the version that returns a list of solutions is useful enough
to warrant inclusion in the standard library. You can easily just use
`benchmark_det((pred(L::out) is det :- solutions(p, L)), ...)' instead,
if that is what you want.
Oh, BTW, there's a bug in the interface to benchmark_det and benchmark_nondet:
they should both be declared cc_multi.
--
Fergus Henderson <fjh at cs.mu.oz.au> | "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh> | of excellence is a lethal habit"
PGP: finger fjh at 128.250.37.3 | -- the last words of T. S. Garp.
More information about the developers
mailing list