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 (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 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 | /* Specials in this file: |
25 | /* Specials in this file: |
… | |
… | |
37 | #define GLORY_HOLE 1 |
38 | #define GLORY_HOLE 1 |
38 | #define ORC_ZONE 2 |
39 | #define ORC_ZONE 2 |
39 | #define MINING_ZONE 3 |
40 | #define MINING_ZONE 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
41 | #define NR_OF_HOLE_TYPES 3 |
41 | |
42 | |
42 | /* clear map completely of all objects: a rectangular area of xsize, ysize |
43 | /* clear map completely of all !floor objects: |
|
|
44 | * a rectangular area of xsize, ysize |
43 | is cleared with the top left corner at xstart, ystart */ |
45 | * is cleared with the top left corner at xstart, ystart |
44 | |
46 | */ |
45 | void |
47 | static void |
46 | nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) |
48 | nuke_map_region (maptile *map, char **maze, int xstart, int ystart, int xsize, int ysize) |
47 | { |
49 | { |
48 | int i, j; |
|
|
49 | object *tmp; |
|
|
50 | |
|
|
51 | for (i = xstart; i < xstart + xsize; i++) |
50 | for (int i = xstart; i < xstart + xsize; i++) |
52 | for (j = ystart; j < ystart + ysize; j++) |
51 | for (int j = ystart; j < ystart + ysize; j++) |
53 | { |
52 | { |
54 | for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above) |
53 | maze[i][j] = 'S'; |
|
|
54 | |
|
|
55 | for (object *tmp = map->at (i, j).bot; tmp; ) |
|
|
56 | if (tmp->flag [FLAG_IS_FLOOR]) |
|
|
57 | tmp = tmp->above; |
55 | { |
58 | else |
56 | if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
|
|
57 | { |
59 | { |
58 | if (tmp->head) |
60 | object *head = tmp->head_ (); |
59 | tmp = tmp->head; |
61 | tmp = tmp->above; |
60 | tmp->remove (); |
|
|
61 | tmp->destroy (); |
62 | head->destroy (); |
62 | tmp = GET_MAP_OB (map, i, j); |
|
|
63 | } |
63 | } |
64 | if (tmp == NULL) |
|
|
65 | break; |
|
|
66 | } |
|
|
67 | } |
64 | } |
68 | } |
65 | } |
69 | |
66 | |
70 | /* copy in_map into dest_map at point x,y */ |
67 | /* copy in_map into dest_map at point x,y */ |
71 | void |
68 | static void |
72 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
69 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
73 | { |
70 | { |
74 | int i, j; |
|
|
75 | object *tmp; |
|
|
76 | object *new_ob; |
|
|
77 | |
|
|
78 | /* First, splatter everything in the dest map at the location */ |
|
|
79 | nuke_map_region (dest_map, x, y, in_map->width, in_map->height); |
|
|
80 | |
|
|
81 | for (i = 0; i < in_map->width; i++) |
71 | for (int i = 0; i < in_map->width; i++) |
82 | for (j = 0; j < in_map->height; j++) |
72 | for (int j = 0; j < in_map->height; j++) |
83 | { |
|
|
84 | for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above) |
73 | for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) |
85 | { |
74 | { |
86 | /* don't copy things with multiple squares: must be dealt with |
75 | /* don't copy tails: must be dealt with specially. */ |
87 | specially. */ |
|
|
88 | if (tmp->head != NULL) |
76 | if (!tmp->is_head ()) |
89 | continue; |
77 | continue; |
90 | new_ob = arch_to_object (tmp->arch); |
78 | |
91 | copy_object_with_inv (tmp, new_ob); |
79 | object *new_ob = tmp->deep_clone (); |
92 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
80 | |
93 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
81 | if (tmp->flag [FLAG_IS_LINKED]) |
94 | new_ob->x = i + x; |
82 | new_ob->add_link (dest_map, tmp->find_link ()->id); |
95 | new_ob->y = j + y; |
83 | |
96 | insert_multisquare_ob_in_map (new_ob, dest_map); |
84 | dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON); |
97 | } |
85 | } |
98 | } |
|
|
99 | } |
86 | } |
100 | |
87 | |
101 | int |
88 | static int |
102 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
89 | find_spot_for_submap (maptile *map, char **maze, int *ix, int *iy, int xsize, int ysize) |
103 | { |
90 | { |
104 | int tries; |
91 | int blocked, i, j; |
105 | int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */ |
|
|
106 | int is_occupied = 0; |
|
|
107 | int l, m; |
|
|
108 | |
92 | |
109 | /* don't even try to place a submap into a map if the big map isn't |
93 | /* don't even try to place a submap into a map if the big map isn't |
110 | sufficiently large. */ |
94 | sufficiently large. */ |
111 | if (2 * xsize > map->width || 2 * ysize > map->height) |
95 | if (2 * xsize > map->width || 2 * ysize > map->height) |
112 | return 0; |
96 | return 0; |
113 | |
97 | |
114 | /* search a bit for a completely free spot. */ |
98 | /* search a bit for a completely free spot. */ |
115 | for (tries = 0; tries < 20; tries++) |
99 | for (int tries = 0; tries < 20; tries++) |
116 | { |
100 | { |
|
|
101 | blocked = 0; |
|
|
102 | |
117 | /* pick a random location in the layout */ |
103 | /* pick a random location in the maze */ |
118 | i = rndm (map->width - xsize - 2) + 1; |
104 | i = rmg_rndm (1, map->width - xsize - 2); |
119 | j = rndm (map->height - ysize - 2) + 1; |
105 | j = rmg_rndm (1, map->height - ysize - 2); |
120 | is_occupied = 0; |
106 | |
121 | for (l = i; l < i + xsize; l++) |
107 | for (int l = i; l < i + xsize; l++) |
122 | for (m = j; m < j + ysize; m++) |
108 | for (int m = j; m < j + ysize; m++) |
123 | is_occupied |= layout[l][m]; |
109 | { |
|
|
110 | blocked = 1; |
|
|
111 | break; |
|
|
112 | } |
|
|
113 | |
124 | if (!is_occupied) |
114 | if (!blocked) |
125 | break; |
115 | break; |
126 | } |
116 | } |
127 | |
117 | |
128 | |
|
|
129 | /* if we failed, relax the restrictions */ |
118 | /* if we failed, relax the restrictions */ |
130 | |
119 | if (blocked) |
131 | if (is_occupied) |
|
|
132 | { /* failure, try a relaxed placer. */ |
120 | { /* failure, try a relaxed placer. */ |
133 | /* pick a random location in the layout */ |
121 | /* pick a random location in the maze */ |
134 | for (tries = 0; tries < 10; tries++) |
122 | for (int tries = 0; tries < 10; tries++) |
135 | { |
123 | { |
136 | i = rndm (map->width - xsize - 2) + 1; |
124 | i = rmg_rndm (1, map->width - xsize - 2); |
137 | j = rndm (map->height - ysize - 2) + 1; |
125 | j = rmg_rndm (1, map->height - ysize - 2); |
|
|
126 | |
138 | is_occupied = 0; |
127 | blocked = 0; |
|
|
128 | |
139 | for (l = i; l < i + xsize; l++) |
129 | for (int l = i; l < i + xsize; l++) |
140 | for (m = j; m < j + ysize; m++) |
130 | for (int m = j; m < j + ysize; m++) |
141 | if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') |
131 | if (maze[l][m] != '#' && maze[l][m] != 'D' && maze[l][m] != 0) |
|
|
132 | { |
142 | is_occupied |= 1; |
133 | blocked = 1; |
|
|
134 | break; |
|
|
135 | } |
143 | } |
136 | } |
144 | } |
137 | } |
145 | |
138 | |
146 | if (is_occupied) |
139 | if (blocked) |
147 | return 0; |
140 | return 0; |
148 | |
141 | |
149 | *ix = i; |
142 | *ix = i; |
150 | *iy = j; |
143 | *iy = j; |
|
|
144 | |
151 | return 1; |
145 | return 1; |
152 | } |
146 | } |
153 | |
147 | |
154 | void |
148 | static void |
155 | place_fountain_with_specials (maptile *map) |
149 | place_fountain_with_specials (maptile *map) |
156 | { |
150 | { |
157 | int ix, iy, i = -1, tries = 0; |
151 | int ix, iy, i = -1, tries = 0; |
158 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
152 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
159 | |
153 | |
… | |
… | |
161 | { |
155 | { |
162 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
156 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
163 | return; |
157 | return; |
164 | } |
158 | } |
165 | |
159 | |
166 | object *fountain = archetype::get ("fountain"); |
160 | object *fountain = archetype::get (shstr_fountain); |
167 | object *potion = fountain_style->pick_random_object ()->clone (); |
161 | object *potion = fountain_style->pick_random_object (rmg_rndm)->clone (); |
168 | |
162 | |
169 | while (i < 0 && tries < 10) |
163 | while (i < 0 && tries < 10) |
170 | { |
164 | { |
171 | ix = rndm (map->width - 2) + 1; |
165 | ix = rmg_rndm (map->width - 2) + 1; |
172 | iy = rndm (map->height - 2) + 1; |
166 | iy = rmg_rndm (map->height - 2) + 1; |
173 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
167 | i = rmg_find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
174 | tries++; |
168 | tries++; |
175 | } |
169 | } |
176 | |
170 | |
177 | if (i == -1) |
171 | if (i == -1) |
178 | { /* can't place fountain */ |
172 | { /* can't place fountain */ |
… | |
… | |
182 | } |
176 | } |
183 | |
177 | |
184 | ix += freearr_x[i]; |
178 | ix += freearr_x[i]; |
185 | iy += freearr_y[i]; |
179 | iy += freearr_y[i]; |
186 | potion->face = fountain->face; |
180 | potion->face = fountain->face; |
187 | SET_FLAG (potion, FLAG_NO_PICK); |
181 | potion->set_flag (FLAG_NO_PICK); |
188 | SET_FLAG (potion, FLAG_IDENTIFIED); |
182 | potion->set_flag (FLAG_IDENTIFIED); |
189 | potion->name = potion->name_pl = "fountain"; |
183 | potion->name = potion->name_pl = shstr_fountain; |
190 | potion->x = ix; |
184 | potion->x = ix; |
191 | potion->y = iy; |
185 | potion->y = iy; |
192 | potion->materialname = "adamantium"; |
186 | potion->material = name_to_material (shstr_adamantium); |
193 | fountain->x = ix; |
187 | fountain->x = ix; |
194 | fountain->y = iy; |
188 | fountain->y = iy; |
195 | insert_ob_in_map (fountain, map, NULL, 0); |
189 | insert_ob_in_map (fountain, map, NULL, 0); |
196 | insert_ob_in_map (potion, map, NULL, 0); |
190 | insert_ob_in_map (potion, map, NULL, 0); |
197 | } |
191 | } |
198 | |
192 | |
199 | void |
193 | static void |
200 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
194 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
201 | { |
195 | { |
202 | int ix, iy, i = -1; |
|
|
203 | char buf[16384]; |
|
|
204 | const char *style, *decor, *mon; |
|
|
205 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
196 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", RP->difficulty); |
206 | int g_xsize, g_ysize; |
|
|
207 | |
|
|
208 | if (!exit_style) |
197 | if (!exit_style) |
209 | { |
198 | { |
210 | LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n"); |
199 | LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n"); |
211 | return; |
200 | return; |
212 | } |
201 | } |
213 | |
202 | |
214 | if (!exit_style) |
203 | if (!exit_style) |
215 | return; |
204 | return; |
216 | |
205 | |
217 | object *the_exit = exit_style->pick_random_object ()->clone (); |
206 | object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone (); |
218 | |
207 | |
219 | // put an upper bound here, just in case |
208 | // put an upper bound here, just in case |
220 | for (int repeat = 8192; --repeat; ) |
209 | for (int repeat = 8192; --repeat; ) |
221 | { |
210 | { |
222 | ix = rndm (map->width - 2) + 1; |
211 | int ix = rmg_rndm (1, map->width - 2); |
223 | iy = rndm (map->height - 2) + 1; |
212 | int iy = rmg_rndm (1, map->height - 2); |
224 | |
213 | |
225 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
214 | int i = rmg_find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
226 | if (i >= 0) |
215 | if (i >= 0) |
227 | { |
216 | { |
228 | ix += freearr_x[i]; |
217 | the_exit->x = ix + freearr_x[i]; |
229 | iy += freearr_y[i]; |
218 | the_exit->y = iy + freearr_y[i]; |
230 | break; |
219 | break; |
231 | } |
220 | } |
232 | } |
221 | } |
233 | |
222 | |
234 | the_exit->x = ix; |
|
|
235 | the_exit->y = iy; |
|
|
236 | |
|
|
237 | if (!hole_type) |
223 | if (!hole_type) |
238 | hole_type = rndm (NR_OF_HOLE_TYPES) + 1; |
224 | hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1; |
|
|
225 | |
|
|
226 | const char *style, *decor, *mon; |
|
|
227 | int g_xsize, g_ysize; |
239 | |
228 | |
240 | switch (hole_type) |
229 | switch (hole_type) |
241 | { |
230 | { |
242 | case GLORY_HOLE: /* treasures */ |
231 | case GLORY_HOLE: /* treasures */ |
243 | { |
232 | { |
244 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
233 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
245 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
234 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
246 | style = "onion"; |
235 | style = "onion"; |
247 | decor = "wealth2"; |
236 | decor = "special_wealth"; |
248 | mon = "none"; |
237 | mon = "none"; |
249 | break; |
238 | break; |
250 | } |
239 | } |
251 | |
240 | |
252 | case ORC_ZONE: /* hole with orcs in it. */ |
241 | case ORC_ZONE: /* hole with orcs in it. */ |
253 | { |
242 | { |
254 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
243 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
255 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
244 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
256 | style = "onion"; |
245 | style = "onion"; |
257 | decor = "wealth2"; |
246 | decor = "special_wealth"; |
258 | mon = "orc"; |
247 | mon = "orc"; |
259 | break; |
248 | break; |
260 | } |
249 | } |
261 | |
250 | |
262 | case MINING_ZONE: /* hole with orcs in it. */ |
251 | case MINING_ZONE: /* hole with orcs in it. */ |
263 | { |
252 | { |
264 | g_xsize = rndm (9) + 4 + RP->difficulty / 4; |
253 | g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
265 | g_ysize = rndm (9) + 4 + RP->difficulty / 4; |
254 | g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
266 | style = "maze"; |
255 | style = "maze"; |
267 | decor = "minerals2"; |
256 | decor = "minerals2"; |
268 | mon = "none"; |
257 | mon = "none"; |
269 | break; |
258 | break; |
270 | } |
259 | } |
271 | |
260 | |
272 | default: /* undefined */ |
261 | default: /* undefined */ |
273 | LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
262 | LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
274 | return; |
263 | return; |
275 | break; |
|
|
276 | } |
264 | } |
277 | |
265 | |
278 | /* Need to be at least this size, otherwise the load |
266 | /* Need to be at least this size, otherwise the load |
279 | * code will generate new size values which are too large. |
267 | * code will generate new size values which are too large. |
280 | */ |
268 | */ |
281 | if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; |
269 | max_it (g_xsize, MIN_RANDOM_MAP_SIZE); |
282 | if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; |
270 | max_it (g_ysize, MIN_RANDOM_MAP_SIZE); |
283 | |
271 | |
284 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
272 | dynbuf_text buf; |
285 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
273 | |
286 | RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
274 | { |
287 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
275 | random_map_params &rp = *new random_map_params; // for zero_intiialised to work... |
288 | the_exit->slaying = "/!"; |
276 | |
289 | the_exit->msg = buf; |
277 | rp.hv = (HV *)newHV (); |
|
|
278 | |
|
|
279 | rp.xsize = g_xsize; |
|
|
280 | rp.ysize = g_ysize; |
|
|
281 | |
|
|
282 | rp.set ("wallstyle" , RP->get_str ("wallstyle" , 0)); |
|
|
283 | rp.set ("floorstyle" , RP->get_str ("floorstyle", 0)); |
|
|
284 | rp.set ("exitstyle" , RP->get_str ("exitstyle" , 0)); |
|
|
285 | rp.set ("region" , RP->get_str ("region" , 0)); |
|
|
286 | rp.set ("monsterstyle" , mon); |
|
|
287 | rp.set ("treasurestyle", "none"); |
|
|
288 | rp.set ("layoutstyle" , style); |
|
|
289 | rp.set ("decorstyle" , decor); |
|
|
290 | rp.set ("decoroptions" , (IV)-1); |
|
|
291 | |
|
|
292 | rp.layoutoptions1 = RMOPT_WALLS_ONLY; |
|
|
293 | rp.symmetry = SYMMETRY_NONE; |
|
|
294 | rp.dungeon_depth = RP->dungeon_level; |
|
|
295 | rp.dungeon_level = RP->dungeon_level; |
|
|
296 | rp.difficulty = RP->difficulty; |
|
|
297 | rp.difficulty_given = RP->difficulty; |
|
|
298 | rp.difficulty_increase = RP->difficulty_increase; |
|
|
299 | rp.orientation = 1; |
|
|
300 | rp.random_seed = uint32_t (RP->random_seed + 0xdeadbeef); |
|
|
301 | |
|
|
302 | the_exit->slaying = shstr_random_map_exit; |
|
|
303 | the_exit->msg = rp.as_shstr (); |
|
|
304 | |
|
|
305 | delete &rp; |
|
|
306 | } |
290 | |
307 | |
291 | insert_ob_in_map (the_exit, map, NULL, 0); |
308 | insert_ob_in_map (the_exit, map, NULL, 0); |
292 | } |
309 | } |
293 | |
310 | |
294 | void |
311 | void |
295 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
312 | place_specials_in_map (maptile *map, char **maze, random_map_params *RP) |
296 | { |
313 | { |
297 | maptile *special_map; |
314 | switch (rmg_rndm (NUM_OF_SPECIAL_TYPES)) |
298 | int ix, iy; /* map insertion locatons */ |
|
|
299 | int special_type; /* type of special to make */ |
|
|
300 | |
|
|
301 | special_type = rndm (NUM_OF_SPECIAL_TYPES); |
|
|
302 | |
|
|
303 | switch (special_type) |
|
|
304 | { |
315 | { |
305 | case SPECIAL_SUBMAP: |
316 | case SPECIAL_SUBMAP: |
|
|
317 | { |
306 | /* includes a special map into the random map being made. */ |
318 | /* includes a special map into the random map being made. */ |
307 | special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
319 | maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty, true); |
308 | |
320 | |
309 | if (!special_map) |
321 | if (!special_map) |
310 | return; |
322 | break; |
311 | |
323 | |
|
|
324 | int ix, iy; /* map insertion locatons */ |
|
|
325 | |
312 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
326 | if (find_spot_for_submap (map, maze, &ix, &iy, special_map->width, special_map->height)) |
|
|
327 | { |
|
|
328 | /* First, splatter everything in the dest map at the location */ |
|
|
329 | nuke_map_region (map, maze, ix, iy, special_map->width, special_map->height); |
313 | include_map_in_map (map, special_map, ix, iy); |
330 | include_map_in_map (map, special_map, ix, iy); |
|
|
331 | } |
|
|
332 | } |
314 | |
333 | |
315 | break; |
334 | break; |
316 | |
335 | |
317 | case SPECIAL_FOUNTAIN: |
336 | case SPECIAL_FOUNTAIN: |
318 | /* Make a special fountain: an unpickable potion disguised as |
337 | /* Make a special fountain: an unpickable potion disguised as |