github
Advanced Search
  • Home
  • Pricing and Signup
  • Explore GitHub
  • Blog
  • Login

agl / critbit

  • Admin
  • Watch Unwatch
  • Fork
  • Your Fork
  • Pull Request
  • Download Source
    • 9
    • 0
  • Source
  • Commits
  • Network (0)
  • Issues (0)
  • Downloads (0)
  • Wiki (1)
  • Graphs
  • Branch: master

click here to add a description

click here to add a homepage

  • Branches (1)
    • master ✓
  • Tags (0)
Sending Request…
Enable Donations

Pledgie Donations

Once activated, we'll place the following badge in your repository's detail box:
Pledgie_example
This service is courtesy of Pledgie.

Critbit trees in C — Read more

  cancel

  cancel
  • Private
  • Read-Only
  • HTTP Read-Only

This URL has Read+Write access

Missed critbit.h (thanks to sfossen for the heads up) 
agl (author)
Tue Sep 30 08:32:51 -0700 2008
commit  7f2e381c94863f7ef56013a1610f4c6fd45a3eda
tree    32d5ab0e9622b9797ca137b6d7e29051d1b3788b
parent  4d2e259d7a62a2e951ccb68d246da7b29df385f1
critbit /
name age
history
message
file Makefile Loading commit data...
file README
file critbit-test.cc
file critbit.c
file critbit.h
file critbit.pdf
file critbit.w
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.
Blog | Support | Training | Contact | API | Status | Twitter | Help | Security
© 2010 GitHub Inc. All rights reserved. | Terms of Service | Privacy Policy
Powered by the Dedicated Servers and
Cloud Computing of Rackspace Hosting®
Dedicated Server