http://judy.sourceforge.net/downloads/10minutes.htm

Would be nice to have such an implementation. Supposedly one of the best all around data structures in existence? Maybe D could be used to make them work with arbitrary cache-sizes?

Anyone up for the challenge?

On Thursday, 25 August 2016 at 20:42:42 UTC, Illuminati wrote:
> http://judy.sourceforge.net/downloads/10minutes.htm
>
> Would be nice to have such an implementation. Supposedly one of the best all around data structures in existence? Maybe D could be used to make them work with arbitrary cache-sizes?
>
> Anyone up for the challenge?

Also, I think it would be best to avoid the GC, so it works in both GC code and non-gc code.

On Thursday, 25 August 2016 at 20:43:19 UTC, Illuminati wrote:
> On Thursday, 25 August 2016 at 20:42:42 UTC, Illuminati wrote:
>> http://judy.sourceforge.net/downloads/10minutes.htm
>>
>> Would be nice to have such an implementation. Supposedly one of the best all around data structures in existence? Maybe D could be used to make them work with arbitrary cache-sizes?
>>
>> Anyone up for the challenge?
>
> Also, I think it would be best to avoid the GC, so it works in both GC code and non-gc code.

We use them heavily at work. They are insanely good. But the reference C implementation is the craziest code I've ever seen. There is some dark magic at work in there. This challenge is not for the faint of heart.

On Thursday, 25 August 2016 at 20:42:42 UTC, Illuminati wrote:
> http://judy.sourceforge.net/downloads/10minutes.htm
>
> Would be nice to have such an implementation. Supposedly one of the best all around data structures in existence? Maybe D could be used to make them work with arbitrary cache-sizes?
>
> Anyone up for the challenge?

There is a version of it on dub.

http://code.dlang.org/packages/judy