Re: efficiency of new listu/listn
Ar an naoú lá is fiche de mí Márta, scríobh Jeff Sparkes:
Since Jerry changed the listu to build the list in the right order,
is it
any faster than listN?
They should be equivalent, from eyeballing the code, though I’m open to
contradiction from benchmarks.
When does the iterative version overcome the oeverhead of recursion.
I'm
sure it pretty CPU/cache sensitive, but maybe a microbenchmark is called
for. Maybe we can get rid of list5 and/or list6?
Iteration versus recursion doesn’t come into it, both approaches are
iterative, but I think it’s reasonable to eliminate those functions, and
would approve a patch.
--
“Apart from the nine-banded armadillo, man is the only natural host of
Mycobacterium leprae, although it can be grown in the footpads of mice.”
-- Kumar & Clark, Clinical Medicine, summarising improbable leprosy research
_______________________________________________
XEmacs-Beta mailing list
XEmacs-Beta(a)xemacs.org
http://lists.xemacs.org/mailman/listinfo/xemacs-beta