10 our @ISA = qw(Exporter);
11 our @EXPORT = qw(parse_input_graph o plag_prs %region %c);
14 require 'misc-data.pl';
17 # $region{NAME}{Colour}
18 # $region{NAME}{Water}
20 # $region{NAME}{L} # line number
21 # $region{NAME}{Adj}[]{Name}
22 # $region{NAME}{Adj}[]{DisplayName}[]
23 # $region{NAME}{Adj}[]{Pattern}
24 # $region{NAME}{Adj}[]{Regexp}
25 # $region{NAME}{Adj}[]{Dikes}
26 # $region{NAME}{Adj}[]{L}
29 # $adj{EARLIER}{LATER}{Dikes}
30 # $adj{EARLIER}{LATER}{L}[]
31 # $adj{EARLIER}{LATER}{T}[]
45 if (my ($name, $water) = m{^\t(\S.*\w|L2?)(?: \[(\d+)\])?$}) {
46 confess unless defined $ccolour;
47 my $dname = $c{DisplayNames}{$name} // $name;
49 confess "$name ?" if $region{$name};
50 $region{$name}{Colour} = $ccolour;
51 $region{$name}{Water} = $water;
52 $region{$name}{L} = $.;
54 $dname =~ s{(?<!-)/(?! )}{-/}g;
55 $region{$name}{DisplayName} = [ grep m/./, split m{ */ *}, $dname ];
57 $region{$name}{DisplayName} = [ split m{(?<=-)| }, $dname ];
62 if (my ($aref, $adikes) = m{^\t\t(\S.*[A-Za-z.]|L2?)(?: (\+\+?))?$}) {
63 my $adj = { Dikes => (length $adikes // 0), L => $. };
65 $adj->{Pattern} = $aref;
66 $aref =~ s{\-}{[^- ]*-}g;
68 length $& eq 1 ? qr{[^- ]* ?} :
69 length $& eq 2 ? qr{.*} : confess "$aref"
71 $adj->{Regexp} = $aref;
75 push @{ $region{$cregion}{Adj} }, $adj;
82 sub unique_aref ($$) {
84 my $re = $adja->{Regexp};
85 return $adja->{Name} unless defined $re;
87 foreach my $rb (sort keys %region) {
88 #print STDERR "?? $ra -> $re $rb ?\n";
89 foreach my $adjb (@{ $region{$rb}{Adj} }) {
90 my $adjbn = $adjb->{Name};
91 next unless defined $adjbn;
92 #print STDERR "?? $ra -> $re $rb ?? $adjbn\n";
93 next unless $adjbn eq $ra;
94 push @cands, [ $rb, "$region{$rb}{L},$adjb->{L}" ];
97 my @found = grep { $_->[0] =~ m{^$re$} } @cands;
99 join ' / ', map { "$_->[0] ($_->[1])" } @_;
101 confess "$adja->{L} $adja->{Pattern} /$re/ | ".$pr->(@cands)
102 ." | ".$pr->(@found)." | ?"
104 my $r = $found[0][0];
105 #print STDERR "resolve $ra -> $adja->{Pattern} = $r\n";
110 ($a eq 'L' ) <=> ($b eq 'L' ) or
111 ($a eq 'L2') <=> ($b eq 'L2') or
112 ($a eq 'NZ') <=> ($b eq 'NZ') or
116 sub resolve_arefs () {
117 #print Dumper(\%region);
118 foreach my $ra (sort keys %region) {
119 foreach my $adj (@{ $region{$ra}{Adj} }) {
120 next if defined $adj->{Name};
121 $adj->{ProspectiveName} = unique_aref $ra, $adj;
124 foreach my $ra (sort keys %region) {
125 foreach my $adj (@{ $region{$ra}{Adj} }) {
126 $adj->{Name} //= $adj->{ProspectiveName};
129 foreach my $ra (sort keys %region) {
130 foreach my $adj (@{ $region{$ra}{Adj} }) {
131 confess unless $adj->{Name} eq unique_aref $ra, $adj;
137 foreach my $ra (sort keys %region) {
138 my $adjs = $region{$ra}{Adj};
139 foreach my $adji (0..$#$adjs) {
140 my $adja = $adjs->[$adji];
141 my $rb = $adja->{Name};
142 my ($r0,$r1) = sort region_cmp ($ra,$rb);
143 push @{ $adj{$r0}{$r1}{L} }, $adja->{L};
144 push @{ $adj{$r0}{$r1}{T} }, substr($ra,0,1)."#".$adji;
145 my $e = $adj{$r0}{$r1};
146 $e->{Dikes} //= $adja->{Dikes};
147 confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dikes} $adja->{Dikes} ?"
148 unless $e->{Dikes} == $adja->{Dikes};
152 foreach my $r0 (sort keys %adj) {
153 foreach my $r1 (sort keys %{ $adj{$r0} }) {
154 my $e = $adj{$r0}{$r1};
155 confess "$r0 / $r1 : @{ $e->{L} } ?" unless @{ $e->{L} } == 2;
156 $ndikes += $e->{Dikes};
159 #print STDERR "total $ndikes dikes\n";
163 foreach my $r (sort keys %region) {
164 $region{$r}{Name} = $r;
168 sub edge_id_to_other_id ($$) {
169 my ($ra, $adjia) = @_;
170 my $adjsa = $region{$ra}{Adj};
171 my $adja = $adjsa->[$adjia];
172 my $rb = $adja->{Name};
173 my $adjsb = $region{$rb}{Adj};
174 foreach my $adjib (0..$#$adjsb) {
175 my $adjb = $adjsb->[$adjib];
176 next unless $adjb->{Name} eq $ra;
177 # $adjb is the same edge seen from the other side
178 return ($rb, $adjib);
180 confess "$ra $adjia ?";
183 sub o { print @_ or die $!; }
187 $t = $` if $t =~ m/\n/;
193 sub parse_input_graph () {