Tree-BPTree

Changes for version 1.02

Added benchmark.pl to compare speed to hashes and lists (results are attrocious.
Corrected typos in the Changes file.
Added a line to Makefile.PL to prevent *.pl files from being installed.
Updated documentation to reflect poor benchmarks.
Added the reverse() method to perform an action similar to the Perl reverse operator.
Added the new_cursor() method and altered the way each() works to allow for multiple simultaneous iterators.
Added a missing pairs() method.
Altered keys(), values(), and flattened_values() to use the new each() method with a cursor.
Added t/cursors.t to test simultaneous cursors.
Added t/reverse.t to test reverse().
Added t/reverse_find.t to test find() after a reverse() has taken place--since this updates the -keycmp subroutine.

Perl implementation of B+ trees

in BPTree.pm

in BPTree.pm

in BPTree.pm

To install Tree::BPTree, copy and paste the appropriate command in to your terminal.

cpanm Tree::BPTree

perl -MCPAN -e shell
install Tree::BPTree

For more information on module installation, please visit the detailed CPAN module installation guide.

	Global
`s`	Focus search bar
`?`	Bring up this help dialog

	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)

	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)