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.30 by root, Wed Jun 30 23:03:40 2010 UTC vs.
Revision 1.39 by root, Sat Jul 3 01:49:18 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,
… …
140// 12 has been experimentally :( determined ot be a lot more stable 131// 12 has been experimentally :( determined ot be a lot more stable
141// than 11 or 10, leading to the assumption that something inherently 132// than 11 or 10, leading to the assumption that something inherently
142// needs a minimum size of at least 12 133// needs a minimum size of at least 12
143#define MIN_RANDOM_MAP_SIZE 12 134#define MIN_RANDOM_MAP_SIZE 12
144 135
136// we often use signed chars for coordinates (and U8 for distances)
137#define MAX_RANDOM_MAP_SIZE 120
138
145// reference 139// reference
146// 140//
147// \0 floor only 141// \0 floor only
148// # wall 142// # wall
149// D door 143// D door
150// < up 144// < up
151// > down 145// > down
152// C "center" (of onion layout) 146// C "center" (of onion maze)
153// . ?? (rogue) 147// . ?? (rogue)
154// 148//
155 149
156// use this in new code 150// use this in new code
151INTERFACE_CLASS(layout)
157struct LayoutData 152struct layout
158{ 153{
159 char **col; 154 typedef char cell;
155
156 cell **data;
160 int w, h; 157 int w, h;
161 158
162 LayoutData (int w, int h); 159 layout (int w, int h);
160 layout (layout &copy);
163 ~LayoutData (); 161 ~layout ();
164 162
165 operator char **() 163 operator cell **() const
166 { 164 {
167 return col; 165 return data;
168 } 166 }
169 167
168 void swap (layout &maze)
169 {
170 ::swap (maze.data, data);
171 ::swap (maze.w , w );
172 ::swap (maze.h , h );
173 }
174
175 MTH void swap (layout *maze) { swap (*maze); }
176
170 // for debugging, print layout to stdout 177 // for debugging, print maze to stdout
171 void print (); 178 MTH void print () const;
172 179
173 // simple inpainting 180 // simple inpainting
174 void fill (char fill); 181 MTH void fill (char fill);
175 void clear () { fill (0); } 182 MTH void clear () { fill (0); }
176 void border (char fill = '#'); 183 MTH void border (char fill = '#');
177 void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive 184 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
185 MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
178 186
179 void fill_rand (int perc); 187 MTH void fill_rand (int perc);
180 188
181 // makes sure all areas are connected. dirty=true carves rounder but also 189 // makes sure all areas are connected
182 // more walls, dirty=false carves narrow corridors.
183 void isolation_remover (bool dirty = 0); 190 MTH void isolation_remover ();
184 191
185 // generates a cave, subtype 0 is a rough cave, randomly open or closed 192 // generates a cave, subtype 0 is a rough cave, randomly open or closed
186 void gen_cave (int subtype); 193 MTH void gen_cave (int subtype);
194
195 // helper functions to modify the maze
187 void erode_1_2 (int c1, int c2 = -1, int repeat = 1); 196 MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
197 MTH void doorify ();
198 MTH void roomify (); // make some rooms in it, works best on onions
199 MTH void expand2x ();
200 MTH void symmetrize (int symmetry);
201 MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
188 202
189 void swap (LayoutData &layout)
190 {
191 ::swap (layout.col, col);
192 ::swap (layout.w , w );
193 ::swap (layout.h , h );
194 }
195};
196
197// basically a layoutdata point - do not use in new code
198struct Layout
199{
200 LayoutData *ptr;
201
202 Layout ()
203 {
204 }
205
206 Layout (int xsize, int ysize)
207 : ptr (new LayoutData (xsize, ysize))
208 {
209 }
210
211 Layout (random_map_params *RP) 203 void generate (random_map_params *RP);
212 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 204private:
213 { 205 void alloc (int w, int h);
214 }
215
216 void free ()
217 {
218 delete ptr;
219 }
220
221 LayoutData *operator ->() const
222 {
223 return ptr;
224 }
225
226 operator char **() const
227 {
228 return *ptr;
229 }
230
231 void swap (Layout &layout)
232 {
233 ::swap (layout.ptr, ptr);
234 }
235}; 206};
236 207
237// utility functions, to use rmg_rndm instead of rndm. 208// utility functions, to use rmg_rndm instead of rndm.
238static inline int 209static inline int
239rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 210rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)

Diff Legend

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