1 1.8 dholland /* $NetBSD: compkl.c,v 1.8 2009/05/24 21:44:56 dholland 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.5 agc * 3. Neither the name of the University nor the names of its contributors 16 1.1 cgd * may be used to endorse or promote products derived from this software 17 1.1 cgd * without specific prior written permission. 18 1.1 cgd * 19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 1.1 cgd * SUCH DAMAGE. 30 1.1 cgd */ 31 1.1 cgd 32 1.4 christos #include <sys/cdefs.h> 33 1.1 cgd #ifndef lint 34 1.3 cgd #if 0 35 1.3 cgd static char sccsid[] = "@(#)compkl.c 8.1 (Berkeley) 5/31/93"; 36 1.3 cgd #else 37 1.8 dholland __RCSID("$NetBSD: compkl.c,v 1.8 2009/05/24 21:44:56 dholland Exp $"); 38 1.3 cgd #endif 39 1.1 cgd #endif /* not lint */ 40 1.1 cgd 41 1.4 christos #include <math.h> 42 1.4 christos #include "trek.h" 43 1.1 cgd 44 1.1 cgd /* 45 1.1 cgd ** compute klingon distances 46 1.1 cgd ** 47 1.1 cgd ** The klingon list has the distances for all klingons recomputed 48 1.1 cgd ** and sorted. The parameter is a Boolean flag which is set if 49 1.1 cgd ** we have just entered a new quadrant. 50 1.1 cgd ** 51 1.1 cgd ** This routine is used every time the Enterprise or the Klingons 52 1.1 cgd ** move. 53 1.7 dholland ** 54 1.7 dholland ** f -- set if new quadrant 55 1.1 cgd */ 56 1.1 cgd 57 1.6 jsm static void sortkl(void); 58 1.4 christos 59 1.4 christos void 60 1.7 dholland compkldist(int f) 61 1.1 cgd { 62 1.4 christos int i, dx, dy; 63 1.4 christos double d; 64 1.4 christos double temp; 65 1.1 cgd 66 1.1 cgd if (Etc.nkling == 0) 67 1.1 cgd return; 68 1.8 dholland for (i = 0; i < Etc.nkling; i++) { 69 1.1 cgd /* compute distance to the Klingon */ 70 1.1 cgd dx = Ship.sectx - Etc.klingon[i].x; 71 1.1 cgd dy = Ship.secty - Etc.klingon[i].y; 72 1.1 cgd d = dx * dx + dy * dy; 73 1.1 cgd d = sqrt(d); 74 1.1 cgd 75 1.1 cgd /* compute average of new and old distances to Klingon */ 76 1.8 dholland if (!f) { 77 1.1 cgd temp = Etc.klingon[i].dist; 78 1.1 cgd Etc.klingon[i].avgdist = 0.5 * (temp + d); 79 1.8 dholland } else { 80 1.1 cgd /* new quadrant: average is current */ 81 1.1 cgd Etc.klingon[i].avgdist = d; 82 1.1 cgd } 83 1.1 cgd Etc.klingon[i].dist = d; 84 1.1 cgd } 85 1.1 cgd 86 1.1 cgd /* leave them sorted */ 87 1.1 cgd sortkl(); 88 1.1 cgd } 89 1.1 cgd 90 1.1 cgd 91 1.1 cgd /* 92 1.1 cgd ** sort klingons 93 1.1 cgd ** 94 1.1 cgd ** bubble sort on ascending distance 95 1.1 cgd */ 96 1.1 cgd 97 1.4 christos static void 98 1.7 dholland sortkl(void) 99 1.1 cgd { 100 1.1 cgd struct kling t; 101 1.4 christos int f, i, m; 102 1.1 cgd 103 1.1 cgd m = Etc.nkling - 1; 104 1.1 cgd f = 1; 105 1.8 dholland while (f) { 106 1.1 cgd f = 0; 107 1.8 dholland for (i = 0; i < m; i++) { 108 1.8 dholland if (Etc.klingon[i].dist > Etc.klingon[i+1].dist) { 109 1.4 christos t = Etc.klingon[i]; 110 1.4 christos Etc.klingon[i] = Etc.klingon[i+1]; 111 1.4 christos Etc.klingon[i+1] = t; 112 1.1 cgd f = 1; 113 1.1 cgd } 114 1.8 dholland } 115 1.1 cgd } 116 1.1 cgd } 117