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.40 by root, Sat Jul 3 02:19:10 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;
… …
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;
54 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
55
56 shstr_tmp as_shstr () const;
69 57
70 // fetch something from the options hash 58 // fetch something from the options hash
71 const_utf8_string get_str (const_utf8_string option, const_utf8_string fallback = "") const; 59 SV *get_sv (const char *option) const;
60 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; 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;
73 64
74 void set (const_utf8_string option, const_utf8_string value); 65 void set (const char *option, SV *value) const;
66 void set (const char *option, const_utf8_string value) const;
75 void set (const_utf8_string option, IV value); 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); }
76 72
77 // "private", adjusted sizes 73 // "private", adjusted sizes
78 int Xsize; 74 int Xsize;
79 int Ysize; 75 int Ysize;
80 76
77 random_map_params ();
78 random_map_params (HV *hv);
81 ~random_map_params (); 79 ~random_map_params ();
82}; 80};
83 81
84enum { 82enum {
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,
92 NROFLAYOUTS, 91 NROFLAYOUTS,
93}; 92};
94 93
95/* 94/*
96 * 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
… …
132// 12 has been experimentally :( determined ot be a lot more stable 131// 12 has been experimentally :( determined ot be a lot more stable
133// than 11 or 10, leading to the assumption that something inherently 132// than 11 or 10, leading to the assumption that something inherently
134// needs a minimum size of at least 12 133// needs a minimum size of at least 12
135#define MIN_RANDOM_MAP_SIZE 12 134#define MIN_RANDOM_MAP_SIZE 12
136 135
136// we often use signed chars for coordinates (and U8 for distances)
137#define MAX_RANDOM_MAP_SIZE 120
138
137// reference 139// reference
138// 140//
139// \0 floor only 141// \0 floor only
140// # wall 142// # wall
141// D door 143// D door
142// < up 144// < up
143// > down 145// > down
144// C "center" (of onion layout) 146// C "center" (of onion maze)
145// . ?? (rogue) 147// . ?? (rogue)
146// 148//
147 149
148struct LayoutData : zero_initialised 150// use this in new code
151INTERFACE_CLASS(layout)
152struct layout
149{ 153{
150 char **col; 154 typedef char cell;
155
156 cell **data;
151 int w, h; 157 int w, h;
152 158
153 LayoutData (int w, int h); 159 layout (int w, int h);
160 layout (layout &copy);
161 layout (layout &orig, int x1, int y1, int x2, int y2); // reference rect in other layout
154 ~LayoutData (); 162 ~layout ();
155 163
156 operator char **() 164 operator cell **() const
157 { 165 {
158 return col; 166 return data;
159 } 167 }
160 168
161 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); }
162 void border (char fill = '#'); 185 MTH void border (char fill = '#');
163}; 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
164 188
165struct Layout 189 MTH void fill_rand (int perc);
166{
167 LayoutData *ptr;
168 190
169 Layout () 191 // makes sure all areas are connected
170 { 192 MTH void isolation_remover ();
171 }
172 193
173 Layout (int xsize, int ysize) 194 // generates a cave, subtype 0 is a rough cave, randomly open or closed
174 : ptr (new LayoutData (xsize, ysize)) 195 MTH void gen_cave (int subtype);
175 {
176 }
177 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
178 Layout (random_map_params *RP) 205 void generate (random_map_params *RP);
179 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 206private:
180 { 207 int size;
181 } 208 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}; 209};
205 210
206// utility functions, to use rmg_rndm instead of rndm. 211// utility functions, to use rmg_rndm instead of rndm.
207static inline int 212static inline int
208rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 213rmg_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); 216 int i = find_free_spot (ob, m, x, y, start, stop);
212 swap (rmg_rndm, rndm); 217 swap (rmg_rndm, rndm);
213 return i; 218 return i;
214} 219}
215 220
221// a simple point helper struct
222struct point
223{
224 short x;
225 short y;
226
227 point ()
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
239template<typename T>
240struct 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);
263 }
264
265 void free ()
266 {
267 sfree (data, max);
268 data = 0;
269 }
270
271 ~fixed_stack ()
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
297 return v;
298 }
299};
300
216#endif 301#endif
217 302

Diff Legend

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