This repository is private.
All pages are served over SSL and all pushing and pulling is done over SSH.
No one may fork, clone, or view it unless they are added as a member.
Every repository with this icon (
) is private.
Every repository with this icon (
This repository is public.
Anyone may fork, clone, or view it.
Every repository with this icon (
) is public.
Every repository with this icon (
critbit /
| name | age | message | |
|---|---|---|---|
| |
Makefile | Mon Sep 29 09:37:22 -0700 2008 | |
| |
README | Mon Sep 29 09:40:26 -0700 2008 | |
| |
critbit-test.cc | Mon Sep 29 09:44:35 -0700 2008 | |
| |
critbit.c | Mon Sep 29 09:37:46 -0700 2008 | |
| |
critbit.h | Tue Sep 30 08:32:51 -0700 2008 | |
| |
critbit.pdf | Mon Sep 29 09:44:35 -0700 2008 | |
| |
critbit.w | Mon Sep 29 09:44:35 -0700 2008 |
README
This code is taken from Dan Bernstein's qhasm and implements a binary crit-bit (alsa known as PATRICA) 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.







