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.
42 $capacitystring => '';
64 my $routeparams= { EmsgRef => \$emsg, SayRequiredCapacity => 1 };
71 <h1>Find most profitable routes and trades</h1>
73 % if ($qa->{Dropdowns}) {
74 This feature is not available from the "drop down menus" interface.
77 % $prselector->('RouteSearchType');
79 <form action="<% $quri->() |h %>" method="get">
81 <& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs,
82 enterwhat => 'Enter starting point(s)',
83 islandids_r => \@islandids, archipelagoes_r => undef
86 <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>
92 <&| qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml',
93 thingstring => 'distance', emsgstore => \$emsg,
94 onresults => sub { ($maxdist)= @_; } &>
99 <input type=submit name=submit value="Search">
100 % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^capitalstring|^capacitystring|^distance/; };
101 <& "lookup:formhidden", ours => $ours &>
107 <div class="results">
110 if (!$emsg && $maxdist > $maxmaxdist) {
111 $emsg= "Searching for routes of more than $maxmaxdist leagues is not".
112 " supported, sorry.";
115 $emsgokorprint->($emsg) or return;
116 @islandids or return;
117 $allargs->{'submit'} or return;
118 defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume} or return;
120 #---------- prepare island names ----------
122 my $islandname_stmt= $dbh->prepare(<<END);
123 SELECT islandname, archipelago
130 $islandname_stmt->execute($id);
131 my $row= $islandname_stmt->fetchrow_hashref();
132 local $_= $row->{'islandname'};
134 return $_, $row->{'islandname'}, $row->{'archipelago'};
137 #---------- compute the results ----------
139 my @rsargs= ($concur_lim, '-DN');
142 foreach my $k (qw(MaxMass MaxVolume MaxCapital)) {
143 my $v= $routeparams->{$k};
144 push @rsargs, (defined $v ? $v : -1);
146 push @rsargs, defined $routeparams->{LossPerLeaguePct}
147 ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9;
149 push @rsargs, 'search',$maxdist, $maxcountea,$maxcountea;
150 push @rsargs, $ARGS{RouteSearchType} ? 'circ' : 'any';
151 push @rsargs, @islandids;
153 m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs;
155 if ($qa->{'debug'}) {
157 [[ <% "@rsargs" |h %> ]]<br><pre>
162 'nice', sourcebasedir().'/yarrg/routesearch',
163 '-d', dbw_filename($qa->{'Ocean'}),
164 '-C', webdatadir().'/_concur.', '.lock';
166 # touch _concur.0{0,1,2,3,4}.lock
167 # really chgrp www-data _concur.0?.lock
169 my %results; # $results{$ap}{"5 6 9 10"} = { stuff }
171 my $fh= new IO::File;
172 my $child= $fh->open("-|"); defined $child or die $!;
174 my $cpu= BSD::Resource::RLIMIT_CPU;
175 my ($soft,$hard)= getrlimit($cpu);
176 setrlimit($cpu,$maxcpu,$hard) or die $! if $hard<=$maxcpu;
183 if ($qa->{'debug'}) {
188 next unless m/^\s*\@/;
189 if (m/^\@\@\@ concurrency limit exceeded/) {
193 die unless m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *(\d+)lg *\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
194 my ($ap,$isles) = (uc $1,$5);
195 next if $results{$ap} && %{$results{$ap}} >= $maxcountea;
196 my $item= { A => $3, P => $4, Leagues => $2 };
198 foreach (split / /, $isles) {
199 my ($name,$fullname,$arch)= $isleinfo->($_);
202 push @a, $arch unless @a && $a[-1] eq $arch;
204 $item->{Isles}= [ @i ];
205 $item->{Archs}= [ @a ];
206 $item->{Start}= $i[0];
207 $item->{Finish}= $i[-1];
210 for ($i=1; $i < @i-1; $i++) {
211 push @{ $item->{Vias} }, $i[$i];
213 my %linkqf= (%$baseqf, %$queryqf);
214 delete $linkqf{'query'};
215 $linkqf{'routestring'}= join ', ', @fi;
216 $item->{Url}= $quri->(%linkqf);
217 $item->{ArchesString}= join ', ', @a;
218 $item->{ViasString}= join ' ', map { $_.',' } @{ $item->{Vias} };
219 $item->{RouteSortString}= join ', ', @i;
220 $results{$ap}{$isles}= $item;
223 if ($qa->{'debug'}) {
230 die $? if $? != 24; # SIGXCPU but not in POSIX.pm :-/
232 <h2>Search took too long and was terminated</h2>
234 Sorry, but your query resulted in a search that took too long.
235 Searches are limited to <% $maxcpu |h %> seconds of CPU time to
236 avoid them consuming excessive resources on the server system, and to
237 make sure that shorter searches can still happen.
240 Please try a search with a smaller minimum distance, or place more
241 restrictions on the route.
249 <h2>Server too busy</h2>
251 Sorry, but there are already <% $concur_lim |h %> route searches
252 running. We limit the number which can run at once to avoid
253 overloading the server system and to make sure that the rest of the
254 YARRG website still runs quickly.
257 If you submitted several searches and gave up on them (eg by hitting
258 `back' or `stop' in your browser), be aware that that doesn't
259 generally stop the search process at the server end. So it's best to
260 avoid asking for large searches that you're not sure about.
263 Otherwise, please try later. Searches are limited to <% $maxcpu |h %>
264 seconds of CPU time so more processing resources should be available soon.
273 % foreach my $ap (qw(A P)) {
275 <h2>Best routes for total profit</h2>
277 <h2>Best routes for profit per league</h2>
279 <table class="data" rules=groups id="ap<% $ap %>_table">
300 <tr id="ap<% $ap %>_sortrow"><th><th><th><th><th><th><th>
303 % foreach my $isles (sort {
304 % $results{$ap}{$b}{$ap} <=>
305 % $results{$ap}{$a}{$ap}
306 % } keys %{$results{$ap}}) {
307 % my $item= $results{$ap}{$isles};
309 % my $rowid= "r${ap}$isles"; $rowid =~ y/ /_/;
310 % foreach my $k (qw(A P Leagues ArchesString
311 % Start RouteSortString Finish)) {
312 % $sortkeys{$ci}{$rowid}= $item->{$k};
315 <tr class="datarow<% $datarow %>" id="<% $rowid %>">
316 <td align=right><% $item->{A} |h %>
317 <td align=right><% $item->{P} |h %>
318 <td align=right><% $item->{Leagues} |h %>
319 <td align=left><a href="<% $item->{Url} |h %>"><%
320 $item->{ArchesString} |h %></a>
321 <td align=left><% $item->{Start} |h %>,
322 <td align=left><% $item->{ViasString} |h %>
323 <td align=left><% $item->{Finish} |h %>
328 <&| tabsort, table => "ap${ap}_table", sortkeys => "ap${ap}_sortkeys",
329 throw => "ap${ap}_sortrow", rowclass => "datarow", cols => [
330 { DoReverse => 1, Numeric => 1 },
331 { DoReverse => 1, Numeric => 1 },
332 { DoReverse => 1, Numeric => 1 },
338 ap<% $ap %>_sortkeys= <% to_json_protecttags(\%sortkeys) %>;
346 Per league values count each island visited as one
347 (additional) league; the `Dist.' column is however the actual distance
348 to be sailed. All profit figures are somewhat approximate; get a
349 complete trading plan for a route for accurate information.