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 | |
29 | struct random_map_params |
30 | struct 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]; |
|
|
34 | char monsterstyle[512]; |
33 | char monsterstyle[512]; |
35 | char treasurestyle[512]; |
34 | char treasurestyle[512]; |
36 | char layoutstyle[512]; |
35 | char layoutstyle[512]; |
37 | char doorstyle[512]; |
36 | char doorstyle[512]; |
38 | char decorstyle[512]; |
37 | char decorstyle[512]; |
39 | shstr origin_map; |
38 | shstr origin_map; |
40 | shstr final_map; |
39 | shstr final_map; |
41 | char exitstyle[512]; |
|
|
42 | shstr this_map; |
40 | shstr this_map; |
43 | char exit_on_final_map[512]; |
41 | char exit_on_final_map[512]; |
44 | char *custom; |
42 | |
45 | |
|
|
46 | int xsize, ysize; |
43 | int xsize, ysize; |
47 | int expand2x; |
44 | int expand2x; |
48 | int layoutoptions1; |
45 | int layoutoptions1; |
49 | int layoutoptions2; |
46 | int layoutoptions2; |
50 | int layoutoptions3; |
47 | int layoutoptions3; |
… | |
… | |
66 | int treasureoptions; |
63 | int treasureoptions; |
67 | int symmetry_used; |
64 | int symmetry_used; |
68 | |
65 | |
69 | struct region *region; |
66 | struct region *region; |
70 | |
67 | |
|
|
68 | HV *hv; |
|
|
69 | |
|
|
70 | // fetch something from the options hash |
|
|
71 | const_utf8_string get_str (const_utf8_string option, const_utf8_string fallback = "") const; |
|
|
72 | IV get_iv (const_utf8_string option, IV fallback = 0) const; |
|
|
73 | |
|
|
74 | void set (const_utf8_string option, const_utf8_string value); |
|
|
75 | void set (const_utf8_string option, IV value); |
|
|
76 | |
71 | // "private", adjusted sizes |
77 | // "private", adjusted sizes |
72 | int Xsize; |
78 | int Xsize; |
73 | int Ysize; |
79 | int Ysize; |
|
|
80 | |
|
|
81 | ~random_map_params (); |
74 | }; |
82 | }; |
75 | |
83 | |
76 | enum { |
84 | enum { |
77 | LAYOUT_NONE, |
85 | LAYOUT_NONE, |
78 | LAYOUT_ONION, |
86 | LAYOUT_ONION, |
… | |
… | |
124 | // 12 has been experimentally :( determined ot be a lot more stable |
132 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // than 11 or 10, leading to the assumption that something inherently |
133 | // than 11 or 10, leading to the assumption that something inherently |
126 | // needs a minimum size of at least 12 |
134 | // needs a minimum size of at least 12 |
127 | #define MIN_RANDOM_MAP_SIZE 12 |
135 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | |
136 | |
|
|
137 | // reference |
|
|
138 | // |
|
|
139 | // \0 floor only |
|
|
140 | // # wall |
|
|
141 | // D door |
|
|
142 | // < up |
|
|
143 | // > down |
|
|
144 | // C "center" (of onion layout) |
|
|
145 | // . ?? (rogue) |
|
|
146 | // |
|
|
147 | |
129 | struct MazeData : zero_initialised |
148 | struct LayoutData : zero_initialised |
130 | { |
149 | { |
131 | char **col; |
150 | char **col; |
132 | int w, h; |
151 | int w, h; |
133 | |
152 | |
134 | MazeData (int w, int h); |
153 | LayoutData (int w, int h); |
135 | ~MazeData (); |
154 | ~LayoutData (); |
136 | |
155 | |
137 | operator char **() |
156 | operator char **() |
138 | { |
157 | { |
139 | return col; |
158 | return col; |
140 | } |
159 | } |
141 | |
160 | |
142 | void clear (char fill = 0); |
161 | void clear (char fill = 0); |
143 | void border (char fill = '#'); |
162 | void border (char fill = '#'); |
144 | }; |
163 | }; |
145 | |
164 | |
146 | struct Maze |
165 | struct Layout |
147 | { |
166 | { |
148 | MazeData *ptr; |
167 | LayoutData *ptr; |
149 | |
168 | |
150 | Maze () |
169 | Layout () |
151 | { |
170 | { |
152 | } |
171 | } |
153 | |
172 | |
154 | Maze (int xsize, int ysize) |
173 | Layout (int xsize, int ysize) |
155 | : ptr (new MazeData (xsize, ysize)) |
174 | : ptr (new LayoutData (xsize, ysize)) |
156 | { |
175 | { |
157 | } |
176 | } |
158 | |
177 | |
159 | Maze (random_map_params *RP) |
178 | Layout (random_map_params *RP) |
160 | : ptr (new MazeData (RP->Xsize, RP->Ysize)) |
179 | : ptr (new LayoutData (RP->Xsize, RP->Ysize)) |
161 | { |
180 | { |
162 | } |
181 | } |
163 | |
182 | |
164 | void free () |
183 | void free () |
165 | { |
184 | { |
166 | delete ptr; |
185 | delete ptr; |
167 | } |
186 | } |
168 | |
187 | |
169 | MazeData *operator ->() const |
188 | LayoutData *operator ->() const |
170 | { |
189 | { |
171 | return ptr; |
190 | return ptr; |
172 | } |
191 | } |
173 | |
192 | |
174 | operator char **() const |
193 | operator char **() const |
175 | { |
194 | { |
176 | return *ptr; |
195 | return *ptr; |
177 | } |
196 | } |
178 | |
197 | |
179 | void swap (Maze &maze) |
198 | void swap (const Layout &layout) const |
180 | { |
199 | { |
181 | MazeData *p = maze.ptr; |
200 | ::swap (layout.ptr->col, ptr->col); |
182 | maze.ptr = ptr; |
201 | ::swap (layout.ptr->w , ptr->w ); |
183 | ptr = p; |
202 | ::swap (layout.ptr->h , ptr->h ); |
184 | } |
203 | } |
185 | }; |
204 | }; |
|
|
205 | |
|
|
206 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
207 | static inline int |
|
|
208 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
209 | { |
|
|
210 | swap (rmg_rndm, rndm); |
|
|
211 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
212 | swap (rmg_rndm, rndm); |
|
|
213 | return i; |
|
|
214 | } |
186 | |
215 | |
187 | #endif |
216 | #endif |
188 | |
217 | |