3 This is part of the YARRG website. YARRG is a tool and website
4 for assisting players of Yohoho Puzzle Pirates.
6 Copyright (C) 2009 Ian Jackson <ijackson@chiark.greenend.org.uk>
7 Copyright (C) 2009 Clare Boothby
9 YARRG's client code etc. is covered by the ordinary GNU GPL (v3 or later).
10 The YARRG website is covered by the GNU Affero GPL v3 or later, which
11 basically means that every installation of the website will let you
14 This program is free software: you can redistribute it and/or modify
15 it under the terms of the GNU Affero General Public License as
16 published by the Free Software Foundation, either version 3 of the
17 License, or (at your option) any later version.
19 This program is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 GNU Affero General Public License for more details.
24 You should have received a copy of the GNU Affero General Public License
25 along with this program. If not, see <http://www.gnu.org/licenses/>.
27 Yohoho and Puzzle Pirates are probably trademarks of Three Rings and
28 are used without permission. This program is not endorsed or
29 sponsored by Three Rings.
32 This Mason component generates the core of the `routesearch' query.
40 $capacitystring => '';
59 my $routeparams= { EmsgRef => \$emsg, SayRequiredCapacity => 1 };
65 <h1>Find most profitable routes and trades</h1>
67 % if ($qa->{Dropdowns}) {
68 This feature is not available from the "drop down menus" interface.
71 <form action="<% $quri->() |h %>" method="get">
73 <& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs,
74 enterwhat => 'Enter starting point(s)',
75 islandids_r => \@islandids, archipelagoes_r => undef
78 <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>
84 <&| qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml',
85 thingstring => 'distance', emsgstore => \$emsg,
86 onresults => sub { ($maxdist)= @_; } &>
91 <input type=submit name=submit value="Go">
92 % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^capitalstring|^capacitystring|^distance/; };
93 <& "lookup:formhidden", ours => $ours &>
100 if (!$emsg && $maxdist > $maxmaxdist) {
101 $emsg= "Searching for routes of more than $maxmaxdist leagues is not".
102 " supported, sorry.";
105 $emsgokorprint->($emsg) or return;
106 @islandids or return;
107 defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume} or return;
109 #---------- prepare island names ----------
111 my $islandname_stmt= $dbh->prepare(<<END);
112 SELECT islandname, archipelago
119 $islandname_stmt->execute($id);
120 my $row= $islandname_stmt->fetchrow_hashref();
121 local $_= $row->{'islandname'};
123 return $_, $row->{'archipelago'};
126 #---------- compute the results ----------
130 foreach my $k (qw(MaxMass MaxVolume MaxCapital)) {
131 my $v= $routeparams->{$k};
132 push @rsargs, (defined $v ? $v : -1);
134 push @rsargs, defined $routeparams->{LossPerLeaguePct}
135 ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9;
137 push @rsargs, 'search',$maxdist, $maxcountea,$maxcountea, 'any', @islandids;
139 m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs;
141 if ($qa->{'debug'}) {
143 [[ <% "@rsargs" |h %> ]]<br><pre>
147 unshift @rsargs, sourcebasedir().'/yarrg/routesearch',
148 '-d', dbw_filename($qa->{'Ocean'});
150 my %results; # $results{$ap}{"5 6 9 10"} = { stuff }
152 my $fh= new IO::File;
153 my $child= $fh->open("-|"); defined $child or die $!;
155 my $cpu= BSD::Resource::RLIMIT_CPU;
156 my ($soft,$hard)= getrlimit($cpu);
157 setrlimit($cpu,$maxcpu,$hard) or die $! if $hard<=$maxcpu;
164 if ($qa->{'debug'}) {
170 m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
171 my ($ap,$isles) = (uc $1,$4);
172 next if $results{$ap} && %{$results{$ap}} >= $maxcountea;
173 my $item= { A => $2, P => $3 };
175 foreach (split / /, $isles) {
176 my ($name,$arch)= $isleinfo->($_);
178 push @a, $arch unless @a && $a[-1] eq $arch;
180 $item->{Isles}= [ @i ];
181 $item->{Archs}= [ @a ];
182 $item->{Start}= $i[0];
183 $item->{Finish}= $i[-1];
186 for ($i=1; $i < @i-1; $i++) {
187 push @{ $item->{Vias} }, $i[$i];
189 $results{$ap}{$isles}= $item;
192 if ($qa->{'debug'}) {
197 % foreach my $ap (qw(A P)) {
198 <h2>ap=<% $ap %></h2>
217 % foreach my $isles (sort {
218 % $results{$ap}{$b}{$ap} <=>
219 % $results{$ap}{$a}{$ap}
220 % } keys %{$results{$ap}}) {
221 % my $item= $results{$ap}{$isles};
222 <tr class="datarow<% $datarow %>">
223 <td align=right><% $item->{A} |h %>
224 <td align=right><% $item->{P} |h %>
225 <td align=left><% join ', ', @{ $item->{Archs} } |h %>
226 <td align=left><% $item->{Start} |h %>,
227 <td align=left><% join ' ', map { $_.',' } @{ $item->{Vias} } |h %>
228 <td align=left><% $item->{Finish} |h %>