ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/room_gen_spiral.C
(Generate patch)

Comparing deliantra/server/random_maps/room_gen_spiral.C (file contents):
Revision 1.18 by root, Fri Mar 26 00:59:21 2010 UTC vs.
Revision 1.30 by root, Sun Jan 29 02:47:05 2017 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 1994 Mark Wedel 5 * Copyright (©) 1994 Mark Wedel
6 * Copyright (©) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the Affero GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25/* The onion room generator: 25/* The onion room generator:
26Onion rooms are like this: 26Onion rooms are like this:
27 27
28char **map_gen_spiral(int xsize, int ysize, int option); 28char **map_gen_spiral(int xsize, int ysize, int option);
29*/ 29*/
30 30
31#include <global.h> 31#include <global.h>
32#include <random_map.h> 32#include <rmg.h>
33#include <rproto.h> 33#include <rproto.h>
34 34
35#define RANDOM_OPTIONS 0 /* Pick random options below */ 35#define RANDOM_OPTIONS 0 /* Pick random options below */
36#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */ 36#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */
37#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */ 37#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */
… …
40 40
41#define MINDIST 3 41#define MINDIST 3
42 42
43#define MAX_FINE .454545 43#define MAX_FINE .454545
44 44
45extern int surround_check (char **maze, int i, int j, int xsize, int ysize);
46
47void 45void
48map_gen_spiral (Layout maze, int option) 46map_gen_spiral (layout &maze, int option)
49{ 47{
50 int i, j;
51 float parm = 0; 48 float parm = 0;
52 float x = 0, y = 0; 49 float x = 0, y = 0;
53 int ic, jc; 50 int ic, jc;
54 float SizeX, SizeY; 51 float SizeX, SizeY;
55 float xscale, yscale; 52 float xscale, yscale;
56 53
57 /* slightly easier to fill and then cut */ 54 /* slightly easier to fill and then cut */
58 maze->clear ('#'); 55 maze.fill ('#');
59 56
60 int xsize = maze->w; 57 int xsize = maze.w;
61 int ysize = maze->h; 58 int ysize = maze.h;
62 59
63 ic = xsize / 2; 60 ic = xsize / 2;
64 jc = ysize / 2; 61 jc = ysize / 2;
65 SizeX = xsize / 2 - 2; 62 SizeX = xsize / 2 - 2;
66 SizeY = ysize / 2 - 2; 63 SizeY = ysize / 2 - 2;
… …
69 if (option == 0) 66 if (option == 0)
70 option = rmg_rndm (MAX_SPIRAL_OPT); 67 option = rmg_rndm (MAX_SPIRAL_OPT);
71 68
72 /* the order in which these are evaluated matters */ 69 /* the order in which these are evaluated matters */
73 70
74 /* the following two are mutually exclusive. 71 /* the following two are mutually exclusive.
75 pick one if they're both set. */ 72 pick one if they're both set. */
76 if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL)) 73 if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
77 { 74 {
78 /* unset REGULAR_SPIRAL half the time */ 75 /* unset REGULAR_SPIRAL half the time */
79 if (rmg_rndm (2) && (option & REGULAR_SPIRAL)) 76 if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
… …
121 /* cut out the center in a 2x2 and place the center and downexit */ 118 /* cut out the center in a 2x2 and place the center and downexit */
122 maze[ic][jc + 1] = '>'; 119 maze[ic][jc + 1] = '>';
123 maze[ic][jc] = 'C'; 120 maze[ic][jc] = 'C';
124} 121}
125 122
126/* the following function connects disjoint spirals which may
127 result from the symmetrization process. */
128void
129connect_spirals (int xsize, int ysize, int sym, char **layout)
130{
131 int i, j, ic = xsize / 2, jc = ysize / 2;
132
133 if (sym == SYMMETRY_X)
134 {
135 layout[ic][jc] = 0;
136
137 /* go left from map center */
138 for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
139 layout[i][j] = 0;
140
141 /* go right */
142 for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
143 layout[i][j] = 0;
144 }
145
146 if (sym == SYMMETRY_Y)
147 {
148 layout[ic][jc] = 0;
149
150 /* go up */
151 for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
152 layout[i][j] = 0;
153
154 /* go down */
155 for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
156 layout[i][j] = 0;
157 }
158
159 if (sym == SYMMETRY_XY)
160 {
161 /* go left from map center */
162 layout[ic][jc / 2] = 0;
163 layout[ic / 2][jc] = 0;
164 layout[ic][jc / 2 + jc] = 0;
165 layout[ic / 2 + ic][jc] = 0;
166
167 for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
168 {
169 layout[i][j + jc] = 0;
170 layout[i][j] = 0;
171 }
172
173 /* go right */
174 for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
175 {
176 layout[i][j + jc] = 0;
177 layout[i][j] = 0;
178 }
179
180 /* go up */
181 for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
182 {
183 layout[i][j] = 0;
184 layout[i + ic][j] = 0;
185 }
186
187 /* go down */
188 for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
189 {
190 layout[i][j] = 0;
191 layout[i + ic][j] = 0;
192 }
193
194 }
195
196 /* get rid of bad doors. */
197 for (i = 0; i < xsize; i++)
198 for (j = 0; j < ysize; j++)
199 {
200 if (layout[i][j] == 'D')
201 { /* remove bad door. */
202 int si = surround_check (layout, i, j, xsize, ysize);
203
204 if (si != 3 && si != 12)
205 {
206 layout[i][j] = 0;
207 /* back up and recheck any nearby doors */
208 i = 0;
209 j = 0;
210 }
211 }
212 }
213}
214

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines