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 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
… | |
… | |
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]; |
|
|
35 | char monsterstyle[512]; |
33 | char monsterstyle[512]; |
36 | char treasurestyle[512]; |
|
|
37 | char layoutstyle[512]; |
34 | char layoutstyle[512]; |
38 | char doorstyle[512]; |
35 | char doorstyle[512]; |
39 | char decorstyle[512]; |
|
|
40 | shstr origin_map; |
36 | shstr origin_map; |
41 | shstr final_map; |
37 | shstr final_map; |
42 | char exitstyle[512]; |
|
|
43 | shstr this_map; |
38 | shstr this_map; |
44 | char exit_on_final_map[512]; |
39 | char exit_on_final_map[512]; |
45 | char *custom; |
40 | |
46 | |
|
|
47 | int xsize, ysize; |
41 | int xsize, ysize; |
48 | int expand2x; |
42 | int expand2x; |
49 | int layoutoptions1; |
43 | int layoutoptions1; |
50 | int layoutoptions2; |
44 | int layoutoptions2; |
51 | int layoutoptions3; |
45 | int layoutoptions3; |
… | |
… | |
55 | float difficulty_increase; |
49 | float difficulty_increase; |
56 | |
50 | |
57 | int dungeon_level; |
51 | int dungeon_level; |
58 | int dungeon_depth; |
52 | int dungeon_depth; |
59 | |
53 | |
60 | int decoroptions; |
|
|
61 | int orientation; |
54 | int orientation; |
|
|
55 | int origin_x; |
62 | int origin_y; |
56 | int origin_y; |
63 | int origin_x; |
|
|
64 | uint32_t random_seed; |
57 | uint32_t random_seed; |
65 | uint64_t total_map_hp; |
58 | uint64_t total_map_hp; |
66 | int map_layout_style; |
59 | int map_layout_style; |
67 | int treasureoptions; |
|
|
68 | int symmetry_used; |
60 | int symmetry_used; |
69 | |
61 | |
70 | 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); } |
71 | |
83 | |
72 | // "private", adjusted sizes |
84 | // "private", adjusted sizes |
73 | int Xsize; |
85 | int Xsize; |
74 | int Ysize; |
86 | int Ysize; |
|
|
87 | |
|
|
88 | ~random_map_params (); |
75 | }; |
89 | }; |
76 | |
90 | |
77 | enum { |
91 | enum { |
78 | LAYOUT_NONE, |
92 | LAYOUT_NONE, |
79 | LAYOUT_ONION, |
93 | LAYOUT_ONION, |
… | |
… | |
136 | // > down |
150 | // > down |
137 | // C "center" (of onion layout) |
151 | // C "center" (of onion layout) |
138 | // . ?? (rogue) |
152 | // . ?? (rogue) |
139 | // |
153 | // |
140 | |
154 | |
141 | struct LayoutData : zero_initialised |
155 | struct LayoutData |
142 | { |
156 | { |
143 | char **col; |
157 | char **col; |
144 | int w, h; |
158 | int w, h; |
145 | |
159 | |
146 | LayoutData (int w, int h); |
160 | LayoutData (int w, int h); |
… | |
… | |
149 | operator char **() |
163 | operator char **() |
150 | { |
164 | { |
151 | return col; |
165 | return col; |
152 | } |
166 | } |
153 | |
167 | |
|
|
168 | void fill (char fill); |
154 | void clear (char fill = 0); |
169 | void clear () { fill (0); } |
155 | void border (char fill = '#'); |
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); |
156 | }; |
176 | }; |
157 | |
177 | |
158 | struct Layout |
178 | struct Layout |
159 | { |
179 | { |
160 | LayoutData *ptr; |
180 | LayoutData *ptr; |
… | |
… | |
192 | { |
212 | { |
193 | ::swap (layout.ptr->col, ptr->col); |
213 | ::swap (layout.ptr->col, ptr->col); |
194 | ::swap (layout.ptr->w , ptr->w ); |
214 | ::swap (layout.ptr->w , ptr->w ); |
195 | ::swap (layout.ptr->h , ptr->h ); |
215 | ::swap (layout.ptr->h , ptr->h ); |
196 | } |
216 | } |
|
|
217 | |
|
|
218 | // for debugging, print layout to stdout |
|
|
219 | void print (); |
|
|
220 | }; |
|
|
221 | |
|
|
222 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
223 | static inline int |
|
|
224 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
225 | { |
|
|
226 | swap (rmg_rndm, rndm); |
|
|
227 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
228 | swap (rmg_rndm, rndm); |
|
|
229 | return i; |
|
|
230 | } |
|
|
231 | |
|
|
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 | } |
197 | }; |
307 | }; |
198 | |
308 | |
199 | #endif |
309 | #endif |
200 | |
310 | |