ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/random_map.h
(Generate patch)

Comparing deliantra/server/random_maps/random_map.h (file contents):
Revision 1.26 by root, Sat Jun 26 22:10:18 2010 UTC vs.
Revision 1.44 by root, Sun Jul 4 00:58:18 2010 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines