Programming puzzles: processing lists!

[DavidM]

(04-24-2017 09:35 PM)Claudio L. Wrote:  I wonder if using MAP instead of DOLIST would be any faster.

(04-24-2017 10:00 PM)John Keith Wrote:  I doubt it, MAP tends to be quite slow.

Yet another list processing command to add to the list of dedicated RPL list-processing commands! I hadn't noticed that one before.

Syntax-wise, it appears that it could be used in the same situations where DOLIST (or DOSUBS) would be used with a single list and n=1. I don't see anything documented about it using NSUB, though, so a subprogram that needs to differentiate its process for specific iterations wouldn't be able to take advantage of that. So I suppose it is more like DOLIST than DOSUBS in that regard.

Would be interesting to compare the performance for a couple of these (where it is a good fit, of course).