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 => '';
56 my $routeparams= { EmsgRef => \$emsg, SayRequiredCapacity => 1 };
63 <h1>Find most profitable routes and trades</h1>
65 % if ($qa->{Dropdowns}) {
66 This feature is not available from the "drop down menus" interface.
69 <form action="<% $quri->() |h %>" method="get">
71 <& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs,
72 enterwhat => 'Enter starting point(s)',
73 islandids_r => \@islandids, archipelagoes_r => undef
76 <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>
82 <&| qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml',
83 thingstring => 'distance', emsgstore => \$emsg,
84 onresults => sub { ($maxdist)= @_; } &>
89 <input type=submit name=submit value="Go">
90 % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^capitalstring|^capacitystring|^distance/; };
91 <& "lookup:formhidden", ours => $ours &>
98 if (!$emsg && $maxdist > 30) {
99 $emsg= "Searching for routes of more than 30 leagues is not".
100 " supported, sorry.";
103 $emsgokorprint->($emsg) or return;
104 @islandids or return;
105 defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume} or return;
107 #---------- prepare island names ----------
109 my $islandname_stmt= $dbh->prepare(<<END);
110 SELECT islandname, archipelago
117 $islandname_stmt->execute($id);
118 my $row= $islandname_stmt->fetchrow_hashref();
119 local $_= $row->{'islandname'};
121 return $_, $row->{'archipelago'};
124 #---------- compute the results ----------
128 foreach my $k (qw(MaxMass MaxVolume MaxCapital)) {
129 my $v= $routeparams->{$k};
130 push @rsargs, (defined $v ? $v : -1);
132 push @rsargs, defined $routeparams->{LossPerLeaguePct}
133 ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9;
135 push @rsargs, 'search',$maxdist, $maxcountea,$maxcountea, 'any', @islandids;
137 m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs;
139 if ($qa->{'debug'}) {
141 [[ <% "@rsargs" |h %> ]]<br><pre>
145 unshift @rsargs, sourcebasedir().'/yarrg/routesearch',
146 '-d', dbw_filename($qa->{'Ocean'});
148 my %results; # $results{$ap}{"5 6 9 10"} = { stuff }
150 my $fh= new IO::File;
151 my $child= $fh->open("-|"); defined $child or die $!;
153 my $cpu= BSD::Resource::RLIMIT_CPU;
154 my ($soft,$hard)= getrlimit($cpu);
155 setrlimit($cpu,$maxcpu,$hard) or die $! if $soft>$maxcpu;
162 if ($qa->{'debug'}) {
168 m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
169 my ($ap,$isles) = (uc $1,$4);
170 next if $results{$ap} && %{$results{$ap}} >= $maxcountea;
171 my $item= { A => $2, P => $3 };
173 foreach (split / /, $isles) {
174 my ($name,$arch)= $isleinfo->($_);
176 push @a, $arch unless @a && $a[-1] eq $arch;
178 $item->{Isles}= [ @i ];
179 $item->{Archs}= [ @a ];
180 $item->{Start}= $i[0];
181 $item->{Finish}= $i[-1];
184 for ($i=1; $i < @i-1; $i++) {
185 push @{ $item->{Vias} }, $i[$i];
187 $results{$ap}{$isles}= $item;
190 if ($qa->{'debug'}) {
195 % foreach my $ap (qw(A P)) {
196 <h2>ap=<% $ap %></h2>
215 % foreach my $isles (sort {
216 % $results{$ap}{$b}{$ap} <=>
217 % $results{$ap}{$a}{$ap}
218 % } keys %{$results{$ap}}) {
219 % my $item= $results{$ap}{$isles};
220 <tr class="datarow<% $datarow %>">
221 <td align=right><% $item->{A} |h %>
222 <td align=right><% $item->{P} |h %>
223 <td align=left><% join ', ', @{ $item->{Archs} } |h %>
224 <td align=left><% $item->{Start} |h %>,
225 <td align=left><% join ' ', map { $_.',' } @{ $item->{Vias} } |h %>
226 <td align=left><% $item->{Finish} |h %>