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.32 by root, Thu Jul 1 01:22:44 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];
35 char monsterstyle[512]; 33 char monsterstyle[512];
36 char treasurestyle[512];
37 char layoutstyle[512]; 34 char layoutstyle[512];
38 char doorstyle[512]; 35 char doorstyle[512];
39 char decorstyle[512];
40 char miningstyle[512];
41 shstr origin_map; 36 shstr origin_map;
42 shstr final_map; 37 shstr final_map;
43 char exitstyle[512];
44 shstr this_map; 38 shstr this_map;
45 char exit_on_final_map[512]; 39 char exit_on_final_map[512];
46 char *custom; 40
47
48 int xsize, ysize; 41 int xsize, ysize;
49 int expand2x; 42 int expand2x;
50 int layoutoptions1; 43 int layoutoptions1;
51 int layoutoptions2; 44 int layoutoptions2;
52 int layoutoptions3; 45 int layoutoptions3;
… …
56 float difficulty_increase; 49 float difficulty_increase;
57 50
58 int dungeon_level; 51 int dungeon_level;
59 int dungeon_depth; 52 int dungeon_depth;
60 53
61 int decoroptions;
62 int orientation; 54 int orientation;
55 int origin_x;
63 int origin_y; 56 int origin_y;
64 int origin_x;
65 uint32_t random_seed; 57 uint32_t random_seed;
66 uint64_t total_map_hp; 58 uint64_t total_map_hp;
67 int map_layout_style; 59 int map_layout_style;
68 int treasureoptions;
69 int symmetry_used; 60 int symmetry_used;
70 61
71 struct region *region; 62 struct region *region;
63
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;
68
69 // fetch something from the options hash
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 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;
75
76 void set (const char *option, SV *value) const;
77 void set (const char *option, const_utf8_string value) const;
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); }
72 83
73 // "private", adjusted sizes 84 // "private", adjusted sizes
74 int Xsize; 85 int Xsize;
75 int Ysize; 86 int Ysize;
87
88 ~random_map_params ();
76}; 89};
77 90
78enum { 91enum {
79 LAYOUT_NONE, 92 LAYOUT_NONE,
80 LAYOUT_ONION, 93 LAYOUT_ONION,
81 LAYOUT_MAZE, 94 LAYOUT_MAZE,
82 LAYOUT_SPIRAL, 95 LAYOUT_SPIRAL,
83 LAYOUT_ROGUELIKE, 96 LAYOUT_ROGUELIKE,
84 LAYOUT_SNAKE, 97 LAYOUT_SNAKE,
85 LAYOUT_SQUARE_SPIRAL, 98 LAYOUT_SQUARE_SPIRAL,
99 LAYOUT_CAVE,
86 NROFLAYOUTS, 100 NROFLAYOUTS,
87}; 101};
88 102
89/* 103/*
90 * 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
… …
126// 12 has been experimentally :( determined ot be a lot more stable 140// 12 has been experimentally :( determined ot be a lot more stable
127// than 11 or 10, leading to the assumption that something inherently 141// than 11 or 10, leading to the assumption that something inherently
128// needs a minimum size of at least 12 142// needs a minimum size of at least 12
129#define MIN_RANDOM_MAP_SIZE 12 143#define MIN_RANDOM_MAP_SIZE 12
130 144
145// we often use signed chars for coordinates (and U8 for distances)
146#define MAX_RANDOM_MAP_SIZE 120
147
131// reference 148// reference
132// 149//
133// \0 floor only 150// \0 floor only
134// # wall 151// # wall
135// D door 152// D door
… …
137// > down 154// > down
138// C "center" (of onion layout) 155// C "center" (of onion layout)
139// . ?? (rogue) 156// . ?? (rogue)
140// 157//
141 158
142struct LayoutData : zero_initialised 159// use this in new code
160struct Layout
143{ 161{
144 char **col; 162 char **col;
145 int w, h; 163 int w, h;
146 164
147 LayoutData (int w, int h); 165 Layout (int w, int h);
148 ~LayoutData (); 166 ~Layout ();
149 167
150 operator char **() 168 operator char **()
151 { 169 {
152 return col; 170 return col;
153 } 171 }
154 172
173 void swap (Layout &layout)
174 {
175 ::swap (layout.col, col);
176 ::swap (layout.w , w );
177 ::swap (layout.h , h );
178 }
179
180 // for debugging, print layout to stdout
181 void print ();
182
183 // simple inpainting
184 void fill (char fill);
155 void clear (char fill = 0); 185 void clear () { fill (0); }
156 void border (char fill = '#'); 186 void border (char fill = '#');
157}; 187 void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
158 188
159struct Layout 189 void fill_rand (int perc);
160{
161 LayoutData *ptr;
162 190
163 Layout () 191 // makes sure all areas are connected. dirty=true carves rounder but also
164 { 192 // more walls, dirty=false carves narrow corridors.
165 } 193 void isolation_remover (bool dirty = 0);
166 194
167 Layout (int xsize, int ysize) 195 // generates a cave, subtype 0 is a rough cave, randomly open or closed
168 : ptr (new LayoutData (xsize, ysize)) 196 void gen_cave (int subtype);
169 { 197 void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
170 }
171 198
172 Layout (random_map_params *RP) 199 void generate (random_map_params *RP);
173 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 200};
201
202// utility functions, to use rmg_rndm instead of rndm.
203static inline int
204rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
205{
206 swap (rmg_rndm, rndm);
207 int i = find_free_spot (ob, m, x, y, start, stop);
208 swap (rmg_rndm, rndm);
209 return i;
210}
211
212// a simple point helper struct
213struct point
214{
215 short x;
216 short y;
217
218 point ()
174 { 219 {
220 }
221
222 point (int x, int y)
223 : x(x), y(y)
224 {
225 }
226};
227
228// something like a vector or stack, but without
229// out of bounds checking
230template<typename T>
231struct fixed_stack
232{
233 T *data;
234 int size;
235 int max;
236
237 fixed_stack ()
238 : size (0), data (0)
239 {
240 }
241
242 fixed_stack (int max)
243 : size (0), max (max)
244 {
245 data = salloc<T> (max);
246 }
247
248 void reset (int new_max)
249 {
250 sfree (data, max);
251 size = 0;
252 max = new_max;
253 data = salloc<T> (max);
175 } 254 }
176 255
177 void free () 256 void free ()
178 { 257 {
179 delete ptr; 258 sfree (data, max);
259 data = 0;
180 } 260 }
181 261
182 LayoutData *operator ->() const 262 ~fixed_stack ()
183 { 263 {
264 sfree (data, max);
265 }
266
267 T &operator[](int idx)
268 {
269 return data [idx];
270 }
271
272 void push (T v)
273 {
274 data [size++] = v;
275 }
276
277 T &pop ()
278 {
279 return data [--size];
280 }
281
282 T remove (int idx)
283 {
284 T v = data [idx];
285
286 data [idx] = data [--size];
287
184 return ptr; 288 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 } 289 }
198}; 290};
199 291
200#endif 292#endif
201 293

Diff Legend

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