while (<>) {
next if m{^\s*\#};
next unless m{\S};
- s{\s+$}{};
- chomp or confess;
+ s{\s+$}{} or confess;
if (m{^\w+}) {
$ccolour = $&;
next;
}
if (my ($aref, $adykes) = m{^\t\t(\S.*\S)(?: (\+\+?))$}) {
my $adj = { Dykes => length $adykes };
- if ($aref =~ {\.}) {
+ if ($aref =~ m{\.}) {
$aref =~ s{\-}{[^- ]*-};
$aref =~ s{\.}{[^- ]* ?};
$adj->{Regexp} = $aref;
sub unique_aref ($$) {
my ($ra, $adja) = @_;
- my $re = $adj->{Regexp};
- return $adj->{Name} unless defined $re;
+ my $re = $adja->{Regexp};
+ return $adja->{Name} unless defined $re;
my @found;
foreach my $rb (sort keys %region) {
next unless $rb =~ m{^$re$};
}
sub resolve_arefs () {
- foreach my $ra (sort keys $region) {
+ foreach my $ra (sort keys %region) {
foreach my $adj (@{ $region{$ra}{Adj} }) {
next if defined $adj->{Name};
$adj->{ProspectiveName} = unique_aref $ra, $adj;
}
}
- foreach my $ra (sort keys $region) {
+ foreach my $ra (sort keys %region) {
foreach my $adj (@{ $region{$ra}{Adj} }) {
$adj->{Name} //= $adj->{ProspectiveName};
}
}
- foreach my $ra (sort keys $region) {
+ foreach my $ra (sort keys %region) {
foreach my $adj (@{ $region{$ra}{Adj} }) {
confess unless $adj->{Name} eq unique_aref $ra, $adj;
}