8 |
use base 'WebPAC::Common'; |
use base 'WebPAC::Common'; |
9 |
use File::Slurp; |
use File::Slurp; |
10 |
use List::Util qw/first/; |
use List::Util qw/first/; |
11 |
use Data::Dumper; |
use Data::Dump qw/dump/; |
12 |
use WebPAC::Normalize qw/_pack_subfields_hash/; |
use WebPAC::Normalize qw/_pack_subfields_hash/; |
13 |
use Storable qw/dclone/; |
use Storable qw/dclone/; |
14 |
|
|
18 |
|
|
19 |
=head1 VERSION |
=head1 VERSION |
20 |
|
|
21 |
Version 0.02 |
Version 0.07 |
22 |
|
|
23 |
=cut |
=cut |
24 |
|
|
25 |
our $VERSION = '0.02'; |
our $VERSION = '0.07'; |
26 |
|
|
27 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
28 |
|
|
34 |
# same with 101 |
# same with 101 |
35 |
101 |
101 |
36 |
# field 200 have valid subfields a-g |
# field 200 have valid subfields a-g |
37 |
200 a b c d e f g |
# and field e is repeatable |
38 |
|
200 a b c d e* f g |
39 |
# field 205 can have only subfield a |
# field 205 can have only subfield a |
40 |
205 a |
# and must exists |
41 |
|
205! a |
42 |
# while 210 can have a c or d |
# while 210 can have a c or d |
43 |
210 a c d |
210 a c d |
44 |
|
|
84 |
|
|
85 |
my $fld = shift @d; |
my $fld = shift @d; |
86 |
|
|
87 |
|
if ($fld =~ s/!$//) { |
88 |
|
$self->{must_exist}->{$fld}++; |
89 |
|
} |
90 |
|
|
91 |
$log->logdie("need field name in line $curr_line: $l") unless (defined($fld)); |
$log->logdie("need field name in line $curr_line: $l") unless (defined($fld)); |
92 |
|
|
93 |
if (@d) { |
if (@d) { |
94 |
$v->{$fld} = \@d; |
$v->{$fld} = [ map { |
95 |
|
my $sf = $_; |
96 |
|
if ( $sf =~ s/!(\*)?$/$1/ ) { |
97 |
|
$self->{must_exist_sf}->{ $fld }->{ $sf }++; |
98 |
|
}; |
99 |
|
$sf; |
100 |
|
} @d ]; |
101 |
} else { |
} else { |
102 |
$v->{$fld} = 1; |
$v->{$fld} = 1; |
103 |
} |
} |
104 |
|
|
105 |
} |
} |
106 |
|
|
107 |
$log->debug("current validation rules: ", Dumper($v)); |
$log->debug("current validation rules: ", dump($v)); |
108 |
|
|
109 |
$self->{rules} = $v; |
$self->{rules} = $v; |
110 |
|
|
117 |
|
|
118 |
Validate record and return errors |
Validate record and return errors |
119 |
|
|
120 |
my @errors = $validate->validate_errors( $rec ); |
my @errors = $validate->validate_errors( $rec, $rec_dump ); |
121 |
|
|
122 |
=cut |
=cut |
123 |
|
|
127 |
my $log = $self->_get_logger(); |
my $log = $self->_get_logger(); |
128 |
|
|
129 |
my $rec = shift || $log->logdie("validate_errors need record"); |
my $rec = shift || $log->logdie("validate_errors need record"); |
130 |
|
my $rec_dump = shift; |
131 |
|
|
132 |
$log->logdie("rec isn't HASH") unless (ref($rec) eq 'HASH'); |
$log->logdie("rec isn't HASH") unless (ref($rec) eq 'HASH'); |
133 |
$log->logdie("can't find validation rules") unless (my $r = $self->{rules}); |
$log->logdie("can't find validation rules") unless (my $r = $self->{rules}); |
134 |
|
|
135 |
my @errors; |
my $errors; |
136 |
|
|
137 |
|
$log->debug("rec = ", sub { dump($rec) }, "keys = ", keys %{ $rec }); |
138 |
|
|
139 |
$log->debug("rec = ", sub { Dumper($rec) }, "keys = ", keys %{ $rec }); |
my $fields; |
140 |
|
|
141 |
foreach my $f (keys %{ $rec }) { |
foreach my $f (keys %{ $rec }) { |
142 |
|
|
143 |
next if (!defined($f) || $f eq '' || $f eq '000'); |
next if (!defined($f) || $f eq '' || $f eq '000'); |
144 |
|
|
145 |
if (! defined($r->{$f})) { |
$fields->{$f}++; |
146 |
push @errors, "field '$f' shouldn't exists"; |
|
147 |
|
if ( ! defined($r->{$f}) ) { |
148 |
|
$errors->{ $f }->{unexpected} = "this field is not expected"; |
149 |
next; |
next; |
150 |
} |
} |
151 |
|
|
152 |
|
|
153 |
if (ref($rec->{$f}) ne 'ARRAY') { |
if (ref($rec->{$f}) ne 'ARRAY') { |
154 |
push @errors, "field '$f' isn't repetable, probably bug in parsing input data"; |
$errors->{ $f }->{not_repeatable} = "probably bug in parsing input data"; |
155 |
next; |
next; |
156 |
} |
} |
157 |
|
|
159 |
# can we have subfields? |
# can we have subfields? |
160 |
if (ref($r->{$f}) eq 'ARRAY') { |
if (ref($r->{$f}) eq 'ARRAY') { |
161 |
# are values hashes? (has subfields) |
# are values hashes? (has subfields) |
162 |
if (ref($v) ne 'HASH') { |
if (! defined($v)) { |
163 |
push @errors, "$f has value without subfields: $v"; |
# $errors->{$f}->{empty} = undef; |
164 |
|
# $errors->{dump} = $rec_dump if ($rec_dump); |
165 |
|
} elsif (ref($v) ne 'HASH') { |
166 |
|
$errors->{$f}->{missing_subfield} = join(",", @{ $r->{$f} }) . " required"; |
167 |
next; |
next; |
168 |
} else { |
} else { |
169 |
|
|
170 |
my $h = dclone( $v ); |
my $h = dclone( $v ); |
171 |
|
|
172 |
|
my $sf_repeatable; |
173 |
|
|
174 |
delete($v->{subfields}) if (defined($v->{subfields})); |
delete($v->{subfields}) if (defined($v->{subfields})); |
175 |
|
|
176 |
|
my $subfields; |
177 |
|
|
178 |
foreach my $sf (keys %{ $v }) { |
foreach my $sf (keys %{ $v }) { |
179 |
|
|
180 |
# permited subfield? |
$subfields->{ $sf }++; |
181 |
if (! first { $_ eq $sf } @{ $r->{$f} }) { |
|
182 |
push @errors, "$f has unknown subfield: $sf"; |
# is non-repeatable but with multiple values? |
183 |
|
if ( ! first { $_ eq $sf.'*' } @{$r->{$f}} ) { |
184 |
|
if ( ref($v->{$sf}) eq 'ARRAY' ) { |
185 |
|
$sf_repeatable->{$sf}++; |
186 |
|
}; |
187 |
|
if (! first { $_ eq $sf } @{ $r->{$f} }) { |
188 |
|
$errors->{ $f }->{subfield}->{extra}->{$sf}++; |
189 |
|
} |
190 |
} |
} |
191 |
|
|
192 |
# is repeatable? |
} |
193 |
if ( ref($v->{$sf}) eq 'ARRAY' ) { |
if (my @r_sf = sort keys( %$sf_repeatable )) { |
194 |
push @errors, "$f subfield $sf is repeatable: " . |
|
195 |
join('', _pack_subfields_hash( dclone($h), 1) ); |
foreach my $sf (@r_sf) { |
196 |
### FIXME |
$errors->{$f}->{subfield}->{extra_repeatable}->{$sf}++; |
197 |
|
$errors->{$f}->{dump} = |
198 |
|
join('', _pack_subfields_hash( $h, 1 ) ); |
199 |
} |
} |
200 |
|
|
201 |
} |
} |
202 |
|
|
203 |
|
if ( defined( $self->{must_exist_sf}->{$f} ) ) { |
204 |
|
foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) { |
205 |
|
#warn "====> $f $sf must exist\n"; |
206 |
|
$errors->{$f}->{subfield}->{missing}->{$sf}++ |
207 |
|
unless defined( $subfields->{$sf} ); |
208 |
|
} |
209 |
|
} |
210 |
|
|
211 |
} |
} |
212 |
} elsif (ref($v) eq 'HASH') { |
} elsif (ref($v) eq 'HASH') { |
213 |
push @errors, "$f has subfields which is not valid"; |
$errors->{$f}->{unexpected_subfields}++; |
214 |
|
$errors->{$f}->{dump} = |
215 |
|
join('', _pack_subfields_hash( $v, 1 ) ); |
216 |
} |
} |
217 |
} |
} |
218 |
} |
} |
219 |
|
|
220 |
|
foreach my $must (sort keys %{ $self->{must_exist} }) { |
221 |
|
next if ($fields->{$must}); |
222 |
|
$errors->{$must}->{missing}++; |
223 |
|
$errors->{dump} = $rec_dump if ($rec_dump); |
224 |
|
} |
225 |
|
|
226 |
|
if ($errors) { |
227 |
|
$log->debug("errors: ", sub { dump( $errors ) } ); |
228 |
|
|
229 |
|
my $mfn = $rec->{'000'}->[0] || $log->logconfess("record ", dump( $rec ), " doesn't have MFN"); |
230 |
|
$self->{errors}->{$mfn} = $errors; |
231 |
|
} |
232 |
|
|
233 |
#$log->logcluck("return from this function is ARRAY") unless wantarray; |
#$log->logcluck("return from this function is ARRAY") unless wantarray; |
234 |
|
|
235 |
$log->debug("errors: ", join(", ", @errors)) if (@errors); |
return $errors; |
236 |
|
} |
237 |
|
|
238 |
|
=head2 reset_errors |
239 |
|
|
240 |
|
Clean all accumulated errors for this input |
241 |
|
|
242 |
|
$validate->reset_errors; |
243 |
|
|
244 |
|
=cut |
245 |
|
|
246 |
|
sub reset_errors { |
247 |
|
my $self = shift; |
248 |
|
delete ($self->{errors}); |
249 |
|
} |
250 |
|
|
251 |
|
=head2 all_errors |
252 |
|
|
253 |
|
Return hash with all errors |
254 |
|
|
255 |
|
print dump( $validate->all_errors ); |
256 |
|
|
257 |
|
=cut |
258 |
|
|
259 |
|
sub all_errors { |
260 |
|
my $self = shift; |
261 |
|
return $self->{errors}; |
262 |
|
} |
263 |
|
|
264 |
|
=head2 report |
265 |
|
|
266 |
|
Produce nice humanly readable report of errors |
267 |
|
|
268 |
|
print $validate->report; |
269 |
|
|
270 |
|
=cut |
271 |
|
|
272 |
|
sub report { |
273 |
|
my $self = shift; |
274 |
|
|
275 |
|
sub unroll { |
276 |
|
my ($self, $tree, $accumulated) = @_; |
277 |
|
|
278 |
|
my $log = $self->_get_logger(); |
279 |
|
|
280 |
|
$log->debug("# ", |
281 |
|
( $tree ? "tree: $tree " : '' ), |
282 |
|
( $accumulated ? "accumulated: $accumulated " : '' ), |
283 |
|
); |
284 |
|
|
285 |
|
my $results; |
286 |
|
|
287 |
|
if (ref($tree) ne 'HASH') { |
288 |
|
return ("$accumulated\t($tree)", undef); |
289 |
|
} |
290 |
|
|
291 |
|
my $dump; |
292 |
|
|
293 |
|
foreach my $k (sort keys %{ $tree }) { |
294 |
|
|
295 |
|
if ($k eq 'dump') { |
296 |
|
$dump = $tree->{dump}; |
297 |
|
warn "## dump: ",dump($dump),"\n"; |
298 |
|
next; |
299 |
|
} |
300 |
|
|
301 |
|
$log->debug("current: $k"); |
302 |
|
|
303 |
|
my ($new_results, $new_dump) = $self->unroll($tree->{$k}, |
304 |
|
$accumulated ? "$accumulated\t$k" : $k |
305 |
|
); |
306 |
|
|
307 |
|
$log->debug( |
308 |
|
( $new_results ? "new_results: " . dump($new_results) ." " : '' ), |
309 |
|
); |
310 |
|
|
311 |
|
push @$results, $new_results if ($new_results); |
312 |
|
$dump = $new_dump if ($new_dump); |
313 |
|
|
314 |
|
} |
315 |
|
|
316 |
|
$log->debug( |
317 |
|
( $results ? "results: " . dump($results) ." " : '' ), |
318 |
|
); |
319 |
|
|
320 |
|
if ($#$results == 0) { |
321 |
|
return ($results->[0], $dump); |
322 |
|
} else { |
323 |
|
return ($results, $dump); |
324 |
|
} |
325 |
|
} |
326 |
|
|
327 |
|
my $log = $self->_get_logger(); |
328 |
|
|
329 |
|
my $out = ''; |
330 |
|
my $e = $self->{errors} || return; |
331 |
|
|
332 |
|
sub reformat { |
333 |
|
my $l = shift; |
334 |
|
$l =~ s/\t/ /g; |
335 |
|
$l =~ s/_/ /; |
336 |
|
return $l; |
337 |
|
} |
338 |
|
|
339 |
|
foreach my $mfn (sort keys %$e) { |
340 |
|
$out .= "MFN $mfn\n"; |
341 |
|
|
342 |
|
for my $f (sort keys %{ $e->{$mfn} }) { |
343 |
|
my ($r, $d) = $self->unroll( $e->{$mfn}->{$f} ); |
344 |
|
my $e = $f . ': '; |
345 |
|
if (ref($r) eq 'ARRAY') { |
346 |
|
$e .= join(", ", map { reformat( $_ ) } @$r); |
347 |
|
} else { |
348 |
|
$e .= reformat( $r ); |
349 |
|
} |
350 |
|
$e .= "\n\t$d" if ($d); |
351 |
|
$e .= "\n"; |
352 |
|
$log->debug("MFN $mfn | $e"); |
353 |
|
$out .= $e; |
354 |
|
} |
355 |
|
} |
356 |
|
|
357 |
return @errors; |
return $out; |
358 |
} |
} |
359 |
|
|
360 |
=head1 AUTHOR |
=head1 AUTHOR |