<%doc> This is part of the YARRG website. YARRG is a tool and website for assisting players of Yohoho Puzzle Pirates. Copyright (C) 2009 Ian Jackson Copyright (C) 2009 Clare Boothby YARRG's client code etc. is covered by the ordinary GNU GPL (v3 or later). The YARRG website is covered by the GNU Affero GPL v3 or later, which basically means that every installation of the website will let you download the source. This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details. You should have received a copy of the GNU Affero General Public License along with this program. If not, see . Yohoho and Puzzle Pirates are probably trademarks of Three Rings and are used without permission. This program is not endorsed or sponsored by Three Rings. This Mason component generates the core of the `routesearch' query. <%args> $quri $dbh $baseqf $queryqf $islandstring => ''; $capacitystring => ''; $lossperleague => ''; $capitalstring => ''; $minprofitstring => ''; $distance => ''; $prselector $someresults $emsgokorprint $allargs <%perl> no warnings qw(exec); use BSD::Resource; my $emsg; my @warningfs; my @islandids; my $destspec; my @maxmaxdist= qw(100 100 100); my $maxcpu=90; my $concur_lim=5; my $qa= \%ARGS; my $routeparams= { EmsgRef => \$emsg, SayRequiredCapacity => 1 }; my $maxdist; my $maxcountea=15;

Find most profitable routes and trades

% my $searchtype= $ARGS{RouteSearchType}; % my $searchtype_show; % % if ($qa->{Dropdowns}) { This feature is not available from the "drop down menus" interface. % } else { % $prselector->('RouteSearchType');
<& enter_route, qa=>$qa, dbh=>$dbh, emsg_r=>\$emsg, warningfs_r=>\@warningfs, enterwhat => 'Enter starting point(s)', islandids_r => \@islandids, archipelagoes_r => undef &> % if ($searchtype == 0) { % $destspec= 'any'; % $searchtype_show= 'open-ended'; % } elsif ($searchtype == 1) { % $destspec= 'circ'; % $searchtype_show= 'circular'; % } elsif ($searchtype == 2) { % $searchtype_show= 'specific-destination'; Destination (one island only): <& qtextstring, qa => $qa, dbh => $dbh, emsgstore => \$emsg, thingstring => 'deststring', prefix => 'ds', boxopts => 'size=40', onresults => sub { print STDERR "ONRESULTS @_\n"; return unless @_; my ($canonname, $island, $arch) = @{ $_[0] }; die unless defined $island; $destspec= $island; } &> % } else { % die "$destspec ?"; % } <&| enter_advrouteopts, qa=>$qa, dbh=>$dbh, routeparams=>$routeparams &>     Maximum distance: <& qtextstring, qa => $qa, dbh => $dbh, prefix => 'ml', thingstring => 'distance', emsgstore => \$emsg, boxopts => 'size=10', onresults => sub { ($maxdist)= @_; } &> % my $ours= sub { $_[0] =~ m/^lossperleague|^islandstring|^deststring|^capitalstring|^capacitystring|^minprofitstring|^distance/; }; <& "lookup:formhidden", ours => $ours &> % }
<%perl> my $maxmaxdist= $maxmaxdist[$searchtype]; if (!$emsg && $maxdist > $maxmaxdist) { $emsg= "Searching for $searchtype_show routes". " of more than $maxmaxdist leagues is not". " supported, sorry."; } print("
"), return unless $emsgokorprint->($emsg) and @islandids and $allargs->{'submit'} and defined $destspec and (defined $routeparams->{MaxMass} or defined $routeparams->{MaxVolume}); #---------- prepare island names ---------- my $islandname_stmt= $dbh->prepare(<execute($id); my $row= $islandname_stmt->fetchrow_hashref(); local $_= $row->{'islandname'}; s/ Island$//; return $_, $row->{'islandname'}, $row->{'archipelago'}; }; #---------- compute the results ---------- my @rsargs= ($concur_lim, '-DN'); my $concur_fail; foreach my $k (qw(MaxMass MaxVolume MaxCapital)) { my $v= $routeparams->{$k}; push @rsargs, (defined $v ? $v : -1); } push @rsargs, defined $routeparams->{LossPerLeaguePct} ? $routeparams->{LossPerLeaguePct}*0.01 : 1e-9; push @rsargs, $routeparams->{MinProfit} // 0; push @rsargs, 'search',$maxdist, $maxcountea,$maxcountea; push @rsargs, $destspec; push @rsargs, @islandids; m/[^-.0-9a-zA-Z]/ and die "$_ $& ?" foreach @rsargs; if ($qa->{'debug'}) { [[ <% "@rsargs" |h %> ]]
<%perl>
}

unshift @rsargs,
	'nice', sourcebasedir().'/yarrg/routesearch',
	'-d', dbw_filename($qa->{'Ocean'}),
	'-C', webdatadir().'/_concur.', '.lock';

# touch _concur.0{0,1,2,3,4}.lock
# really chgrp www-data _concur.0?.lock

my %results; # $results{$ap}{"5 6 9 10"} = { stuff }

my $fh= new IO::File;
my $child= $fh->open("-|"); defined $child or die $!;
if (!$child) {
	my $cpu= BSD::Resource::RLIMIT_CPU;
	my ($soft,$hard)= getrlimit($cpu);
	setrlimit($cpu,$maxcpu,$hard) or die $! if $hard<=$maxcpu;
	exec @rsargs;
	die $!;
}

while (<$fh>) {
	chomp;
	if ($qa->{'debug'}) {

<% $_ |h %>
<%perl>
	}
	next unless m/^\s*\@/;
	if (m/^\@\@\@ concurrency limit exceeded/) {
		$concur_fail= 1;
		last;
	}
	die unless m/^ \@ *\d+ ([ap])\# *\d+ \|.*\| *(\d+)lg *\| *\d+ +(\d+) +(\d+) *\| ([0-9 ]+)$/;
	my ($ap,$isles) = (uc $1,$5);
	next if $results{$ap} && keys %{$results{$ap}} >= $maxcountea;
	my $item= { A => $3, P => $4, Leagues => $2 };
	my (@i, @fi, @a);
	foreach (split / /, $isles) {
		my ($name,$fullname,$arch)= $isleinfo->($_);
		push @i, $name;
		push @fi, $fullname;
		push @a, $arch unless @a && $a[-1] eq $arch;
	}
	$item->{Isles}= [ @i ];
	$item->{Archs}= [ @a ];
	$item->{Start}= $i[0];
	$item->{Finish}= $i[-1];
	$item->{Vias}= [ ];
	my $i;
	for ($i=1; $i < @i-1; $i++) {
		push @{ $item->{Vias} }, $i[$i];
	}
	my %linkqf= (%$baseqf, %$queryqf);
	delete $linkqf{'query'};
	$linkqf{'routestring'}= join ', ', @fi;
	$item->{Url}= $quri->(%linkqf);
	$item->{ArchesString}= join ', ', @a;
	$item->{ViasString}= join ' ', map { $_.',' } @{ $item->{Vias} };
	$item->{RouteSortString}= join ', ', @i;
	$results{$ap}{$isles}= $item;
}

if ($qa->{'debug'}) {
	print "
\n"; } $!=0; if (!close $fh) { die $! if $!; die $? if $? != 24; # SIGXCPU but not in POSIX.pm :-/ % $someresults->('Search took too long and was terminated'); Sorry, but your query resulted in a search that took too long. Searches are limited to <% $maxcpu |h %> seconds of CPU time to avoid them consuming excessive resources on the server system, and to make sure that shorter searches can still happen.

Please try a search with a smaller maximum distance, or place more restrictions on the route. <%perl> return; } if ($concur_fail) { % $someresults->('Server too busy'); Sorry, but there are already <% $concur_lim |h %> route searches running. We limit the number which can run at once to avoid overloading the server system and to make sure that the rest of the YARRG website still runs quickly.

If you submitted several searches and gave up on them (eg by hitting "back" or "stop" in your browser), be aware that that doesn't generally stop the search process at the server end. So it's best to avoid asking for large searches that you're not sure about.

Otherwise, please try later. Searches are limited to <% $maxcpu |h %> seconds of CPU time so more processing resources should be available soon. <%perl> return; } $someresults->(); % foreach my $ap (qw(A P)) { % if ($ap eq 'A') {

Best routes for total profit

% } else {

Best routes for profit per league

% } % $datarow ^= 1; % } # $isles
Profit Dist. Archipelagoes Route
Abs. Per.lg. (link to plan) Start Via Finish
% my $datarow=0; % my %sortkeys; % foreach my $isles (sort { % $results{$ap}{$b}{$ap} <=> % $results{$ap}{$a}{$ap} % } keys %{$results{$ap}}) { % my $item= $results{$ap}{$isles}; % my $ci=0; % my $rowid= "r${ap}$isles"; $rowid =~ y/ /_/; % foreach my $k (qw(A P Leagues ArchesString % Start RouteSortString Finish)) { % $sortkeys{$ci}{$rowid}= $item->{$k}; % $ci++; % }
<% $item->{A} |h %> <% $item->{P} |h %> <% $item->{Leagues} |h %> <% $item->{ArchesString} |h %> <% $item->{Start} |h %>, <% $item->{ViasString} |h %> <% $item->{Finish} |h %>
<&| tabsort, table => "ap${ap}_table", sortkeys => "ap${ap}_sortkeys", throw => "ap${ap}_sortrow", rowclass => "datarow", cols => [ { DoReverse => 1, Numeric => 1 }, { DoReverse => 1, Numeric => 1 }, { DoReverse => 1, Numeric => 1 }, { }, { }, { }, { }, ] &> ap<% $ap %>_sortkeys= <% to_json_protecttags(\%sortkeys) %>; % } # $ap

Notes

Per league values count each island visited as one (additional) league; the "Dist." column is however the actual distance to be sailed. All profit figures are somewhat approximate; get a complete trading plan for a route for accurate information.