… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 |
… | |
… | |
124 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // than 11 or 10, leading to the assumption that something inherently |
126 | // than 11 or 10, leading to the assumption that something inherently |
126 | // needs a minimum size of at least 12 |
127 | // needs a minimum size of at least 12 |
127 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | |
129 | |
|
|
130 | // reference |
|
|
131 | // |
|
|
132 | // \0 floor only |
|
|
133 | // # wall |
|
|
134 | // D door |
|
|
135 | // < up |
|
|
136 | // > down |
|
|
137 | // C "center" (of onion layout) |
|
|
138 | // . ?? (rogue) |
|
|
139 | // |
|
|
140 | |
129 | struct MazeData : zero_initialised |
141 | struct LayoutData : zero_initialised |
130 | { |
142 | { |
131 | char **col; |
143 | char **col; |
|
|
144 | int w, h; |
132 | |
145 | |
133 | MazeData (int xsize, int ysize); |
146 | LayoutData (int w, int h); |
134 | ~MazeData (); |
147 | ~LayoutData (); |
135 | |
148 | |
136 | operator char **() |
149 | operator char **() |
137 | { |
150 | { |
138 | return col; |
151 | return col; |
139 | } |
152 | } |
140 | }; |
|
|
141 | |
153 | |
142 | struct Maze |
154 | void clear (char fill = 0); |
|
|
155 | void border (char fill = '#'); |
|
|
156 | }; |
|
|
157 | |
|
|
158 | struct Layout |
143 | { |
159 | { |
144 | MazeData *ptr; |
160 | LayoutData *ptr; |
145 | |
161 | |
146 | Maze () |
162 | Layout () |
147 | { |
163 | { |
148 | } |
164 | } |
149 | |
165 | |
150 | Maze (int xsize, int ysize) |
166 | Layout (int xsize, int ysize) |
151 | : ptr (new MazeData (xsize, ysize)) |
167 | : ptr (new LayoutData (xsize, ysize)) |
152 | { |
168 | { |
153 | } |
169 | } |
154 | |
170 | |
155 | Maze (random_map_params *RP) |
171 | Layout (random_map_params *RP) |
156 | : ptr (new MazeData (RP->Xsize, RP->Ysize)) |
172 | : ptr (new LayoutData (RP->Xsize, RP->Ysize)) |
157 | { |
173 | { |
158 | } |
174 | } |
159 | |
175 | |
160 | void free () |
176 | void free () |
161 | { |
177 | { |
162 | delete ptr; |
178 | delete ptr; |
163 | } |
179 | } |
164 | |
180 | |
|
|
181 | LayoutData *operator ->() const |
|
|
182 | { |
|
|
183 | return ptr; |
|
|
184 | } |
|
|
185 | |
165 | operator char **() |
186 | operator char **() const |
166 | { |
187 | { |
167 | return *ptr; |
188 | return *ptr; |
168 | } |
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 | } |
169 | }; |
197 | }; |
170 | |
198 | |
171 | #endif |
199 | #endif |
172 | |
200 | |