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}[]{Dykes}
26 # $region{NAME}{Adj}[]{L}
29 # $adj{EARLIER}{LATER}{Dykes}
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, $adykes, $dwdyke) =
63 m{^\t\t(\S.*[A-Za-z.]|L2?)(?: (\+\+?)(\@?))?$}) {
64 my $adj = { Dykes => (length $adykes // 0), L => $. };
66 $adj->{Pattern} = $aref;
67 $aref =~ s{\-}{[^- ]*-}g;
69 length $& eq 1 ? qr{[^- ]* ?} :
70 length $& eq 2 ? qr{.*} : confess "$aref"
72 $adj->{Regexp} = $aref;
76 push @{ $region{$cregion}{Adj} }, $adj;
83 sub unique_aref ($$) {
85 my $re = $adja->{Regexp};
86 return $adja->{Name} unless defined $re;
88 foreach my $rb (sort keys %region) {
89 #print STDERR "?? $ra -> $re $rb ?\n";
90 foreach my $adjb (@{ $region{$rb}{Adj} }) {
91 my $adjbn = $adjb->{Name};
92 next unless defined $adjbn;
93 #print STDERR "?? $ra -> $re $rb ?? $adjbn\n";
94 next unless $adjbn eq $ra;
95 push @cands, [ $rb, "$region{$rb}{L},$adjb->{L}" ];
98 my @found = grep { $_->[0] =~ m{^$re$} } @cands;
100 join ' / ', map { "$_->[0] ($_->[1])" } @_;
102 confess "$adja->{L} $adja->{Pattern} /$re/ | ".$pr->(@cands)
103 ." | ".$pr->(@found)." | ?"
105 my $r = $found[0][0];
106 #print STDERR "resolve $ra -> $adja->{Pattern} = $r\n";
111 ($a eq 'L' ) <=> ($b eq 'L' ) or
112 ($a eq 'L2') <=> ($b eq 'L2') or
113 ($a eq 'NZ') <=> ($b eq 'NZ') or
117 sub resolve_arefs () {
118 #print Dumper(\%region);
119 foreach my $ra (sort keys %region) {
120 foreach my $adj (@{ $region{$ra}{Adj} }) {
121 next if defined $adj->{Name};
122 $adj->{ProspectiveName} = unique_aref $ra, $adj;
125 foreach my $ra (sort keys %region) {
126 foreach my $adj (@{ $region{$ra}{Adj} }) {
127 $adj->{Name} //= $adj->{ProspectiveName};
130 foreach my $ra (sort keys %region) {
131 foreach my $adj (@{ $region{$ra}{Adj} }) {
132 confess unless $adj->{Name} eq unique_aref $ra, $adj;
138 foreach my $ra (sort keys %region) {
139 my $adjs = $region{$ra}{Adj};
140 foreach my $adji (0..$#$adjs) {
141 my $adja = $adjs->[$adji];
142 my $rb = $adja->{Name};
143 my ($r0,$r1) = sort region_cmp ($ra,$rb);
144 push @{ $adj{$r0}{$r1}{L} }, $adja->{L};
145 push @{ $adj{$r0}{$r1}{T} }, substr($ra,0,1)."#".$adji;
146 my $e = $adj{$r0}{$r1};
147 $e->{Dykes} //= $adja->{Dykes};
148 confess "$r0 - $r1 | @{ $e->{L} } | $e->{Dykes} $adja->{Dykes} ?"
149 unless $e->{Dykes} == $adja->{Dykes};
153 foreach my $r0 (sort keys %adj) {
154 foreach my $r1 (sort keys %{ $adj{$r0} }) {
155 my $e = $adj{$r0}{$r1};
156 confess "$r0 / $r1 : @{ $e->{L} } ?" unless @{ $e->{L} } == 2;
157 $ndykes += $e->{Dykes};
160 #print STDERR "total $ndykes dykes\n";
164 foreach my $r (sort keys %region) {
165 $region{$r}{Name} = $r;
169 sub edge_id_to_other_id ($$) {
170 my ($ra, $adjia) = @_;
171 my $adjsa = $region{$ra}{Adj};
172 my $adja = $adjsa->[$adjia];
173 my $rb = $adja->{Name};
174 my $adjsb = $region{$rb}{Adj};
175 foreach my $adjib (0..$#$adjsb) {
176 my $adjb = $adjsb->[$adjib];
177 next unless $adjb->{Name} eq $ra;
178 # $adjb is the same edge seen from the other side
179 return ($rb, $adjib);
181 confess "$ra $adjia ?";
184 sub o { print @_ or die $!; }
188 $t = $` if $t =~ m/\n/;
194 sub parse_input_graph () {