2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2008, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * snxtsct.c: Arrange sector selection using either distance or area
30 * Known contributors to this file:
32 * Markus Armbruster, 2006-2008
43 #include "prototypes.h"
47 * setup the nstr_sect structure for sector selection.
48 * can select on either NS_ALL, NS_AREA, or NS_RANGE
49 * iterate thru the "condarg" string looking
50 * for arguments to compile into the nstr.
51 * Using this function for anything but command arguments is usually
52 * incorrect, because it respects conditionals. Use the snxtsct_FOO()
56 snxtsct(struct nstr_sect *np, char *str)
64 if (str == 0 || *str == 0) {
65 if ((str = getstring("(sects)? ", buf)) == 0)
68 switch (sarg_type(str)) {
70 if (!sarg_area(str, &range))
72 snxtsct_area(np, &range);
75 if (!sarg_range(str, &cx, &cy, &dist))
77 snxtsct_dist(np, cx, cy, dist);
81 * Can't use snxtsct_all(), as it would disclose the real
82 * origin. Use a world-sized area instead.
84 natp = getnatp(player->cnum);
85 range.lx = xabs(natp, -WORLD_X / 2);
86 range.ly = yabs(natp, -WORLD_Y / 2);
87 range.hx = xnorm(range.lx + WORLD_X - 1);
88 range.hy = ynorm(range.ly + WORLD_Y - 1);
90 snxtsct_area(np, &range);
95 if (player->condarg == 0)
97 n = nstr_comp(np->cond, sizeof(np->cond) / sizeof(*np->cond),
98 EF_SECTOR, player->condarg);
99 np->ncond = n >= 0 ? n : 0;
104 snxtsct_all(struct nstr_sect *np)
106 struct range worldrange;
110 worldrange.hx = WORLD_X - 1;
111 worldrange.hy = WORLD_Y - 1;
112 xysize_range(&worldrange);
113 snxtsct_area(np, &worldrange);
117 snxtsct_area(struct nstr_sect *np, struct range *range)
119 memset(np, 0, sizeof(*np));
123 np->x = np->range.lx - 1;
124 np->y = np->range.ly;
130 snxtsct_rewind(struct nstr_sect *np)
132 np->x = np->range.lx - 1;
133 np->y = np->range.ly;
140 snxtsct_dist(struct nstr_sect *np, coord cx, coord cy, int dist)
142 memset(np, 0, sizeof(*np));
143 xydist_range(cx, cy, dist, &np->range);
149 np->x = np->range.lx - 1;
150 np->y = np->range.ly;
156 xysize_range(struct range *rp)
159 rp->width = WORLD_X + rp->hx + 1 - rp->lx;
161 rp->width = rp->hx + 1 - rp->lx;
162 if (CANT_HAPPEN(rp->width > WORLD_X))
165 rp->height = WORLD_Y + rp->hy + 1 - rp->ly;
167 rp->height = rp->hy + 1 - rp->ly;
168 if (CANT_HAPPEN(rp->height > WORLD_Y))
169 rp->height = WORLD_Y;
173 xydist_range(coord x, coord y, int dist, struct range *rp)
175 if (4 * dist + 1 < WORLD_X) {
176 rp->lx = xnorm(x - 2 * dist);
177 rp->hx = xnorm(x + 2 * dist);
178 rp->width = 4 * dist + 1;
180 rp->lx = xnorm(x - WORLD_X / 2);
181 rp->hx = xnorm(rp->lx + WORLD_X - 1);
185 if (2 * dist + 1 < WORLD_Y) {
186 rp->ly = ynorm(y - dist);
187 rp->hy = ynorm(y + dist);
188 rp->height = 2 * dist + 1;
190 rp->ly = ynorm(y - WORLD_Y / 2);
191 rp->hy = ynorm(rp->ly + WORLD_Y - 1);
192 rp->height = WORLD_Y;