1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
… | |
… | |
196 | { |
196 | { |
197 | case KW_parent: |
197 | case KW_parent: |
198 | rgn->parent = region::find (f.get_str ()); |
198 | rgn->parent = region::find (f.get_str ()); |
199 | break; |
199 | break; |
200 | |
200 | |
201 | case KW_longname: f.get (rgn->longname); break; |
|
|
202 | case KW_match: f.get (rgn->match); break; |
|
|
203 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
204 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
205 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
206 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
201 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
|
|
202 | case KW_longname: f.get (rgn->longname); break; |
|
|
203 | case KW_match: f.get (rgn->match); break; |
|
|
204 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
205 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
206 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
207 | case KW_portal_map: f.get (rgn->portalmap);break; |
|
|
208 | case KW_portal_x: f.get (rgn->portalx); break; |
|
|
209 | case KW_portal_y: f.get (rgn->portaly); break; |
|
|
210 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
211 | case KW_chance: f.get (rgn->treasure_density); break; |
|
|
212 | |
|
|
213 | case KW_randomitems: |
|
|
214 | rgn->treasure = treasurelist::get (f.get_str ()); |
|
|
215 | break; |
208 | |
216 | |
209 | case KW_end: |
217 | case KW_end: |
|
|
218 | f.next (); |
|
|
219 | |
210 | for_all_regions (old) |
220 | for_all_regions (old) |
211 | if (old->name == rgn->name) |
221 | if (old->name == rgn->name) |
212 | { |
222 | { |
213 | // replace, copy new values (ugly) |
223 | // replace, copy new values (ugly) |
214 | rgn->index = old->index; |
224 | rgn->index = old->index; |
… | |
… | |
237 | |
247 | |
238 | /* |
248 | /* |
239 | * First initialises the archtype hash-table (init_archetable()). |
249 | * First initialises the archtype hash-table (init_archetable()). |
240 | * Reads and parses the archetype file (with the first and second-pass |
250 | * Reads and parses the archetype file (with the first and second-pass |
241 | * functions). |
251 | * functions). |
242 | * Then initialises treasures by calling load_treasures(). |
|
|
243 | */ |
252 | */ |
244 | void |
253 | void |
245 | init_regions (void) |
254 | init_regions (void) |
246 | { |
255 | { |
247 | if (!regions.size ()) |
256 | if (!regions.size ()) |