1 |
package WebPAC::Normalize; |
package WebPAC::Normalize; |
2 |
use Exporter 'import'; |
use Exporter 'import'; |
3 |
@EXPORT = qw/ |
our @EXPORT = qw/ |
4 |
_set_rec _set_lookup |
_set_ds _set_lookup |
5 |
_set_load_row |
_set_load_row |
6 |
_get_ds _clean_ds |
_get_ds _clean_ds |
7 |
_debug |
_debug |
8 |
_pack_subfields_hash |
_pack_subfields_hash |
9 |
|
|
10 |
tag search display |
to |
11 |
marc marc_indicators marc_repeatable_subfield |
search_display search display sorted |
|
marc_compose marc_leader |
|
|
marc_duplicate marc_remove |
|
|
marc_original_order |
|
12 |
|
|
13 |
rec1 rec2 rec |
rec1 rec2 rec |
14 |
|
frec frec_eq frec_ne |
15 |
regex prefix suffix surround |
regex prefix suffix surround |
16 |
first lookup join_with |
first lookup join_with |
17 |
save_into_lookup |
save_into_lookup |
18 |
|
|
19 |
split_rec_on |
split_rec_on |
20 |
|
|
21 |
|
get set |
22 |
|
count |
23 |
|
|
24 |
/; |
/; |
25 |
|
|
26 |
use warnings; |
use warnings; |
28 |
|
|
29 |
#use base qw/WebPAC::Common/; |
#use base qw/WebPAC::Common/; |
30 |
use Data::Dump qw/dump/; |
use Data::Dump qw/dump/; |
|
use Storable qw/dclone/; |
|
31 |
use Carp qw/confess/; |
use Carp qw/confess/; |
32 |
|
|
33 |
# debugging warn(s) |
# debugging warn(s) |
34 |
my $debug = 0; |
my $debug = 0; |
35 |
|
_debug( $debug ); |
36 |
|
|
37 |
|
# FIXME |
38 |
|
use WebPAC::Normalize::ISBN; |
39 |
|
push @EXPORT, ( 'isbn_10', 'isbn_13' ); |
40 |
|
|
41 |
|
use WebPAC::Normalize::MARC; |
42 |
|
push @EXPORT, ( qw/ |
43 |
|
marc marc_indicators marc_repeatable_subfield |
44 |
|
marc_compose marc_leader marc_fixed |
45 |
|
marc_duplicate marc_remove marc_count |
46 |
|
marc_original_order |
47 |
|
marc_template |
48 |
|
/); |
49 |
|
|
50 |
=head1 NAME |
=head1 NAME |
51 |
|
|
52 |
WebPAC::Normalize - describe normalisaton rules using sets |
WebPAC::Normalize - describe normalisaton rules using sets |
53 |
|
|
|
=head1 VERSION |
|
|
|
|
|
Version 0.22 |
|
|
|
|
54 |
=cut |
=cut |
55 |
|
|
56 |
our $VERSION = '0.22'; |
our $VERSION = '0.36'; |
57 |
|
|
58 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
59 |
|
|
66 |
C<perl -c normalize.pl>. |
C<perl -c normalize.pl>. |
67 |
|
|
68 |
Normalisation can generate multiple output normalized data. For now, supported output |
Normalisation can generate multiple output normalized data. For now, supported output |
69 |
types (on the left side of definition) are: C<tag>, C<display>, C<search> and |
types (on the left side of definition) are: C<search_display>, C<display>, C<search> and |
70 |
C<marc>. |
C<marc>. |
71 |
|
|
72 |
=head1 FUNCTIONS |
=head1 FUNCTIONS |
85 |
marc_encoding => 'utf-8', |
marc_encoding => 'utf-8', |
86 |
config => $config, |
config => $config, |
87 |
load_row_coderef => sub { |
load_row_coderef => sub { |
88 |
my ($database,$input,$mfn) = shift; |
my ($database,$input,$mfn) = @_; |
89 |
$store->load_row( database => $database, input => $input, id => $mfn ); |
$store->load_row( database => $database, input => $input, id => $mfn ); |
90 |
}, |
}, |
91 |
); |
); |
111 |
die "need row argument" unless ($arg->{row}); |
die "need row argument" unless ($arg->{row}); |
112 |
die "need normalisation argument" unless ($arg->{rules}); |
die "need normalisation argument" unless ($arg->{rules}); |
113 |
|
|
|
no strict 'subs'; |
|
114 |
_set_lookup( $arg->{lookup} ) if defined($arg->{lookup}); |
_set_lookup( $arg->{lookup} ) if defined($arg->{lookup}); |
115 |
_set_rec( $arg->{row} ); |
_set_ds( $arg->{row} ); |
116 |
_set_config( $arg->{config} ) if defined($arg->{config}); |
_set_config( $arg->{config} ) if defined($arg->{config}); |
117 |
_clean_ds( %{ $arg } ); |
_clean_ds( %{ $arg } ); |
118 |
$load_row_coderef = $arg->{load_row_coderef}; |
$load_row_coderef = $arg->{load_row_coderef}; |
119 |
|
|
120 |
eval "$arg->{rules}"; |
no strict 'subs'; |
121 |
|
no warnings 'redefine'; |
122 |
|
eval "$arg->{rules};"; |
123 |
die "error evaling $arg->{rules}: $@\n" if ($@); |
die "error evaling $arg->{rules}: $@\n" if ($@); |
124 |
|
|
125 |
return _get_ds(); |
return _get_ds(); |
126 |
} |
} |
127 |
|
|
128 |
=head2 _set_rec |
=head2 _set_ds |
129 |
|
|
130 |
Set current record hash |
Set current record hash |
131 |
|
|
132 |
_set_rec( $rec ); |
_set_ds( $rec ); |
133 |
|
|
134 |
=cut |
=cut |
135 |
|
|
136 |
my $rec; |
my $rec; |
137 |
|
|
138 |
sub _set_rec { |
sub _set_ds { |
139 |
$rec = shift or die "no record hash"; |
$rec = shift or die "no record hash"; |
140 |
|
$WebPAC::Normalize::MARC::rec = $rec; |
141 |
} |
} |
142 |
|
|
143 |
|
=head2 |
144 |
|
|
145 |
|
my $rec = _get_rec(); |
146 |
|
|
147 |
|
=cut |
148 |
|
|
149 |
|
sub _get_rec { $rec }; |
150 |
|
|
151 |
=head2 _set_config |
=head2 _set_config |
152 |
|
|
153 |
Set current config hash |
Set current config hash |
184 |
|
|
185 |
=cut |
=cut |
186 |
|
|
187 |
my ($out, $marc_record, $marc_encoding, $marc_repeatable_subfield, $marc_indicators, $leader); |
my $out; |
|
my ($marc_record_offset, $marc_fetch_offset) = (0, 0); |
|
188 |
|
|
189 |
sub _get_ds { |
sub _get_ds { |
190 |
|
#warn "## out = ",dump($out); |
191 |
return $out; |
return $out; |
192 |
} |
} |
193 |
|
|
201 |
|
|
202 |
sub _clean_ds { |
sub _clean_ds { |
203 |
my $a = {@_}; |
my $a = {@_}; |
204 |
($out,$marc_record, $marc_encoding, $marc_repeatable_subfield, $marc_indicators, $leader) = (); |
$out = undef; |
205 |
($marc_record_offset, $marc_fetch_offset) = (0,0); |
WebPAC::Normalize::MARC::_clean(); |
|
$marc_encoding = $a->{marc_encoding}; |
|
206 |
} |
} |
207 |
|
|
208 |
=head2 _set_lookup |
=head2 _set_lookup |
250 |
$load_row_coderef = $coderef; |
$load_row_coderef = $coderef; |
251 |
} |
} |
252 |
|
|
|
=head2 _get_marc_fields |
|
|
|
|
|
Get all fields defined by calls to C<marc> |
|
|
|
|
|
$marc->add_fields( WebPAC::Normalize:_get_marc_fields() ); |
|
|
|
|
|
We are using I<magic> which detect repeatable fields only from |
|
|
sequence of field/subfield data generated by normalization. |
|
|
|
|
|
Repeatable field is created when there is second occurence of same subfield or |
|
|
if any of indicators are different. |
|
|
|
|
|
This is sane for most cases. Something like: |
|
|
|
|
|
900a-1 900b-1 900c-1 |
|
|
900a-2 900b-2 |
|
|
900a-3 |
|
|
|
|
|
will be created from any combination of: |
|
|
|
|
|
900a-1 900a-2 900a-3 900b-1 900b-2 900c-1 |
|
|
|
|
|
and following rules: |
|
|
|
|
|
marc('900','a', rec('200','a') ); |
|
|
marc('900','b', rec('200','b') ); |
|
|
marc('900','c', rec('200','c') ); |
|
|
|
|
|
which might not be what you have in mind. If you need repeatable subfield, |
|
|
define it using C<marc_repeatable_subfield> like this: |
|
|
|
|
|
marc_repeatable_subfield('900','a'); |
|
|
marc('900','a', rec('200','a') ); |
|
|
marc('900','b', rec('200','b') ); |
|
|
marc('900','c', rec('200','c') ); |
|
|
|
|
|
will create: |
|
|
|
|
|
900a-1 900a-2 900a-3 900b-1 900c-1 |
|
|
900b-2 |
|
|
|
|
|
There is also support for returning next or specific using: |
|
|
|
|
|
while (my $mf = WebPAC::Normalize:_get_marc_fields( fetch_next => 1 ) ) { |
|
|
# do something with $mf |
|
|
} |
|
|
|
|
|
will always return fields from next MARC record or |
|
|
|
|
|
my $mf = WebPAC::Normalize::_get_marc_fields( offset => 42 ); |
|
|
|
|
|
will return 42th copy record (if it exists). |
|
|
|
|
|
=cut |
|
|
|
|
|
sub _get_marc_fields { |
|
|
|
|
|
my $arg = {@_}; |
|
|
warn "### _get_marc_fields arg: ", dump($arg), $/ if ($debug > 2); |
|
|
my $offset = $marc_fetch_offset; |
|
|
if ($arg->{offset}) { |
|
|
$offset = $arg->{offset}; |
|
|
} elsif($arg->{fetch_next}) { |
|
|
$marc_fetch_offset++; |
|
|
} |
|
|
|
|
|
return if (! $marc_record || ref($marc_record) ne 'ARRAY'); |
|
|
|
|
|
warn "### full marc_record = ", dump( @{ $marc_record }), $/ if ($debug > 2); |
|
|
|
|
|
my $marc_rec = $marc_record->[ $offset ]; |
|
|
|
|
|
warn "## _get_marc_fields (at offset: $offset) -- marc_record = ", dump( @$marc_rec ), $/ if ($debug > 1); |
|
|
|
|
|
return if (! $marc_rec || ref($marc_rec) ne 'ARRAY' || $#{ $marc_rec } < 0); |
|
|
|
|
|
# first, sort all existing fields |
|
|
# XXX might not be needed, but modern perl might randomize elements in hash |
|
|
my @sorted_marc_record = sort { |
|
|
$a->[0] . ( $a->[3] || '' ) cmp $b->[0] . ( $b->[3] || '') |
|
|
} @{ $marc_rec }; |
|
|
|
|
|
@sorted_marc_record = @{ $marc_rec }; ### FIXME disable sorting |
|
|
|
|
|
# output marc fields |
|
|
my @m; |
|
|
|
|
|
# count unique field-subfields (used for offset when walking to next subfield) |
|
|
my $u; |
|
|
map { $u->{ $_->[0] . ( $_->[3] || '') }++ } @sorted_marc_record; |
|
|
|
|
|
if ($debug) { |
|
|
warn "## marc_repeatable_subfield = ", dump( $marc_repeatable_subfield ), $/ if ( $marc_repeatable_subfield ); |
|
|
warn "## marc_record[$offset] = ", dump( $marc_rec ), $/; |
|
|
warn "## sorted_marc_record = ", dump( \@sorted_marc_record ), $/; |
|
|
warn "## subfield count = ", dump( $u ), $/; |
|
|
} |
|
|
|
|
|
my $len = $#sorted_marc_record; |
|
|
my $visited; |
|
|
my $i = 0; |
|
|
my $field; |
|
|
|
|
|
foreach ( 0 .. $len ) { |
|
|
|
|
|
# find next element which isn't visited |
|
|
while ($visited->{$i}) { |
|
|
$i = ($i + 1) % ($len + 1); |
|
|
} |
|
|
|
|
|
# mark it visited |
|
|
$visited->{$i}++; |
|
|
|
|
|
my $row = dclone( $sorted_marc_record[$i] ); |
|
|
|
|
|
# field and subfield which is key for |
|
|
# marc_repeatable_subfield and u |
|
|
my $fsf = $row->[0] . ( $row->[3] || '' ); |
|
|
|
|
|
if ($debug > 1) { |
|
|
|
|
|
print "### field so far [", $#$field, "] : ", dump( $field ), " ", $field ? 'T' : 'F', $/; |
|
|
print "### this [$i]: ", dump( $row ),$/; |
|
|
print "### sf: ", $row->[3], " vs ", $field->[3], |
|
|
$marc_repeatable_subfield->{ $row->[0] . $row->[3] } ? ' (repeatable)' : '', $/, |
|
|
if ($#$field >= 0); |
|
|
|
|
|
} |
|
|
|
|
|
# if field exists |
|
|
if ( $#$field >= 0 ) { |
|
|
if ( |
|
|
$row->[0] ne $field->[0] || # field |
|
|
$row->[1] ne $field->[1] || # i1 |
|
|
$row->[2] ne $field->[2] # i2 |
|
|
) { |
|
|
push @m, $field; |
|
|
warn "## saved/1 ", dump( $field ),$/ if ($debug); |
|
|
$field = $row; |
|
|
|
|
|
} elsif ( |
|
|
( $row->[3] lt $field->[-2] ) # subfield which is not next (e.g. a after c) |
|
|
|| |
|
|
( $row->[3] eq $field->[-2] && # same subfield, but not repeatable |
|
|
! $marc_repeatable_subfield->{ $fsf } |
|
|
) |
|
|
) { |
|
|
push @m, $field; |
|
|
warn "## saved/2 ", dump( $field ),$/ if ($debug); |
|
|
$field = $row; |
|
|
|
|
|
} else { |
|
|
# append new subfields to existing field |
|
|
push @$field, ( $row->[3], $row->[4] ); |
|
|
} |
|
|
} else { |
|
|
# insert first field |
|
|
$field = $row; |
|
|
} |
|
|
|
|
|
if (! $marc_repeatable_subfield->{ $fsf }) { |
|
|
# make step to next subfield |
|
|
$i = ($i + $u->{ $fsf } ) % ($len + 1); |
|
|
} |
|
|
} |
|
|
|
|
|
if ($#$field >= 0) { |
|
|
push @m, $field; |
|
|
warn "## saved/3 ", dump( $field ),$/ if ($debug); |
|
|
} |
|
|
|
|
|
return \@m; |
|
|
} |
|
|
|
|
253 |
=head2 _debug |
=head2 _debug |
254 |
|
|
255 |
Change level of debug warnings |
Change level of debug warnings |
263 |
return $debug unless defined($l); |
return $debug unless defined($l); |
264 |
warn "debug level $l",$/ if ($l > 0); |
warn "debug level $l",$/ if ($l > 0); |
265 |
$debug = $l; |
$debug = $l; |
266 |
|
$WebPAC::Normalize::MARC::debug = $debug; |
267 |
} |
} |
268 |
|
|
269 |
=head1 Functions to create C<data_structure> |
=head1 Functions to create C<data_structure> |
270 |
|
|
271 |
Those functions generally have to first in your normalization file. |
Those functions generally have to first in your normalization file. |
272 |
|
|
273 |
=head2 tag |
=head2 to |
|
|
|
|
Define new tag for I<search> and I<display>. |
|
274 |
|
|
275 |
tag('Title', rec('200','a') ); |
Generic way to set values for some name |
276 |
|
|
277 |
|
to('field-name', 'name-value' => rec('200','a') ); |
278 |
|
|
279 |
=cut |
There are many helpers defined below which might be easier to use. |
|
|
|
|
sub tag { |
|
|
my $name = shift or die "tag needs name as first argument"; |
|
|
my @o = grep { defined($_) && $_ ne '' } @_; |
|
|
return unless (@o); |
|
|
$out->{$name}->{tag} = $name; |
|
|
$out->{$name}->{search} = \@o; |
|
|
$out->{$name}->{display} = \@o; |
|
|
} |
|
|
|
|
|
=head2 display |
|
|
|
|
|
Define tag just for I<display> |
|
|
|
|
|
@v = display('Title', rec('200','a') ); |
|
280 |
|
|
281 |
=cut |
=cut |
282 |
|
|
283 |
sub display { |
sub to { |
284 |
my $name = shift or die "display needs name as first argument"; |
my $type = shift or confess "need type -- BUG?"; |
285 |
|
my $name = shift or confess "needs name as first argument"; |
286 |
my @o = grep { defined($_) && $_ ne '' } @_; |
my @o = grep { defined($_) && $_ ne '' } @_; |
287 |
return unless (@o); |
return unless (@o); |
288 |
$out->{$name}->{tag} = $name; |
$out->{$name}->{$type} = \@o; |
|
$out->{$name}->{display} = \@o; |
|
289 |
} |
} |
290 |
|
|
291 |
=head2 search |
=head2 search_display |
292 |
|
|
293 |
Prepare values just for I<search> |
Define output for L<search> and L<display> at the same time |
294 |
|
|
295 |
@v = search('Title', rec('200','a') ); |
search_display('Title', rec('200','a') ); |
296 |
|
|
297 |
=cut |
=cut |
298 |
|
|
299 |
sub search { |
sub search_display { |
300 |
my $name = shift or die "search needs name as first argument"; |
my $name = shift or die "search_display needs name as first argument"; |
301 |
my @o = grep { defined($_) && $_ ne '' } @_; |
my @o = grep { defined($_) && $_ ne '' } @_; |
302 |
return unless (@o); |
return unless (@o); |
|
$out->{$name}->{tag} = $name; |
|
303 |
$out->{$name}->{search} = \@o; |
$out->{$name}->{search} = \@o; |
304 |
|
$out->{$name}->{display} = \@o; |
305 |
} |
} |
306 |
|
|
307 |
=head2 marc_leader |
=head2 tag |
|
|
|
|
Setup fields within MARC leader or get leader |
|
|
|
|
|
marc_leader('05','c'); |
|
|
my $leader = marc_leader(); |
|
|
|
|
|
=cut |
|
|
|
|
|
sub marc_leader { |
|
|
my ($offset,$value) = @_; |
|
|
|
|
|
if ($offset) { |
|
|
$leader->{ $offset } = $value; |
|
|
} else { |
|
|
return $leader; |
|
|
} |
|
|
} |
|
|
|
|
|
=head2 marc |
|
|
|
|
|
Save value for MARC field |
|
|
|
|
|
marc('900','a', rec('200','a') ); |
|
|
marc('001', rec('000') ); |
|
|
|
|
|
=cut |
|
|
|
|
|
sub marc { |
|
|
my $f = shift or die "marc needs field"; |
|
|
die "marc field must be numer" unless ($f =~ /^\d+$/); |
|
|
|
|
|
my $sf; |
|
|
if ($f >= 10) { |
|
|
$sf = shift or die "marc needs subfield"; |
|
|
} |
|
|
|
|
|
foreach (@_) { |
|
|
my $v = $_; # make var read-write for Encode |
|
|
next unless (defined($v) && $v !~ /^\s*$/); |
|
|
my ($i1,$i2) = defined($marc_indicators->{$f}) ? @{ $marc_indicators->{$f} } : (' ',' '); |
|
|
if (defined $sf) { |
|
|
push @{ $marc_record->[ $marc_record_offset ] }, [ $f, $i1, $i2, $sf => $v ]; |
|
|
} else { |
|
|
push @{ $marc_record->[ $marc_record_offset ] }, [ $f, $v ]; |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
=head2 marc_repeatable_subfield |
|
|
|
|
|
Save values for MARC repetable subfield |
|
|
|
|
|
marc_repeatable_subfield('910', 'z', rec('909') ); |
|
|
|
|
|
=cut |
|
|
|
|
|
sub marc_repeatable_subfield { |
|
|
my ($f,$sf) = @_; |
|
|
die "marc_repeatable_subfield need field and subfield!\n" unless ($f && $sf); |
|
|
$marc_repeatable_subfield->{ $f . $sf }++; |
|
|
marc(@_); |
|
|
} |
|
|
|
|
|
=head2 marc_indicators |
|
|
|
|
|
Set both indicators for MARC field |
|
|
|
|
|
marc_indicators('900', ' ', 1); |
|
|
|
|
|
Any indicator value other than C<0-9> will be treated as undefined. |
|
|
|
|
|
=cut |
|
|
|
|
|
sub marc_indicators { |
|
|
my $f = shift || die "marc_indicators need field!\n"; |
|
|
my ($i1,$i2) = @_; |
|
|
die "marc_indicators($f, ...) need i1!\n" unless(defined($i1)); |
|
|
die "marc_indicators($f, $i1, ...) need i2!\n" unless(defined($i2)); |
|
|
|
|
|
$i1 = ' ' if ($i1 !~ /^\d$/); |
|
|
$i2 = ' ' if ($i2 !~ /^\d$/); |
|
|
@{ $marc_indicators->{$f} } = ($i1,$i2); |
|
|
} |
|
|
|
|
|
=head2 marc_compose |
|
|
|
|
|
Save values for each MARC subfield explicitly |
|
|
|
|
|
marc_compose('900', |
|
|
'a', rec('200','a') |
|
|
'b', rec('201','a') |
|
|
'a', rec('200','b') |
|
|
'c', rec('200','c') |
|
|
); |
|
308 |
|
|
309 |
If you specify C<+> for subfield, value will be appended |
Old name for L<search_display>, it will probably be removed at one point. |
|
to previous defined subfield. |
|
310 |
|
|
311 |
=cut |
=cut |
312 |
|
|
313 |
sub marc_compose { |
sub tag { |
314 |
my $f = shift or die "marc_compose needs field"; |
search_display( @_ ); |
|
die "marc_compose field must be numer" unless ($f =~ /^\d+$/); |
|
|
|
|
|
my ($i1,$i2) = defined($marc_indicators->{$f}) ? @{ $marc_indicators->{$f} } : (' ',' '); |
|
|
my $m = [ $f, $i1, $i2 ]; |
|
|
|
|
|
warn "### marc_compose input subfields = ", dump(@_),$/ if ($debug > 2); |
|
|
|
|
|
if ($#_ % 2 != 1) { |
|
|
die "ERROR: marc_compose",dump($f,@_)," not valid (must be even).\nDo you need to add first() or join() around some argument?\n"; |
|
|
} |
|
|
|
|
|
while (@_) { |
|
|
my $sf = shift; |
|
|
my $v = shift; |
|
|
|
|
|
next unless (defined($v) && $v !~ /^\s*$/); |
|
|
warn "## ++ marc_compose($f,$sf,$v) ", dump( $m ),$/ if ($debug > 1); |
|
|
if ($sf ne '+') { |
|
|
push @$m, ( $sf, $v ); |
|
|
} else { |
|
|
$m->[ $#$m ] .= $v; |
|
|
} |
|
|
} |
|
|
|
|
|
warn "## marc_compose current marc = ", dump( $m ),$/ if ($debug > 1); |
|
|
|
|
|
push @{ $marc_record->[ $marc_record_offset ] }, $m if ($#{$m} > 2); |
|
315 |
} |
} |
316 |
|
|
317 |
=head2 marc_duplicate |
=head2 display |
|
|
|
|
Generate copy of current MARC record and continue working on copy |
|
318 |
|
|
319 |
marc_duplicate(); |
Define output just for I<display> |
320 |
|
|
321 |
Copies can be accessed using C<< _get_marc_fields( fetch_next => 1 ) >> or |
@v = display('Title', rec('200','a') ); |
|
C<< _get_marc_fields( offset => 42 ) >>. |
|
322 |
|
|
323 |
=cut |
=cut |
324 |
|
|
325 |
sub marc_duplicate { |
sub display { to( 'display', @_ ) } |
|
my $m = $marc_record->[ -1 ]; |
|
|
die "can't duplicate record which isn't defined" unless ($m); |
|
|
push @{ $marc_record }, dclone( $m ); |
|
|
warn "## marc_duplicate = ", dump(@$marc_record), $/ if ($debug > 1); |
|
|
$marc_record_offset = $#{ $marc_record }; |
|
|
warn "## marc_record_offset = $marc_record_offset", $/ if ($debug > 1); |
|
|
} |
|
326 |
|
|
327 |
=head2 marc_remove |
=head2 search |
|
|
|
|
Remove some field or subfield from MARC record. |
|
|
|
|
|
marc_remove('200'); |
|
|
marc_remove('200','a'); |
|
|
|
|
|
This will erase field C<200> or C<200^a> from current MARC record. |
|
328 |
|
|
329 |
This is useful after calling C<marc_duplicate> or on it's own (but, you |
Prepare values just for I<search> |
|
should probably just remove that subfield definition if you are not |
|
|
using C<marc_duplicate>). |
|
330 |
|
|
331 |
FIXME: support fields < 10. |
@v = search('Title', rec('200','a') ); |
332 |
|
|
333 |
=cut |
=cut |
334 |
|
|
335 |
sub marc_remove { |
sub search { to( 'search', @_ ) } |
|
my ($f, $sf) = @_; |
|
|
|
|
|
die "marc_remove needs record number" unless defined($f); |
|
|
|
|
|
my $marc = $marc_record->[ $marc_record_offset ]; |
|
|
|
|
|
warn "### marc_remove before = ", dump( $marc ), $/ if ($debug > 2); |
|
|
|
|
|
my $i = 0; |
|
|
foreach ( 0 .. $#{ $marc } ) { |
|
|
last unless (defined $marc->[$i]); |
|
|
warn "#### working on ",dump( @{ $marc->[$i] }), $/ if ($debug > 3); |
|
|
if ($marc->[$i]->[0] eq $f) { |
|
|
if (! defined $sf) { |
|
|
# remove whole field |
|
|
splice @$marc, $i, 1; |
|
|
warn "#### slice \@\$marc, $i, 1 = ",dump( @{ $marc }), $/ if ($debug > 3); |
|
|
$i--; |
|
|
} else { |
|
|
foreach my $j ( 0 .. (( $#{ $marc->[$i] } - 3 ) / 2) ) { |
|
|
my $o = ($j * 2) + 3; |
|
|
if ($marc->[$i]->[$o] eq $sf) { |
|
|
# remove subfield |
|
|
splice @{$marc->[$i]}, $o, 2; |
|
|
warn "#### slice \@{\$marc->[$i]}, $o, 2 = ", dump( @{ $marc }), $/ if ($debug > 3); |
|
|
# is record now empty? |
|
|
if ($#{ $marc->[$i] } == 2) { |
|
|
splice @$marc, $i, 1; |
|
|
warn "#### slice \@\$marc, $i, 1 = ", dump( @{ $marc }), $/ if ($debug > 3); |
|
|
$i--; |
|
|
}; |
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
|
$i++; |
|
|
} |
|
|
|
|
|
warn "### marc_remove($f", $sf ? ",$sf" : "", ") after = ", dump( $marc ), $/ if ($debug > 2); |
|
|
|
|
|
$marc_record->[ $marc_record_offset ] = $marc; |
|
|
|
|
|
warn "## full marc_record = ", dump( @{ $marc_record }), $/ if ($debug > 1); |
|
|
} |
|
|
|
|
|
=head2 marc_original_order |
|
|
|
|
|
Copy all subfields preserving original order to marc field. |
|
336 |
|
|
337 |
marc_original_order( marc_field_number, original_input_field_number ); |
=head2 sorted |
338 |
|
|
339 |
Please note that field numbers are consistent with other commands (marc |
Insert into lists which will be automatically sorted |
|
field number first), but somewhat counter-intuitive (destination and then |
|
|
source). |
|
|
|
|
|
You might want to use this command if you are just renaming subfields or |
|
|
using pre-processing modify_record in C<config.yml> and don't need any |
|
|
post-processing or want to preserve order of original subfields. |
|
340 |
|
|
341 |
|
sorted('Title', rec('200','a') ); |
342 |
|
|
343 |
=cut |
=cut |
344 |
|
|
345 |
sub marc_original_order { |
sub sorted { to( 'sorted', @_ ) } |
|
|
|
|
my ($to, $from) = @_; |
|
|
die "marc_original_order needs from and to fields\n" unless ($from && $to); |
|
|
|
|
|
return unless defined($rec->{$from}); |
|
|
|
|
|
my $r = $rec->{$from}; |
|
|
die "record field $from isn't array\n" unless (ref($r) eq 'ARRAY'); |
|
|
|
|
|
my ($i1,$i2) = defined($marc_indicators->{$to}) ? @{ $marc_indicators->{$to} } : (' ',' '); |
|
|
warn "## marc_original_order($to,$from) source = ", dump( $r ),$/ if ($debug > 1); |
|
|
|
|
|
foreach my $d (@$r) { |
|
|
|
|
|
if (! defined($d->{subfields}) && ref($d->{subfields}) ne 'ARRAY') { |
|
|
warn "# marc_original_order($to,$from): field $from doesn't have subfields specification\n"; |
|
|
next; |
|
|
} |
|
|
|
|
|
my @sfs = @{ $d->{subfields} }; |
|
|
|
|
|
die "field $from doesn't have even number of subfields specifications\n" unless($#sfs % 2 == 1); |
|
|
|
|
|
warn "#--> d: ",dump($d), "\n#--> sfs: ",dump(@sfs),$/ if ($debug > 2); |
|
|
|
|
|
my $m = [ $to, $i1, $i2 ]; |
|
|
|
|
|
while (my $sf = shift @sfs) { |
|
|
|
|
|
warn "#--> sf: ",dump($sf), $/ if ($debug > 2); |
|
|
my $offset = shift @sfs; |
|
|
die "corrupted sufields specification for field $from\n" unless defined($offset); |
|
|
|
|
|
my $v; |
|
|
if (ref($d->{$sf}) eq 'ARRAY') { |
|
|
$v = $d->{$sf}->[$offset] if (defined($d->{$sf}->[$offset])); |
|
|
} elsif ($offset == 0) { |
|
|
$v = $d->{$sf}; |
|
|
} else { |
|
|
die "field $from subfield '$sf' need occurence $offset which doesn't exist", dump($d->{$sf}); |
|
|
} |
|
|
push @$m, ( $sf, $v ) if (defined($v)); |
|
|
} |
|
|
|
|
|
if ($#{$m} > 2) { |
|
|
push @{ $marc_record->[ $marc_record_offset ] }, $m; |
|
|
} |
|
|
} |
|
|
|
|
|
warn "## marc_record = ", dump( $marc_record ),$/ if ($debug > 1); |
|
|
} |
|
346 |
|
|
347 |
|
|
348 |
=head1 Functions to extract data from input |
=head1 Functions to extract data from input |
366 |
|
|
367 |
my ($h,$include_subfields) = @_; |
my ($h,$include_subfields) = @_; |
368 |
|
|
369 |
|
# sanity and ease of use |
370 |
|
return $h if (ref($h) ne 'HASH'); |
371 |
|
|
372 |
if ( defined($h->{subfields}) ) { |
if ( defined($h->{subfields}) ) { |
373 |
my $sfs = delete $h->{subfields} || die "no subfields?"; |
my $sfs = delete $h->{subfields} || die "no subfields?"; |
374 |
my @out; |
my @out; |
458 |
} else { |
} else { |
459 |
$_->{$sf}; |
$_->{$sf}; |
460 |
} |
} |
461 |
} grep { ref($_) eq 'HASH' && $_->{$sf} } @{ $rec->{$f} }; |
} grep { ref($_) eq 'HASH' && defined $_->{$sf} } @{ $rec->{$f} }; |
462 |
} |
} |
463 |
|
|
464 |
=head2 rec |
=head2 rec |
468 |
@v = rec('200') |
@v = rec('200') |
469 |
@v = rec('200','a') |
@v = rec('200','a') |
470 |
|
|
471 |
|
If rec() returns just single value, it will |
472 |
|
return scalar, not array. |
473 |
|
|
474 |
=cut |
=cut |
475 |
|
|
476 |
sub rec { |
sub rec { |
480 |
} elsif ($#_ == 1) { |
} elsif ($#_ == 1) { |
481 |
@out = rec2(@_); |
@out = rec2(@_); |
482 |
} |
} |
483 |
if (@out) { |
if ($#out == 0 && ! wantarray) { |
484 |
|
return $out[0]; |
485 |
|
} elsif (@out) { |
486 |
return @out; |
return @out; |
487 |
} else { |
} else { |
488 |
return ''; |
return ''; |
489 |
} |
} |
490 |
} |
} |
491 |
|
|
492 |
|
=head2 frec |
493 |
|
|
494 |
|
Returns first value from field |
495 |
|
|
496 |
|
$v = frec('200'); |
497 |
|
$v = frec('200','a'); |
498 |
|
|
499 |
|
=cut |
500 |
|
|
501 |
|
sub frec { |
502 |
|
my @out = rec(@_); |
503 |
|
warn "rec(",dump(@_),") has more than one return value, ignoring\n" if $#out > 0; |
504 |
|
return shift @out; |
505 |
|
} |
506 |
|
|
507 |
|
=head2 frec_eq |
508 |
|
|
509 |
|
=head2 frec_ne |
510 |
|
|
511 |
|
Check if first values from two fields are same or different |
512 |
|
|
513 |
|
if ( frec_eq( 900 => 'a', 910 => 'c' ) ) { |
514 |
|
# values are same |
515 |
|
} else { |
516 |
|
# values are different |
517 |
|
} |
518 |
|
|
519 |
|
Strictly speaking C<frec_eq> and C<frec_ne> wouldn't be needed if you |
520 |
|
could write something like: |
521 |
|
|
522 |
|
if ( frec( '900','a' ) eq frec( '910','c' ) ) { |
523 |
|
# yada tada |
524 |
|
} |
525 |
|
|
526 |
|
but you can't since our parser L<WebPAC::Parser> will remove all whitespaces |
527 |
|
in order to parse text and create invalid function C<eqfrec>. |
528 |
|
|
529 |
|
=cut |
530 |
|
|
531 |
|
sub frec_eq { |
532 |
|
my ( $f1,$sf1, $f2, $sf2 ) = @_; |
533 |
|
return (rec( $f1, $sf1 ))[0] eq (rec( $f2, $sf2 ))[0]; |
534 |
|
} |
535 |
|
|
536 |
|
sub frec_ne { |
537 |
|
return ! frec_eq( @_ ); |
538 |
|
} |
539 |
|
|
540 |
=head2 regex |
=head2 regex |
541 |
|
|
542 |
Apply regex to some or all values |
Apply regex to some or all values |
566 |
=cut |
=cut |
567 |
|
|
568 |
sub prefix { |
sub prefix { |
569 |
my $p = shift or return; |
my $p = shift; |
570 |
|
return @_ unless defined( $p ); |
571 |
return map { $p . $_ } grep { defined($_) } @_; |
return map { $p . $_ } grep { defined($_) } @_; |
572 |
} |
} |
573 |
|
|
580 |
=cut |
=cut |
581 |
|
|
582 |
sub suffix { |
sub suffix { |
583 |
my $s = shift or die "suffix needs string as first argument"; |
my $s = shift; |
584 |
|
return @_ unless defined( $s ); |
585 |
return map { $_ . $s } grep { defined($_) } @_; |
return map { $_ . $s } grep { defined($_) } @_; |
586 |
} |
} |
587 |
|
|
594 |
=cut |
=cut |
595 |
|
|
596 |
sub surround { |
sub surround { |
597 |
my $p = shift or die "surround need prefix as first argument"; |
my $p = shift; |
598 |
my $s = shift or die "surround needs suffix as second argument"; |
my $s = shift; |
599 |
|
$p = '' unless defined( $p ); |
600 |
|
$s = '' unless defined( $s ); |
601 |
return map { $p . $_ . $s } grep { defined($_) } @_; |
return map { $p . $_ . $s } grep { defined($_) } @_; |
602 |
} |
} |
603 |
|
|
662 |
sub lookup { |
sub lookup { |
663 |
my ($what, $database, $input, $key, $having) = @_; |
my ($what, $database, $input, $key, $having) = @_; |
664 |
|
|
665 |
confess "lookup needs 5 arguments: what, database, input, key, having" unless ($#_ == 4); |
confess "lookup needs 5 arguments: what, database, input, key, having\n" unless ($#_ == 4); |
666 |
|
|
667 |
warn "## lookup ($database, $input, $key)", $/ if ($debug > 1); |
warn "## lookup ($database, $input, $key)", $/ if ($debug > 1); |
668 |
return unless (defined($lookup->{$database}->{$input}->{$key})); |
return unless (defined($lookup->{$database}->{$input}->{$key})); |
676 |
|
|
677 |
foreach my $h ( @having ) { |
foreach my $h ( @having ) { |
678 |
if (defined($lookup->{$database}->{$input}->{$key}->{$h})) { |
if (defined($lookup->{$database}->{$input}->{$key}->{$h})) { |
679 |
warn "lookup for $database/$input/$key/$h return ",dump($lookup->{$database}->{$input}->{$key}->{$h}),"\n"; |
warn "lookup for $database/$input/$key/$h return ",dump($lookup->{$database}->{$input}->{$key}->{$h}),"\n" if ($debug); |
680 |
$mfns->{$_}++ foreach keys %{ $lookup->{$database}->{$input}->{$key}->{$h} }; |
$mfns->{$_}++ foreach keys %{ $lookup->{$database}->{$input}->{$key}->{$h} }; |
681 |
} |
} |
682 |
} |
} |
685 |
|
|
686 |
my @mfns = sort keys %$mfns; |
my @mfns = sort keys %$mfns; |
687 |
|
|
688 |
warn "# lookup loading $database/$input/$key mfn ", join(",",@mfns)," having ",dump(@having),"\n"; |
warn "# lookup loading $database/$input/$key mfn ", join(",",@mfns)," having ",dump(@having),"\n" if ($debug); |
689 |
|
|
690 |
my $old_rec = $rec; |
my $old_rec = $rec; |
691 |
my @out; |
my @out; |
693 |
foreach my $mfn (@mfns) { |
foreach my $mfn (@mfns) { |
694 |
$rec = $load_row_coderef->( $database, $input, $mfn ); |
$rec = $load_row_coderef->( $database, $input, $mfn ); |
695 |
|
|
696 |
warn "got $database/$input/$mfn = ", dump($rec), $/; |
warn "got $database/$input/$mfn = ", dump($rec), $/ if ($debug); |
697 |
|
|
698 |
my @vals = $what->(); |
my @vals = $what->(); |
699 |
|
|
700 |
push @out, ( @vals ); |
push @out, ( @vals ); |
701 |
|
|
702 |
warn "lookup for mfn $mfn returned ", dump(@vals), $/; |
warn "lookup for mfn $mfn returned ", dump(@vals), $/ if ($debug); |
703 |
} |
} |
704 |
|
|
705 |
# if (ref($lookup->{$k}) eq 'ARRAY') { |
# if (ref($lookup->{$k}) eq 'ARRAY') { |
710 |
|
|
711 |
$rec = $old_rec; |
$rec = $old_rec; |
712 |
|
|
713 |
warn "## lookup returns = ", dump(@out), $/; |
warn "## lookup returns = ", dump(@out), $/ if ($debug); |
714 |
|
|
715 |
if ($#out == 0) { |
if ($#out == 0) { |
716 |
return $out[0]; |
return $out[0]; |
772 |
$database_code = config(); # use _ from hash |
$database_code = config(); # use _ from hash |
773 |
$database_name = config('name'); |
$database_name = config('name'); |
774 |
$database_input_name = config('input name'); |
$database_input_name = config('input name'); |
|
$tag = config('input normalize tag'); |
|
775 |
|
|
776 |
Up to three levels are supported. |
Up to three levels are supported. |
777 |
|
|
832 |
|
|
833 |
sub id { |
sub id { |
834 |
my $mfn = $config->{_mfn} || die "no _mfn in config data"; |
my $mfn = $config->{_mfn} || die "no _mfn in config data"; |
835 |
return $mfn . $#{$marc_record} ? $#{$marc_record} + 1 : ''; |
return $mfn . ( WebPAC::Normalize::MARC::_created_marc_records() || '' ); |
836 |
} |
} |
837 |
|
|
838 |
=head2 join_with |
=head2 join_with |
887 |
} |
} |
888 |
} |
} |
889 |
|
|
890 |
|
my $hash; |
891 |
|
|
892 |
|
=head2 set |
893 |
|
|
894 |
|
set( key => 'value' ); |
895 |
|
|
896 |
|
=cut |
897 |
|
|
898 |
|
sub set { |
899 |
|
my ($k,$v) = @_; |
900 |
|
warn "## set ( $k => ", dump($v), " )", $/ if ( $debug ); |
901 |
|
$hash->{$k} = $v; |
902 |
|
}; |
903 |
|
|
904 |
|
=head2 get |
905 |
|
|
906 |
|
get( 'key' ); |
907 |
|
|
908 |
|
=cut |
909 |
|
|
910 |
|
sub get { |
911 |
|
my $k = shift || return; |
912 |
|
my $v = $hash->{$k}; |
913 |
|
warn "## get $k = ", dump( $v ), $/ if ( $debug ); |
914 |
|
return $v; |
915 |
|
} |
916 |
|
|
917 |
|
=head2 count |
918 |
|
|
919 |
|
if ( count( @result ) == 1 ) { |
920 |
|
# do something if only 1 result is there |
921 |
|
} |
922 |
|
|
923 |
|
=cut |
924 |
|
|
925 |
|
sub count { |
926 |
|
warn "## count ",dump(@_),$/ if ( $debug ); |
927 |
|
return @_ . ''; |
928 |
|
} |
929 |
|
|
930 |
# END |
# END |
931 |
1; |
1; |