3 |
use warnings; |
use warnings; |
4 |
use strict; |
use strict; |
5 |
|
|
6 |
|
use blib; |
7 |
|
|
8 |
use WebPAC::Common; |
use WebPAC::Common; |
9 |
use base qw/WebPAC::Common/; |
use base qw/WebPAC::Common/; |
10 |
use Text::Iconv; |
use Text::Iconv; |
16 |
|
|
17 |
=head1 VERSION |
=head1 VERSION |
18 |
|
|
19 |
Version 0.03 |
Version 0.05 |
20 |
|
|
21 |
=cut |
=cut |
22 |
|
|
23 |
our $VERSION = '0.03'; |
our $VERSION = '0.05'; |
24 |
|
|
25 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
26 |
|
|
49 |
); |
); |
50 |
|
|
51 |
$db->open('/path/to/database'); |
$db->open('/path/to/database'); |
52 |
print "database size: ",$db->size,"\n"; |
print "database size: ",$db->size,"\n"; |
53 |
while (my $rec = $db->fetch) { |
while (my $rec = $db->fetch) { |
54 |
} |
# do something with $rec |
55 |
|
} |
56 |
|
|
57 |
|
|
58 |
|
|
66 |
module => 'WebPAC::Input::MARC', |
module => 'WebPAC::Input::MARC', |
67 |
code_page => 'ISO-8859-2', |
code_page => 'ISO-8859-2', |
68 |
low_mem => 1, |
low_mem => 1, |
69 |
|
recode => 'char pairs', |
70 |
|
no_progress_bar => 1, |
71 |
); |
); |
72 |
|
|
73 |
C<module> is low-level file format module. See L<WebPAC::Input::Isis> and |
C<module> is low-level file format module. See L<WebPAC::Input::Isis> and |
79 |
|
|
80 |
Default is not to use C<low_mem> options (see L<MEMORY USAGE> below). |
Default is not to use C<low_mem> options (see L<MEMORY USAGE> below). |
81 |
|
|
82 |
|
C<recode> is optional string constisting of character or words pairs that |
83 |
|
should be replaced in input stream. |
84 |
|
|
85 |
|
C<no_progress_bar> disables progress bar output on C<STDOUT> |
86 |
|
|
87 |
This function will also call low-level C<init> if it exists with same |
This function will also call low-level C<init> if it exists with same |
88 |
parametars. |
parametars. |
89 |
|
|
162 |
limit => 500, |
limit => 500, |
163 |
offset => 6000, |
offset => 6000, |
164 |
lookup => $lookup_obj, |
lookup => $lookup_obj, |
165 |
|
stats => 1, |
166 |
); |
); |
167 |
|
|
168 |
By default, C<code_page> is assumed to be C<852>. |
By default, C<code_page> is assumed to be C<852>. |
171 |
|
|
172 |
C<limit> is optional parametar to read just C<limit> records from database |
C<limit> is optional parametar to read just C<limit> records from database |
173 |
|
|
174 |
|
C<stats> create optional report about usage of fields and subfields |
175 |
|
|
176 |
Returns size of database, regardless of C<offset> and C<limit> |
Returns size of database, regardless of C<offset> and C<limit> |
177 |
parametars, see also C<size>. |
parametars, see also C<size>. |
178 |
|
|
196 |
# create Text::Iconv object |
# create Text::Iconv object |
197 |
$self->{iconv} = Text::Iconv->new($code_page,$self->{'code_page'}); |
$self->{iconv} = Text::Iconv->new($code_page,$self->{'code_page'}); |
198 |
|
|
199 |
|
my $filter_ref; |
200 |
|
|
201 |
|
if ($self->{recode}) { |
202 |
|
my @r = split(/\s/, $self->{recode}); |
203 |
|
if ($#r % 2 != 1) { |
204 |
|
$log->logwarn("recode needs even number of elements (some number of valid pairs)"); |
205 |
|
} else { |
206 |
|
my $recode; |
207 |
|
while (@r) { |
208 |
|
my $from = shift @r; |
209 |
|
my $to = shift @r; |
210 |
|
$recode->{$from} = $to; |
211 |
|
} |
212 |
|
|
213 |
|
my $regex = join '|' => keys %{ $recode }; |
214 |
|
|
215 |
|
$log->debug("using recode regex: $regex"); |
216 |
|
|
217 |
|
$filter_ref = sub { |
218 |
|
my $t = shift; |
219 |
|
$t =~ s/($regex)/$recode->{$1}/g; |
220 |
|
return $t; |
221 |
|
}; |
222 |
|
|
223 |
|
} |
224 |
|
|
225 |
|
} |
226 |
|
|
227 |
my ($db, $size) = $self->{open_db}->( $self, |
my ($db, $size) = $self->{open_db}->( $self, |
228 |
path => $arg->{path}, |
path => $arg->{path}, |
229 |
|
filter => $filter_ref, |
230 |
); |
); |
231 |
|
|
232 |
unless ($db) { |
unless (defined($db)) { |
233 |
$log->logwarn("can't open database $arg->{path}, skipping..."); |
$log->logwarn("can't open database $arg->{path}, skipping..."); |
234 |
return; |
return; |
235 |
} |
} |
258 |
# store size for later |
# store size for later |
259 |
$self->{size} = ($to_rec - $from_rec) ? ($to_rec - $from_rec + 1) : 0; |
$self->{size} = ($to_rec - $from_rec) ? ($to_rec - $from_rec + 1) : 0; |
260 |
|
|
261 |
$log->info("processing $self->{size}/$size records [$from_rec-$to_rec] convert $code_page -> $self->{code_page}"); |
$log->info("processing $self->{size}/$size records [$from_rec-$to_rec] convert $code_page -> $self->{code_page}", $self->{stats} ? ' [stats]' : ''); |
262 |
|
|
263 |
# read database |
# read database |
264 |
for (my $pos = $from_rec; $pos <= $to_rec; $pos++) { |
for (my $pos = $from_rec; $pos <= $to_rec; $pos++) { |
284 |
# create lookup |
# create lookup |
285 |
$self->{'lookup'}->add( $rec ) if ($rec && $self->{'lookup'}); |
$self->{'lookup'}->add( $rec ) if ($rec && $self->{'lookup'}); |
286 |
|
|
287 |
$self->progress_bar($pos,$to_rec); |
# update counters for statistics |
288 |
|
if ($self->{stats}) { |
289 |
|
map { |
290 |
|
my $fld = $_; |
291 |
|
$self->{_stats}->{fld}->{ $fld }++; |
292 |
|
if (ref($rec->{ $fld }) eq 'ARRAY') { |
293 |
|
map { |
294 |
|
if (ref($_) eq 'HASH') { |
295 |
|
map { |
296 |
|
$self->{_stats}->{sf}->{ $fld }->{ $_ }++; |
297 |
|
} keys %{ $_ }; |
298 |
|
} else { |
299 |
|
$self->{_stats}->{repeatable}->{ $fld }++; |
300 |
|
} |
301 |
|
} @{ $rec->{$fld} }; |
302 |
|
} |
303 |
|
} keys %{ $rec }; |
304 |
|
} |
305 |
|
|
306 |
|
$self->progress_bar($pos,$to_rec) unless ($self->{no_progress_bar}); |
307 |
|
|
308 |
} |
} |
309 |
|
|
349 |
return; |
return; |
350 |
} |
} |
351 |
|
|
352 |
$self->progress_bar($mfn,$self->{max_pos}); |
$self->progress_bar($mfn,$self->{max_pos}) unless ($self->{no_progress_bar}); |
353 |
|
|
354 |
my $rec; |
my $rec; |
355 |
|
|
424 |
return $self->{pos} = (($pos - 1) || -1); |
return $self->{pos} = (($pos - 1) || -1); |
425 |
} |
} |
426 |
|
|
427 |
|
=head2 stats |
428 |
|
|
429 |
|
Dump statistics about field and subfield usage |
430 |
|
|
431 |
|
print $input->stats; |
432 |
|
|
433 |
|
=cut |
434 |
|
|
435 |
|
sub stats { |
436 |
|
my $self = shift; |
437 |
|
|
438 |
|
my $log = $self->_get_logger(); |
439 |
|
|
440 |
|
my $s = $self->{_stats}; |
441 |
|
if (! $s) { |
442 |
|
$log->warn("called stats, but there is no statistics collected"); |
443 |
|
return; |
444 |
|
} |
445 |
|
|
446 |
|
my $max_fld = 0; |
447 |
|
|
448 |
|
my $out = join("\n", |
449 |
|
map { |
450 |
|
my $f = $_ || die "no field"; |
451 |
|
my $v = $s->{fld}->{$f} || die "no s->{fld}->{$f}"; |
452 |
|
$max_fld = $v if ($v > $max_fld); |
453 |
|
|
454 |
|
my $o = sprintf("%4d %d ~", $f, $v); |
455 |
|
|
456 |
|
if (defined($s->{sf}->{$f})) { |
457 |
|
map { |
458 |
|
$o .= sprintf(" %s:%d", $_, $s->{sf}->{$f}->{$_}); |
459 |
|
} sort keys %{ $s->{sf}->{$f} }; |
460 |
|
} |
461 |
|
|
462 |
|
if (my $v_r = $s->{repeatable}->{$f}) { |
463 |
|
$o .= " ($v_r)" if ($v_r != $v); |
464 |
|
} |
465 |
|
|
466 |
|
$o; |
467 |
|
} sort { $a <=> $b } keys %{ $s->{fld} } |
468 |
|
); |
469 |
|
|
470 |
|
$log->debug( sub { Dumper($s) } ); |
471 |
|
|
472 |
|
return $out; |
473 |
|
} |
474 |
|
|
475 |
=head1 MEMORY USAGE |
=head1 MEMORY USAGE |
476 |
|
|