--- deliantra/server/common/region.C	2007/02/16 19:43:41	1.26
+++ deliantra/server/common/region.C	2007/04/17 18:24:30	1.29
@@ -198,31 +198,17 @@
             rgn->parent = region::find (f.get_str ());
             break;
 
-          case KW_longname:
-            f.get (rgn->longname);
-            break;
-
-          case KW_jail_map:
-            f.get (rgn->jailmap);
-            break;
-
-          case KW_jail_x:
-            f.get (rgn->jailx);
-            break;
-
-          case KW_jail_y:
-            f.get (rgn->jaily);
-            break;
-
-          case KW_msg:
-            f.get_ml (KW_endmsg, rgn->msg);
-            break;
-
-          case KW_fallback:
-            f.get (rgn->fallback);
-            break;
+          case KW_longname: f.get (rgn->longname); break;
+          case KW_match:    f.get (rgn->match);    break;
+          case KW_jail_map: f.get (rgn->jailmap);  break;
+          case KW_jail_x:   f.get (rgn->jailx);    break;
+          case KW_jail_y:   f.get (rgn->jaily);    break;
+          case KW_fallback: f.get (rgn->fallback); break;
+          case KW_msg:      f.get_ml (KW_endmsg, rgn->msg); break;
 
           case KW_end:
+            f.next ();
+
             for_all_regions (old)
               if (old->name == rgn->name)
                 {
@@ -255,7 +241,6 @@
  * First initialises the archtype hash-table (init_archetable()).
  * Reads and parses the archetype file (with the first and second-pass
  * functions).
- * Then initialises treasures by calling load_treasures().
  */
 void
 init_regions (void)