Rabbit Tree: radix bit tries for implementing maps and sets in C

view story

https://bbs.archlinux.org – Project page: http://xyne.archlinux.ca/projects/rabbit_tree/Documentation:  http://xyne.archlinux.ca/projects/rabbi … /index.htmLong story short: I wanted dictionaries and sets in C, so I rolled my own. At first I started to look at the various implementations (red-black trees, etc) but the idea of radix bit tries just popped into my head and before I knew it I was coding (that's the way it usually goes for me... programmer's limbo and all that).Here's a snippet from the output example of the project page, showing the internal binary structure (i.e. each "0" and (HowTos)