Algorithm-Huffman
view release on metacpan or search on metacpan
our $VERSION = '0.09';
use Heap::Fibonacci;
use Tree::DAG_Node;
use List::Util qw/max min first/;
sub new {
my ($proto, $count_hash) = @_;
my $class = ref($proto) || $proto;
__validate_counting_hash($count_hash);
my $heap = Heap::Fibonacci->new;
my $size = 0;
while (my ($str, $count) = each %$count_hash) {
croak "The count for each character/substring must be a number"
unless $count =~ /^(-)?\d+(\.\d+)?$/;
croak "The count for each character/substring must be positive (>= 0)," .
"but found counting '$count' for the string '$str'"
unless $count >= 0;
my $leaf = Tree::DAG_Node->new({name => $str});
last;
}
}
defined $decode
or die "Unknown bit sequence starting at offset $last_offset_ok in the bitstring";
}
return $string;
}
sub __validate_counting_hash {
my $c = shift;
my $error_msg = undef;
defined $c
or croak "Undefined counting hash";
ref($c) eq 'HASH'
or croak "The argument for the counting hash is not a hash reference, as expected";
scalar(keys %$c) >= 2
or croak "The counting hash must have at least 2 keys";
}
( run in 0.493 second using v1.01-cache-2.11-cpan-a5abf4f5562 )