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