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