News for hackers. Stuff that matters.
Re:Crit-bit Trees: the best way to store sets by dchest on Monday September 19, 2011 @06:50PM (#3015530)
agl's C translation written in literate programming style:

PDF: https://github.com/agl/critbit/blob/master/critbit.pdf

Repo: https://github.com/agl/critbit

Re:Crit-bit Trees: the best way to store sets by bumbledraven on Tuesday September 20, 2011 @10:17AM (#3017621)
According to the paper, this code was actually extracted directly from qhasm, which djb released in 2006. This is notable because any code becomes more worthy of admiration once we know it was written by djb. As Mark-Jason Dominus used to say, "I'd drink poisoned cool-aid as long as djb told me he'd made it himself."
Re:Crit-bit Trees: the best way to store sets by dchest on Tuesday September 20, 2011 @12:48PM (#3018334)
Thanks for clarification, you're right. I thought it was translated from qhasm to C.
Re:Crit-bit Trees: the best way to store sets by pyre on Monday September 19, 2011 @07:00PM (#3015565)
Does 'literate programming style' require the lack of indentation in his source file?
Re:Crit-bit Trees: the best way to store sets by DavidHull on Monday September 19, 2011 @07:05PM (#3015579)
The source file is critbit.w. See <http://en.wikipedia.org/wiki/Literate_programming>.
Re:Crit-bit Trees: the best way to store sets by dchest on Monday September 19, 2011 @07:03PM (#3015571)
Not sure, maybe that's how CWEB outputs it. Read PDF instead, it has the properly indented code :-)