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

Diff Legend

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