| … | |
… | |
| 205 | case KW_jail_y: f.get (rgn->jaily); break; |
205 | case KW_jail_y: f.get (rgn->jaily); break; |
| 206 | case KW_fallback: f.get (rgn->fallback); break; |
206 | case KW_fallback: f.get (rgn->fallback); break; |
| 207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
| 208 | |
208 | |
| 209 | case KW_end: |
209 | case KW_end: |
|
|
210 | f.next (); |
|
|
211 | |
| 210 | for_all_regions (old) |
212 | for_all_regions (old) |
| 211 | if (old->name == rgn->name) |
213 | if (old->name == rgn->name) |
| 212 | { |
214 | { |
| 213 | // replace, copy new values (ugly) |
215 | // replace, copy new values (ugly) |
| 214 | rgn->index = old->index; |
216 | rgn->index = old->index; |
| … | |
… | |
| 237 | |
239 | |
| 238 | /* |
240 | /* |
| 239 | * First initialises the archtype hash-table (init_archetable()). |
241 | * First initialises the archtype hash-table (init_archetable()). |
| 240 | * Reads and parses the archetype file (with the first and second-pass |
242 | * Reads and parses the archetype file (with the first and second-pass |
| 241 | * functions). |
243 | * functions). |
| 242 | * Then initialises treasures by calling load_treasures(). |
|
|
| 243 | */ |
244 | */ |
| 244 | void |
245 | void |
| 245 | init_regions (void) |
246 | init_regions (void) |
| 246 | { |
247 | { |
| 247 | if (!regions.size ()) |
248 | if (!regions.size ()) |
