Home | History | Annotate | Line # | Download | only in trek
compkl.c revision 1.3
      1  1.3  cgd /*	$NetBSD: compkl.c,v 1.3 1995/04/22 10:58:38 cgd Exp $	*/
      2  1.3  cgd 
      3  1.1  cgd /*
      4  1.3  cgd  * Copyright (c) 1980, 1993
      5  1.3  cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1  cgd  * modification, are permitted provided that the following conditions
      9  1.1  cgd  * are met:
     10  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *	This product includes software developed by the University of
     18  1.1  cgd  *	California, Berkeley and its contributors.
     19  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1  cgd  *    may be used to endorse or promote products derived from this software
     21  1.1  cgd  *    without specific prior written permission.
     22  1.1  cgd  *
     23  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1  cgd  * SUCH DAMAGE.
     34  1.1  cgd  */
     35  1.1  cgd 
     36  1.1  cgd #ifndef lint
     37  1.3  cgd #if 0
     38  1.3  cgd static char sccsid[] = "@(#)compkl.c	8.1 (Berkeley) 5/31/93";
     39  1.3  cgd #else
     40  1.3  cgd static char rcsid[] = "$NetBSD: compkl.c,v 1.3 1995/04/22 10:58:38 cgd Exp $";
     41  1.3  cgd #endif
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.1  cgd # include	"trek.h"
     45  1.1  cgd 
     46  1.1  cgd /*
     47  1.1  cgd **  compute klingon distances
     48  1.1  cgd **
     49  1.1  cgd **	The klingon list has the distances for all klingons recomputed
     50  1.1  cgd **	and sorted.  The parameter is a Boolean flag which is set if
     51  1.1  cgd **	we have just entered a new quadrant.
     52  1.1  cgd **
     53  1.1  cgd **	This routine is used every time the Enterprise or the Klingons
     54  1.1  cgd **	move.
     55  1.1  cgd */
     56  1.1  cgd 
     57  1.1  cgd compkldist(f)
     58  1.1  cgd int	f;		/* set if new quadrant */
     59  1.1  cgd {
     60  1.1  cgd 	register int		i, dx, dy;
     61  1.1  cgd 	double			d;
     62  1.1  cgd 	double			temp;
     63  1.1  cgd 
     64  1.1  cgd 	if (Etc.nkling == 0)
     65  1.1  cgd 		return;
     66  1.1  cgd 	for (i = 0; i < Etc.nkling; i++)
     67  1.1  cgd 	{
     68  1.1  cgd 		/* compute distance to the Klingon */
     69  1.1  cgd 		dx = Ship.sectx - Etc.klingon[i].x;
     70  1.1  cgd 		dy = Ship.secty - Etc.klingon[i].y;
     71  1.1  cgd 		d = dx * dx + dy * dy;
     72  1.1  cgd 		d = sqrt(d);
     73  1.1  cgd 
     74  1.1  cgd 		/* compute average of new and old distances to Klingon */
     75  1.1  cgd 		if (!f)
     76  1.1  cgd 		{
     77  1.1  cgd 			temp = Etc.klingon[i].dist;
     78  1.1  cgd 			Etc.klingon[i].avgdist = 0.5 * (temp + d);
     79  1.1  cgd 		}
     80  1.1  cgd 		else
     81  1.1  cgd 		{
     82  1.1  cgd 			/* new quadrant: average is current */
     83  1.1  cgd 			Etc.klingon[i].avgdist = d;
     84  1.1  cgd 		}
     85  1.1  cgd 		Etc.klingon[i].dist = d;
     86  1.1  cgd 	}
     87  1.1  cgd 
     88  1.1  cgd 	/* leave them sorted */
     89  1.1  cgd 	sortkl();
     90  1.1  cgd }
     91  1.1  cgd 
     92  1.1  cgd 
     93  1.1  cgd /*
     94  1.1  cgd **  sort klingons
     95  1.1  cgd **
     96  1.1  cgd **	bubble sort on ascending distance
     97  1.1  cgd */
     98  1.1  cgd 
     99  1.1  cgd sortkl()
    100  1.1  cgd {
    101  1.1  cgd 	struct kling		t;
    102  1.1  cgd 	register int		f, i, m;
    103  1.1  cgd 
    104  1.1  cgd 	m = Etc.nkling - 1;
    105  1.1  cgd 	f = 1;
    106  1.1  cgd 	while (f)
    107  1.1  cgd 	{
    108  1.1  cgd 		f = 0;
    109  1.1  cgd 		for (i = 0; i < m; i++)
    110  1.1  cgd 			if (Etc.klingon[i].dist > Etc.klingon[i+1].dist)
    111  1.1  cgd 			{
    112  1.1  cgd 				bmove(&Etc.klingon[i], &t, sizeof t);
    113  1.1  cgd 				bmove(&Etc.klingon[i+1], &Etc.klingon[i], sizeof t);
    114  1.1  cgd 				bmove(&t, &Etc.klingon[i+1], sizeof t);
    115  1.1  cgd 				f = 1;
    116  1.1  cgd 			}
    117  1.1  cgd 	}
    118  1.1  cgd }
    119