1 | /* |
1 | /* |
2 | * static char *rcsid_special_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * "$Id: special.C,v 1.2 2006/08/29 08:01:36 root Exp $"; |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Deliantra is free software: you can redistribute it and/or modify |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation, either version 3 of the License, or |
|
|
11 | * (at your option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
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, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
4 | */ |
22 | */ |
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
|
|
8 | |
|
|
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
|
|
10 | Copyright (C) 1992 Frank Tore Johansen |
|
|
11 | |
|
|
12 | This program is free software; you can redistribute it and/or modify |
|
|
13 | it under the terms of the GNU General Public License as published by |
|
|
14 | the Free Software Foundation; either version 2 of the License, or |
|
|
15 | (at your option) any later version. |
|
|
16 | |
|
|
17 | This program is distributed in the hope that it will be useful, |
|
|
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
20 | GNU General Public License for more details. |
|
|
21 | |
|
|
22 | You should have received a copy of the GNU General Public License |
|
|
23 | along with this program; if not, write to the Free Software |
|
|
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
25 | |
|
|
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
27 | */ |
|
|
28 | |
23 | |
29 | /* Specials in this file: |
24 | /* Specials in this file: |
30 | included maps */ |
25 | included maps */ |
31 | |
26 | |
32 | #include <global.h> |
27 | #include <global.h> |
… | |
… | |
42 | #define GLORY_HOLE 1 |
37 | #define GLORY_HOLE 1 |
43 | #define ORC_ZONE 2 |
38 | #define ORC_ZONE 2 |
44 | #define MINING_ZONE 3 |
39 | #define MINING_ZONE 3 |
45 | #define NR_OF_HOLE_TYPES 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
46 | |
41 | |
47 | /* clear map completely of all objects: a rectangular area of xsize, ysize |
42 | /* clear map completely of all !floor objects: |
|
|
43 | * a rectangular area of xsize, ysize |
48 | is cleared with the top left corner at xstart, ystart */ |
44 | * is cleared with the top left corner at xstart, ystart |
49 | |
45 | */ |
|
|
46 | static void |
50 | void nuke_map_region(mapstruct *map,int xstart,int ystart, int xsize, int ysize) { |
47 | nuke_map_region (maptile *map, char **layout, int xstart, int ystart, int xsize, int ysize) |
51 | int i,j; |
48 | { |
52 | object *tmp; |
|
|
53 | for(i=xstart;i<xstart + xsize;i++) |
49 | for (int i = xstart; i < xstart + xsize; i++) |
54 | for(j=ystart;j<ystart +ysize;j++) { |
50 | for (int j = ystart; j < ystart + ysize; j++) |
55 | for(tmp=get_map_ob(map,i,j);tmp!=NULL;tmp=tmp->above) { |
51 | { |
56 | if(!QUERY_FLAG(tmp,FLAG_IS_FLOOR)) { |
52 | layout[i][j] = 'S'; |
57 | if(tmp->head) tmp=tmp->head; |
53 | |
58 | remove_ob(tmp); |
54 | for (object *tmp = map->at (i, j).bot; tmp; ) |
59 | free_object(tmp); |
55 | if (tmp->flag [FLAG_IS_FLOOR]) |
60 | tmp=get_map_ob(map,i,j); |
56 | tmp = tmp->above; |
|
|
57 | else |
|
|
58 | { |
|
|
59 | object *head = tmp->head_ (); |
|
|
60 | tmp = tmp->above; |
|
|
61 | head->destroy (true); |
61 | } |
62 | } |
62 | if(tmp==NULL) break; |
|
|
63 | } |
63 | } |
64 | } |
|
|
65 | } |
64 | } |
66 | |
65 | |
67 | |
|
|
68 | |
|
|
69 | /* copy in_map into dest_map at point x,y */ |
66 | /* copy in_map into dest_map at point x,y */ |
70 | |
67 | static void |
71 | |
|
|
72 | void include_map_in_map(mapstruct *dest_map, mapstruct *in_map,int x, int y) { |
68 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
73 | int i,j; |
69 | { |
74 | object *tmp; |
70 | for (int i = 0; i < in_map->width; i++) |
75 | object *new_ob; |
71 | for (int j = 0; j < in_map->height; j++) |
76 | |
72 | for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) |
77 | /* First, splatter everything in the dest map at the location */ |
73 | { |
78 | nuke_map_region(dest_map,x,y,MAP_WIDTH(in_map),MAP_HEIGHT(in_map)); |
74 | /* don't copy tails: must be dealt with specially. */ |
79 | |
75 | if (!tmp->is_head ()) |
80 | for(i=0;i<MAP_WIDTH(in_map);i++) |
76 | continue; |
81 | for(j=0;j<MAP_HEIGHT(in_map);j++) { |
77 | |
82 | for(tmp=get_map_ob(in_map,i,j);tmp!=NULL;tmp=tmp->above) { |
78 | object *new_ob = tmp->deep_clone (); |
83 | /* don't copy things with multiple squares: must be dealt with |
79 | |
84 | specially. */ |
|
|
85 | if(tmp->head!=NULL) continue; |
|
|
86 | new_ob = arch_to_object(tmp->arch); |
|
|
87 | copy_object_with_inv(tmp,new_ob); |
|
|
88 | if(QUERY_FLAG(tmp,FLAG_IS_LINKED)) |
80 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
89 | add_button_link(new_ob,dest_map,tmp->path_attuned); |
81 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
90 | new_ob->x = i + x; |
82 | |
91 | new_ob->y = j + y; |
83 | dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON); |
92 | insert_multisquare_ob_in_map(new_ob,dest_map); |
|
|
93 | } |
84 | } |
94 | } |
|
|
95 | } |
85 | } |
96 | |
86 | |
|
|
87 | static int |
97 | int find_spot_for_submap(mapstruct *map,char **layout,int *ix, int *iy,int xsize, int ysize) { |
88 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
98 | int tries; |
89 | { |
99 | int i=0,j=0; /* initialization may not be needed but prevents compiler warnings */ |
90 | int blocked, i, j; |
100 | int is_occupied=0; |
91 | |
101 | int l,m; |
|
|
102 | /* don't even try to place a submap into a map if the big map isn't |
92 | /* don't even try to place a submap into a map if the big map isn't |
103 | sufficiently large. */ |
93 | sufficiently large. */ |
104 | if(2*xsize > MAP_WIDTH(map) || 2*ysize > MAP_HEIGHT(map)) return 0; |
94 | if (2 * xsize > map->width || 2 * ysize > map->height) |
105 | |
95 | return 0; |
|
|
96 | |
106 | /* search a bit for a completely free spot. */ |
97 | /* search a bit for a completely free spot. */ |
107 | for(tries=0;tries<20;tries++) { |
98 | for (int tries = 0; tries < 20; tries++) |
|
|
99 | { |
|
|
100 | blocked = 0; |
|
|
101 | |
108 | /* pick a random location in the layout */ |
102 | /* pick a random location in the layout */ |
109 | i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1; |
103 | i = rmg_rndm (1, map->width - xsize - 2); |
110 | j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1; |
104 | j = rmg_rndm (1, map->height - ysize - 2); |
111 | is_occupied=0; |
105 | |
112 | for(l=i;l<i + xsize;l++) |
106 | for (int l = i; l < i + xsize; l++) |
113 | for(m=j;m<j + ysize;m++) |
107 | for (int m = j; m < j + ysize; m++) |
114 | is_occupied|=layout[l][m]; |
|
|
115 | if(!is_occupied) break; |
|
|
116 | } |
|
|
117 | |
|
|
118 | |
108 | { |
|
|
109 | blocked = 1; |
|
|
110 | break; |
|
|
111 | } |
|
|
112 | |
|
|
113 | if (!blocked) |
|
|
114 | break; |
|
|
115 | } |
|
|
116 | |
119 | /* if we failed, relax the restrictions */ |
117 | /* if we failed, relax the restrictions */ |
120 | |
118 | if (blocked) |
121 | if(is_occupied) { /* failure, try a relaxed placer. */ |
119 | { /* failure, try a relaxed placer. */ |
122 | /* pick a random location in the layout */ |
120 | /* pick a random location in the layout */ |
123 | for(tries=0;tries<10;tries++) { |
121 | for (int tries = 0; tries < 10; tries++) |
124 | i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1; |
122 | { |
125 | j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1; |
123 | i = rmg_rndm (1, map->width - xsize - 2); |
126 | is_occupied=0; |
124 | j = rmg_rndm (1, map->height - ysize - 2); |
|
|
125 | |
|
|
126 | blocked = 0; |
|
|
127 | |
127 | for(l=i;l<i + xsize;l++) |
128 | for (int l = i; l < i + xsize; l++) |
128 | for(m=j;m<j + ysize;m++) |
129 | for (int m = j; m < j + ysize; m++) |
129 | if(layout[l][m]=='C' || layout[l][m]=='>' || layout[l][m]=='<') |
130 | if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0) |
130 | is_occupied|=1; |
131 | { |
131 | } |
132 | blocked = 1; |
|
|
133 | break; |
|
|
134 | } |
|
|
135 | } |
132 | } |
136 | } |
133 | if(is_occupied) return 0; |
137 | |
|
|
138 | if (blocked) |
|
|
139 | return 0; |
|
|
140 | |
134 | *ix=i; |
141 | *ix = i; |
135 | *iy=j; |
142 | *iy = j; |
|
|
143 | |
136 | return 1; |
144 | return 1; |
137 | } |
145 | } |
138 | |
146 | |
139 | |
147 | static void |
140 | void place_fountain_with_specials(mapstruct *map) { |
148 | place_fountain_with_specials (maptile *map) |
|
|
149 | { |
141 | int ix,iy,i=-1,tries=0; |
150 | int ix, iy, i = -1, tries = 0; |
142 | mapstruct *fountain_style=find_style("/styles/misc","fountains",-1); |
151 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
|
|
152 | |
|
|
153 | if (!fountain_style) |
|
|
154 | { |
|
|
155 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
|
|
156 | return; |
|
|
157 | } |
|
|
158 | |
143 | object *fountain=get_archetype("fountain"); |
159 | object *fountain = archetype::get (shstr_fountain); |
144 | object *potion=get_object(); |
160 | object *potion = fountain_style->pick_random_object (rmg_rndm)->clone (); |
145 | copy_object(pick_random_object(fountain_style),potion); |
161 | |
146 | while(i<0 && tries<10) { |
162 | while (i < 0 && tries < 10) |
147 | ix = RANDOM() % (MAP_WIDTH(map) -2) +1; |
163 | { |
148 | iy = RANDOM() % (MAP_HEIGHT(map) -2) +1; |
164 | ix = rmg_rndm (map->width - 2) + 1; |
149 | i = find_first_free_spot(fountain,map,ix,iy); |
165 | iy = rmg_rndm (map->height - 2) + 1; |
|
|
166 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
150 | tries++; |
167 | tries++; |
151 | }; |
168 | } |
152 | if(i==-1) { /* can't place fountain */ |
169 | |
153 | free_object(fountain); |
170 | if (i == -1) |
154 | free_object(potion); |
171 | { /* can't place fountain */ |
|
|
172 | fountain->destroy (true); |
|
|
173 | potion->destroy (true); |
155 | return; |
174 | return; |
156 | } |
175 | } |
|
|
176 | |
157 | ix += freearr_x[i]; |
177 | ix += freearr_x[i]; |
158 | iy += freearr_y[i]; |
178 | iy += freearr_y[i]; |
159 | potion->face=fountain->face; |
179 | potion->face = fountain->face; |
160 | SET_FLAG(potion,FLAG_NO_PICK); |
180 | SET_FLAG (potion, FLAG_NO_PICK); |
161 | SET_FLAG(potion,FLAG_IDENTIFIED); |
181 | SET_FLAG (potion, FLAG_IDENTIFIED); |
162 | potion->name=add_string("fountain"); |
182 | potion->name = potion->name_pl = "fountain"; |
163 | potion->name_pl=add_string("fountain"); |
|
|
164 | potion->x = ix; |
183 | potion->x = ix; |
165 | potion->y = iy; |
184 | potion->y = iy; |
166 | potion->material=M_ADAMANT; |
185 | potion->materialname = "adamantium"; |
167 | fountain->x = ix; |
186 | fountain->x = ix; |
168 | fountain->y = iy; |
187 | fountain->y = iy; |
169 | insert_ob_in_map(fountain,map,NULL,0); |
188 | insert_ob_in_map (fountain, map, NULL, 0); |
170 | insert_ob_in_map(potion,map,NULL,0); |
189 | insert_ob_in_map (potion, map, NULL, 0); |
171 | |
|
|
172 | } |
190 | } |
173 | |
191 | |
|
|
192 | static void |
174 | void place_special_exit(mapstruct * map, int hole_type,RMParms *RP) { |
193 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
|
|
194 | { |
175 | int ix,iy,i=-1; |
195 | int ix, iy, i = -1; |
176 | char buf[HUGE_BUF], *style, *decor, *mon; |
196 | char buf[16384]; |
|
|
197 | const char *style, *decor, *mon; |
177 | mapstruct *exit_style=find_style("/styles/misc","obscure_exits",-1); |
198 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
178 | int g_xsize,g_ysize; |
199 | int g_xsize, g_ysize; |
179 | |
200 | |
180 | object *the_exit=get_object(); |
|
|
181 | if(!exit_style) return; |
201 | if (!exit_style) |
182 | |
|
|
183 | copy_object(pick_random_object(exit_style),the_exit); |
|
|
184 | |
|
|
185 | while(i<0) { |
|
|
186 | ix = RANDOM() % (MAP_WIDTH(map) -2) +1; |
|
|
187 | iy = RANDOM() % (MAP_HEIGHT(map) -2) +1; |
|
|
188 | i = find_first_free_spot(the_exit,map,ix,iy); |
|
|
189 | } |
202 | { |
190 | |
203 | LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n"); |
|
|
204 | return; |
|
|
205 | } |
|
|
206 | |
|
|
207 | if (!exit_style) |
|
|
208 | return; |
|
|
209 | |
|
|
210 | object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone (); |
|
|
211 | |
|
|
212 | // put an upper bound here, just in case |
|
|
213 | for (int repeat = 8192; --repeat; ) |
|
|
214 | { |
|
|
215 | ix = rmg_rndm (1, map->width - 2); |
|
|
216 | iy = rmg_rndm (1, map->height - 2); |
|
|
217 | |
|
|
218 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
|
|
219 | if (i >= 0) |
|
|
220 | { |
191 | ix += freearr_x[i]; |
221 | ix += freearr_x[i]; |
192 | iy += freearr_y[i]; |
222 | iy += freearr_y[i]; |
|
|
223 | break; |
|
|
224 | } |
|
|
225 | } |
|
|
226 | |
193 | the_exit->x = ix; |
227 | the_exit->x = ix; |
194 | the_exit->y = iy; |
228 | the_exit->y = iy; |
195 | |
229 | |
196 | if(!hole_type) hole_type = RANDOM() % NR_OF_HOLE_TYPES + 1 ; |
230 | if (!hole_type) |
197 | |
231 | hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1; |
|
|
232 | |
198 | switch(hole_type) { |
233 | switch (hole_type) |
|
|
234 | { |
199 | case GLORY_HOLE: /* treasures */ |
235 | case GLORY_HOLE: /* treasures */ |
|
|
236 | { |
|
|
237 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
238 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
239 | style = "onion"; |
|
|
240 | decor = "wealth2"; |
|
|
241 | mon = "none"; |
|
|
242 | break; |
|
|
243 | } |
|
|
244 | |
|
|
245 | case ORC_ZONE: /* hole with orcs in it. */ |
|
|
246 | { |
|
|
247 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
248 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
249 | style = "onion"; |
|
|
250 | decor = "wealth2"; |
|
|
251 | mon = "orc"; |
|
|
252 | break; |
|
|
253 | } |
|
|
254 | |
|
|
255 | case MINING_ZONE: /* hole with orcs in it. */ |
|
|
256 | { |
|
|
257 | g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
|
|
258 | g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
|
|
259 | style = "maze"; |
|
|
260 | decor = "minerals2"; |
|
|
261 | mon = "none"; |
|
|
262 | break; |
|
|
263 | } |
|
|
264 | |
|
|
265 | default: /* undefined */ |
|
|
266 | LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
|
|
267 | return; |
|
|
268 | break; |
|
|
269 | } |
|
|
270 | |
|
|
271 | /* Need to be at least this size, otherwise the load |
|
|
272 | * code will generate new size values which are too large. |
|
|
273 | */ |
|
|
274 | if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; |
|
|
275 | if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; |
|
|
276 | |
|
|
277 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
|
|
278 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
|
|
279 | RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
|
|
280 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
|
|
281 | the_exit->slaying = "/!"; |
|
|
282 | the_exit->msg = buf; |
|
|
283 | |
|
|
284 | insert_ob_in_map (the_exit, map, NULL, 0); |
|
|
285 | } |
|
|
286 | |
|
|
287 | void |
|
|
288 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
|
|
289 | { |
|
|
290 | switch (rmg_rndm (NUM_OF_SPECIAL_TYPES)) |
|
|
291 | { |
|
|
292 | case SPECIAL_SUBMAP: |
|
|
293 | { |
|
|
294 | /* includes a special map into the random map being made. */ |
|
|
295 | maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
|
|
296 | |
|
|
297 | if (!special_map) |
|
|
298 | break; |
|
|
299 | |
|
|
300 | int ix, iy; /* map insertion locatons */ |
|
|
301 | |
|
|
302 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
200 | { |
303 | { |
201 | g_xsize = RANDOM() %3 + 4 + RP->difficulty/4; |
304 | /* First, splatter everything in the dest map at the location */ |
202 | g_ysize = RANDOM() %3 + 4 + RP->difficulty/4; |
305 | nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height); |
203 | style = "onion"; |
306 | include_map_in_map (map, special_map, ix, iy); |
204 | decor = "wealth2"; |
|
|
205 | mon = "none"; |
|
|
206 | break; |
|
|
207 | } |
307 | } |
208 | |
|
|
209 | case ORC_ZONE: /* hole with orcs in it. */ |
|
|
210 | { |
|
|
211 | g_xsize = RANDOM() %3 + 4 + RP->difficulty/4; |
|
|
212 | g_ysize = RANDOM() %3 + 4 + RP->difficulty/4; |
|
|
213 | style = "onion"; |
|
|
214 | decor = "wealth2"; |
|
|
215 | mon = "orc"; |
|
|
216 | break; |
|
|
217 | } |
|
|
218 | |
|
|
219 | case MINING_ZONE: /* hole with orcs in it. */ |
|
|
220 | { |
|
|
221 | g_xsize = RANDOM() %9 + 4 + RP->difficulty/4; |
|
|
222 | g_ysize = RANDOM() %9 + 4 + RP->difficulty/4; |
|
|
223 | style = "maze"; |
|
|
224 | decor = "minerals2"; |
|
|
225 | mon = "none"; |
|
|
226 | break; |
|
|
227 | } |
|
|
228 | |
|
|
229 | default: /* undefined */ |
|
|
230 | LOG(llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
|
|
231 | return; |
|
|
232 | break; |
|
|
233 | } |
|
|
234 | |
|
|
235 | /* Need to be at least this size, otherwise the load |
|
|
236 | * code will generate new size values which are too large. |
|
|
237 | */ |
|
|
238 | if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; |
|
|
239 | if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; |
|
|
240 | |
|
|
241 | write_parameters_to_string(buf, g_xsize, g_ysize,RP->wallstyle,RP->floorstyle,mon, |
|
|
242 | "none",style,decor,"none",RP->exitstyle,0,0,0, |
|
|
243 | OPT_WALLS_ONLY,0,0,1,RP->dungeon_level,RP->dungeon_level, |
|
|
244 | RP->difficulty,RP->difficulty,-1,1,0,0,0,0, RP->difficulty_increase); |
|
|
245 | the_exit->slaying = add_string("/!"); |
|
|
246 | the_exit->msg = add_string(buf); |
|
|
247 | |
|
|
248 | insert_ob_in_map(the_exit,map,NULL,0); |
|
|
249 | } |
|
|
250 | |
|
|
251 | |
|
|
252 | void place_specials_in_map(mapstruct *map, char **layout,RMParms *RP) { |
|
|
253 | mapstruct *special_map; |
|
|
254 | int ix,iy; /* map insertion locatons */ |
|
|
255 | int special_type; /* type of special to make */ |
|
|
256 | |
|
|
257 | |
|
|
258 | special_type = RANDOM() % NUM_OF_SPECIAL_TYPES; |
|
|
259 | switch(special_type) { |
|
|
260 | |
|
|
261 | /* includes a special map into the random map being made. */ |
|
|
262 | case SPECIAL_SUBMAP: { |
|
|
263 | special_map = find_style("/styles/specialmaps",0,RP->difficulty); |
|
|
264 | if(special_map==NULL) return; |
|
|
265 | |
308 | } |
266 | if(find_spot_for_submap(map,layout,&ix,&iy,MAP_WIDTH(special_map),MAP_HEIGHT(special_map))) |
309 | |
267 | include_map_in_map(map,special_map,ix,iy); |
|
|
268 | break; |
310 | break; |
269 | } |
|
|
270 | |
311 | |
|
|
312 | case SPECIAL_FOUNTAIN: |
271 | /* Make a special fountain: an unpickable potion disguised as |
313 | /* Make a special fountain: an unpickable potion disguised as |
272 | a fountain, or rather, colocated with a fountain. */ |
314 | a fountain, or rather, colocated with a fountain. */ |
273 | case SPECIAL_FOUNTAIN: { |
|
|
274 | place_fountain_with_specials(map); |
315 | place_fountain_with_specials (map); |
275 | break; |
316 | break; |
276 | } |
|
|
277 | |
317 | |
|
|
318 | case SPECIAL_EXIT: |
278 | /* Make an exit to another random map, e.g. a gloryhole. */ |
319 | /* Make an exit to another random map, e.g. a gloryhole. */ |
279 | case SPECIAL_EXIT: { |
|
|
280 | place_special_exit(map,0,RP); |
320 | place_special_exit (map, 0, RP); |
281 | break; |
321 | break; |
282 | } |
322 | } |
283 | } |
|
|
284 | |
|
|
285 | } |
323 | } |
|
|
324 | |