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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 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 | #ifndef RANDOM_MAP_H |
25 | #ifndef RANDOM_MAP_H |
25 | #define RANDOM_MAP_H |
26 | #define RANDOM_MAP_H |
26 | |
27 | |
27 | #include "util.h" |
28 | #include "util.h" |
28 | |
29 | |
29 | struct random_map_params |
30 | struct random_map_params : zero_initialised |
30 | { |
31 | { |
31 | char wallstyle[512]; |
|
|
32 | char wall_name[512]; |
32 | char wall_name[512]; |
33 | char floorstyle[512]; |
|
|
34 | char monsterstyle[512]; |
33 | char monsterstyle[512]; |
35 | char treasurestyle[512]; |
|
|
36 | char layoutstyle[512]; |
34 | char layoutstyle[512]; |
37 | char doorstyle[512]; |
35 | char doorstyle[512]; |
38 | char decorstyle[512]; |
|
|
39 | shstr origin_map; |
36 | shstr origin_map; |
40 | shstr final_map; |
37 | shstr final_map; |
41 | char exitstyle[512]; |
|
|
42 | shstr this_map; |
38 | shstr this_map; |
43 | char exit_on_final_map[512]; |
39 | char exit_on_final_map[512]; |
44 | char *custom; |
40 | |
45 | |
|
|
46 | int xsize, ysize; |
41 | int xsize, ysize; |
47 | int expand2x; |
42 | int expand2x; |
48 | int layoutoptions1; |
43 | int layoutoptions1; |
49 | int layoutoptions2; |
44 | int layoutoptions2; |
50 | int layoutoptions3; |
45 | int layoutoptions3; |
… | |
… | |
54 | float difficulty_increase; |
49 | float difficulty_increase; |
55 | |
50 | |
56 | int dungeon_level; |
51 | int dungeon_level; |
57 | int dungeon_depth; |
52 | int dungeon_depth; |
58 | |
53 | |
59 | int decoroptions; |
|
|
60 | int orientation; |
54 | int orientation; |
|
|
55 | int origin_x; |
61 | int origin_y; |
56 | int origin_y; |
62 | int origin_x; |
|
|
63 | uint32_t random_seed; |
57 | uint32_t random_seed; |
64 | uint64_t total_map_hp; |
58 | uint64_t total_map_hp; |
65 | int map_layout_style; |
59 | int map_layout_style; |
66 | int treasureoptions; |
|
|
67 | int symmetry_used; |
60 | int symmetry_used; |
68 | |
61 | |
69 | struct region *region; |
62 | struct region *region; |
|
|
63 | |
|
|
64 | HV *hv; |
|
|
65 | void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv }) |
|
|
66 | |
|
|
67 | shstr_tmp as_shstr () const; |
|
|
68 | |
|
|
69 | // fetch something from the options hash |
|
|
70 | SV *get_sv (const char *option) const; |
|
|
71 | const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const; |
|
|
72 | IV get_iv (const char *option, IV fallback = 0) const; |
|
|
73 | UV get_uv (const char *option, UV fallback = 0) const; |
|
|
74 | NV get_nv (const char *option, NV fallback = 0) const; |
|
|
75 | |
|
|
76 | void set (const char *option, SV *value) const; |
|
|
77 | void set (const char *option, const_utf8_string value) const; |
|
|
78 | void set (const char *option, IV value) const; |
|
|
79 | void set (const char *option, UV value) const; |
|
|
80 | void set (const char *option, NV value) const; |
|
|
81 | |
|
|
82 | void set (const char *option, int value) const { set (option, (IV)value); } |
70 | |
83 | |
71 | // "private", adjusted sizes |
84 | // "private", adjusted sizes |
72 | int Xsize; |
85 | int Xsize; |
73 | int Ysize; |
86 | int Ysize; |
|
|
87 | |
|
|
88 | ~random_map_params (); |
74 | }; |
89 | }; |
75 | |
90 | |
76 | enum { |
91 | enum { |
77 | LAYOUT_NONE, |
92 | LAYOUT_NONE, |
78 | LAYOUT_ONION, |
93 | LAYOUT_ONION, |
79 | LAYOUT_MAZE, |
94 | LAYOUT_MAZE, |
80 | LAYOUT_SPIRAL, |
95 | LAYOUT_SPIRAL, |
81 | LAYOUT_ROGUELIKE, |
96 | LAYOUT_ROGUELIKE, |
82 | LAYOUT_SNAKE, |
97 | LAYOUT_SNAKE, |
83 | LAYOUT_SQUARE_SPIRAL, |
98 | LAYOUT_SQUARE_SPIRAL, |
|
|
99 | LAYOUT_CAVE, |
84 | NROFLAYOUTS, |
100 | NROFLAYOUTS, |
85 | }; |
101 | }; |
86 | |
102 | |
87 | /* |
103 | /* |
88 | * Move these defines out of room_gen_onion.c to here, as |
104 | * Move these defines out of room_gen_onion.c to here, as |
… | |
… | |
124 | // 12 has been experimentally :( determined ot be a lot more stable |
140 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // than 11 or 10, leading to the assumption that something inherently |
141 | // than 11 or 10, leading to the assumption that something inherently |
126 | // needs a minimum size of at least 12 |
142 | // needs a minimum size of at least 12 |
127 | #define MIN_RANDOM_MAP_SIZE 12 |
143 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | |
144 | |
|
|
145 | // we often use signed chars for coordinates (and U8 for distances) |
|
|
146 | #define MAX_RANDOM_MAP_SIZE 120 |
|
|
147 | |
129 | // reference |
148 | // reference |
130 | // |
149 | // |
131 | // \0 floor only |
150 | // \0 floor only |
132 | // # wall |
151 | // # wall |
133 | // D door |
152 | // D door |
134 | // < up |
153 | // < up |
135 | // > down |
154 | // > down |
136 | // C "center" (of onion layout) |
155 | // C "center" (of onion maze) |
137 | // . ?? (rogue) |
156 | // . ?? (rogue) |
138 | // |
157 | // |
139 | |
158 | |
140 | struct LayoutData : zero_initialised |
159 | // use this in new code |
|
|
160 | INTERFACE_CLASS(layout) |
|
|
161 | struct layout |
141 | { |
162 | { |
142 | char **col; |
163 | typedef char cell; |
|
|
164 | |
|
|
165 | cell **data; |
143 | int w, h; |
166 | int w, h; |
144 | |
167 | |
145 | LayoutData (int w, int h); |
168 | layout (int w, int h); |
146 | ~LayoutData (); |
169 | ~layout (); |
147 | |
170 | |
148 | operator char **() |
171 | operator cell **() const |
149 | { |
172 | { |
150 | return col; |
173 | return data; |
151 | } |
174 | } |
152 | |
175 | |
153 | void clear (char fill = 0); |
176 | void swap (layout &maze) |
|
|
177 | { |
|
|
178 | ::swap (maze.data, data); |
|
|
179 | ::swap (maze.w , w ); |
|
|
180 | ::swap (maze.h , h ); |
|
|
181 | } |
|
|
182 | |
|
|
183 | MTH void swap (layout *maze) { swap (*maze); } |
|
|
184 | |
|
|
185 | // for debugging, print maze to stdout |
|
|
186 | MTH void print () const; |
|
|
187 | |
|
|
188 | // simple inpainting |
|
|
189 | MTH void fill (char fill); |
|
|
190 | MTH void clear () { fill (0); } |
154 | void border (char fill = '#'); |
191 | MTH void border (char fill = '#'); |
155 | }; |
192 | MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
156 | |
193 | |
157 | struct Layout |
194 | MTH void fill_rand (int perc); |
158 | { |
|
|
159 | LayoutData *ptr; |
|
|
160 | |
195 | |
161 | Layout () |
196 | // makes sure all areas are connected. dirty=true carves rounder but also |
162 | { |
197 | // more walls, dirty=false carves narrow corridors. |
163 | } |
198 | MTH void isolation_remover (bool dirty = 0); |
164 | |
199 | |
165 | Layout (int xsize, int ysize) |
200 | // generates a cave, subtype 0 is a rough cave, randomly open or closed |
166 | : ptr (new LayoutData (xsize, ysize)) |
201 | MTH void gen_cave (int subtype); |
167 | { |
|
|
168 | } |
|
|
169 | |
202 | |
|
|
203 | // helper functions to modify the maze |
|
|
204 | MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
|
|
205 | MTH void doorify (); |
|
|
206 | MTH void roomify (); // make some rooms in it, works best on onions |
|
|
207 | MTH void expand2x (); |
|
|
208 | MTH void symmetrize (int symmetry); |
|
|
209 | MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees |
|
|
210 | |
170 | Layout (random_map_params *RP) |
211 | void generate (random_map_params *RP); |
171 | : ptr (new LayoutData (RP->Xsize, RP->Ysize)) |
212 | }; |
|
|
213 | |
|
|
214 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
215 | static inline int |
|
|
216 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
217 | { |
|
|
218 | swap (rmg_rndm, rndm); |
|
|
219 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
220 | swap (rmg_rndm, rndm); |
|
|
221 | return i; |
|
|
222 | } |
|
|
223 | |
|
|
224 | // a simple point helper struct |
|
|
225 | struct point |
|
|
226 | { |
|
|
227 | short x; |
|
|
228 | short y; |
|
|
229 | |
|
|
230 | point () |
172 | { |
231 | { |
|
|
232 | } |
|
|
233 | |
|
|
234 | point (int x, int y) |
|
|
235 | : x(x), y(y) |
|
|
236 | { |
|
|
237 | } |
|
|
238 | }; |
|
|
239 | |
|
|
240 | // something like a vector or stack, but without |
|
|
241 | // out of bounds checking |
|
|
242 | template<typename T> |
|
|
243 | struct fixed_stack |
|
|
244 | { |
|
|
245 | T *data; |
|
|
246 | int size; |
|
|
247 | int max; |
|
|
248 | |
|
|
249 | fixed_stack () |
|
|
250 | : size (0), data (0) |
|
|
251 | { |
|
|
252 | } |
|
|
253 | |
|
|
254 | fixed_stack (int max) |
|
|
255 | : size (0), max (max) |
|
|
256 | { |
|
|
257 | data = salloc<T> (max); |
|
|
258 | } |
|
|
259 | |
|
|
260 | void reset (int new_max) |
|
|
261 | { |
|
|
262 | sfree (data, max); |
|
|
263 | size = 0; |
|
|
264 | max = new_max; |
|
|
265 | data = salloc<T> (max); |
173 | } |
266 | } |
174 | |
267 | |
175 | void free () |
268 | void free () |
176 | { |
269 | { |
177 | delete ptr; |
270 | sfree (data, max); |
|
|
271 | data = 0; |
178 | } |
272 | } |
179 | |
273 | |
180 | LayoutData *operator ->() const |
274 | ~fixed_stack () |
181 | { |
275 | { |
|
|
276 | sfree (data, max); |
|
|
277 | } |
|
|
278 | |
|
|
279 | T &operator[](int idx) |
|
|
280 | { |
|
|
281 | return data [idx]; |
|
|
282 | } |
|
|
283 | |
|
|
284 | void push (T v) |
|
|
285 | { |
|
|
286 | data [size++] = v; |
|
|
287 | } |
|
|
288 | |
|
|
289 | T &pop () |
|
|
290 | { |
|
|
291 | return data [--size]; |
|
|
292 | } |
|
|
293 | |
|
|
294 | T remove (int idx) |
|
|
295 | { |
|
|
296 | T v = data [idx]; |
|
|
297 | |
|
|
298 | data [idx] = data [--size]; |
|
|
299 | |
182 | return ptr; |
300 | return v; |
183 | } |
|
|
184 | |
|
|
185 | operator char **() const |
|
|
186 | { |
|
|
187 | return *ptr; |
|
|
188 | } |
|
|
189 | |
|
|
190 | void swap (const Layout &layout) const |
|
|
191 | { |
|
|
192 | ::swap (layout.ptr->col, ptr->col); |
|
|
193 | ::swap (layout.ptr->w , ptr->w ); |
|
|
194 | ::swap (layout.ptr->h , ptr->h ); |
|
|
195 | } |
301 | } |
196 | }; |
302 | }; |
197 | |
303 | |
198 | #endif |
304 | #endif |
199 | |
305 | |