compkl.c 3.1 KB

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