45 |
|
|
46 |
use lib 'lib'; |
use lib 'lib'; |
47 |
use Sack::Digest; |
use Sack::Digest; |
48 |
our $digest_opened = 0; |
sub undigest { |
|
sub unshard { |
|
49 |
my ( $o, $v ) = @_; |
my ( $o, $v ) = @_; |
50 |
return $v unless $o->{path}->[0] =~ m{#}; |
my $k = $o->{path}->[0] || return $v; |
51 |
$digest_opened ||= Sack::Digest->open(0); |
return $v unless $k =~ m{#}; |
52 |
# warn "### ",$o->{path}->[0], " $v\n"; |
# warn "## $k = $v\n"; |
53 |
Sack::Digest->from_int($v); |
Sack::Digest->undigest_node_k_v(0, $k, $v); |
54 |
} |
} |
55 |
|
|
56 |
sub new { |
sub new { |
363 |
foreach my $ky (sort keys %$data) { |
foreach my $ky (sort keys %$data) { |
364 |
my $tt=scalar($data->{$ky}); |
my $tt=scalar($data->{$ky}); |
365 |
$tt=substr($tt, 0, $textlimit).'...' if (($textlimit) && (length($tt)>$textlimit)); |
$tt=substr($tt, 0, $textlimit).'...' if (($textlimit) && (length($tt)>$textlimit)); |
366 |
print ' ', $o->unshard($ky), ' => ', $tt, "\n"; |
print ' ', $o->undigest($ky), ' => ', $tt, "\n"; |
367 |
} continue { |
} continue { |
368 |
$i++; |
$i++; |
369 |
} |
} |