Critbit trees in C
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Makefile Initial import of the source files Sep 29, 2008
README Fix typo: "PATRICA" -> "PATRICIA". Jul 13, 2012
critbit-test.cc Fix typos Sep 29, 2008
critbit.c Use a faster "SWAR" algorithm to find MSB. Apr 17, 2012
critbit.h
critbit.pdf Use a faster "SWAR" algorithm to find MSB. Apr 17, 2012
critbit.w Use a faster "SWAR" algorithm to find MSB. Apr 17, 2012

README

This code is taken from Dan Bernstein's qhasm and implements a binary
crit-bit (alsa known as PATRICIA) tree for |NUL| terminated strings. Crit-bit
trees are underused and it's this author's hope that a good example will aid
their adoption.

Herein is the CWEB source (critbit.w) and the derived files (critbit.pdf and
critbit.c) for those who don't wish to install CWEB and/or TeX.

If in doubt, read the PDF file.