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.45 by root, Mon Jul 5 00:07:21 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;
45 int layoutoptions3; 38 int layoutoptions3;
46 int symmetry;
47 int difficulty; 39 int difficulty;
48 int difficulty_given; 40 int difficulty_given;
49 float difficulty_increase; 41 float difficulty_increase;
50 42
51 int dungeon_level; 43 int dungeon_level;
52 int dungeon_depth; 44 int dungeon_depth;
53 45
54 int orientation;
55 int origin_x;
56 int origin_y;
57 uint32_t random_seed; 46 uint32_t random_seed;
58 uint64_t total_map_hp; 47 uint64_t total_map_hp;
59 int map_layout_style;
60 int symmetry_used;
61
62 struct region *region;
63 48
64 HV *hv; 49 HV *hv;
65 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
66 50
67 shstr_tmp as_shstr () const; 51 shstr_tmp as_shstr () const;
68 52
69 // fetch something from the options hash 53 // fetch something from the options hash
70 SV *get_sv (const char *option) const; 54 SV *get_sv (const char *option) const;
… …
83 67
84 // "private", adjusted sizes 68 // "private", adjusted sizes
85 int Xsize; 69 int Xsize;
86 int Ysize; 70 int Ysize;
87 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);
88 ~random_map_params (); 78 ~random_map_params ();
89}; 79};
90 80
91enum { 81enum {
92 LAYOUT_NONE, 82 LAYOUT_NONE,
… …
95 LAYOUT_SPIRAL, 85 LAYOUT_SPIRAL,
96 LAYOUT_ROGUELIKE, 86 LAYOUT_ROGUELIKE,
97 LAYOUT_SNAKE, 87 LAYOUT_SNAKE,
98 LAYOUT_SQUARE_SPIRAL, 88 LAYOUT_SQUARE_SPIRAL,
99 LAYOUT_CAVE, 89 LAYOUT_CAVE,
90 LAYOUT_CASTLE,
91 LAYOUT_MULTIPLE,
100 NROFLAYOUTS, 92 NROFLAYOUTS,
101}; 93};
102 94
103/* 95/*
104 * 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
… …
140// 12 has been experimentally :( determined ot be a lot more stable 132// 12 has been experimentally :( determined ot be a lot more stable
141// than 11 or 10, leading to the assumption that something inherently 133// than 11 or 10, leading to the assumption that something inherently
142// needs a minimum size of at least 12 134// needs a minimum size of at least 12
143#define MIN_RANDOM_MAP_SIZE 12 135#define MIN_RANDOM_MAP_SIZE 12
144 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//
145// reference 157// reference
146// 158//
147// \0 floor only 159// \0 floor only
148// # wall 160// # wall
149// D door 161// D door
150// < up 162// < entrance (traditionally up)
151// > down 163// > exit (traditionally down)
152// C "center" (of onion layout) 164// C "center" (of onion maze)
153// . ?? (rogue) 165// . ?? (rogue)
154// 166//
155 167
156// use this in new code 168// use this in new code
169INTERFACE_CLASS(layout)
157struct LayoutData 170struct layout
158{ 171{
159 char **col; 172 typedef char cell;
173
174 cell **data;
160 int w, h; 175 int w, h;
161 176
162 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
163 ~LayoutData (); 184 ~layout ();
164 185
165 operator char **() 186 operator cell **() const
166 { 187 {
167 return col; 188 return data;
168 } 189 }
169 190
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
170 // for debugging, print layout to stdout 201 // for debugging, print maze to stdout
171 void print (); 202 MTH void print () const;
172 203
173 // simple inpainting 204 // simple inpainting
174 void fill (char fill); 205 MTH void fill (char fill);
175 void clear () { fill (0); } 206 MTH void clear () { fill (0); }
176 void border (char fill = '#'); 207 MTH void border (char fill = '#');
177 void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive 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
178 210
179 void fill_rand (int perc); 211 MTH void fill_rand (int perc);
212 MTH void replace (char from, char to);
180 213
181 // makes sure all areas are connected. dirty=true carves rounder but also 214 point find (char target, int mode = 0); // mode 0=random, 1=upleft, 2=upright, 3=downright, 4=downleft
182 // more walls, dirty=false carves narrow corridors. 215
216 // makes sure all areas are connected
217 // perturb = 0 - very horz/vert tunnels
218 // perturb = 1 - straight but round
219 // perturb = 2 - snaky tunnels
183 void isolation_remover (bool dirty = 0); 220 MTH void isolation_remover (int perturb = 2);
184 221
185 // generates a cave, subtype 0 is a rough cave, randomly open or closed 222 // generates a cave, subtype 0 is a rough cave, randomly open or closed
186 void gen_cave (int subtype); 223 MTH void gen_cave (int subtype);
224 MTH void gen_castle (); // generates straightish structures
225
226 // helper functions to modify the maze
187 void erode_1_2 (int c1, int c2 = -1, int repeat = 1); 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
188 233
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) 234 void generate (random_map_params *RP);
212 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 235private:
213 { 236 int size;
214 } 237 void alloc (int w, int h);
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}; 238};
236 239
237// utility functions, to use rmg_rndm instead of rndm. 240// utility functions, to use rmg_rndm instead of rndm.
238static inline int 241static inline int
239rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 242rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
… …
242 int i = find_free_spot (ob, m, x, y, start, stop); 245 int i = find_free_spot (ob, m, x, y, start, stop);
243 swap (rmg_rndm, rndm); 246 swap (rmg_rndm, rndm);
244 return i; 247 return i;
245} 248}
246 249
247// a simple point helper struct
248struct point
249{
250 short x;
251 short y;
252
253 point ()
254 {
255 }
256
257 point (int x, int y)
258 : x(x), y(y)
259 {
260 }
261};
262
263// something like a vector or stack, but without 250// something like a vector or stack, but without
264// out of bounds checking 251// out of bounds checking
265template<typename T> 252template<typename T>
266struct fixed_stack 253struct fixed_stack
267{ 254{

Diff Legend

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