Project Summary
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.
In a Nutshell, Patricialib...
Quick Reference
http://bitbucket.org/trijezdci/p...
BSD 4-clause (University of California-Specific)
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Hold Liable
Use Trademarks
Required
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
you can embed statistics from Open Hub on your site
-
...
55% of companies leverage OSS for production infrastructure
-
...
learn about Open Hub updates and features on the Open Hub blog