nethack-gwaa-kiwi/nethack
1
0
Fork 0
Code Pull Requests Activity

count_level_features() bit

Browse Source 
The relatively recent code to recalculate the number of fountains and
sinks on a level was including column 0.  levl[*][0] is not used for
the map.
This commit is contained in:
PatR
2023-08-12 15:01:02 -07:00
parent c155d23823
commit 7ea091048c
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/mklev.c
View File

@@ -1,4 +1,4 @@
/* NetHack 3.7 mklev.c $NHDT-Date: 1689629245 2023/07/17 21:27:25 $ $NHDT-Branch: NetHack-3.7 $:$NHDT-Revision: 1.154 $ */ /* NetHack 3.7 mklev.c $NHDT-Date: 1691877661 2023/08/12 22:01:01 $ $NHDT-Branch: NetHack-3.7 $:$NHDT-Revision: 1.155 $ */
/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */ /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/*-Copyright (c) Alex Smith, 2017. */ /*-Copyright (c) Alex Smith, 2017. */
/* NetHack may be freely redistributed. See license for details. */ /* NetHack may be freely redistributed. See license for details. */
@@ -739,7 +739,7 @@ count_level_features(void)
gl.level.flags.nfountains = gl.level.flags.nsinks = 0; gl.level.flags.nfountains = gl.level.flags.nsinks = 0;
for (y = 0; y < ROWNO; y++) for (y = 0; y < ROWNO; y++)
for (x = 0; x < COLNO; x++) { for (x = 1; x < COLNO; x++) {
int typ = levl[x][y].typ; int typ = levl[x][y].typ;
if (typ == FOUNTAIN) if (typ == FOUNTAIN)