3
I Use This!
Inactive
Analyzed 13 days ago. based on code collected 13 days ago.

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

Tags

critbittree java patricia radixtree tree trie

In a Nutshell, patricia-trie...

Apache License 2.0
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Private Use

Use Patent Claims

Sub-License

Forbidden

Use Trademarks

Hold Liable

Required

Include Copyright

Include License

State Changes

Include Notice

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    compare projects before you chose one to use
  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    you can embed statistics from Open Hub on your site

Languages

Languages?height=75&width=75
Java
99%
XML
1%

30 Day Summary

Dec 10 2018 — Jan 9 2019

12 Month Summary

Jan 9 2018 — Jan 9 2019

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!