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} = |
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}->{missing}->{$sf}++ |
$errors->{$f}->{subfield}->{missing}->{$sf}++ |
207 |
unless defined( $subfields->{$sf} ); |
unless defined( $subfields->{$sf} ); |
208 |
} |
} |
209 |
} |
} |
210 |
|
|
211 |
} |
} |
212 |
} elsif (ref($v) eq 'HASH') { |
} elsif (ref($v) eq 'HASH') { |
213 |
$errors->{field}->{$f}->{unexpected_subfields}++; |
$errors->{$f}->{unexpected_subfields}++; |
214 |
$errors->{field}->{$f}->{dump} = |
$errors->{$f}->{dump} = |
215 |
join('', _pack_subfields_hash( $v, 1 ) ); |
join('', _pack_subfields_hash( $v, 1 ) ); |
216 |
} |
} |
217 |
} |
} |
219 |
|
|
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->{$must}->{missing}++; |
223 |
$errors->{dump} = $rec_dump if ($rec_dump); |
$errors->{dump} = $rec_dump if ($rec_dump); |
224 |
} |
} |
225 |
|
|
272 |
sub report { |
sub report { |
273 |
my $self = shift; |
my $self = shift; |
274 |
|
|
|
my $log = $self->_get_logger(); |
|
|
|
|
275 |
sub unroll { |
sub unroll { |
276 |
my ($tree, $accumulated) = @_; |
my ($self, $tree, $accumulated) = @_; |
277 |
|
|
278 |
|
my $log = $self->_get_logger(); |
279 |
|
|
280 |
$log->debug("# ", |
$log->debug("# ", |
281 |
( $tree ? "tree: $tree " : '' ), |
( $tree ? "tree: $tree " : '' ), |
294 |
|
|
295 |
if ($k eq 'dump') { |
if ($k eq 'dump') { |
296 |
$dump = $tree->{dump}; |
$dump = $tree->{dump}; |
297 |
warn "## dump: $dump\n"; |
warn "## dump: ",dump($dump),"\n"; |
298 |
next; |
next; |
299 |
} |
} |
300 |
|
|
301 |
$log->debug("current: $k"); |
$log->debug("current: $k"); |
302 |
|
|
303 |
my ($new_results, $new_dump) = unroll($tree->{$k}, |
my ($new_results, $new_dump) = $self->unroll($tree->{$k}, |
304 |
$accumulated ? "$accumulated\t$k" : $k |
$accumulated ? "$accumulated\t$k" : $k |
305 |
); |
); |
306 |
|
|
324 |
} |
} |
325 |
} |
} |
326 |
|
|
327 |
|
my $log = $self->_get_logger(); |
328 |
|
|
329 |
my $out = ''; |
my $out = ''; |
330 |
my $e = $self->{errors} || return; |
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) { |
foreach my $mfn (sort keys %$e) { |
340 |
my ($r, $d) = unroll( $e->{$mfn} ); |
$out .= "MFN $mfn\n"; |
341 |
$out .= "MFN $mfn\n", dump($r), "\t$d\n\n"; |
|
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 $out; |
return $out; |