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 |
|
|
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} = $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} = "subfields required for this field"; |
$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} = "found extra subfield $sf which shouldn't exist"; |
$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->{field}->{$f}->{dump}->{$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 |
} |
} |
261 |
return $self->{errors}; |
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 ($rest,$o, $dump) = @_; |
277 |
|
|
278 |
|
#warn "# rest: $rest o: $o\n"; |
279 |
|
|
280 |
|
return unless ($rest); |
281 |
|
|
282 |
|
if (ref($rest) ne 'HASH') { |
283 |
|
$o .= "($rest)"; |
284 |
|
return ($o,$dump); |
285 |
|
} |
286 |
|
|
287 |
|
foreach my $k (sort keys %{ $rest }) { |
288 |
|
|
289 |
|
if ($k eq 'dump') { |
290 |
|
$dump = $rest->{dump}; |
291 |
|
warn "## dump: $dump\n"; |
292 |
|
next; |
293 |
|
} |
294 |
|
my $u; |
295 |
|
($u, $dump) = unroll($rest->{$k}, $o, $dump); |
296 |
|
$o .= "$k $u"; |
297 |
|
|
298 |
|
|
299 |
|
} |
300 |
|
return ($o,$dump); |
301 |
|
} |
302 |
|
|
303 |
|
my $out = ''; |
304 |
|
|
305 |
|
foreach my $mfn (sort keys %{ $self->{errors} }) { |
306 |
|
my ($msg,$dump) = unroll( $self->{errors}->{$mfn}, '', '' ); |
307 |
|
$out .= "MFN $mfn\n$msg\t$dump\n\n"; |
308 |
|
} |
309 |
|
|
310 |
|
return $out; |
311 |
|
} |
312 |
|
|
313 |
=head1 AUTHOR |
=head1 AUTHOR |
314 |
|
|
315 |
Dobrica Pavlinusic, C<< <dpavlin@rot13.org> >> |
Dobrica Pavlinusic, C<< <dpavlin@rot13.org> >> |