10 our @ISA = qw(Exporter);
11 our @EXPORT = qw(parse_input_graph o plag_prs %region);
14 # $region{NAME}{Colour}
15 # $region{NAME}{Water}
16 # $region{NAME}{L} # line number
17 # $region{NAME}{Adj}[]{Name}
18 # $region{NAME}{Adj}[]{Pattern}
19 # $region{NAME}{Adj}[]{Regexp}
20 # $region{NAME}{Adj}[]{Dikes}
21 # $region{NAME}{Adj}[]{L}
24 # $adj{EARLIER}{LATER}{Dikes}
25 # $adj{EARLIER}{LATER}{L}[]
26 # $adj{EARLIER}{LATER}{T}[]
40 if (my ($name, $water) = m{^\t(\S.*\w|L)(?: \[(\d+)\])?$}) {
41 confess unless defined $ccolour;
42 confess "$name ?" if $region{$name};
43 $region{$name}{Colour} = $ccolour;
44 $region{$name}{Water} = $water;
45 $region{$name}{L} = $.;
49 if (my ($aref, $adikes) = m{^\t\t(\S.*[A-Za-z.]|L)(?: (\+\+?))?$}) {
50 my $adj = { Dikes => (length $adikes // 0), L => $. };
52 $adj->{Pattern} = $aref;
53 $aref =~ s{\-}{[^- ]*-}g;
55 length $& eq 1 ? qr{[^- ]* ?} :
56 length $& eq 2 ? qr{.*} : confess "$aref"
58 $adj->{Regexp} = $aref;
62 push @{ $region{$cregion}{Adj} }, $adj;
69 sub unique_aref ($$) {
71 my $re = $adja->{Regexp};
72 return $adja->{Name} unless defined $re;
74 foreach my $rb (sort keys %region) {
75 #print STDERR "?? $ra -> $re $rb ?\n";
76 foreach my $adjb (@{ $region{$rb}{Adj} }) {
77 my $adjbn = $adjb->{Name};
78 next unless defined $adjbn;
79 #print STDERR "?? $ra -> $re $rb ?? $adjbn\n";
80 next unless $adjbn eq $ra;
81 push @cands, [ $rb, "$region{$rb}{L},$adjb->{L}" ];
84 my @found = grep { $_->[0] =~ m{^$re$} } @cands;
86 join ' / ', map { "$_->[0] ($_->[1])" } @_;
88 confess "$adja->{L} $adja->{Pattern} /$re/ | ".$pr->(@cands)
89 ." | ".$pr->(@found)." | ?"
92 #print STDERR "resolve $ra -> $adja->{Pattern} = $r\n";
97 ($a eq 'L' ) <=> ($b eq 'L' ) or
98 ($a eq 'NZ') <=> ($b eq 'NZ') or
102 sub resolve_arefs () {
103 #print Dumper(\%region);
104 foreach my $ra (sort keys %region) {
105 foreach my $adj (@{ $region{$ra}{Adj} }) {
106 next if defined $adj->{Name};
107 $adj->{ProspectiveName} = unique_aref $ra, $adj;
110 foreach my $ra (sort keys %region) {
111 foreach my $adj (@{ $region{$ra}{Adj} }) {
112 $adj->{Name} //= $adj->{ProspectiveName};
115 foreach my $ra (sort keys %region) {
116 foreach my $adj (@{ $region{$ra}{Adj} }) {
117 confess unless $adj->{Name} eq unique_aref $ra, $adj;
123 foreach my $ra (sort keys %region) {
124 my $adjs = $region{$ra}{Adj};
125 foreach my $adji (0..$#$adjs) {
126 my $adja = $adjs->[$adji];
127 my $rb = $adja->{Name};
128 my ($r0,$r1) = sort region_cmp ($ra,$rb);
129 push @{ $adj{$r0}{$r1}{L} }, $adja->{L};
130 push @{ $adj{$r0}{$r1}{T} }, substr($ra,0,1)."#".$adji;
131 my $e = $adj{$r0}{$r1};
132 $e->{Dikes} //= $adja->{Dikes};
133 confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dikes} $adja->{Dikes} ?"
134 unless $e->{Dikes} == $adja->{Dikes};
138 foreach my $r0 (sort keys %adj) {
139 foreach my $r1 (sort keys %{ $adj{$r0} }) {
140 my $e = $adj{$r0}{$r1};
141 confess "$r0 / $r1 : @{ $e->{L} } ?" unless @{ $e->{L} } == 2;
142 $ndikes += $e->{Dikes};
145 #print STDERR "total $ndikes dikes\n";
148 sub edge_id_to_other_id ($$) {
149 my ($ra, $adjia) = @_;
150 my $adjsa = $region{$ra}{Adj};
151 my $adja = $adjsa->[$adjia];
152 my $rb = $adja->{Name};
153 my $adjsb = $region{$rb}{Adj};
154 foreach my $adjib (0..$#$adjsb) {
155 my $adjb = $adjsb->[$adjib];
156 next unless $adjb->{Name} eq $ra;
157 # $adjb is the same edge seen from the other side
158 return ($rb, $adjib);
160 confess "$ra $adjia ?";
163 sub o { print @_ or die $!; }
167 $t = $` if $t =~ m/\n/;
173 sub parse_input_graph () {