118 lines
3 KiB
C
118 lines
3 KiB
C
/*
|
|
* Empire - A multi-player, client/server Internet based war game.
|
|
* Copyright (C) 1986-2010, 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 files README, COPYING and CREDITS in the root of the source
|
|
* tree for related information and legal notices. It is expected
|
|
* that future projects/authors will amend these files as needed.
|
|
*
|
|
* ---
|
|
*
|
|
* nxtitem.c: Get the next item from a list
|
|
*
|
|
* Known contributors to this file:
|
|
* Dave Pare, 1989
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include "empobj.h"
|
|
#include "file.h"
|
|
#include "land.h"
|
|
#include "misc.h"
|
|
#include "nsc.h"
|
|
#include "player.h"
|
|
#include "prototypes.h"
|
|
#include "ship.h"
|
|
#include "unit.h"
|
|
#include "xy.h"
|
|
|
|
int
|
|
nxtitem(struct nstr_item *np, void *ptr)
|
|
{
|
|
struct empobj *gp;
|
|
int selected;
|
|
|
|
if (np->sel == NS_UNDEF)
|
|
return 0;
|
|
gp = (struct empobj *)ptr;
|
|
do {
|
|
if (np->sel == NS_LIST) {
|
|
np->index++;
|
|
if (np->index >= np->size)
|
|
return 0;
|
|
np->cur = np->list[np->index];
|
|
} else if (np->sel == NS_CARGO) {
|
|
if (np->next < 0)
|
|
return 0;
|
|
np->cur = np->next;
|
|
np->next = unit_cargo_next(np->type, np->next);
|
|
} else {
|
|
np->cur++;
|
|
}
|
|
if (!ef_read(np->type, np->cur, ptr))
|
|
return 0;
|
|
selected = 1;
|
|
switch (np->sel) {
|
|
case NS_LIST:
|
|
case NS_CARGO:
|
|
case NS_ALL:
|
|
break;
|
|
case NS_DIST:
|
|
if (CANT_HAPPEN(!(ef_flags(np->type) & EFF_XY)))
|
|
return 0;
|
|
if (!xyinrange(gp->x, gp->y, &np->range)) {
|
|
selected = 0;
|
|
break;
|
|
}
|
|
np->curdist = mapdist(gp->x, gp->y, np->cx, np->cy);
|
|
if (np->curdist > np->dist)
|
|
selected = 0;
|
|
break;
|
|
case NS_AREA:
|
|
if (CANT_HAPPEN(!(ef_flags(np->type) & EFF_XY)))
|
|
return 0;
|
|
if (!xyinrange(gp->x, gp->y, &np->range))
|
|
selected = 0;
|
|
break;
|
|
case NS_XY:
|
|
if (CANT_HAPPEN(!(ef_flags(np->type) & EFF_XY)))
|
|
return 0;
|
|
if (xnorm(gp->x) != np->cx || ynorm(gp->y) != np->cy)
|
|
selected = 0;
|
|
break;
|
|
case NS_GROUP:
|
|
if (CANT_HAPPEN(!(ef_flags(np->type) & EFF_GROUP)))
|
|
return 0;
|
|
if (np->group != gp->group)
|
|
selected = 0;
|
|
break;
|
|
default:
|
|
CANT_REACH();
|
|
return 0;
|
|
}
|
|
if (selected && np->ncond) {
|
|
/* nstr_exec is expensive, so we do it last */
|
|
if (!nstr_exec(np->cond, np->ncond, ptr))
|
|
selected = 0;
|
|
}
|
|
} while (!selected);
|
|
return 1;
|
|
}
|