On Fri, Jan 11, 2013 at 08:47:19AM +0100, deadalnix wrote: > On Thursday, 10 January 2013 at 22:28:46 UTC, H. S. Teoh wrote: > >On Thu, Jan 10, 2013 at 11:18:07PM +0100, Era Scarecrow wrote: > >>On Thursday, 10 January 2013 at 22:02:17 UTC, Dmitry Olshansky > >>wrote: > >>>+ user defined implicit conversion so that AALiteral(K,V) > >>>--*implicitly*!--> AA!(K,V) > >>> > >>> > >>>The other use case for user-defined implicit conversion were > >>>already outlined before so I hope it will make its way in one > >>>day. > >> > >> I thought I heard talk of possibly moving AA's to a library > >>implementation rather than a built in feature (Still 'built in' > >>technically). > > > >That's my plan, and Andrei's hope. But it's not going to be easy. > >The current AA implementation is split between object_.d and aaA.d in > >druntime, with bits scattered throughout the compiler. Cleaning all > >of that up is going to be a big job. > > > > You may want to look at this : > http://preshing.com/20130107/this-hash-table-is-faster-than-a-judy-array > > Additionally, can you show me what you have so far ? I'd be > interested in using it directly for SDC without using the existing > one at all.
https://github.com/quickfur/New-AA-implementation It's basically just a refactoring of the current AA code to hoist it into object_.d; I didn't introduce any new algorithms or data structures. T -- This is a tpyo.
