… | |
… | |
162 | * they have to appear here in the headers, before the mapdef |
162 | * they have to appear here in the headers, before the mapdef |
163 | */ |
163 | */ |
164 | INTERFACE_CLASS (region) |
164 | INTERFACE_CLASS (region) |
165 | struct region : zero_initialised |
165 | struct region : zero_initialised |
166 | { |
166 | { |
167 | region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
|
|
168 | char *ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
167 | shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
169 | char *ACC (RW, parent_name); /* |
|
|
170 | * So that parent and child regions can be defined in |
|
|
171 | * any order, we keep hold of the parent_name during |
|
|
172 | * initialisation, and the children get assigned to their |
|
|
173 | * parents later. (before runtime on the server though) |
|
|
174 | * nothing outside the init code should ever use this value. |
|
|
175 | */ |
|
|
176 | region *ACC (RW, parent); /* |
168 | region *ACC (RW, parent); /* |
177 | * Pointer to the region that is a parent of the current |
169 | * Pointer to the region that is a parent of the current |
178 | * region, if a value isn't defined in the current region |
170 | * region, if a value isn't defined in the current region |
179 | * we traverse this series of pointers until it is. |
171 | * we traverse this series of pointers until it is. |
180 | */ |
172 | */ |
181 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
173 | shstr ACC (RW, longname); /* Official title of the region, this might be defined |
182 | * to be the same as name*/ |
174 | * to be the same as name*/ |
183 | char *ACC (RW, msg); /* the description of the region */ |
175 | shstr ACC (RW, msg); /* the description of the region */ |
|
|
176 | shstr ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
|
|
177 | int ACC (RW, index); |
184 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
178 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
|
|
179 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
185 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
180 | bool ACC (RW, fallback); /* whether, in the event of a region not existing, |
186 | * this should be the one we fall back on as the default */ |
181 | * this should be the one we fall back on as the default */ |
187 | char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
|
|
188 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
|
|
189 | |
182 | |
190 | static region *default_region (); |
183 | static region *default_region (); |
191 | static region *find (const char *name); |
184 | static region *find (const char *name); |
|
|
185 | static region *find_fuzzy (const char *name); |
192 | }; |
186 | }; |
|
|
187 | |
|
|
188 | typedef object_vector<region, ®ion::index> regionvec; |
|
|
189 | |
|
|
190 | extern regionvec regions; |
|
|
191 | |
|
|
192 | #define for_all_regions(var) \ |
|
|
193 | for (int _i = 0; _i < regions.size (); ++_i) \ |
|
|
194 | declvar (region *, var, regions [_i]) |
193 | |
195 | |
194 | struct shopitems : zero_initialised |
196 | struct shopitems : zero_initialised |
195 | { |
197 | { |
196 | const char *name; /* name of the item in question, null if it is the default item */ |
198 | const char *name; /* name of the item in question, null if it is the default item */ |
197 | const char *name_pl; /* plural name */ |
199 | const char *name_pl; /* plural name */ |
… | |
… | |
375 | object *part; |
377 | object *part; |
376 | }; |
378 | }; |
377 | |
379 | |
378 | //TODO: these should be refactored into things like xy_normalise |
380 | //TODO: these should be refactored into things like xy_normalise |
379 | // and so on. |
381 | // and so on. |
380 | int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
382 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
381 | int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); |
383 | int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y); |
382 | int out_of_map(maptile *m, int x, int y); |
384 | int out_of_map (maptile *m, int x, int y); |
383 | maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); |
385 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
384 | void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); |
386 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
385 | void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
387 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
386 | int on_same_map(const object *op1, const object *op2); |
388 | int on_same_map (const object *op1, const object *op2); |
|
|
389 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
387 | |
390 | |
388 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
391 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
389 | inline bool |
392 | inline bool |
390 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
393 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
391 | { |
394 | { |