On Wednesday, 14 June 2017 at 02:54:30 UTC, 9il wrote:
Random access iteration is more expensive then front/popFront in general case. For arrays it is not true. But for many other kinds of ranges it is. For example ranges that do not have contiguous memory representation (strided vectors, flattened matrixes and etc)

I'm not sure I understand what you are saying. I was suggesting that foreach(range) would iterate range[0...length] in that order. Wouldn't that be an equivalent access pattern to front/popFront?

Reply via email to