Fun project - faster associative array algorithm
Steven Schveighoffer via Digitalmars-d
digitalmars-d at puremagic.com
Thu Apr 9 07:14:47 PDT 2015
On 4/9/15 8:07 AM, Daniel Murphy wrote:
> "Steven Schveighoffer" wrote in message
> news:mg5pf0$1g51$1 at digitalmars.com...
>
>> I really am surprised that these would be difficult at all. The
>> lowering is pretty easy:
>> a) T[U] => AssociativeArray!(U,T)
>> b) [a:b, c:d] => AssociativeArray!(typeof(true ? a : c), typeof(true ?
>> b : d)).literal(a, b, c, d);
>
> Working out what to lower to is easy, working out when to lower it is hard.
Wouldn't it be whenever AA was previously invoked? I'm surprised there
are any unknowns here.
-Steve
More information about the Digitalmars-d
mailing list