18 |
|
|
19 |
=head1 VERSION |
=head1 VERSION |
20 |
|
|
21 |
Version 0.07 |
Version 0.08 |
22 |
|
|
23 |
=cut |
=cut |
24 |
|
|
25 |
our $VERSION = '0.07'; |
our $VERSION = '0.08'; |
26 |
|
|
27 |
=head1 SYNOPSIS |
=head1 SYNOPSIS |
28 |
|
|
145 |
$fields->{$f}++; |
$fields->{$f}++; |
146 |
|
|
147 |
if ( ! defined($r->{$f}) ) { |
if ( ! defined($r->{$f}) ) { |
148 |
$errors->{field}->{ $f }->{unexpected} = "this field is not expected"; |
$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 |
$errors->{field}->{ $f }->{not_repeatable} = "probably bug in parsing input data"; |
$errors->{ $f }->{not_repeatable} = "probably bug in parsing input data"; |
155 |
next; |
next; |
156 |
} |
} |
157 |
|
|
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->{$f}->{empty} = undef; |
164 |
# $errors->{dump} = $rec_dump if ($rec_dump); |
# $errors->{dump} = $rec_dump if ($rec_dump); |
165 |
} elsif (ref($v) ne 'HASH') { |
} elsif (ref($v) ne 'HASH') { |
166 |
$errors->{field}->{$f}->{missing_subfield} = join(",", @{ $r->{$f} }) . " required"; |
$errors->{$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}->{extra}->{$sf}++; |
$errors->{ $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}->{extra_repeatable}->{$sf}++; |
$errors->{$f}->{subfield}->{extra_repeatable}->{$sf}++; |
197 |
$errors->{field}->{$f}->{dump} = |
$errors->{$f}->{dump} = _pack_subfields_hash( $h, 1 ); |
|
join('', _pack_subfields_hash( $h, 1 ) ); |
|
198 |
} |
} |
199 |
|
|
200 |
} |
} |
202 |
if ( defined( $self->{must_exist_sf}->{$f} ) ) { |
if ( defined( $self->{must_exist_sf}->{$f} ) ) { |
203 |
foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) { |
foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) { |
204 |
#warn "====> $f $sf must exist\n"; |
#warn "====> $f $sf must exist\n"; |
205 |
$errors->{field}->{$f}->{subfield}->{missing}->{$sf}++ |
$errors->{$f}->{subfield}->{missing}->{$sf}++ |
206 |
unless defined( $subfields->{$sf} ); |
unless defined( $subfields->{$sf} ); |
207 |
} |
} |
208 |
} |
} |
209 |
|
|
210 |
} |
} |
211 |
} elsif (ref($v) eq 'HASH') { |
} elsif (ref($v) eq 'HASH') { |
212 |
$errors->{field}->{$f}->{unexpected_subfields}++; |
$errors->{$f}->{unexpected_subfields}++; |
213 |
$errors->{field}->{$f}->{dump} = |
$errors->{$f}->{dump} = _pack_subfields_hash( $v, 1 ); |
|
join('', _pack_subfields_hash( $v, 1 ) ); |
|
214 |
} |
} |
215 |
} |
} |
216 |
} |
} |
217 |
|
|
218 |
foreach my $must (sort keys %{ $self->{must_exist} }) { |
foreach my $must (sort keys %{ $self->{must_exist} }) { |
219 |
next if ($fields->{$must}); |
next if ($fields->{$must}); |
220 |
$errors->{field}->{$must}->{missing}++; |
$errors->{$must}->{missing}++; |
221 |
$errors->{dump} = $rec_dump if ($rec_dump); |
$errors->{dump} = $rec_dump if ($rec_dump); |
222 |
} |
} |
223 |
|
|
271 |
my $self = shift; |
my $self = shift; |
272 |
|
|
273 |
sub unroll { |
sub unroll { |
274 |
my ($rest,$o, $dump) = @_; |
my ($self, $tree, $accumulated) = @_; |
275 |
|
|
276 |
#warn "# rest: $rest o: $o\n"; |
my $log = $self->_get_logger(); |
277 |
|
|
278 |
return unless ($rest); |
$log->debug("# ", |
279 |
|
( $tree ? "tree: $tree " : '' ), |
280 |
|
( $accumulated ? "accumulated: $accumulated " : '' ), |
281 |
|
); |
282 |
|
|
283 |
if (ref($rest) ne 'HASH') { |
my $results; |
284 |
$o .= "($rest)"; |
|
285 |
return ($o,$dump); |
if (ref($tree) ne 'HASH') { |
286 |
|
return ("$accumulated\t($tree)", undef); |
287 |
} |
} |
288 |
|
|
289 |
foreach my $k (sort keys %{ $rest }) { |
my $dump; |
290 |
|
|
291 |
|
foreach my $k (sort keys %{ $tree }) { |
292 |
|
|
293 |
if ($k eq 'dump') { |
if ($k eq 'dump') { |
294 |
$dump = $rest->{dump}; |
$dump = $tree->{dump}; |
295 |
warn "## dump: $dump\n"; |
# warn "## dump: ",dump($dump),"\n"; |
296 |
next; |
next; |
297 |
} |
} |
|
my $u; |
|
|
($u, $dump) = unroll($rest->{$k}, $o, $dump); |
|
|
$o .= "$k $u"; |
|
298 |
|
|
299 |
|
$log->debug("current: $k"); |
300 |
|
|
301 |
|
my ($new_results, $new_dump) = $self->unroll($tree->{$k}, |
302 |
|
$accumulated ? "$accumulated\t$k" : $k |
303 |
|
); |
304 |
|
|
305 |
|
$log->debug( |
306 |
|
( $new_results ? "new_results: " . dump($new_results) ." " : '' ), |
307 |
|
); |
308 |
|
|
309 |
|
push @$results, $new_results if ($new_results); |
310 |
|
$dump = $new_dump if ($new_dump); |
311 |
|
|
312 |
} |
} |
313 |
return ($o,$dump); |
|
314 |
|
$log->debug( |
315 |
|
( $results ? "results: " . dump($results) ." " : '' ), |
316 |
|
); |
317 |
|
|
318 |
|
if ($#$results == 0) { |
319 |
|
return ($results->[0], $dump); |
320 |
|
} else { |
321 |
|
return ($results, $dump); |
322 |
|
} |
323 |
} |
} |
324 |
|
|
325 |
|
my $log = $self->_get_logger(); |
326 |
|
|
327 |
my $out = ''; |
my $out = ''; |
328 |
|
my $e = $self->{errors} || return; |
329 |
|
|
330 |
|
sub reformat { |
331 |
|
my $l = shift; |
332 |
|
$l =~ s/\t/ /g; |
333 |
|
$l =~ s/_/ /; |
334 |
|
return $l; |
335 |
|
} |
336 |
|
|
337 |
foreach my $mfn (sort keys %{ $self->{errors} }) { |
foreach my $mfn (sort keys %$e) { |
338 |
my ($msg,$dump) = unroll( $self->{errors}->{$mfn}, '', '' ); |
$out .= "MFN $mfn\n"; |
339 |
$out .= "MFN $mfn\n$msg\t$dump\n\n"; |
|
340 |
|
for my $f (sort keys %{ $e->{$mfn} }) { |
341 |
|
my ($r, $d) = $self->unroll( $e->{$mfn}->{$f} ); |
342 |
|
my $e = $f . ': '; |
343 |
|
if (ref($r) eq 'ARRAY') { |
344 |
|
$e .= join(", ", map { reformat( $_ ) } @$r); |
345 |
|
} else { |
346 |
|
$e .= reformat( $r ); |
347 |
|
} |
348 |
|
$e .= "\n\t$d" if ($d); |
349 |
|
$e .= "\n"; |
350 |
|
$log->debug("MFN $mfn | $e"); |
351 |
|
$out .= $e; |
352 |
|
} |
353 |
} |
} |
354 |
|
|
355 |
return $out; |
return $out; |