summaryrefslogtreecommitdiffstats
path: root/crawl-ref/source/dungeon.cc
diff options
context:
space:
mode:
authordolorous <dolorous@c06c8d41-db1a-0410-9941-cceddc491573>2008-10-23 06:11:53 +0000
committerdolorous <dolorous@c06c8d41-db1a-0410-9941-cceddc491573>2008-10-23 06:11:53 +0000
commitbcaca7e157d99d683b6c389b99cc25b5e1286e13 (patch)
treea11a518b7c98d69929c695aaff0bb999cd5ec627 /crawl-ref/source/dungeon.cc
parent6613e6733b6c49285266bd5df92ca93fc5b6b091 (diff)
downloadcrawl-ref-bcaca7e157d99d683b6c389b99cc25b5e1286e13.tar.gz
crawl-ref-bcaca7e157d99d683b6c389b99cc25b5e1286e13.zip
Add whitespace fixes.
git-svn-id: https://crawl-ref.svn.sourceforge.net/svnroot/crawl-ref/trunk@7294 c06c8d41-db1a-0410-9941-cceddc491573
Diffstat (limited to 'crawl-ref/source/dungeon.cc')
-rw-r--r--crawl-ref/source/dungeon.cc10
1 files changed, 5 insertions, 5 deletions
diff --git a/crawl-ref/source/dungeon.cc b/crawl-ref/source/dungeon.cc
index ac83dca08d..f3c51fedc7 100644
--- a/crawl-ref/source/dungeon.cc
+++ b/crawl-ref/source/dungeon.cc
@@ -1275,7 +1275,7 @@ static bool _fixup_stone_stairs(bool preserve_vault_stairs)
return success;
}
-static bool _add_feat_if_missing(bool (*iswanted)(const coord_def &),
+static bool _add_feat_if_missing(bool (*iswanted)(const coord_def &),
dungeon_feature_type feat)
{
memset(travel_point_distance, 0, sizeof(travel_distance_grid_t));
@@ -1317,7 +1317,7 @@ static bool _add_feat_if_missing(bool (*iswanted)(const coord_def &),
if (travel_point_distance[rnd.x][rnd.y] != nzones)
continue;
-
+
grd(rnd) = feat;
return (true);
}
@@ -1359,7 +1359,7 @@ static bool _add_connecting_escape_hatches()
return (_add_feat_if_missing(_is_perm_down_stair, DNGN_ESCAPE_HATCH_DOWN));
}
-static bool _branch_entrances_are_connected()
+static bool _branch_entrances_are_connected()
{
// Returns true if all branch entrances on the level are connected to
// stone stairs.
@@ -8121,7 +8121,7 @@ static bool _fixup_interlevel_connectivity()
if (up_region[i] == -1)
return (false);
}
-
+
region_connected.resize(max_region + 1);
for (unsigned int i = 0; i < region_connected.size(); i++)
region_connected[i] = false;
@@ -8183,7 +8183,7 @@ static bool _fixup_interlevel_connectivity()
}
if (!unique_region)
continue;
-
+
// Try first to assign to any connected regions.
for (int j = 0; j < 3; j++)
{