Project Summary
B+ trees are balanced trees which provide an ordered map from keys to values. They are useful for indexing large bodies of data. They are similar to 2-3-4 Trees and Red-Black Trees. This implementation supports B+ trees using an arbitrary n value.
This is a Perl implementation of this data structure.
In a Nutshell, Tree::BPTree...
Quick Reference
Artistic License 2.0
Permitted
Commercial Use
Sub-License
Modify
Distribute
Private Use
Forbidden
Use Trademarks
Hold Liable
Required
Include Install Instructions
Rename
Include Copyright
State Changes
These details are provided for information only. No information here is legal advice and should not be used as such.
GNU General Public License v2.0 or later
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Sub-License
Hold Liable
Required
Include Copyright
Include License
Distribute Original
Disclose Source
State Changes
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...
-
...
Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
-
...
anyone with an Open Hub account can update a project's tags
-
...
use of OSS increased in 65% of companies in 2016
-
...
compare projects before you chose one to use