A highly compressed radix tree heavily based on the Adaptive Radix Tree (paper)

• very portable - clean C89 implementation
• designed as a primary indexing data structure - the paper above describes a secondary index that doesn't fully own its keys
• non recursive update algorithms