On Sunday, June 30, 2013 21:05:41 CJS wrote: > In the talk Andrei seems to mentions that D's associative arrays > are lacking in performance somehow. I'm very new to D, but it's > not obvious to me what the shortcoming is. I assume it's that for > some reason it's hard to specialize associative arrays to specfic > types to give increased performance in specfic cases, but I'm > unclear why that would be difficult. Could someone please > elaborate?
There's one implementation, and you can't swap it out, whereas different use cases may perform better with different implementations. On top of that, the current implementation is rather buggy and fragile, but that's an implementation issue rather than an inherent one. - Jonathan M Davis
