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