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.18 by root, Mon Apr 14 22:41:17 2008 UTC vs.
Revision 1.22 by root, Fri Mar 26 00:59:21 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 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
… …
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
129struct MazeData : zero_initialised 141struct LayoutData : zero_initialised
130{ 142{
131 char **col; 143 char **col;
132 int w, h; 144 int w, h;
133 145
134 MazeData (int w, int h); 146 LayoutData (int w, int h);
135 ~MazeData (); 147 ~LayoutData ();
136 148
137 operator char **() 149 operator char **()
138 { 150 {
139 return col; 151 return col;
140 } 152 }
141 153
142 void clear (char fill = 0); 154 void clear (char fill = 0);
143 void border (char fill = '#'); 155 void border (char fill = '#');
144}; 156};
145 157
146struct Maze 158struct Layout
147{ 159{
148 MazeData *ptr; 160 LayoutData *ptr;
149 161
150 Maze () 162 Layout ()
151 { 163 {
152 } 164 }
153 165
154 Maze (int xsize, int ysize) 166 Layout (int xsize, int ysize)
155 : ptr (new MazeData (xsize, ysize)) 167 : ptr (new LayoutData (xsize, ysize))
156 { 168 {
157 } 169 }
158 170
159 Maze (random_map_params *RP) 171 Layout (random_map_params *RP)
160 : ptr (new MazeData (RP->Xsize, RP->Ysize)) 172 : ptr (new LayoutData (RP->Xsize, RP->Ysize))
161 { 173 {
162 } 174 }
163 175
164 void free () 176 void free ()
165 { 177 {
166 delete ptr; 178 delete ptr;
167 } 179 }
168 180
169 MazeData *operator ->() const 181 LayoutData *operator ->() const
170 { 182 {
171 return ptr; 183 return ptr;
172 } 184 }
173 185
174 operator char **() const 186 operator char **() const
175 { 187 {
176 return *ptr; 188 return *ptr;
177 } 189 }
178 190
179 void swap (Maze &maze) 191 void swap (const Layout &layout) const
180 { 192 {
181 MazeData *p = maze.ptr; 193 ::swap (layout.ptr->col, ptr->col);
182 maze.ptr = ptr; 194 ::swap (layout.ptr->w , ptr->w );
183 ptr = p; 195 ::swap (layout.ptr->h , ptr->h );
184 } 196 }
185}; 197};
186 198
187#endif 199#endif
188 200

Diff Legend

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