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.11 by root, Thu Nov 8 19:43:25 2007 UTC vs.
Revision 1.16 by root, Mon Oct 12 14:00:58 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 1994,2007 Mark Wedel 5 * Copyright (©) 1994,2007 Mark Wedel
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your 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 GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * 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>
22 */ 23 */
23 24
24/* The onion room generator: 25/* The onion room generator:
25Onion rooms are like this: 26Onion rooms are like this:
26 27
27char **map_gen_spiral(int xsize, int ysize, int option); 28char **map_gen_spiral(int xsize, int ysize, int option);
28
29
30*/ 29*/
30
31#include <global.h> 31#include <global.h>
32#include <random_map.h> 32#include <random_map.h>
33 33
34#define RANDOM_OPTIONS 0 /* Pick random options below */ 34#define RANDOM_OPTIONS 0 /* Pick random options below */
35#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */ 35#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */
… …
49 49
50#define MAX_FINE .454545 50#define MAX_FINE .454545
51 51
52extern int surround_check (char **maze, int i, int j, int xsize, int ysize); 52extern int surround_check (char **maze, int i, int j, int xsize, int ysize);
53 53
54char ** 54void
55map_gen_spiral (int xsize, int ysize, int option) 55map_gen_spiral (Layout maze, int option)
56{ 56{
57 int i, j; 57 int i, j;
58 float parm = 0; 58 float parm = 0;
59 float x = 0, y = 0; 59 float x = 0, y = 0;
60 int ic, jc; 60 int ic, jc;
61 float SizeX, SizeY; 61 float SizeX, SizeY;
62 float xscale, yscale; 62 float xscale, yscale;
63 63
64 /* allocate that array, set it up */
65 char **maze = (char **) calloc (sizeof (char *), xsize);
66
67 for (i = 0; i < xsize; i++)
68 {
69 maze[i] = (char *) calloc (sizeof (char), ysize);
70 }
71
72 /* slightly easier to fill and then cut */ 64 /* slightly easier to fill and then cut */
73 for (i = 0; i < xsize; i++) 65 maze->clear ('#');
74 for (j = 0; j < ysize; j++) 66
75 maze[i][j] = '#'; 67 int xsize = maze->w;
68 int ysize = maze->h;
76 69
77 ic = xsize / 2; 70 ic = xsize / 2;
78 jc = ysize / 2; 71 jc = ysize / 2;
79 SizeX = xsize / 2 - 2; 72 SizeX = xsize / 2 - 2;
80 SizeY = ysize / 2 - 2; 73 SizeY = ysize / 2 - 2;
81 74
82 /* select random options if necessary */ 75 /* select random options if necessary */
83 if (option == 0) 76 if (option == 0)
84 {
85 option = rndm (MAX_SPIRAL_OPT); 77 option = rmg_rndm (MAX_SPIRAL_OPT);
86 }
87 78
88 /* the order in which these are evaluated matters */ 79 /* the order in which these are evaluated matters */
89 80
90 /* the following two are mutually exclusive. 81 /* the following two are mutually exclusive.
91 pick one if they're both set. */ 82 pick one if they're both set. */
92 if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL)) 83 if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
93 { 84 {
94 /* unset REGULAR_SPIRAL half the time */ 85 /* unset REGULAR_SPIRAL half the time */
95 if (rndm (2) && (option & REGULAR_SPIRAL)) 86 if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
96 option -= REGULAR_SPIRAL; 87 option -= REGULAR_SPIRAL;
97 else 88 else
98 option -= FIT_SPIRAL; 89 option -= FIT_SPIRAL;
99 } 90 }
100 91
101 xscale = yscale = MAX_FINE; /* fine spiral */ 92 xscale = yscale = MAX_FINE; /* fine spiral */
102 93
103 /* choose the spiral pitch */ 94 /* choose the spiral pitch */
104 if (!(option & FINE_SPIRAL)) 95 if (!(option & FINE_SPIRAL))
105 { 96 {
106 float pitch = (rndm (5)) / 10. + 10. / 22.; 97 float pitch = (rmg_rndm (5)) / 10. + 10. / 22.;
107 98
108 xscale = yscale = pitch; 99 xscale = yscale = pitch;
109 } 100 }
110 101
111 if ((option & FIT_SPIRAL) && (xsize != ysize)) 102 if ((option & FIT_SPIRAL) && (xsize != ysize))
… …
126 /* cut out the spiral */ 117 /* cut out the spiral */
127 while ((fabs (x) < SizeX) && (fabs (y) < SizeY)) 118 while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
128 { 119 {
129 x = parm * cos (parm) * xscale; 120 x = parm * cos (parm) * xscale;
130 y = parm * sin (parm) * yscale; 121 y = parm * sin (parm) * yscale;
131 maze[(int) (ic + x)][(int) (jc + y)] = '\0'; 122 maze[int (ic + x)][int (jc + y)] = '\0';
132 parm += 0.01; 123 parm += 0.01;
133 }; 124 }
134 125
135 maze[(int) (ic + x + 0.5)][(int) (jc + y + 0.5)] = '<'; 126 maze[int (ic + x + 0.5)][int (jc + y + 0.5)] = '<';
136
137 127
138 /* cut out the center in a 2x2 and place the center and downexit */ 128 /* cut out the center in a 2x2 and place the center and downexit */
139 maze[ic][jc + 1] = '>'; 129 maze[ic][jc + 1] = '>';
140 maze[ic][jc] = 'C'; 130 maze[ic][jc] = 'C';
141
142
143 return maze;
144} 131}
145 132
146/* the following function connects disjoint spirals which may 133/* the following function connects disjoint spirals which may
147 result from the symmetrization process. */ 134 result from the symmetrization process. */
148void 135void
149connect_spirals (int xsize, int ysize, int sym, char **layout) 136connect_spirals (int xsize, int ysize, int sym, char **layout)
150{ 137{
151
152 int i, j, ic = xsize / 2, jc = ysize / 2; 138 int i, j, ic = xsize / 2, jc = ysize / 2;
153 139
154 if (sym == SYMMETRY_X) 140 if (sym == SYMMETRY_X)
155 { 141 {
156 layout[ic][jc] = 0; 142 layout[ic][jc] = 0;
143
157 /* go left from map center */ 144 /* go left from map center */
158 for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--) 145 for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
159 layout[i][j] = 0; 146 layout[i][j] = 0;
147
160 /* go right */ 148 /* go right */
161 for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++) 149 for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
162 layout[i][j] = 0; 150 layout[i][j] = 0;
163 } 151 }
164 152
165 if (sym == SYMMETRY_Y) 153 if (sym == SYMMETRY_Y)
166 { 154 {
167
168 layout[ic][jc] = 0; 155 layout[ic][jc] = 0;
156
169 /* go up */ 157 /* go up */
170 for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--) 158 for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
171 layout[i][j] = 0; 159 layout[i][j] = 0;
160
172 /* go down */ 161 /* go down */
173 for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++) 162 for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
174 layout[i][j] = 0; 163 layout[i][j] = 0;
175 } 164 }
176 165
… …
179 /* go left from map center */ 168 /* go left from map center */
180 layout[ic][jc / 2] = 0; 169 layout[ic][jc / 2] = 0;
181 layout[ic / 2][jc] = 0; 170 layout[ic / 2][jc] = 0;
182 layout[ic][jc / 2 + jc] = 0; 171 layout[ic][jc / 2 + jc] = 0;
183 layout[ic / 2 + ic][jc] = 0; 172 layout[ic / 2 + ic][jc] = 0;
173
184 for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--) 174 for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
185 { 175 {
186 layout[i][j + jc] = 0; 176 layout[i][j + jc] = 0;
187 layout[i][j] = 0; 177 layout[i][j] = 0;
188 } 178 }
179
189 /* go right */ 180 /* go right */
190 for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++) 181 for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
191 { 182 {
192 layout[i][j + jc] = 0; 183 layout[i][j + jc] = 0;
193 layout[i][j] = 0; 184 layout[i][j] = 0;
194 } 185 }
186
195 /* go up */ 187 /* go up */
196 for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--) 188 for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
197 { 189 {
198 layout[i][j] = 0; 190 layout[i][j] = 0;
199 layout[i + ic][j] = 0; 191 layout[i + ic][j] = 0;
200 } 192 }
193
201 /* go down */ 194 /* go down */
202 for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++) 195 for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
203 { 196 {
204 layout[i][j] = 0; 197 layout[i][j] = 0;
205 layout[i + ic][j] = 0; 198 layout[i + ic][j] = 0;
… …
222 i = 0; 215 i = 0;
223 j = 0; 216 j = 0;
224 } 217 }
225 } 218 }
226 } 219 }
227
228
229
230} 220}
221

Diff Legend

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