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.
41 $capacitystring => '';
61 my $routeparams= { EmsgRef => \$emsg, SayRequiredCapacity => 1 };
67 <h1>Find most profitable routes and trades</h1>
69 % if ($qa->{Dropdowns}) {
70 This feature is not available from the "drop down menus" interface.
73 <form action="<% $quri->() |h %>" method="get">
75 <& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs,
76 enterwhat => 'Enter starting point(s)',
77 islandids_r => \@islandids, archipelagoes_r => undef
80 <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>
86 <&| qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml',
87 thingstring => 'distance', emsgstore => \$emsg,
88 onresults => sub { ($maxdist)= @_; } &>
93 <input type=submit name=submit value="Search">
94 % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^capitalstring|^capacitystring|^distance/; };
95 <& "lookup:formhidden", ours => $ours &>
102 if (!$emsg && $maxdist > $maxmaxdist) {
103 $emsg= "Searching for routes of more than $maxmaxdist leagues is not".
104 " supported, sorry.";
107 $emsgokorprint->($emsg) or return;
108 @islandids or return;
109 defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume} or return;
111 #---------- prepare island names ----------
113 my $islandname_stmt= $dbh->prepare(<<END);
114 SELECT islandname, archipelago
121 $islandname_stmt->execute($id);
122 my $row= $islandname_stmt->fetchrow_hashref();
123 local $_= $row->{'islandname'};
125 return $_, $row->{'islandname'}, $row->{'archipelago'};
128 #---------- compute the results ----------
130 my @rsargs= ($concur_lim, '-DN');
133 foreach my $k (qw(MaxMass MaxVolume MaxCapital)) {
134 my $v= $routeparams->{$k};
135 push @rsargs, (defined $v ? $v : -1);
137 push @rsargs, defined $routeparams->{LossPerLeaguePct}
138 ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9;
140 push @rsargs, 'search',$maxdist, $maxcountea,$maxcountea, 'any', @islandids;
142 m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs;
144 if ($qa->{'debug'}) {
146 [[ <% "@rsargs" |h %> ]]<br><pre>
151 'nice', sourcebasedir().'/yarrg/routesearch',
152 '-d', dbw_filename($qa->{'Ocean'}),
153 '-C', webdatadir().'/_concur.', '.lock';
155 # touch _concur.0{0,1,2,3,4}.lock
156 # really chgrp www-data _concur.0?.lock
158 my %results; # $results{$ap}{"5 6 9 10"} = { stuff }
160 my $fh= new IO::File;
161 my $child= $fh->open("-|"); defined $child or die $!;
163 my $cpu= BSD::Resource::RLIMIT_CPU;
164 my ($soft,$hard)= getrlimit($cpu);
165 setrlimit($cpu,$maxcpu,$hard) or die $! if $hard<=$maxcpu;
172 if ($qa->{'debug'}) {
177 next unless m/^\s*\@/;
178 if (m/^\@\@\@ concurrency limit exceeded/) {
182 die unless m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *(\d+)lg *\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
183 my ($ap,$isles) = (uc $1,$5);
184 next if $results{$ap} && %{$results{$ap}} >= $maxcountea;
185 my $item= { A => $3, P => $4, Leagues => $2 };
187 foreach (split / /, $isles) {
188 my ($name,$fullname,$arch)= $isleinfo->($_);
191 push @a, $arch unless @a && $a[-1] eq $arch;
193 $item->{Isles}= [ @i ];
194 $item->{Archs}= [ @a ];
195 $item->{Start}= $i[0];
196 $item->{Finish}= $i[-1];
199 for ($i=1; $i < @i-1; $i++) {
200 push @{ $item->{Vias} }, $i[$i];
202 my %linkqf= %$queryqf;
203 delete $linkqf{'query'};
204 $linkqf{'routestring'}= join ', ', @fi;
205 $item->{Url}= $quri->(%linkqf);
206 $item->{ArchesString}= join ', ', @a;
207 $item->{ViasString}= join ' ', map { $_.',' } @{ $item->{Vias} };
208 $item->{RouteSortString}= join ', ', @i;
209 $results{$ap}{$isles}= $item;
212 if ($qa->{'debug'}) {
219 die $? if $? != 24; # SIGXCPU but not in POSIX.pm :-/
221 <h2>Search took too long and was terminated</h2>
223 Sorry, but your query resulted in a search that took too long.
224 Searches are limited to <% $maxcpu |h %> seconds of CPU time to
225 avoid them consuming excessive resources on the server system, and to
226 make sure that shorter searches can still happen.
229 Please try a search with a smaller minimum distance, or place more
230 restrictions on the route.
238 <h2>Server too busy</h2>
240 Sorry, but there are already <% $concur_lim |h %> route searches
241 running. We limit the number which can run at once to avoid
242 overloading the server system and to make sure that the rest of the
243 YARRG website still runs quickly.
246 If you submitted several searches and gave up on them (eg by hitting
247 `back' or `stop' in your browser), be aware that that doesn't
248 generally stop the search process at the server end. So it's best to
249 avoid asking for large searches that you're not sure about.
252 Otherwise, please try later. Searches are limited to <% $maxcpu |h %>
253 seconds of CPU time so more processing resources should be available soon.
262 % foreach my $ap (qw(A P)) {
264 <h2>Best routes for total profit</h2>
266 <h2>Best routes for profit per league</h2>
268 <table rules=groups id="ap<% $ap %>_table">
289 <tr id="ap<% $ap %>_sortrow"><th><th><th><th><th><th><th>
292 % foreach my $isles (sort {
293 % $results{$ap}{$b}{$ap} <=>
294 % $results{$ap}{$a}{$ap}
295 % } keys %{$results{$ap}}) {
296 % my $item= $results{$ap}{$isles};
298 % my $rowid= "r${ap}$isles"; $rowid =~ y/ /_/;
299 % foreach my $k (qw(A P Leagues ArchesString
300 % Start RouteSortString Finish)) {
301 % $sortkeys{$ci}{$rowid}= $item->{$k};
304 <tr class="datarow<% $datarow %>" id="<% $rowid %>">
305 <td align=right><% $item->{A} |h %>
306 <td align=right><% $item->{P} |h %>
307 <td align=right><% $item->{Leagues} |h %>
308 <td align=left><a href="<% $item->{Url} |h %>"><%
309 $item->{ArchesString} |h %></a>
310 <td align=left><% $item->{Start} |h %>,
311 <td align=left><% $item->{ViasString} |h %>
312 <td align=left><% $item->{Finish} |h %>
317 <&| tabsort, table => "ap${ap}_table", sortkeys => "ap${ap}_sortkeys",
318 throw => "ap${ap}_sortrow", rowclass => "datarow", cols => [
319 { DoReverse => 1, Numeric => 1 },
320 { DoReverse => 1, Numeric => 1 },
321 { DoReverse => 1, Numeric => 1 },
327 ap<% $ap %>_sortkeys= <% to_json_protecttags(\%sortkeys) %>;
335 Per league values count each island visited as one
336 (additional) league; the `Dist.' column is however the actual distance
337 to be sailed. All profit figures are somewhat approximate; get a
338 complete trading plan for a route for accurate information.