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.19 by root, Tue Apr 15 03:00:24 2008 UTC vs.
Revision 1.40 by root, Sat Jul 3 02:19:10 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#ifndef RANDOM_MAP_H 25#ifndef RANDOM_MAP_H
25#define RANDOM_MAP_H 26#define RANDOM_MAP_H
26 27
27#include "util.h" 28#include "util.h"
28 29
29struct random_map_params 30struct random_map_params : zero_initialised
30{ 31{
31 char wallstyle[512];
32 char wall_name[512]; 32 char wall_name[512];
33 char floorstyle[512]; 33
34 char monsterstyle[512];
35 char treasurestyle[512];
36 char layoutstyle[512];
37 char doorstyle[512];
38 char decorstyle[512];
39 shstr origin_map;
40 shstr final_map;
41 char exitstyle[512];
42 shstr this_map;
43 char exit_on_final_map[512];
44 char *custom;
45
46 int xsize, ysize; 34 int xsize, ysize;
47 int expand2x; 35 int expand2x;
48 int layoutoptions1; 36 int layoutoptions1;
49 int layoutoptions2; 37 int layoutoptions2;
50 int layoutoptions3; 38 int layoutoptions3;
… …
54 float difficulty_increase; 42 float difficulty_increase;
55 43
56 int dungeon_level; 44 int dungeon_level;
57 int dungeon_depth; 45 int dungeon_depth;
58 46
59 int decoroptions;
60 int orientation; 47 int orientation;
61 int origin_y;
62 int origin_x;
63 uint32_t random_seed; 48 uint32_t random_seed;
64 uint64_t total_map_hp; 49 uint64_t total_map_hp;
65 int map_layout_style; 50 int map_layout_style;
66 int treasureoptions;
67 int symmetry_used; 51 int symmetry_used;
68 52
69 struct region *region; 53 HV *hv;
54 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
55
56 shstr_tmp as_shstr () const;
57
58 // fetch something from the options hash
59 SV *get_sv (const char *option) const;
60 const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const;
61 IV get_iv (const char *option, IV fallback = 0) const;
62 UV get_uv (const char *option, UV fallback = 0) const;
63 NV get_nv (const char *option, NV fallback = 0) const;
64
65 void set (const char *option, SV *value) const;
66 void set (const char *option, const_utf8_string value) const;
67 void set (const char *option, IV value) const;
68 void set (const char *option, UV value) const;
69 void set (const char *option, NV value) const;
70
71 void set (const char *option, int value) const { set (option, (IV)value); }
70 72
71 // "private", adjusted sizes 73 // "private", adjusted sizes
72 int Xsize; 74 int Xsize;
73 int Ysize; 75 int Ysize;
76
77 random_map_params ();
78 random_map_params (HV *hv);
79 ~random_map_params ();
74}; 80};
75 81
76enum { 82enum {
77 LAYOUT_NONE, 83 LAYOUT_NONE,
78 LAYOUT_ONION, 84 LAYOUT_ONION,
79 LAYOUT_MAZE, 85 LAYOUT_MAZE,
80 LAYOUT_SPIRAL, 86 LAYOUT_SPIRAL,
81 LAYOUT_ROGUELIKE, 87 LAYOUT_ROGUELIKE,
82 LAYOUT_SNAKE, 88 LAYOUT_SNAKE,
83 LAYOUT_SQUARE_SPIRAL, 89 LAYOUT_SQUARE_SPIRAL,
90 LAYOUT_CAVE,
84 NROFLAYOUTS, 91 NROFLAYOUTS,
85}; 92};
86 93
87/* 94/*
88 * Move these defines out of room_gen_onion.c to here, as 95 * Move these defines out of room_gen_onion.c to here, as
… …
124// 12 has been experimentally :( determined ot be a lot more stable 131// 12 has been experimentally :( determined ot be a lot more stable
125// than 11 or 10, leading to the assumption that something inherently 132// than 11 or 10, leading to the assumption that something inherently
126// needs a minimum size of at least 12 133// needs a minimum size of at least 12
127#define MIN_RANDOM_MAP_SIZE 12 134#define MIN_RANDOM_MAP_SIZE 12
128 135
129struct LayoutData : zero_initialised 136// we often use signed chars for coordinates (and U8 for distances)
137#define MAX_RANDOM_MAP_SIZE 120
138
139// reference
140//
141// \0 floor only
142// # wall
143// D door
144// < up
145// > down
146// C "center" (of onion maze)
147// . ?? (rogue)
148//
149
150// use this in new code
151INTERFACE_CLASS(layout)
152struct layout
130{ 153{
131 char **col; 154 typedef char cell;
155
156 cell **data;
132 int w, h; 157 int w, h;
133 158
134 LayoutData (int w, int h); 159 layout (int w, int h);
160 layout (layout &copy);
161 layout (layout &orig, int x1, int y1, int x2, int y2); // reference rect in other layout
135 ~LayoutData (); 162 ~layout ();
136 163
137 operator char **() 164 operator cell **() const
138 { 165 {
139 return col; 166 return data;
140 } 167 }
141 168
142 void clear (char fill = 0); 169 void swap (layout &maze)
170 {
171 ::swap (maze.data, data);
172 ::swap (maze.w , w );
173 ::swap (maze.h , h );
174 ::swap (maze.size, size);
175 }
176
177 MTH void swap (layout *maze) { swap (*maze); }
178
179 // for debugging, print maze to stdout
180 MTH void print () const;
181
182 // simple inpainting
183 MTH void fill (char fill);
184 MTH void clear () { fill (0); }
143 void border (char fill = '#'); 185 MTH void border (char fill = '#');
144}; 186 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
187 MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
145 188
146struct Layout 189 MTH void fill_rand (int perc);
147{
148 LayoutData *ptr;
149 190
150 Layout () 191 // makes sure all areas are connected
151 { 192 MTH void isolation_remover ();
152 }
153 193
154 Layout (int xsize, int ysize) 194 // generates a cave, subtype 0 is a rough cave, randomly open or closed
155 : ptr (new LayoutData (xsize, ysize)) 195 MTH void gen_cave (int subtype);
156 {
157 }
158 196
197 // helper functions to modify the maze
198 MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
199 MTH void doorify ();
200 MTH void roomify (); // make some rooms in it, works best on onions
201 MTH void expand2x ();
202 MTH void symmetrize (int symmetry);
203 MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
204
159 Layout (random_map_params *RP) 205 void generate (random_map_params *RP);
160 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 206private:
207 int size;
208 void alloc (int w, int h);
209};
210
211// utility functions, to use rmg_rndm instead of rndm.
212static inline int
213rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
214{
215 swap (rmg_rndm, rndm);
216 int i = find_free_spot (ob, m, x, y, start, stop);
217 swap (rmg_rndm, rndm);
218 return i;
219}
220
221// a simple point helper struct
222struct point
223{
224 short x;
225 short y;
226
227 point ()
161 { 228 {
229 }
230
231 point (int x, int y)
232 : x(x), y(y)
233 {
234 }
235};
236
237// something like a vector or stack, but without
238// out of bounds checking
239template<typename T>
240struct fixed_stack
241{
242 T *data;
243 int size;
244 int max;
245
246 fixed_stack ()
247 : size (0), data (0)
248 {
249 }
250
251 fixed_stack (int max)
252 : size (0), max (max)
253 {
254 data = salloc<T> (max);
255 }
256
257 void reset (int new_max)
258 {
259 sfree (data, max);
260 size = 0;
261 max = new_max;
262 data = salloc<T> (max);
162 } 263 }
163 264
164 void free () 265 void free ()
165 { 266 {
166 delete ptr; 267 sfree (data, max);
268 data = 0;
167 } 269 }
168 270
169 LayoutData *operator ->() const 271 ~fixed_stack ()
170 { 272 {
273 sfree (data, max);
274 }
275
276 T &operator[](int idx)
277 {
278 return data [idx];
279 }
280
281 void push (T v)
282 {
283 data [size++] = v;
284 }
285
286 T &pop ()
287 {
288 return data [--size];
289 }
290
291 T remove (int idx)
292 {
293 T v = data [idx];
294
295 data [idx] = data [--size];
296
171 return ptr; 297 return v;
172 }
173
174 operator char **() const
175 {
176 return *ptr;
177 }
178
179 void swap (const Layout &layout) const
180 {
181 ::swap (layout.ptr->col, ptr->col);
182 ::swap (layout.ptr->w , ptr->w );
183 ::swap (layout.ptr->h , ptr->h );
184 } 298 }
185}; 299};
186 300
187#endif 301#endif
188 302

Diff Legend

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