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.25 by root, Tue Apr 13 02:39:53 2010 UTC vs.
Revision 1.42 by root, Sat Jul 3 13:14:36 2010 UTC

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

Diff Legend

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