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

Diff Legend

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