[Issue 12446] std.parallelism.amap prefer iteration to indexing

[d-bugmail at puremagic.com]

https://d.puremagic.com/issues/show_bug.cgi?id=12446



--- Comment #1 from safety0ff.bugz <safety0ff.bugz at gmail.com> 2014-03-23 13:54:09 PDT ---
(In reply to comment #0)
> This matters when random access is more expensive than iteration.
> 
> Iteration, if properly implemented, should always at least as fast as indexing.

It occurred to me that the cost of slicing a range could be disproportionate to
indexing. Are there any use cases where this is true?

-- 
Configure issuemail: https://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------