The BLT library implements crit-bit trees. After seeing Adam Langley’s library, I was inspired to rewrite my old crit-bit tree code.

I highly recommend linking with tcmalloc.

I’m hoping to find time to add support for trees where each key is the same length, and also trees where the keys can contain zero bytes, at which point I can replace my old library in various pet projects.

See blt.h for usage.

See COPYING for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA