10 our @ISA = qw(Exporter);
11 our @EXPORT = qw(parse_input_graph o plag_prs %region);
14 # $region{NAME}{Colour}
15 # $region{NAME}{Water}
17 # $region{NAME}{L} # line number
18 # $region{NAME}{Adj}[]{Name}
19 # $region{NAME}{Adj}[]{Pattern}
20 # $region{NAME}{Adj}[]{Regexp}
21 # $region{NAME}{Adj}[]{Dikes}
22 # $region{NAME}{Adj}[]{L}
25 # $adj{EARLIER}{LATER}{Dikes}
26 # $adj{EARLIER}{LATER}{L}[]
27 # $adj{EARLIER}{LATER}{T}[]
41 if (my ($name, $water) = m{^\t(\S.*\w|L)(?: \[(\d+)\])?$}) {
42 confess unless defined $ccolour;
43 confess "$name ?" if $region{$name};
44 $region{$name}{Colour} = $ccolour;
45 $region{$name}{Water} = $water;
46 $region{$name}{L} = $.;
50 if (my ($aref, $adikes) = m{^\t\t(\S.*[A-Za-z.]|L)(?: (\+\+?))?$}) {
51 my $adj = { Dikes => (length $adikes // 0), L => $. };
53 $adj->{Pattern} = $aref;
54 $aref =~ s{\-}{[^- ]*-}g;
56 length $& eq 1 ? qr{[^- ]* ?} :
57 length $& eq 2 ? qr{.*} : confess "$aref"
59 $adj->{Regexp} = $aref;
63 push @{ $region{$cregion}{Adj} }, $adj;
70 sub unique_aref ($$) {
72 my $re = $adja->{Regexp};
73 return $adja->{Name} unless defined $re;
75 foreach my $rb (sort keys %region) {
76 #print STDERR "?? $ra -> $re $rb ?\n";
77 foreach my $adjb (@{ $region{$rb}{Adj} }) {
78 my $adjbn = $adjb->{Name};
79 next unless defined $adjbn;
80 #print STDERR "?? $ra -> $re $rb ?? $adjbn\n";
81 next unless $adjbn eq $ra;
82 push @cands, [ $rb, "$region{$rb}{L},$adjb->{L}" ];
85 my @found = grep { $_->[0] =~ m{^$re$} } @cands;
87 join ' / ', map { "$_->[0] ($_->[1])" } @_;
89 confess "$adja->{L} $adja->{Pattern} /$re/ | ".$pr->(@cands)
90 ." | ".$pr->(@found)." | ?"
93 #print STDERR "resolve $ra -> $adja->{Pattern} = $r\n";
98 ($a eq 'L' ) <=> ($b eq 'L' ) or
99 ($a eq 'NZ') <=> ($b eq 'NZ') or
103 sub resolve_arefs () {
104 #print Dumper(\%region);
105 foreach my $ra (sort keys %region) {
106 foreach my $adj (@{ $region{$ra}{Adj} }) {
107 next if defined $adj->{Name};
108 $adj->{ProspectiveName} = unique_aref $ra, $adj;
111 foreach my $ra (sort keys %region) {
112 foreach my $adj (@{ $region{$ra}{Adj} }) {
113 $adj->{Name} //= $adj->{ProspectiveName};
116 foreach my $ra (sort keys %region) {
117 foreach my $adj (@{ $region{$ra}{Adj} }) {
118 confess unless $adj->{Name} eq unique_aref $ra, $adj;
124 foreach my $ra (sort keys %region) {
125 my $adjs = $region{$ra}{Adj};
126 foreach my $adji (0..$#$adjs) {
127 my $adja = $adjs->[$adji];
128 my $rb = $adja->{Name};
129 my ($r0,$r1) = sort region_cmp ($ra,$rb);
130 push @{ $adj{$r0}{$r1}{L} }, $adja->{L};
131 push @{ $adj{$r0}{$r1}{T} }, substr($ra,0,1)."#".$adji;
132 my $e = $adj{$r0}{$r1};
133 $e->{Dikes} //= $adja->{Dikes};
134 confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dikes} $adja->{Dikes} ?"
135 unless $e->{Dikes} == $adja->{Dikes};
139 foreach my $r0 (sort keys %adj) {
140 foreach my $r1 (sort keys %{ $adj{$r0} }) {
141 my $e = $adj{$r0}{$r1};
142 confess "$r0 / $r1 : @{ $e->{L} } ?" unless @{ $e->{L} } == 2;
143 $ndikes += $e->{Dikes};
146 #print STDERR "total $ndikes dikes\n";
150 foreach my $r (sort keys %region) {
151 $region{$r}{Name} = $r;
155 sub edge_id_to_other_id ($$) {
156 my ($ra, $adjia) = @_;
157 my $adjsa = $region{$ra}{Adj};
158 my $adja = $adjsa->[$adjia];
159 my $rb = $adja->{Name};
160 my $adjsb = $region{$rb}{Adj};
161 foreach my $adjib (0..$#$adjsb) {
162 my $adjb = $adjsb->[$adjib];
163 next unless $adjb->{Name} eq $ra;
164 # $adjb is the same edge seen from the other side
165 return ($rb, $adjib);
167 confess "$ra $adjia ?";
170 sub o { print @_ or die $!; }
174 $t = $` if $t =~ m/\n/;
180 sub parse_input_graph () {