ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/door.C
(Generate patch)

Comparing deliantra/server/random_maps/door.C (file contents):
Revision 1.14 by root, Sat Feb 17 23:32:11 2007 UTC vs.
Revision 1.30 by root, Mon Oct 29 23:55:54 2012 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * This program 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 2 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 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 17 *
18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#include <global.h> 25#include <global.h>
26#include <random_map.h> 26#include <rmg.h>
27#include <rproto.h> 27#include <rproto.h>
28 28
29/* where are there adjacent doors or walls? */ 29/* where are there adjacent doors or walls? */
30int 30static int
31surround_check2 (char **layout, int i, int j, int Xsize, int Ysize) 31surround_check2 (layout &maze, int i, int j)
32{ 32{
33 /* 1 = door or wall to left, 33 /* 1 = door or wall to left,
34 2 = door or wall to right, 34 2 = door or wall to right,
35 4 = door or wall above 35 4 = door or wall above
36 8 = door or wall below */ 36 8 = door or wall below */
37 int surround_index = 0; 37 int surround_index = 0;
38 38
39 if ((i > 0) && (layout[i - 1][j] == 'D' || layout[i - 1][j] == '#')) 39 if ((i > 0) && (maze[i - 1][j] == 'D' || maze[i - 1][j] == '#')) surround_index |= 1;
40 surround_index += 1; 40 if ((i < maze.w - 1) && (maze[i + 1][j] == 'D' || maze[i + 1][j] == '#')) surround_index |= 2;
41 if ((i < Xsize - 1) && (layout[i + 1][j] == 'D' || layout[i + 1][j] == '#')) 41 if ((j > 0) && (maze[i][j - 1] == 'D' || maze[i][j - 1] == '#')) surround_index |= 4;
42 surround_index += 2; 42 if ((j < maze.h - 1) && (maze[i][j + 1] == 'D' || maze[i][j + 1] == '#')) surround_index |= 8;
43 if ((j > 0) && (layout[i][j - 1] == 'D' || layout[i][j - 1] == '#')) 43
44 surround_index += 4;
45 if ((j < Ysize - 1) && (layout[i][j + 1] == 'D' && layout[i][j + 1] == '#'))
46 surround_index += 8;
47 return surround_index; 44 return surround_index;
48} 45}
49 46
50void 47void
51put_doors (maptile *the_map, char **maze, const char *doorstyle, random_map_params *RP) 48put_doors (maptile *the_map, layout &maze, const char *doorstyle, random_map_params *RP)
52{ 49{
53 int i, j; 50 int i, j;
54 maptile *vdoors; 51 maptile *vdoors;
55 maptile *hdoors; 52 maptile *hdoors;
56 char doorpath[1024]; 53 char doorpath[1024];
57 54
58 if (!strcmp (doorstyle, "none")) 55 if (!strcmp (doorstyle, "none"))
59 return; 56 return;
60 57
61 vdoors = find_style ("/styles/doorstyles", doorstyle, -1); 58 vdoors = find_style ("/styles/doorstyles", doorstyle, RP->difficulty);
62 59
63 if (vdoors) 60 if (vdoors)
64 hdoors = vdoors; 61 hdoors = vdoors;
65 else 62 else
66 { 63 {
67 vdoors = find_style ("/styles/doorstyles/vdoors", doorstyle, -1); 64 vdoors = find_style ("/styles/doorstyles/vdoors", doorstyle, RP->difficulty);
68 if (!vdoors) 65 if (!vdoors)
69 return; 66 return;
70 67
71 sprintf (doorpath, "/styles/doorstyles/hdoors%s", strrchr (vdoors->path, '/')); 68 sprintf (doorpath, "/styles/doorstyles/hdoors%s", strrchr (vdoors->path, '/'));
72 hdoors = find_style (doorpath, 0, -1); 69 hdoors = find_style (doorpath, 0, RP->difficulty);
73 if (!hdoors) 70 if (!hdoors)
74 return; 71 return;
75 } 72 }
76 73
77 for (i = 0; i < RP->Xsize; i++) 74 for (i = 0; i < RP->Xsize; i++)
78 for (j = 0; j < RP->Ysize; j++) 75 for (j = 0; j < RP->Ysize; j++)
79 { 76 {
80 if (maze[i][j] == 'D') 77 if (maze[i][j] == 'D')
81 { 78 {
82 int sindex; 79 int sindex = surround_check2 (maze, i, j);
83 object *this_door, *new_door;
84 80
85 sindex = surround_check2 (maze, i, j, RP->Xsize, RP->Ysize); 81 object *this_door = (sindex == 3 ? hdoors : vdoors)
86 if (sindex == 3) 82 ->pick_random_object (rmg_rndm);
87 this_door = hdoors->pick_random_object ();
88 else
89 this_door = vdoors->pick_random_object ();
90 83
91 if (!this_door) 84 the_map->insert (this_door->clone (), i, j, 0, 0);
92 abort ();
93
94 new_door = arch_to_object (this_door->arch);
95 this_door->copy_to (new_door);
96 new_door->x = i;
97 new_door->y = j;
98 insert_ob_in_map (new_door, the_map, NULL, 0);
99 } 85 }
100 } 86 }
101} 87}
102 88

Diff Legend

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