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.36 by root, Fri Jul 2 17:18:04 2010 UTC vs.
Revision 1.46 by root, Tue Jul 6 20:00:46 2010 UTC

… …
24 24
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#include "layout.h"
29 30
30struct random_map_params : zero_initialised 31struct random_map_params : zero_initialised
31{ 32{
32 char wall_name[512]; 33 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 34
41 int xsize, ysize; 35 int xsize, ysize;
42 int expand2x; 36 int expand2x;
43 int layoutoptions1; 37 int layoutoptions1;
44 int layoutoptions2; 38 int layoutoptions2;
45 int layoutoptions3; 39 int layoutoptions3;
46 int symmetry;
47 int difficulty; 40 int difficulty;
48 int difficulty_given; 41 int difficulty_given;
49 float difficulty_increase; 42 float difficulty_increase;
50 43
51 int dungeon_level; 44 int dungeon_level;
52 int dungeon_depth; 45 int dungeon_depth;
53 46
54 int orientation;
55 int origin_x;
56 int origin_y;
57 uint32_t random_seed; 47 uint32_t random_seed;
58 uint64_t total_map_hp; 48 uint64_t total_map_hp;
59 int map_layout_style;
60 int symmetry_used;
61
62 struct region *region;
63 49
64 HV *hv; 50 HV *hv;
65 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
66 51
67 shstr_tmp as_shstr () const; 52 shstr_tmp as_shstr () const;
68 53
69 // fetch something from the options hash 54 // fetch something from the options hash
70 SV *get_sv (const char *option) const; 55 SV *get_sv (const char *option) const;
… …
83 68
84 // "private", adjusted sizes 69 // "private", adjusted sizes
85 int Xsize; 70 int Xsize;
86 int Ysize; 71 int Ysize;
87 72
73 int map_layout_style;
74 int symmetry_used;
75
76 random_map_params ();
77 random_map_params (random_map_params *RP);
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,
… …
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,
99 LAYOUT_CAVE, 90 LAYOUT_CAVE,
91 LAYOUT_CASTLE,
92 LAYOUT_MULTIPLE,
100 NROFLAYOUTS, 93 NROFLAYOUTS,
101}; 94};
102 95
103/* 96/*
104 * 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
… …
143#define MIN_RANDOM_MAP_SIZE 12 136#define MIN_RANDOM_MAP_SIZE 12
144 137
145// we often use signed chars for coordinates (and U8 for distances) 138// we often use signed chars for coordinates (and U8 for distances)
146#define MAX_RANDOM_MAP_SIZE 120 139#define MAX_RANDOM_MAP_SIZE 120
147 140
148// reference
149//
150// \0 floor only
151// # wall
152// D door
153// < up
154// > down
155// C "center" (of onion maze)
156// . ?? (rogue)
157//
158
159// use this in new code
160INTERFACE_CLASS(layout)
161struct layout
162{
163 typedef char cell;
164
165 cell **data;
166 int w, h;
167
168 layout (int w, int h);
169 layout (layout &copy);
170 ~layout ();
171
172 operator cell **() const
173 {
174 return data;
175 }
176
177 void swap (layout &maze)
178 {
179 ::swap (maze.data, data);
180 ::swap (maze.w , w );
181 ::swap (maze.h , h );
182 }
183
184 MTH void swap (layout *maze) { swap (*maze); }
185
186 // for debugging, print maze to stdout
187 MTH void print () const;
188
189 // simple inpainting
190 MTH void fill (char fill);
191 MTH void clear () { fill (0); }
192 MTH void border (char fill = '#');
193 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
194
195 MTH void fill_rand (int perc);
196
197 // makes sure all areas are connected. dirty=true carves rounder but also
198 // more walls, dirty=false carves narrow corridors.
199 MTH void isolation_remover (bool dirty = 0);
200
201 // generates a cave, subtype 0 is a rough cave, randomly open or closed
202 MTH void gen_cave (int subtype);
203
204 // helper functions to modify the maze
205 MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
206 MTH void doorify ();
207 MTH void roomify (); // make some rooms in it, works best on onions
208 MTH void expand2x ();
209 MTH void symmetrize (int symmetry);
210 MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
211
212 void generate (random_map_params *RP);
213private:
214 void alloc (int w, int h);
215};
216
217// utility functions, to use rmg_rndm instead of rndm. 141// utility functions, to use rmg_rndm instead of rndm.
218static inline int 142static inline int
219rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 143rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
220{ 144{
221 swap (rmg_rndm, rndm); 145 swap (rmg_rndm, rndm);
222 int i = find_free_spot (ob, m, x, y, start, stop); 146 int i = find_free_spot (ob, m, x, y, start, stop);
223 swap (rmg_rndm, rndm); 147 swap (rmg_rndm, rndm);
224 return i; 148 return i;
225} 149}
226 150
227// a simple point helper struct
228struct point
229{
230 short x;
231 short y;
232
233 point ()
234 {
235 }
236
237 point (int x, int y)
238 : x(x), y(y)
239 {
240 }
241};
242
243// something like a vector or stack, but without
244// out of bounds checking
245template<typename T>
246struct fixed_stack
247{
248 T *data;
249 int size;
250 int max;
251
252 fixed_stack ()
253 : size (0), data (0)
254 {
255 }
256
257 fixed_stack (int max)
258 : size (0), max (max)
259 {
260 data = salloc<T> (max);
261 }
262
263 void reset (int new_max)
264 {
265 sfree (data, max);
266 size = 0;
267 max = new_max;
268 data = salloc<T> (max);
269 }
270
271 void free ()
272 {
273 sfree (data, max);
274 data = 0;
275 }
276
277 ~fixed_stack ()
278 {
279 sfree (data, max);
280 }
281
282 T &operator[](int idx)
283 {
284 return data [idx];
285 }
286
287 void push (T v)
288 {
289 data [size++] = v;
290 }
291
292 T &pop ()
293 {
294 return data [--size];
295 }
296
297 T remove (int idx)
298 {
299 T v = data [idx];
300
301 data [idx] = data [--size];
302
303 return v;
304 }
305};
306
307#endif 151#endif
308 152

Diff Legend

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