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 };
62 <h1>Find most profitable routes and trades</h1>
64 % if ($qa->{Dropdowns}) {
65 This feature is not available from the "drop down menus" interface.
68 <form action="<% $quri->() |h %>" method="get">
70 <& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs,
71 enterwhat => 'Enter starting point(s)',
72 islandids_r => \@islandids, archipelagoes_r => undef
75 <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>
81 <&| qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml',
82 thingstring => 'distance', emsgstore => \$emsg,
83 onresults => sub { ($maxdist)= @_; } &>
88 <input type=submit name=submit value="Go">
89 % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^capitalstring|^capacitystring|^distance/; };
90 <& "lookup:formhidden", ours => $ours &>
97 if (!$emsg && $maxdist > 30) {
98 $emsg= "Searching for routes of more than 30 leagues is not".
102 $emsgokorprint->($emsg) or return;
103 @islandids or return;
104 defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume} or return;
106 #---------- prepare island names ----------
108 my $islandname_stmt= $dbh->prepare(<<END);
109 SELECT islandname, archipelago
116 $islandname_stmt->execute($id);
117 my $row= $islandname_stmt->fetchrow_hashref();
118 local $_= $row->{'islandname'};
120 return $_, $row->{'archipelago'};
123 #---------- compute the results ----------
127 foreach my $k (qw(MaxMass MaxVolume MaxCapital)) {
128 my $v= $routeparams->{$k};
129 push @rsargs, (defined $v ? $v : -1);
131 push @rsargs, defined $routeparams->{LossPerLeaguePct}
132 ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9;
133 push @rsargs, 'search', $maxcountea,$maxcountea, $maxdist, 'any', @islandids;
135 m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs;
137 unshift @rsargs, dbw_filename($qa->{'Ocean'});
138 unshift @rsargs, qw(-DN);
140 if ($qa->{'debug'}) {
142 [[ <% "@rsargs" |h %> ]]<br><pre>
146 unshift @rsargs, sourcebasedir().'/yarrg/routesearch';
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);
156 setrlimit($cpu,$max,$hard) or die $! if $soft>$max;
163 if ($qa->{'debug'}) {
169 m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
170 my ($ap,$isles) = (uc $1,$4);
171 next if $results{$ap} && %{$results{$ap}} >= $maxcountea;
172 my $item= { A => $2, P => $3 };
174 foreach (split / /, $isles) {
175 my ($name,$arch)= $isleinfo->($_);
177 push @a, $arch unless @a && $a[-1] eq $arch;
179 $item->{Isles}= [ @i ];
180 $item->{Archs}= [ @a ];
181 $item->{Start}= $i[0];
182 $item->{Finish}= $i[-1];
185 for ($i=1; $i < @i-1; $i++) {
186 push @{ $item->{Vias} }, $i[$i];
188 $results{$ap}{$isles}= $item;
191 if ($qa->{'debug'}) {
196 % foreach my $ap (qw(A P)) {
197 <h2>ap=<% $ap %></h2>
216 % foreach my $isles (sort {
217 % $results{$ap}{$b}{$ap} <=>
218 % $results{$ap}{$a}{$ap}
219 % } keys %{$results{$ap}}) {
220 % my $item= $results{$ap}{$isles};
221 <tr class="datarow<% $datarow %>">
222 <td align=right><% $item->{A} |h %>
223 <td align=right><% $item->{P} |h %>
224 <td align=left><% join ', ', @{ $item->{Archs} } |h %>
225 <td align=left><% $item->{Start} |h %>,
226 <td align=left><% join ' ', map { $_.',' } @{ $item->{Vias} } |h %>
227 <td align=left><% $item->{Finish} |h %>