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 |
… | |
… | |
34 | char monsterstyle[512]; |
35 | char monsterstyle[512]; |
35 | char treasurestyle[512]; |
36 | char treasurestyle[512]; |
36 | char layoutstyle[512]; |
37 | char layoutstyle[512]; |
37 | char doorstyle[512]; |
38 | char doorstyle[512]; |
38 | char decorstyle[512]; |
39 | char decorstyle[512]; |
|
|
40 | char miningstyle[512]; |
39 | shstr origin_map; |
41 | shstr origin_map; |
40 | shstr final_map; |
42 | shstr final_map; |
41 | char exitstyle[512]; |
43 | char exitstyle[512]; |
42 | shstr this_map; |
44 | shstr this_map; |
43 | char exit_on_final_map[512]; |
45 | char exit_on_final_map[512]; |
… | |
… | |
124 | // 12 has been experimentally :( determined ot be a lot more stable |
126 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // than 11 or 10, leading to the assumption that something inherently |
127 | // than 11 or 10, leading to the assumption that something inherently |
126 | // needs a minimum size of at least 12 |
128 | // needs a minimum size of at least 12 |
127 | #define MIN_RANDOM_MAP_SIZE 12 |
129 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | |
130 | |
|
|
131 | // reference |
|
|
132 | // |
|
|
133 | // \0 floor only |
|
|
134 | // # wall |
|
|
135 | // D door |
|
|
136 | // < up |
|
|
137 | // > down |
|
|
138 | // C "center" (of onion layout) |
|
|
139 | // . ?? (rogue) |
|
|
140 | // |
|
|
141 | |
129 | struct MazeData : zero_initialised |
142 | struct LayoutData : zero_initialised |
130 | { |
143 | { |
131 | char **col; |
144 | char **col; |
132 | int w, h; |
145 | int w, h; |
133 | |
146 | |
134 | MazeData (int w, int h); |
147 | LayoutData (int w, int h); |
135 | ~MazeData (); |
148 | ~LayoutData (); |
136 | |
149 | |
137 | operator char **() |
150 | operator char **() |
138 | { |
151 | { |
139 | return col; |
152 | return col; |
140 | } |
153 | } |
141 | |
154 | |
142 | void clear (char fill = 0); |
155 | void clear (char fill = 0); |
143 | void border (char fill = '#'); |
156 | void border (char fill = '#'); |
144 | }; |
157 | }; |
145 | |
158 | |
146 | struct Maze |
159 | struct Layout |
147 | { |
160 | { |
148 | MazeData *ptr; |
161 | LayoutData *ptr; |
149 | |
162 | |
150 | Maze () |
163 | Layout () |
151 | { |
164 | { |
152 | } |
165 | } |
153 | |
166 | |
154 | Maze (int xsize, int ysize) |
167 | Layout (int xsize, int ysize) |
155 | : ptr (new MazeData (xsize, ysize)) |
168 | : ptr (new LayoutData (xsize, ysize)) |
156 | { |
169 | { |
157 | } |
170 | } |
158 | |
171 | |
159 | Maze (random_map_params *RP) |
172 | Layout (random_map_params *RP) |
160 | : ptr (new MazeData (RP->Xsize, RP->Ysize)) |
173 | : ptr (new LayoutData (RP->Xsize, RP->Ysize)) |
161 | { |
174 | { |
162 | } |
175 | } |
163 | |
176 | |
164 | void free () |
177 | void free () |
165 | { |
178 | { |
166 | delete ptr; |
179 | delete ptr; |
167 | } |
180 | } |
168 | |
181 | |
169 | MazeData *operator ->() const |
182 | LayoutData *operator ->() const |
170 | { |
183 | { |
171 | return ptr; |
184 | return ptr; |
172 | } |
185 | } |
173 | |
186 | |
174 | operator char **() const |
187 | operator char **() const |
175 | { |
188 | { |
176 | return *ptr; |
189 | return *ptr; |
177 | } |
190 | } |
178 | |
191 | |
179 | void swap (Maze &maze) |
192 | void swap (const Layout &layout) const |
180 | { |
193 | { |
181 | MazeData *p = maze.ptr; |
194 | ::swap (layout.ptr->col, ptr->col); |
182 | maze.ptr = ptr; |
195 | ::swap (layout.ptr->w , ptr->w ); |
183 | ptr = p; |
196 | ::swap (layout.ptr->h , ptr->h ); |
184 | } |
197 | } |
185 | }; |
198 | }; |
186 | |
199 | |
187 | #endif |
200 | #endif |
188 | |
201 | |