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
Modify
Distribute
Sub-License
Private Use
Forbidden
Hold Liable
Use Trademarks
Required
Include Copyright
State Changes
Include Install Instructions
Rename
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
Distribute Original
Disclose Source
Include Copyright
State Changes
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...
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
search using multiple tags to find exactly what you need
-
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog