[Issue 10009] foreach_reverse and AA.byKey/byValue

[via Digitalmars-d-bugs]

https://issues.dlang.org/show_bug.cgi?id=10009

--- Comment #21 from Ketmar Dark <ketmar at ketmar.no-ip.org> ---
(In reply to yebblies from comment #20)
> Anyone looking for high performance in the built-in AAs is on the wrong track.
but why? it's wrong to assume that AA has any defined order of items for
iteration. this is *really* wrong. but there is nothing wrong with fast and
memory-effective built-in AAs. why include language feature that is known to be
slow when it can be reasonably fast?

built-in AAs are very handy. and if they known to be slow, people will start to
roll their own AA implementations virtually each time they want to use AA. and
then we can just kill built-in AAs altogether.

> Sure, but I tend to think of the builtin AAs as convenient but not
> necessarily high performance. 
i believe that built-in AAs should be fast, but not necessarily featurefull.
and AAs with more features can be implemented in Phobos.

> > yet i'm not sure that everyone are ready to pay 8/64 bytes per AA element
> > for this feature.
> Maybe not.
i certainly don't want that overhead. i done some work on faster byKey.first
though, see https://issues.dlang.org/show_bug.cgi?id=13410

--