NAME Tree::BPTree - Perl implementation of B+ trees SYNOPSIS use Tree::BPTree; # These arguments are actually the defaults my $tree = new Tree::BPTree( -n => 3, -unique => 0, -keycmp => sub { $_[0] cmp $_[1] }, -valuecmp => sub { $_[0] <=> $_[1] }, ); # index the entries in this string: my $string = "THERE'S MORE THAN ONE WAY TO DO IT"; # TMTOWTDI my $i = 0; $tree->insert($_, $i++) foreach (split