C library for Patricia trie storage. The library provides an API to create and use dynamic compact Patricia tries for arbitrary data. Keys may be of variable length. Data may be stored and retrieved by reference only. Supports in-order retrieval and best-match prefix searches with foreach closure semantics. Requires C99, no dependencies, platform independent. Work in progress. BSD style license.
Commercial Use
Modify
Distribute
Place Warranty
Hold Liable
Use Trademarks
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.