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