Re: efficiency of new listu/listn
On Tue, Mar 29, 2011 at 6:52 AM, Jeff Sparkes <jsparkes(a)gmail.com> wrote:
Since Jerry changed the listu to build the list in the right order,
is it
any faster than listN?
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?
My expectation is that list building with listn(), listu(), or any of the
listN() functions is going to be dominated by the cost of memory allocation
for the cons cells. But I haven't done any measurements. Who knows?
Actual measurements sometimes turn up surprising things.
--
Jerry James
http://www.jamezone.org/
_______________________________________________
XEmacs-Beta mailing list
XEmacs-Beta(a)xemacs.org
http://lists.xemacs.org/mailman/listinfo/xemacs-beta