summaryrefslogtreecommitdiffstats
path: root/trek/compkl.c
diff options
context:
space:
mode:
authorcgd <cgd@NetBSD.org>1993-03-21 09:45:37 +0000
committercgd <cgd@NetBSD.org>1993-03-21 09:45:37 +0000
commit77e3814f0c0e3dea4d0032e25666f77e6f83bfff (patch)
tree7eddfcbf3dd12089e71dc3fafb0a106c5c5766c7 /trek/compkl.c
parente81d63576b2e46ab90da7d75fa155ea57ee4d32e (diff)
downloadbsdgames-darwin-77e3814f0c0e3dea4d0032e25666f77e6f83bfff.tar.gz
bsdgames-darwin-77e3814f0c0e3dea4d0032e25666f77e6f83bfff.tar.zst
bsdgames-darwin-77e3814f0c0e3dea4d0032e25666f77e6f83bfff.zip
initial import of 386bsd-0.1 sources
Diffstat (limited to 'trek/compkl.c')
-rw-r--r--trek/compkl.c112
1 files changed, 112 insertions, 0 deletions
diff --git a/trek/compkl.c b/trek/compkl.c
new file mode 100644
index 00000000..ad1d61cf
--- /dev/null
+++ b/trek/compkl.c
@@ -0,0 +1,112 @@
+/*
+ * Copyright (c) 1980 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.
+ */
+
+#ifndef lint
+static char sccsid[] = "@(#)compkl.c 5.4 (Berkeley) 6/1/90";
+#endif /* not lint */
+
+# 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.
+*/
+
+compkldist(f)
+int f; /* set if new quadrant */
+{
+ register 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
+*/
+
+sortkl()
+{
+ struct kling t;
+ register 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)
+ {
+ bmove(&Etc.klingon[i], &t, sizeof t);
+ bmove(&Etc.klingon[i+1], &Etc.klingon[i], sizeof t);
+ bmove(&t, &Etc.klingon[i+1], sizeof t);
+ f = 1;
+ }
+ }
+}