Re: cl-dolist, dolist, cl-return,

[Stefan Monnier]

>> Right, the question often makes sense for loop boundary computations,
>> but for this specific case, if you think enough about it, it makes no
>> sense to re-evaluate it: you'd have to use an index into the list,
>> and at each iteration, increment the index, recompute the list, and
>> do an (nth <index> <list>), which would overall be
>> *really* inefficient.
> No, of course I don't want to re-evaluate it! I didn't

My point was that the re-evaluation part would be just a side-problem:
even if your expression is a mere variable (so re-evaluating it is very
cheap), the need to use `nth' at each step would force an O(N^2)
complexity to this loop.


        Stefan