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.35 by root, Fri Jul 2 15:43:37 2010 UTC

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

Diff Legend

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