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.24 by root, Sun Mar 28 22:29:50 2010 UTC vs.
Revision 1.45 by root, Mon Jul 5 00:07:21 2010 UTC

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

Diff Legend

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