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.45 by root, Mon Jul 5 00:07:21 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 34
… …
135#define MIN_RANDOM_MAP_SIZE 12 136#define MIN_RANDOM_MAP_SIZE 12
136 137
137// we often use signed chars for coordinates (and U8 for distances) 138// we often use signed chars for coordinates (and U8 for distances)
138#define MAX_RANDOM_MAP_SIZE 120 139#define MAX_RANDOM_MAP_SIZE 120
139 140
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//
157// reference
158//
159// \0 floor only
160// # wall
161// D door
162// < entrance (traditionally up)
163// > exit (traditionally down)
164// C "center" (of onion maze)
165// . ?? (rogue)
166//
167
168// use this in new code
169INTERFACE_CLASS(layout)
170struct layout
171{
172 typedef char cell;
173
174 cell **data;
175 int w, h;
176
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
184 ~layout ();
185
186 operator cell **() const
187 {
188 return data;
189 }
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
201 // for debugging, print maze to stdout
202 MTH void print () const;
203
204 // simple inpainting
205 MTH void fill (char fill);
206 MTH void clear () { fill (0); }
207 MTH void border (char fill = '#');
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
210
211 MTH void fill_rand (int perc);
212 MTH void replace (char from, char to);
213
214 point find (char target, int mode = 0); // mode 0=random, 1=upleft, 2=upright, 3=downright, 4=downleft
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
220 MTH void isolation_remover (int perturb = 2);
221
222 // generates a cave, subtype 0 is a rough cave, randomly open or closed
223 MTH void gen_cave (int subtype);
224 MTH void gen_castle (); // generates straightish structures
225
226 // helper functions to modify the maze
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
233
234 void generate (random_map_params *RP);
235private:
236 int size;
237 void alloc (int w, int h);
238};
239
240// utility functions, to use rmg_rndm instead of rndm. 141// utility functions, to use rmg_rndm instead of rndm.
241static inline int 142static inline int
242rmg_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)
243{ 144{
244 swap (rmg_rndm, rndm); 145 swap (rmg_rndm, rndm);
245 int i = find_free_spot (ob, m, x, y, start, stop); 146 int i = find_free_spot (ob, m, x, y, start, stop);
246 swap (rmg_rndm, rndm); 147 swap (rmg_rndm, rndm);
247 return i; 148 return i;
248} 149}
249 150
250// something like a vector or stack, but without
251// out of bounds checking
252template<typename T>
253struct fixed_stack
254{
255 T *data;
256 int size;
257 int max;
258
259 fixed_stack ()
260 : size (0), data (0)
261 {
262 }
263
264 fixed_stack (int max)
265 : size (0), max (max)
266 {
267 data = salloc<T> (max);
268 }
269
270 void reset (int new_max)
271 {
272 sfree (data, max);
273 size = 0;
274 max = new_max;
275 data = salloc<T> (max);
276 }
277
278 void free ()
279 {
280 sfree (data, max);
281 data = 0;
282 }
283
284 ~fixed_stack ()
285 {
286 sfree (data, max);
287 }
288
289 T &operator[](int idx)
290 {
291 return data [idx];
292 }
293
294 void push (T v)
295 {
296 data [size++] = v;
297 }
298
299 T &pop ()
300 {
301 return data [--size];
302 }
303
304 T remove (int idx)
305 {
306 T v = data [idx];
307
308 data [idx] = data [--size];
309
310 return v;
311 }
312};
313
314#endif 151#endif
315 152

Diff Legend

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