Tie::SubstrHash - Fixed-table-size, fixed-key-length hashing
tie %myhash, 'Tie::SubstrHash', $key_len, $value_len, $table_size;
The B<Tie::SubstrHash> package provides a hash-table-like interface to
an array of determinate size, with constant key size and record size.
Upon tying a new hash to this package, the developer must specify the
size of the keys that will be used, the size of the value fields that the
keys will index, and the size of the overall table (in terms of key-value
pairs, not size in hard memory). I<These values will not change for the
duration of the tied hash>. The newly-allocated hash table may now have
data stored and retrieved. Efforts to store more than C<$table_size>
elements will result in a fatal error, as will efforts to store a value
not exactly C<$value_len> characters in length, or reference through a
key not exactly C<$key_len> characters in length. While these constraints
may seem excessive, the result is a hash table using much less internal
memory than an equivalent freely-allocated hash table.
Because the current implementation uses the table and key sizes for the
hashing algorithm, there is no means by which to dynamically change the
value of any of the initialization parameters.
The hash does not support exists().
my ($klen, $vlen, $tsize) = @_;
my $rlen = 1 + $klen + $vlen;
findgteprime
($tsize * 1.1)]; # Allow 10% empty.
local $self = bless ["\0", $klen, $vlen, $tsize, $rlen, 0, -1];
$$self[0] x
= $rlen * $tsize->[1];
$$self[0] = "\0" x
($$self[4] * $$self[3]->[1]);
local($klen, $vlen, $tsize, $rlen) = @
$self[1..4];
$record = substr($$self[0], $offset, $rlen);
elsif (ord($record) == 1) {
elsif (substr($record, 1, $klen) eq $key) {
return substr($record, 1+$klen, $vlen);
local($self,$key,$val) = @_;
local($klen, $vlen, $tsize, $rlen) = @
$self[1..4];
croak
("Table is full ($tsize->[0] elements)") if $$self[5] > $tsize->[0];
croak
(qq/Value "$val" is not $vlen characters long/)
if length($val) != $vlen;
$record = substr($$self[0], $offset, $rlen);
$record = "\2". $key . $val;
die "panic" unless length($record) == $rlen;
$writeoffset = $offset unless defined $writeoffset;
substr($$self[0], $writeoffset, $rlen) = $record;
elsif (ord($record) == 1) {
$writeoffset = $offset unless defined $writeoffset;
elsif (substr($record, 1, $klen) eq $key) {
$record = "\2". $key . $val;
die "panic" unless length($record) == $rlen;
substr($$self[0], $offset, $rlen) = $record;
local($klen, $vlen, $tsize, $rlen) = @
$self[1..4];
$record = substr($$self[0], $offset, $rlen);
elsif (ord($record) == 1) {
elsif (substr($record, 1, $klen) eq $key) {
substr($$self[0], $offset, 1) = "\1";
return substr($record, 1+$klen, $vlen);
local($klen, $vlen, $tsize, $rlen, $entries, $iterix) = @
$self[1..6];
for (++$iterix; $iterix < $tsize->[1]; ++$iterix) {
next unless substr($$self[0], $iterix * $rlen, 1) eq "\2";
return substr($$self[0], $iterix * $rlen + 1, $klen);
croak
"Tie::SubstrHash does not support exists()";
croak
(qq/Key "$key" is not $klen characters long/)
if length($key) != $klen;
for (unpack('C*', $key)) {
&_hashwrap
if $hash >= 1e13
;
&_hashwrap
if $hash >= $tsize->[1];
$hash -= int($hash / $tsize->[1]) * $tsize->[1];
$hash -= $tsize->[1] if $hash >= $tsize->[1];
# using POSIX::ceil() would be too heavy, and not all platforms have it.
$num = int($num + 1) unless $num == int $num;
# http://www-groups.dcs.st-andrews.ac.uk/~history/HistTopics/Prime_numbers.html
sub findgteprime
{ # find the smallest prime integer greater than or equal to
my $sqrtnum = int sqrt $num;
my $sqrtnumsquared = $sqrtnum * $sqrtnum;
if ($sqrtnumsquared < $num) {
$sqrtnumsquared = $sqrtnum * $sqrtnum;
for ($i = 3; $i <= $sqrtnum; $i += 2) {
next NUM
unless $num % $i;