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.28 by root, Wed Jun 30 01:32:57 2010 UTC vs.
Revision 1.36 by root, Fri Jul 2 17:18:04 2010 UTC

… …
94 LAYOUT_MAZE, 94 LAYOUT_MAZE,
95 LAYOUT_SPIRAL, 95 LAYOUT_SPIRAL,
96 LAYOUT_ROGUELIKE, 96 LAYOUT_ROGUELIKE,
97 LAYOUT_SNAKE, 97 LAYOUT_SNAKE,
98 LAYOUT_SQUARE_SPIRAL, 98 LAYOUT_SQUARE_SPIRAL,
99 LAYOUT_CAVE,
99 NROFLAYOUTS, 100 NROFLAYOUTS,
100}; 101};
101 102
102/* 103/*
103 * 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
… …
139// 12 has been experimentally :( determined ot be a lot more stable 140// 12 has been experimentally :( determined ot be a lot more stable
140// than 11 or 10, leading to the assumption that something inherently 141// than 11 or 10, leading to the assumption that something inherently
141// needs a minimum size of at least 12 142// needs a minimum size of at least 12
142#define MIN_RANDOM_MAP_SIZE 12 143#define MIN_RANDOM_MAP_SIZE 12
143 144
145// we often use signed chars for coordinates (and U8 for distances)
146#define MAX_RANDOM_MAP_SIZE 120
147
144// reference 148// reference
145// 149//
146// \0 floor only 150// \0 floor only
147// # wall 151// # wall
148// D door 152// D door
149// < up 153// < up
150// > down 154// > down
151// C "center" (of onion layout) 155// C "center" (of onion maze)
152// . ?? (rogue) 156// . ?? (rogue)
153// 157//
154 158
155struct LayoutData : zero_initialised 159// use this in new code
160INTERFACE_CLASS(layout)
161struct layout
156{ 162{
157 char **col; 163 typedef char cell;
164
165 cell **data;
158 int w, h; 166 int w, h;
159 167
160 LayoutData (int w, int h); 168 layout (int w, int h);
169 layout (layout &copy);
161 ~LayoutData (); 170 ~layout ();
162 171
163 operator char **() 172 operator cell **() const
164 { 173 {
165 return col; 174 return data;
166 } 175 }
167 176
168 void clear (char fill = 0); 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); }
169 void border (char fill = '#'); 192 MTH void border (char fill = '#');
170}; 193 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
171 194
172struct Layout 195 MTH void fill_rand (int perc);
173{
174 LayoutData *ptr;
175 196
176 Layout () 197 // makes sure all areas are connected. dirty=true carves rounder but also
177 { 198 // more walls, dirty=false carves narrow corridors.
178 } 199 MTH void isolation_remover (bool dirty = 0);
179 200
180 Layout (int xsize, int ysize) 201 // generates a cave, subtype 0 is a rough cave, randomly open or closed
181 : ptr (new LayoutData (xsize, ysize)) 202 MTH void gen_cave (int subtype);
182 {
183 }
184 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
185 Layout (random_map_params *RP) 212 void generate (random_map_params *RP);
186 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 213private:
187 { 214 void alloc (int w, int h);
188 }
189
190 void free ()
191 {
192 delete ptr;
193 }
194
195 LayoutData *operator ->() const
196 {
197 return ptr;
198 }
199
200 operator char **() const
201 {
202 return *ptr;
203 }
204
205 void swap (const Layout &layout) const
206 {
207 ::swap (layout.ptr->col, ptr->col);
208 ::swap (layout.ptr->w , ptr->w );
209 ::swap (layout.ptr->h , ptr->h );
210 }
211
212 // for debugging, print layout to stdout
213 void print ();
214}; 215};
215 216
216// utility functions, to use rmg_rndm instead of rndm. 217// utility functions, to use rmg_rndm instead of rndm.
217static inline int 218static inline int
218rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 219rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
… …
221 int i = find_free_spot (ob, m, x, y, start, stop); 222 int i = find_free_spot (ob, m, x, y, start, stop);
222 swap (rmg_rndm, rndm); 223 swap (rmg_rndm, rndm);
223 return i; 224 return i;
224} 225}
225 226
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
226#endif 307#endif
227 308

Diff Legend

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