mirror of
https://github.com/vattam/BSDGames.git
synced 2025-12-20 19:04:49 +00:00
Initial revision
git-svn-id: file:///srv/svn/joey/bsdgames-trunk@5086 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
124
trek/compkl.c
Normal file
124
trek/compkl.c
Normal file
@@ -0,0 +1,124 @@
|
||||
/* $NetBSD: compkl.c,v 1.4 1997/10/12 21:24:33 christos Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1980, 1993
|
||||
* The Regents of the University of California. All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* This product includes software developed by the University of
|
||||
* California, Berkeley and its contributors.
|
||||
* 4. Neither the name of the University nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
#ifndef lint
|
||||
#if 0
|
||||
static char sccsid[] = "@(#)compkl.c 8.1 (Berkeley) 5/31/93";
|
||||
#else
|
||||
__RCSID("$NetBSD: compkl.c,v 1.4 1997/10/12 21:24:33 christos Exp $");
|
||||
#endif
|
||||
#endif /* not lint */
|
||||
|
||||
#include <math.h>
|
||||
#include "trek.h"
|
||||
|
||||
/*
|
||||
** compute klingon distances
|
||||
**
|
||||
** The klingon list has the distances for all klingons recomputed
|
||||
** and sorted. The parameter is a Boolean flag which is set if
|
||||
** we have just entered a new quadrant.
|
||||
**
|
||||
** This routine is used every time the Enterprise or the Klingons
|
||||
** move.
|
||||
*/
|
||||
|
||||
static void sortkl __P((void));
|
||||
|
||||
void
|
||||
compkldist(f)
|
||||
int f; /* set if new quadrant */
|
||||
{
|
||||
int i, dx, dy;
|
||||
double d;
|
||||
double temp;
|
||||
|
||||
if (Etc.nkling == 0)
|
||||
return;
|
||||
for (i = 0; i < Etc.nkling; i++)
|
||||
{
|
||||
/* compute distance to the Klingon */
|
||||
dx = Ship.sectx - Etc.klingon[i].x;
|
||||
dy = Ship.secty - Etc.klingon[i].y;
|
||||
d = dx * dx + dy * dy;
|
||||
d = sqrt(d);
|
||||
|
||||
/* compute average of new and old distances to Klingon */
|
||||
if (!f)
|
||||
{
|
||||
temp = Etc.klingon[i].dist;
|
||||
Etc.klingon[i].avgdist = 0.5 * (temp + d);
|
||||
}
|
||||
else
|
||||
{
|
||||
/* new quadrant: average is current */
|
||||
Etc.klingon[i].avgdist = d;
|
||||
}
|
||||
Etc.klingon[i].dist = d;
|
||||
}
|
||||
|
||||
/* leave them sorted */
|
||||
sortkl();
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
** sort klingons
|
||||
**
|
||||
** bubble sort on ascending distance
|
||||
*/
|
||||
|
||||
static void
|
||||
sortkl()
|
||||
{
|
||||
struct kling t;
|
||||
int f, i, m;
|
||||
|
||||
m = Etc.nkling - 1;
|
||||
f = 1;
|
||||
while (f)
|
||||
{
|
||||
f = 0;
|
||||
for (i = 0; i < m; i++)
|
||||
if (Etc.klingon[i].dist > Etc.klingon[i+1].dist)
|
||||
{
|
||||
t = Etc.klingon[i];
|
||||
Etc.klingon[i] = Etc.klingon[i+1];
|
||||
Etc.klingon[i+1] = t;
|
||||
f = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user