mirrors/BSDGames
1
0
Fork 0
mirror of https://github.com/vattam/BSDGames.git synced 2025-12-20 19:04:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Initial revision

Browse Source 
git-svn-id: file:///srv/svn/joey/bsdgames-trunk@5086 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
joey
1999-09-08 23:56:51 +00:00
commit 03272d67da
623 changed files with 243457 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

118
trek/lrscan.c Normal file
View File

@@ -0,0 +1,118 @@
/* $NetBSD: lrscan.c,v 1.4 1997/10/12 21:24:59 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[] = "@(#)lrscan.c 8.1 (Berkeley) 5/31/93";
#else
__RCSID("$NetBSD: lrscan.c,v 1.4 1997/10/12 21:24:59 christos Exp $");
#endif
#endif /* not lint */
#include <stdio.h>
#include "trek.h"
/*
** LONG RANGE OF SCANNERS
**
** A summary of the quadrants that surround you is printed. The
** hundreds digit is the number of Klingons in the quadrant,
** the tens digit is the number of starbases, and the units digit
** is the number of stars. If the printout is "///" it means
** that that quadrant is rendered uninhabitable by a supernova.
** It also updates the "scanned" field of the quadrants it scans,
** for future use by the "chart" option of the computer.
*/
/*ARGSUSED*/
void
lrscan(v)
int v __attribute__((unused));
{
int i, j;
struct quad *q;
if (check_out(LRSCAN))
{
return;
}
printf("Long range scan for quadrant %d,%d\n\n", Ship.quadx, Ship.quady);
/* print the header on top */
for (j = Ship.quady - 1; j <= Ship.quady + 1; j++)
{
if (j < 0 || j >= NQUADS)
printf(" ");
else
printf(" %1d", j);
}
/* scan the quadrants */
for (i = Ship.quadx - 1; i <= Ship.quadx + 1; i++)
{
printf("\n -------------------\n");
if (i < 0 || i >= NQUADS)
{
/* negative energy barrier */
printf(" ! * ! * ! * !");
continue;
}
/* print the left hand margin */
printf("%1d !", i);
for (j = Ship.quady - 1; j <= Ship.quady + 1; j++)
{
if (j < 0 || j >= NQUADS)
{
/* negative energy barrier again */
printf(" * !");
continue;
}
q = &Quad[i][j];
if (q->stars < 0)
{
/* supernova */
printf(" /// !");
q->scanned = 1000;
continue;
}
q->scanned = q->klings * 100 + q->bases * 10 + q->stars;
printf(" %3d !", q->scanned);
}
}
printf("\n -------------------\n");
return;
}