empire/empserver
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Import of Empire 4.2.12

Browse source
This commit is contained in:
Markus Armbruster 2003-08-23 12:23:04 +00:00
commit d8b7fdfae1
817 changed files with 126589 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

88
src/lib/commands/best.c Normal file
View file

@ -0,0 +1,88 @@
/*
* Empire - A multi-player, client/server Internet based war game.
* Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* ---
*
* See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
* related information and legal notices. It is expected that any future
* projects/authors will amend these files as needed.
*
* ---
*
* best.c: Show the best path between two sectors
*
* Known contributors to this file:
*
*/
#include "misc.h"
#include "player.h"
#include "var.h"
#include "sect.h"
#include "item.h"
#include "xy.h"
#include "path.h"
#include "nsc.h"
#include "deity.h"
#include "file.h"
#include "nat.h"
#include "commands.h"
int
best(void)
{
double cost;
s_char *BestDistPath(), *BestLandPath(), *s;
struct sctstr s1, s2;
struct nstr_sect nstr, nstr2;
int dist=0;
s_char buf[1024];
dist = player->argp[0][4] == 'd';
if (!snxtsct(&nstr, player->argp[1]))
return RET_SYN;
if (!snxtsct(&nstr2, player->argp[2]))
return RET_SYN;
while (!player->aborted && nxtsct(&nstr, &s1)){
if (s1.sct_own != player->cnum)
continue;
snxtsct(&nstr2, player->argp[2]);
while (!player->aborted && nxtsct(&nstr2, &s2)){
if (s2.sct_own != player->cnum)
continue;
if (dist)
s = BestDistPath(buf, &s1,&s2,&cost, MOB_ROAD);
else
s = BestLandPath(buf, &s1,&s2,&cost, MOB_ROAD);
if (s != (s_char *)0)
pr("Best %spath from %s to %s is %s (cost %1.3f)\n",
(dist ? "dist" : ""),
xyas(s1.sct_x,s1.sct_y,player->cnum),
xyas(s2.sct_x,s2.sct_y,player->cnum), s, cost);
else
pr("No owned path from %s to %s exists!\n",
xyas(s1.sct_x,s1.sct_y,player->cnum),
xyas(s2.sct_x,s2.sct_y,player->cnum));
}
}
return 0;
}