18 |
|
|
19 |
=head1 VERSION |
=head1 VERSION |
20 |
|
|
21 |
Version 0.06 |
Version 0.07 |
22 |
|
|
23 |
=cut |
=cut |
24 |
|
|
25 |
our $VERSION = '0.06'; |
our $VERSION = '0.07'; |
26 |
|
|
27 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
28 |
|
|
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}); |
145 |
$fields->{$f}++; |
$fields->{$f}++; |
146 |
|
|
147 |
if ( ! defined($r->{$f}) ) { |
if ( ! defined($r->{$f}) ) { |
148 |
$errors->{field}->{ $f }->{extra} = "not expected"; |
$errors->{field}->{ $f }->{unexpected} = "this field is not expected"; |
149 |
next; |
next; |
150 |
} |
} |
151 |
|
|
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 (! defined($v)) { |
if (! defined($v)) { |
163 |
$errors->{field}->{$f}->{empty} = undef; |
# $errors->{field}->{$f}->{empty} = undef; |
164 |
$errors->{dump}->{record}++; |
# $errors->{dump} = $rec_dump if ($rec_dump); |
165 |
} elsif (ref($v) ne 'HASH') { |
} elsif (ref($v) ne 'HASH') { |
166 |
$errors->{field}->{$f}->{missing_subfield} = "value without subfields: $v"; |
$errors->{field}->{$f}->{missing_subfield} = join(",", @{ $r->{$f} }) . " required"; |
167 |
next; |
next; |
168 |
} else { |
} else { |
169 |
|
|
185 |
$sf_repeatable->{$sf}++; |
$sf_repeatable->{$sf}++; |
186 |
}; |
}; |
187 |
if (! first { $_ eq $sf } @{ $r->{$f} }) { |
if (! first { $_ eq $sf } @{ $r->{$f} }) { |
188 |
$errors->{field}->{ $f }->{subfield}->{$sf} = "unknown"; |
$errors->{field}->{ $f }->{subfield}->{extra}->{$sf}++; |
189 |
} |
} |
190 |
} |
} |
191 |
|
|
193 |
if (my @r_sf = sort keys( %$sf_repeatable )) { |
if (my @r_sf = sort keys( %$sf_repeatable )) { |
194 |
|
|
195 |
foreach my $sf (@r_sf) { |
foreach my $sf (@r_sf) { |
196 |
$errors->{field}->{$f}->{subfield}->{$sf} = "repeatable"; |
$errors->{field}->{$f}->{subfield}->{extra_repeatable}->{$sf}++; |
197 |
$errors->{dump}->{field}->{$f} = |
$errors->{field}->{$f}->{dump} = |
198 |
join('', _pack_subfields_hash( $h, 1 ) ); |
join('', _pack_subfields_hash( $h, 1 ) ); |
199 |
} |
} |
200 |
|
|
203 |
if ( defined( $self->{must_exist_sf}->{$f} ) ) { |
if ( defined( $self->{must_exist_sf}->{$f} ) ) { |
204 |
foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) { |
foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) { |
205 |
#warn "====> $f $sf must exist\n"; |
#warn "====> $f $sf must exist\n"; |
206 |
$errors->{field}->{$f}->{subfield}->{$sf} = "missing" |
$errors->{field}->{$f}->{subfield}->{missing}->{$sf}++ |
207 |
unless defined( $subfields->{$sf} ); |
unless defined( $subfields->{$sf} ); |
208 |
} |
} |
209 |
} |
} |
211 |
} |
} |
212 |
} elsif (ref($v) eq 'HASH') { |
} elsif (ref($v) eq 'HASH') { |
213 |
$errors->{field}->{$f}->{unexpected_subfields}++; |
$errors->{field}->{$f}->{unexpected_subfields}++; |
214 |
$errors->{dump}->{field}->{$f} = |
$errors->{field}->{$f}->{dump} = |
215 |
join('', _pack_subfields_hash( $v, 1 ) ); |
join('', _pack_subfields_hash( $v, 1 ) ); |
216 |
} |
} |
217 |
} |
} |
220 |
foreach my $must (sort keys %{ $self->{must_exist} }) { |
foreach my $must (sort keys %{ $self->{must_exist} }) { |
221 |
next if ($fields->{$must}); |
next if ($fields->{$must}); |
222 |
$errors->{field}->{$must}->{missing}++; |
$errors->{field}->{$must}->{missing}++; |
223 |
$errors->{dump}->{record}++; |
$errors->{dump} = $rec_dump if ($rec_dump); |
224 |
} |
} |
225 |
|
|
226 |
if ($errors) { |
if ($errors) { |
227 |
$log->debug("errors: ", sub { dump( $errors ) } ); |
$log->debug("errors: ", sub { dump( $errors ) } ); |
228 |
|
|
229 |
my $mfn = $rec->{'000'}->[0]; |
my $mfn = $rec->{'000'}->[0] || $log->logconfess("record ", dump( $rec ), " doesn't have MFN"); |
230 |
$self->{errors}->{$mfn} = $errors; |
$self->{errors}->{$mfn} = $errors; |
231 |
} |
} |
232 |
|
|
235 |
return $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 |
|
my $log = $self->_get_logger(); |
276 |
|
|
277 |
|
sub unroll { |
278 |
|
my ($tree, $accumulated) = @_; |
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\n"; |
298 |
|
next; |
299 |
|
} |
300 |
|
|
301 |
|
$log->debug("current: $k"); |
302 |
|
|
303 |
|
my ($new_results, $new_dump) = 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 $out = ''; |
328 |
|
my $e = $self->{errors} || return; |
329 |
|
|
330 |
|
foreach my $mfn (sort keys %$e) { |
331 |
|
my ($r, $d) = unroll( $e->{$mfn} ); |
332 |
|
$out .= "MFN $mfn\n", dump($r), "\t$d\n\n"; |
333 |
|
} |
334 |
|
|
335 |
|
return $out; |
336 |
|
} |
337 |
|
|
338 |
=head1 AUTHOR |
=head1 AUTHOR |
339 |
|
|
340 |
Dobrica Pavlinusic, C<< <dpavlin@rot13.org> >> |
Dobrica Pavlinusic, C<< <dpavlin@rot13.org> >> |