3 |
@EXPORT = qw/ |
@EXPORT = qw/ |
4 |
_set_rec _set_lookup |
_set_rec _set_lookup |
5 |
_get_ds _clean_ds |
_get_ds _clean_ds |
6 |
|
_debug |
7 |
|
|
8 |
tag search display |
tag search display |
9 |
marc marc_indicators marc_repeatable_subfield |
marc marc_indicators marc_repeatable_subfield |
10 |
|
marc_compose |
11 |
|
|
12 |
rec1 rec2 rec |
rec1 rec2 rec |
13 |
regex prefix suffix surround |
regex prefix suffix surround |
14 |
first lookup join_with |
first lookup join_with |
15 |
|
|
16 |
|
split_rec_on |
17 |
/; |
/; |
18 |
|
|
19 |
use warnings; |
use warnings; |
20 |
use strict; |
use strict; |
21 |
|
|
22 |
#use base qw/WebPAC::Common/; |
#use base qw/WebPAC::Common/; |
23 |
use Data::Dumper; |
use Data::Dump qw/dump/; |
24 |
use Encode qw/from_to/; |
use Encode qw/from_to/; |
25 |
|
|
26 |
|
# debugging warn(s) |
27 |
|
my $debug = 0; |
28 |
|
|
29 |
|
|
30 |
=head1 NAME |
=head1 NAME |
31 |
|
|
32 |
WebPAC::Normalize - describe normalisaton rules using sets |
WebPAC::Normalize - describe normalisaton rules using sets |
33 |
|
|
34 |
=head1 VERSION |
=head1 VERSION |
35 |
|
|
36 |
Version 0.06 |
Version 0.08 |
37 |
|
|
38 |
=cut |
=cut |
39 |
|
|
40 |
our $VERSION = '0.06'; |
our $VERSION = '0.08'; |
41 |
|
|
42 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
43 |
|
|
133 |
|
|
134 |
sub _clean_ds { |
sub _clean_ds { |
135 |
my $a = {@_}; |
my $a = {@_}; |
136 |
($out,$marc_record, $marc_encoding, $marc_repeatable_subfield, $marc_indicators) = (undef); |
($out,$marc_record, $marc_encoding, $marc_repeatable_subfield, $marc_indicators) = (); |
137 |
$marc_encoding = $a->{marc_encoding}; |
$marc_encoding = $a->{marc_encoding}; |
138 |
} |
} |
139 |
|
|
157 |
|
|
158 |
$marc->add_fields( WebPAC::Normalize:_get_marc_fields() ); |
$marc->add_fields( WebPAC::Normalize:_get_marc_fields() ); |
159 |
|
|
|
|
|
|
|
|
160 |
We are using I<magic> which detect repeatable fields only from |
We are using I<magic> which detect repeatable fields only from |
161 |
sequence of field/subfield data generated by normalization. |
sequence of field/subfield data generated by normalization. |
162 |
|
|
163 |
Repeatable field is created if there is second occurence of same subfield or |
Repeatable field is created when there is second occurence of same subfield or |
164 |
if any of indicators are different. This is sane for most cases except for |
if any of indicators are different. |
165 |
non-repeatable fields with repeatable subfields. |
|
166 |
|
This is sane for most cases. Something like: |
167 |
|
|
168 |
|
900a-1 900b-1 900c-1 |
169 |
|
900a-2 900b-2 |
170 |
|
900a-3 |
171 |
|
|
172 |
|
will be created from any combination of: |
173 |
|
|
174 |
|
900a-1 900a-2 900a-3 900b-1 900b-2 900c-1 |
175 |
|
|
176 |
You can change behaviour of that using C<marc_repeatable_subfield>. |
and following rules: |
177 |
|
|
178 |
|
marc('900','a', rec('200','a') ); |
179 |
|
marc('900','b', rec('200','b') ); |
180 |
|
marc('900','c', rec('200','c') ); |
181 |
|
|
182 |
|
which might not be what you have in mind. If you need repeatable subfield, |
183 |
|
define it using C<marc_repeatable_subfield> like this: |
184 |
|
|
185 |
|
.... |
186 |
|
|
187 |
=cut |
=cut |
188 |
|
|
189 |
sub _get_marc_fields { |
sub _get_marc_fields { |
190 |
|
|
191 |
|
return if (! $marc_record || ref($marc_record) ne 'ARRAY' || $#{ $marc_record } < 0); |
192 |
|
|
193 |
|
# first, sort all existing fields |
194 |
|
# XXX might not be needed, but modern perl might randomize elements in hash |
195 |
|
my @sorted_marc_record = sort { |
196 |
|
$a->[0] . $a->[3] cmp $b->[0] . $b->[3] |
197 |
|
} @{ $marc_record }; |
198 |
|
|
199 |
|
@sorted_marc_record = @{ $marc_record }; ### FIXME disable sorting |
200 |
|
|
201 |
|
# output marc fields |
202 |
my @m; |
my @m; |
203 |
my $last; |
|
204 |
foreach my $row (@{ $marc_record }) { |
# count unique field-subfields (used for offset when walking to next subfield) |
205 |
if ($last && |
my $u; |
206 |
$last->[0] eq $row->[0] && # check if field is same |
map { $u->{ $_->[0] . $_->[3] }++ } @sorted_marc_record; |
207 |
$last->[1] eq $row->[1] && # check for i1 |
|
208 |
$last->[2] eq $row->[2] && # and for i2 |
if ($debug) { |
209 |
( $last->[3] ne $row->[3] || # and subfield is different |
warn "## marc_repeatable_subfield ", dump( $marc_repeatable_subfield ), $/; |
210 |
$last->[3] eq $row->[3] && # or subfield is same, |
warn "## marc_record ", dump( $marc_record ), $/; |
211 |
$marc_repeatable_subfield->{ $row->[3] } # but is repeatable |
warn "## sorted_marc_record ", dump( \@sorted_marc_record ), $/; |
212 |
) |
warn "## subfield count ", dump( $u ), $/; |
213 |
) { |
} |
214 |
push @$last, ( $row->[3] , $row->[4] ); |
|
215 |
next; |
my $len = $#sorted_marc_record; |
216 |
} elsif ($last) { |
my $visited; |
217 |
push @m, $last; |
my $i = 0; |
218 |
|
my $field; |
219 |
|
|
220 |
|
foreach ( 0 .. $len ) { |
221 |
|
|
222 |
|
# find next element which isn't visited |
223 |
|
while ($visited->{$i}) { |
224 |
|
$i = ($i + 1) % ($len + 1); |
225 |
|
} |
226 |
|
|
227 |
|
# mark it visited |
228 |
|
$visited->{$i}++; |
229 |
|
|
230 |
|
my $row = $sorted_marc_record[$i]; |
231 |
|
|
232 |
|
# field and subfield which is key for |
233 |
|
# marc_repeatable_subfield and u |
234 |
|
my $fsf = $row->[0] . $row->[3]; |
235 |
|
|
236 |
|
if ($debug > 1) { |
237 |
|
|
238 |
|
print "### field so far [", $#$field, "] : ", dump( $field ), " ", $field ? 'T' : 'F', $/; |
239 |
|
print "### this [$i]: ", dump( $row ),$/; |
240 |
|
print "### sf: ", $row->[3], " vs ", $field->[3], |
241 |
|
$marc_repeatable_subfield->{ $row->[0] . $row->[3] } ? ' (repeatable)' : '', $/, |
242 |
|
if ($#$field >= 0); |
243 |
|
|
244 |
|
} |
245 |
|
|
246 |
|
# if field exists |
247 |
|
if ( $#$field >= 0 ) { |
248 |
|
if ( |
249 |
|
$row->[0] ne $field->[0] || # field |
250 |
|
$row->[1] ne $field->[1] || # i1 |
251 |
|
$row->[2] ne $field->[2] # i2 |
252 |
|
) { |
253 |
|
push @m, $field; |
254 |
|
warn "## saved/1 ", dump( $field ),$/ if ($debug); |
255 |
|
$field = $row; |
256 |
|
|
257 |
|
} elsif ( |
258 |
|
( $row->[3] lt $field->[-2] ) # subfield which is not next (e.g. a after c) |
259 |
|
|| |
260 |
|
( $row->[3] eq $field->[-2] && # same subfield, but not repeatable |
261 |
|
! $marc_repeatable_subfield->{ $fsf } |
262 |
|
) |
263 |
|
) { |
264 |
|
push @m, $field; |
265 |
|
warn "## saved/2 ", dump( $field ),$/ if ($debug); |
266 |
|
$field = $row; |
267 |
|
|
268 |
|
} else { |
269 |
|
# append new subfields to existing field |
270 |
|
push @$field, ( $row->[3], $row->[4] ); |
271 |
|
} |
272 |
|
} else { |
273 |
|
# insert first field |
274 |
|
$field = $row; |
275 |
} |
} |
276 |
|
|
277 |
$last = $row; |
if (! $marc_repeatable_subfield->{ $fsf }) { |
278 |
|
# make step to next subfield |
279 |
|
$i = ($i + $u->{ $fsf } ) % ($len + 1); |
280 |
|
} |
281 |
} |
} |
282 |
|
|
283 |
push @m, $last if ($last); |
if ($#$field >= 0) { |
284 |
|
push @m, $field; |
285 |
|
warn "## saved/3 ", dump( $field ),$/ if ($debug); |
286 |
|
} |
287 |
|
|
288 |
return @m; |
return @m; |
289 |
} |
} |
290 |
|
|
291 |
|
=head2 _debug |
292 |
|
|
293 |
|
Change level of debug warnings |
294 |
|
|
295 |
|
_debug( 2 ); |
296 |
|
|
297 |
|
=cut |
298 |
|
|
299 |
|
sub _debug { |
300 |
|
my $l = shift; |
301 |
|
return $debug unless defined($l); |
302 |
|
warn "debug level $l" if ($l > 0); |
303 |
|
$debug = $l; |
304 |
|
} |
305 |
|
|
306 |
=head1 Functions to create C<data_structure> |
=head1 Functions to create C<data_structure> |
307 |
|
|
308 |
Those functions generally have to first in your normalization file. |
Those functions generally have to first in your normalization file. |
389 |
=cut |
=cut |
390 |
|
|
391 |
sub marc_repeatable_subfield { |
sub marc_repeatable_subfield { |
392 |
die "marc_repeatable_subfield need subfield!\n" unless (defined($_[1])); |
my ($f,$sf) = @_; |
393 |
$marc_repeatable_subfield->{ $_[1] }++; |
die "marc_repeatable_subfield need field and subfield!\n" unless ($f && $sf); |
394 |
|
$marc_repeatable_subfield->{ $f . $sf }++; |
395 |
marc(@_); |
marc(@_); |
396 |
} |
} |
397 |
|
|
416 |
@{ $marc_indicators->{$f} } = ($i1,$i2); |
@{ $marc_indicators->{$f} } = ($i1,$i2); |
417 |
} |
} |
418 |
|
|
419 |
|
=head2 marc_compose |
420 |
|
|
421 |
|
Save values for each MARC subfield explicitly |
422 |
|
|
423 |
|
marc_compose('900', |
424 |
|
'a', rec('200','a') |
425 |
|
'b', rec('201','a') |
426 |
|
'a', rec('200','b') |
427 |
|
'c', rec('200','c') |
428 |
|
); |
429 |
|
|
430 |
|
=cut |
431 |
|
|
432 |
|
sub marc_compose { |
433 |
|
my $f = shift or die "marc_compose needs field"; |
434 |
|
die "marc_compose field must be numer" unless ($f =~ /^\d+$/); |
435 |
|
|
436 |
|
my ($i1,$i2) = defined($marc_indicators->{$f}) ? @{ $marc_indicators->{$f} } : (' ',' '); |
437 |
|
my $m = [ $f, $i1, $i2 ]; |
438 |
|
|
439 |
|
while (@_) { |
440 |
|
my $sf = shift or die "marc_compose $f needs subfield"; |
441 |
|
my $v = shift or die "marc_compose $f needs value for subfield $sf"; |
442 |
|
|
443 |
|
next unless (defined($v) && $v !~ /^\s*$/); |
444 |
|
from_to($v, 'iso-8859-2', $marc_encoding) if ($marc_encoding); |
445 |
|
push @$m, ( $sf, $v ); |
446 |
|
warn "## ++ marc_compose($f,$sf,$v) ", dump( $m ) if ($debug > 1); |
447 |
|
} |
448 |
|
|
449 |
|
warn "## marc_compose(d) ", dump( $m ) if ($debug > 1); |
450 |
|
|
451 |
|
push @{ $marc_record }, $m; |
452 |
|
} |
453 |
|
|
454 |
|
|
455 |
=head1 Functions to extract data from input |
=head1 Functions to extract data from input |
456 |
|
|
526 |
sub regex { |
sub regex { |
527 |
my $r = shift; |
my $r = shift; |
528 |
my @out; |
my @out; |
529 |
#warn "r: $r\n",Dumper(\@_); |
#warn "r: $r\n", dump(\@_); |
530 |
foreach my $t (@_) { |
foreach my $t (@_) { |
531 |
next unless ($t); |
next unless ($t); |
532 |
eval "\$t =~ $r"; |
eval "\$t =~ $r"; |
620 |
return join($d, grep { defined($_) && $_ ne '' } @_); |
return join($d, grep { defined($_) && $_ ne '' } @_); |
621 |
} |
} |
622 |
|
|
623 |
|
=head2 split_rec_on |
624 |
|
|
625 |
|
Split record subfield on some regex and take one of parts out |
626 |
|
|
627 |
|
$a_before_semi_column = |
628 |
|
split_rec_on('200','a', /\s*;\s*/, $part); |
629 |
|
|
630 |
|
C<$part> is optional number of element. First element is |
631 |
|
B<1>, not 0! |
632 |
|
|
633 |
|
If there is no C<$part> parameter or C<$part> is 0, this function will |
634 |
|
return all values produced by splitting. |
635 |
|
|
636 |
|
=cut |
637 |
|
|
638 |
|
sub split_rec_on { |
639 |
|
die "split_rec_on need (fld,sf,regex[,part]" if ($#_ < 2); |
640 |
|
|
641 |
|
my ($fld, $sf, $regex, $part) = @_; |
642 |
|
warn "### regex ", ref($regex), $regex if ($debug > 2); |
643 |
|
|
644 |
|
my @r = rec( $fld, $sf ); |
645 |
|
my $v = shift @r; |
646 |
|
warn "### first rec($fld,$sf) = ",dump($v) if ($debug > 2); |
647 |
|
|
648 |
|
my @s = split( $regex, $v ); |
649 |
|
warn "## split_rec_on($fld,$sf,$regex,$part) = ",dump(@s) if ($debug > 1); |
650 |
|
if ($part > 0) { |
651 |
|
return $s[ $part - 1 ]; |
652 |
|
} else { |
653 |
|
return @s; |
654 |
|
} |
655 |
|
} |
656 |
|
|
657 |
# END |
# END |
658 |
1; |
1; |