AA Troubles

[Jonathan Crapuchettes]

Thank you, but I figured out a way to significantly reduce the number of AAs 
that were in use in my program and that seems to have helped it and sped it up a 
bit.

The next problem that I just ran into really doesn't make sense and I'm hoping 
that you can help me. I'm getting segfaults in the function 
invariant._d_invariant. Does this mean anything to you?

Thanks,
Jonathan

dsimcha wrote:
> BTW, I've updated RandAA for 64-bits if you want to try it out. The updates were
> rather trivial and I meant to do them a long time ago.
>
> On 5/11/2011 1:49 PM, Jonathan Crapuchettes wrote:
>> Wow! When is the next release planned? Is it worth my trying the beta?
>>
>> dsimcha wrote:
>>> == Quote from Jonathan Crapuchettes (jcrapuchettes at gmail.com)'s article
>>>> 1. I will give you implementation a try.
>>>> 2. I have been compiling with 64-bit as I expect most of the programs
>>>> I write
>>>> require more than 4GB of memory.
>>>> Thanks!
>>>
>>> Unfortunately RandAA doesn't work on 64-bit yet, though the reasons
>>> are just some
>>> minor details, not fundamental issues. I didn't bother supporting it
>>> because last
>>> time I did a major update the 64-bit backend wasn't ready yet and I
>>> needed to find
>>> good linear congruential parameters for 64-bit.
>>>
>>> You might also be pleasantly surprised when the new release (currently
>>> in beta)
>>> comes out. I've put a lot of optimization work into the garbage
>>> collector and
>>> depending on the allocation size, it's between 25% and 200x faster
>>> than the 2.052
>>> GC. (See
>>> https://github.com/dsimcha/druntime/wiki/Druntime-GC-Optimization-Fork)
>