Genezzo::Index::bt2 Genezzo::Index::bt2 is a basic btree built of row directory blocks.
Download

Genezzo::Index::bt2 Ranking & Summary

Genezzo::Index::bt2 Tags

Perl module btree built directory blocks btree built

Genezzo::Index::bt2 Description

Genezzo::Index::bt2 is a basic btree built of row directory blocks. Genezzo::Index::bt2 is a basic btree built of row directory blocks.construct comparison/equality callbacks my $cmp1 = sub { my ($k1, $k2) = @_; # NOTE: use "spaceship" (-1,0,1) comparison with # short-circuit OR (which returns 0 or VALUE, not 0 or 1) # to perform multi-column key comparison # a la Schwartzian Transform return ( ( ($k1-> $k2->) || ($k1-> $k2->)) == -1 ); }; my $eq1 = sub { my ($k1, $k2) = @_; return (($k1-> == $k2->) && ($k1-> == $k2->) ); };SYNOPSIS use Genezzo::Index::bt?; my $tt = Genezzo::Index::btree->new(); $tt->insert(1, "hi"); $tt->insert(7, "there");This btree algorithm is a bottom-up implementation based upon ideas from Chapter 16 of "Algorithms in C++ (third edition)", by Robert Sedgewick, 1998 and Chapter 15, "Access Paths", of "Transaction Processing: Concepts and Techniques" by Jim Gray and Andreas Reuter, 1993. The pedagogical examples use a fixed number of entries per node, or fixed-size keys in each block, but this implementation has significant extensions to support variable numbers of variably-sized keys in fixed-size disk blocks, with the associated error handling, plus support for reverse scans.Requirements:· Perl Requirements: · Perl

Genezzo::Index::bt2 Related Software