Project Summary
PATRICIA Trie
Practical Algorithm to Retrieve Information Coded in Alphanumeric
"A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data structure based on the trie that is used to store a set of strings. In contrast with a regular trie, the edges of a Patricia trie are labelled with sequences of characters rather than with single characters. These can be strings of characters, bit strings such as integers or IP addresses, or generally arbitrary sequences of objects in lexicographical order. Sometimes the names radix tree and crit bit tree are only applied to trees storing integers and Patricia trie is retained for more general inputs, but the structure works the same way in all cases." -- Wikipedia
In a Nutshell, patricia-trie...
- ...
- ...
- ...
-
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in November, 2010
ending with its most recent commit almost 10 years ago
Quick Reference
Apache License 2.0
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Sub-License
Private Use
Use Patent Claims
Forbidden
Hold Liable
Use Trademarks
Required
Include Copyright
State Changes
Include License
Include Notice
These details are provided for information only. No information here is legal advice and should not be used as such.
Project Security
Vulnerabilities per Version ( last 10 releases )
There are no reported vulnerabilities
Project Vulnerability Report
Security Confidence Index
Vulnerability Exposure Index
Did You Know...
-
...
55% of companies leverage OSS for production infrastructure
-
...
by exploring contributors within projects, you can view details on every commit they have made to that project
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
data presented on the Open Hub is available through our API
30 Day SummaryMar 20 2024 — Apr 19 2024
|
12 Month SummaryApr 19 2023 — Apr 19 2024
|
