--- trunk/lib/WebPAC/Validate.pm	2006/09/07 16:41:08	654
+++ trunk/lib/WebPAC/Validate.pm	2006/09/13 17:44:57	677
@@ -18,11 +18,11 @@
 
 =head1 VERSION
 
-Version 0.06
+Version 0.09
 
 =cut
 
-our $VERSION = '0.06';
+our $VERSION = '0.09';
 
 =head1 SYNOPSIS
 
@@ -41,6 +41,8 @@
   205! a
   # while 210 can have a c or d
   210 a c d
+  # field which is ignored in validation
+  999-
 
 =head1 FUNCTIONS
 
@@ -86,6 +88,8 @@
 
 		if ($fld =~ s/!$//) {
 			$self->{must_exist}->{$fld}++;
+		} elsif ($fld =~ s/-$//) {
+			$self->{dont_validate}->{$fld}++;
 		}
 
 		$log->logdie("need field name in line $curr_line: $l") unless (defined($fld));
@@ -142,16 +146,19 @@
 
 		next if (!defined($f) || $f eq '' || $f eq '000');
 
+		next if (defined( $self->{dont_validate}->{$f} ));
+
+		# track field usage
 		$fields->{$f}++;
 
 		if ( ! defined($r->{$f}) ) {
-			$errors->{field}->{ $f }->{unexpected} = "this field is not expected";
+			$errors->{ $f }->{unexpected} = "this field is not expected";
 			next;
 		}
 
 
 		if (ref($rec->{$f}) ne 'ARRAY') {
-			$errors->{field}->{ $f }->{not_repeatable} = "probably bug in parsing input data";
+			$errors->{ $f }->{not_repeatable} = "probably bug in parsing input data";
 			next;
 		}
 
@@ -160,10 +167,10 @@
 			if (ref($r->{$f}) eq 'ARRAY') {
 				# are values hashes? (has subfields)
 				if (! defined($v)) {
-					$errors->{field}->{$f}->{empty} = undef;
-					$errors->{dump} = $rec_dump if ($rec_dump);
+#					$errors->{$f}->{empty} = undef;
+#					$errors->{dump} = $rec_dump if ($rec_dump);
 				} elsif (ref($v) ne 'HASH') {
-					$errors->{field}->{$f}->{missing_subfield} = "subfields required for this field";
+					$errors->{$f}->{missing_subfield} = join(",", @{ $r->{$f} }) . " required";
 					next;
 				} else {
 
@@ -185,7 +192,7 @@
 								$sf_repeatable->{$sf}++;
 							};
 							if (! first { $_ eq $sf } @{ $r->{$f} }) {
-								$errors->{field}->{ $f }->{subfield}->{extra}->{$sf}++;
+								$errors->{ $f }->{subfield}->{extra}->{$sf}++;
 							}
 						}
 
@@ -193,9 +200,8 @@
 					if (my @r_sf = sort keys( %$sf_repeatable )) {
 
 						foreach my $sf (@r_sf) {
-							$errors->{field}->{$f}->{subfield}->{repeatable}->{$sf}++;
-							$errors->{field}->{$f}->{dump}->{$f} =
-								join('', _pack_subfields_hash( $h, 1 ) );
+							$errors->{$f}->{subfield}->{extra_repeatable}->{$sf}++;
+							$errors->{$f}->{dump} = _pack_subfields_hash( $h, 1 );
 						}
 
 					}
@@ -203,28 +209,27 @@
 					if ( defined( $self->{must_exist_sf}->{$f} ) ) {
 						foreach my $sf (sort keys %{ $self->{must_exist_sf}->{$f} }) {
 #warn "====> $f $sf must exist\n";
-							$errors->{field}->{$f}->{subfield}->{$sf} = "missing"
+							$errors->{$f}->{subfield}->{missing}->{$sf}++
 								unless defined( $subfields->{$sf} );
 						}
 					}
 
 				}
 			} elsif (ref($v) eq 'HASH') {
-				$errors->{field}->{$f}->{unexpected_subfields}++;
-				$errors->{field}->{$f}->{dump} =
-					join('', _pack_subfields_hash( $v, 1 ) );
+				$errors->{$f}->{unexpected_subfields}++;
+				$errors->{$f}->{dump} = _pack_subfields_hash( $v, 1 );
 			}
 		}
 	}
 
 	foreach my $must (sort keys %{ $self->{must_exist} }) {
 		next if ($fields->{$must});
-		$errors->{field}->{$must}->{missing}++;
+		$errors->{$must}->{missing}++;
 		$errors->{dump} = $rec_dump if ($rec_dump);
 	}
 
 	if ($errors) {
-		$log->debug("errors: ", sub { dump( $errors ) } );
+		$log->debug("errors: ", $self->report_error( $errors ) );
 
 		my $mfn = $rec->{'000'}->[0] || $log->logconfess("record ", dump( $rec ), " doesn't have MFN");
 		$self->{errors}->{$mfn} = $errors;
@@ -261,6 +266,120 @@
 	return $self->{errors};
 }
 
+=head2 report_error
+
+Produce nice humanly readable report of single error
+
+  print $validate->report_error( $error_hash );
+
+=cut
+
+sub report_error {
+	my $self = shift;
+
+	my $h = shift || die "no hash?";
+
+	sub _unroll {
+		my ($self, $tree, $accumulated) = @_;
+
+		my $log = $self->_get_logger();
+
+		$log->debug("# ",
+			( $tree			? "tree: $tree "					: '' ),
+			( $accumulated	? "accumulated: $accumulated "		: '' ),
+		);
+
+		my $results;
+
+		if (ref($tree) ne 'HASH') {
+			return ("$accumulated\t($tree)", undef);
+		}
+
+		my $dump;
+
+		foreach my $k (sort keys %{ $tree }) {
+
+			if ($k eq 'dump') {
+				$dump = $tree->{dump};
+#				warn "## dump: ",dump($dump),"\n";
+				next;
+			}
+
+			$log->debug("current: $k");
+
+			my ($new_results, $new_dump) = $self->_unroll($tree->{$k},
+				$accumulated ? "$accumulated\t$k" : $k
+			);
+
+			$log->debug(
+				( $new_results		? "new_results: " . dump($new_results) ." "	: '' ),
+			);
+
+			push @$results, $new_results if ($new_results);
+			$dump = $new_dump if ($new_dump);
+
+		}
+
+		$log->debug(
+			( $results		? "results: " . dump($results) ." "	: '' ),
+		);
+
+		if ($#$results == 0) {
+			return ($results->[0], $dump);
+		} else {
+			return ($results, $dump);
+		}
+	}
+
+
+	sub _reformat {
+		my $l = shift;
+		$l =~ s/\t/ /g;
+		$l =~ s/_/ /;
+		return $l;
+	}
+
+	my $out = '';
+
+	for my $f (sort keys %{ $h }) {
+		$out .= "$f: ";
+		
+		my ($r, $d) = $self->_unroll( $h->{$f} );
+		my $e;
+		if (ref($r) eq 'ARRAY') {
+			$e .= join(", ", map { _reformat( $_ ) } @$r);
+		} else {
+			$e .= _reformat( $r );
+		}
+		$e .= "\n\t$d" if ($d);
+
+		$out .= $e . "\n";
+	}
+	return $out;
+}
+
+
+=head2 report
+
+Produce nice humanly readable report of errors
+
+  print $validate->report;
+
+=cut
+
+sub report {
+	my $self = shift;
+	my $e = $self->{errors} || return;
+
+	my $out;
+	foreach my $mfn (sort { $a <=> $b } keys %$e) {
+		$out .= "MFN $mfn\n" . $self->report_error( $e->{$mfn} ) . "\n";
+	}
+
+	return $out;
+
+}
+
 =head1 AUTHOR
 
 Dobrica Pavlinusic, C<< <dpavlin@rot13.org> >>