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.28 by root, Wed Jun 30 01:32:57 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 layoutstyle[512];
35 char doorstyle[512];
36 shstr origin_map;
37 shstr final_map;
38 shstr this_map;
39 char exit_on_final_map[512];
40 33
41 int xsize, ysize; 34 int xsize, ysize;
42 int expand2x; 35 int expand2x;
43 int layoutoptions1; 36 int layoutoptions1;
44 int layoutoptions2; 37 int layoutoptions2;
… …
50 43
51 int dungeon_level; 44 int dungeon_level;
52 int dungeon_depth; 45 int dungeon_depth;
53 46
54 int orientation; 47 int orientation;
55 int origin_x;
56 int origin_y;
57 uint32_t random_seed; 48 uint32_t random_seed;
58 uint64_t total_map_hp; 49 uint64_t total_map_hp;
59 int map_layout_style; 50 int map_layout_style;
60 int symmetry_used; 51 int symmetry_used;
61
62 struct region *region;
63 52
64 HV *hv; 53 HV *hv;
65 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv }) 54 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
66 55
67 shstr_tmp as_shstr () const; 56 shstr_tmp as_shstr () const;
… …
83 72
84 // "private", adjusted sizes 73 // "private", adjusted sizes
85 int Xsize; 74 int Xsize;
86 int Ysize; 75 int Ysize;
87 76
77 random_map_params ();
78 random_map_params (HV *hv);
88 ~random_map_params (); 79 ~random_map_params ();
89}; 80};
90 81
91enum { 82enum {
92 LAYOUT_NONE, 83 LAYOUT_NONE,
… …
94 LAYOUT_MAZE, 85 LAYOUT_MAZE,
95 LAYOUT_SPIRAL, 86 LAYOUT_SPIRAL,
96 LAYOUT_ROGUELIKE, 87 LAYOUT_ROGUELIKE,
97 LAYOUT_SNAKE, 88 LAYOUT_SNAKE,
98 LAYOUT_SQUARE_SPIRAL, 89 LAYOUT_SQUARE_SPIRAL,
90 LAYOUT_CAVE,
99 NROFLAYOUTS, 91 NROFLAYOUTS,
100}; 92};
101 93
102/* 94/*
103 * 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
… …
139// 12 has been experimentally :( determined ot be a lot more stable 131// 12 has been experimentally :( determined ot be a lot more stable
140// than 11 or 10, leading to the assumption that something inherently 132// than 11 or 10, leading to the assumption that something inherently
141// needs a minimum size of at least 12 133// needs a minimum size of at least 12
142#define MIN_RANDOM_MAP_SIZE 12 134#define MIN_RANDOM_MAP_SIZE 12
143 135
136// we often use signed chars for coordinates (and U8 for distances)
137#define MAX_RANDOM_MAP_SIZE 120
138
144// reference 139// reference
145// 140//
146// \0 floor only 141// \0 floor only
147// # wall 142// # wall
148// D door 143// D door
149// < up 144// < up
150// > down 145// > down
151// C "center" (of onion layout) 146// C "center" (of onion maze)
152// . ?? (rogue) 147// . ?? (rogue)
153// 148//
154 149
155struct LayoutData : zero_initialised 150// use this in new code
151INTERFACE_CLASS(layout)
152struct layout
156{ 153{
157 char **col; 154 typedef char cell;
155
156 cell **data;
158 int w, h; 157 int w, h;
159 158
160 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
161 ~LayoutData (); 162 ~layout ();
162 163
163 operator char **() 164 operator cell **() const
164 { 165 {
165 return col; 166 return data;
166 } 167 }
167 168
168 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); }
169 void border (char fill = '#'); 185 MTH void border (char fill = '#');
170}; 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
171 188
172struct Layout 189 MTH void fill_rand (int perc);
173{
174 LayoutData *ptr;
175 190
176 Layout () 191 // makes sure all areas are connected
177 { 192 MTH void isolation_remover ();
178 }
179 193
180 Layout (int xsize, int ysize) 194 // generates a cave, subtype 0 is a rough cave, randomly open or closed
181 : ptr (new LayoutData (xsize, ysize)) 195 MTH void gen_cave (int subtype);
182 {
183 }
184 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
185 Layout (random_map_params *RP) 205 void generate (random_map_params *RP);
186 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 206private:
187 { 207 int size;
188 } 208 void alloc (int w, int h);
189
190 void free ()
191 {
192 delete ptr;
193 }
194
195 LayoutData *operator ->() const
196 {
197 return ptr;
198 }
199
200 operator char **() const
201 {
202 return *ptr;
203 }
204
205 void swap (const Layout &layout) const
206 {
207 ::swap (layout.ptr->col, ptr->col);
208 ::swap (layout.ptr->w , ptr->w );
209 ::swap (layout.ptr->h , ptr->h );
210 }
211
212 // for debugging, print layout to stdout
213 void print ();
214}; 209};
215 210
216// utility functions, to use rmg_rndm instead of rndm. 211// utility functions, to use rmg_rndm instead of rndm.
217static inline int 212static inline int
218rmg_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)
… …
221 int i = find_free_spot (ob, m, x, y, start, stop); 216 int i = find_free_spot (ob, m, x, y, start, stop);
222 swap (rmg_rndm, rndm); 217 swap (rmg_rndm, rndm);
223 return i; 218 return i;
224} 219}
225 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
226#endif 301#endif
227 302

Diff Legend

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