[Issue 10009] foreach_reverse and AA.byKey/byValue

[via Digitalmars-d-bugs]

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

--- Comment #29 from Ketmar Dark <ketmar at ketmar.no-ip.org> ---
(In reply to bearophile_hugs from comment #26)
> > it's either slow or memory-consuming. as for me it's unacceptable deal.
> Why? Have you created benchmarks, have you tested it already?
there is no need to test the obvious. to gain speed we need two more pointers
for each element. if we add one pointer, our AA will turn to single-linked list
for insertion and deletion; complete disaster. no pointers — and we have no
place to store housekeeping info.

two more pointers for the feature i don't need and will not use? no, i'll not
buy this. ;-)

--