# $region{NAME}{Adj}[]{DisplayName}[]
# $region{NAME}{Adj}[]{Pattern}
# $region{NAME}{Adj}[]{Regexp}
-# $region{NAME}{Adj}[]{Dikes}
+# $region{NAME}{Adj}[]{Dykes}
# $region{NAME}{Adj}[]{L}
our %adj;
-# $adj{EARLIER}{LATER}{Dikes}
+# $adj{EARLIER}{LATER}{Dykes}
# $adj{EARLIER}{LATER}{L}[]
# $adj{EARLIER}{LATER}{T}[]
$cregion = $name;
next;
}
- if (my ($aref, $adikes) = m{^\t\t(\S.*[A-Za-z.]|L2?)(?: (\+\+?))?$}) {
- my $adj = { Dikes => (length $adikes // 0), L => $. };
+ if (my ($aref, $adykes) = m{^\t\t(\S.*[A-Za-z.]|L2?)(?: (\+\+?))?$}) {
+ my $adj = { Dykes => (length $adykes // 0), L => $. };
if ($aref =~ m{\.}) {
$adj->{Pattern} = $aref;
$aref =~ s{\-}{[^- ]*-}g;
push @{ $adj{$r0}{$r1}{L} }, $adja->{L};
push @{ $adj{$r0}{$r1}{T} }, substr($ra,0,1)."#".$adji;
my $e = $adj{$r0}{$r1};
- $e->{Dikes} //= $adja->{Dikes};
- confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dikes} $adja->{Dikes} ?"
- unless $e->{Dikes} == $adja->{Dikes};
+ $e->{Dykes} //= $adja->{Dykes};
+ confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dykes} $adja->{Dykes} ?"
+ unless $e->{Dykes} == $adja->{Dykes};
}
}
- my $ndikes = 0;
+ my $ndykes = 0;
foreach my $r0 (sort keys %adj) {
foreach my $r1 (sort keys %{ $adj{$r0} }) {
my $e = $adj{$r0}{$r1};
confess "$r0 / $r1 : @{ $e->{L} } ?" unless @{ $e->{L} } == 2;
- $ndikes += $e->{Dikes};
+ $ndykes += $e->{Dykes};
}
}
- #print STDERR "total $ndikes dikes\n";
+ #print STDERR "total $ndykes dykes\n";
}
sub names () {