… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
… | |
… | |
43 | * if it can't find a matching name /or/ a fallback region it logs an info message |
44 | * if it can't find a matching name /or/ a fallback region it logs an info message |
44 | * message and returns NULL |
45 | * message and returns NULL |
45 | * used by the map parsing code. |
46 | * used by the map parsing code. |
46 | */ |
47 | */ |
47 | region * |
48 | region * |
48 | region::find (const char *name) |
49 | region::find (shstr_cmp name) |
49 | { |
50 | { |
50 | for_all_regions (rgn) |
51 | for_all_regions (rgn) |
51 | if (!strcmp (rgn->name, name)) |
52 | if (rgn->name == name) |
52 | return rgn; |
53 | return rgn; |
53 | |
54 | |
54 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); |
55 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", &name); |
55 | |
|
|
56 | return default_region (); |
|
|
57 | } |
|
|
58 | |
|
|
59 | /* |
|
|
60 | * Tries to find a region that 'name' corresponds to. |
|
|
61 | * It looks, in order, for: |
|
|
62 | * an exact match to region name (case insensitive) |
|
|
63 | * an exact match to longname (case insensitive) |
|
|
64 | * a substring that matches to the longname (eg Kingdom) |
|
|
65 | * a substring that matches to the region name (eg nav) |
|
|
66 | * if it can find none of these it returns the first parentless region |
|
|
67 | * (there should be only one of these - the top level one) |
|
|
68 | * If we got a NULL, then just return the top level region |
|
|
69 | * |
|
|
70 | */ |
|
|
71 | region * |
|
|
72 | region::find_fuzzy (const char *name) |
|
|
73 | { |
|
|
74 | if (!name) |
|
|
75 | return default_region (); |
|
|
76 | |
|
|
77 | char *p = strchr (name, '\n'); |
|
|
78 | if (p) |
|
|
79 | *p = '\0'; |
|
|
80 | |
|
|
81 | for_all_regions (rgn) |
|
|
82 | if (!strcasecmp (rgn->name, name)) |
|
|
83 | return rgn; |
|
|
84 | |
|
|
85 | for_all_regions (rgn) |
|
|
86 | if (rgn->longname) |
|
|
87 | if (!strcasecmp (rgn->longname, name)) |
|
|
88 | return rgn; |
|
|
89 | |
|
|
90 | for_all_regions (rgn) |
|
|
91 | if (rgn->longname) |
|
|
92 | { |
|
|
93 | if (strstr (rgn->longname, name)) |
|
|
94 | return rgn; |
|
|
95 | } |
|
|
96 | |
|
|
97 | for_all_regions (rgn) |
|
|
98 | if (rgn->longname) |
|
|
99 | { |
|
|
100 | /* |
|
|
101 | * This is not a bug, we want the region that is most identifiably a discrete |
|
|
102 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
|
|
103 | * 'scornarena', regardless of their order on the list so we only look at those |
|
|
104 | * regions with a longname set. |
|
|
105 | */ |
|
|
106 | if (strstr (rgn->name, name)) |
|
|
107 | return rgn; |
|
|
108 | } |
|
|
109 | |
|
|
110 | for_all_regions (rgn) |
|
|
111 | { |
|
|
112 | if (strstr (rgn->name, name)) |
|
|
113 | return rgn; |
|
|
114 | } |
|
|
115 | |
56 | |
116 | return default_region (); |
57 | return default_region (); |
117 | } |
58 | } |
118 | |
59 | |
119 | void |
60 | void |
… | |
… | |
123 | |
64 | |
124 | attachable::do_destroy (); |
65 | attachable::do_destroy (); |
125 | |
66 | |
126 | refcnt_dec (); |
67 | refcnt_dec (); |
127 | } |
68 | } |
|
|
69 | |
|
|
70 | //+GPL |
128 | |
71 | |
129 | /* |
72 | /* |
130 | * returns 1 if the player is in the region reg, or a child region thereof |
73 | * returns 1 if the player is in the region reg, or a child region thereof |
131 | * otherwise returns 0 |
74 | * otherwise returns 0 |
132 | * if passed a NULL region returns -1 |
75 | * if passed a NULL region returns -1 |
133 | */ |
76 | */ |
134 | static int |
77 | static int |
135 | region_is_child_of_region (const region * child, const region * r) |
78 | region_is_child_of_region (const region * child, const region * r) |
136 | { |
79 | { |
137 | |
80 | if (!r) |
138 | if (r == NULL) |
|
|
139 | return -1; |
81 | return -1; |
140 | |
82 | |
141 | if (child == NULL) |
83 | if (!child) |
142 | return 0; |
84 | return 0; |
143 | |
85 | |
144 | if (!strcmp (child->name, r->name)) |
86 | if (child->name == r->name) |
145 | return 1; |
87 | return 1; |
146 | |
88 | |
147 | else if (child->parent != NULL) |
89 | if (child->parent) |
148 | return region_is_child_of_region (child->parent, r); |
90 | return region_is_child_of_region (child->parent, r); |
149 | else |
91 | |
150 | return 0; |
92 | return 0; |
151 | } |
93 | } |
152 | |
94 | |
153 | /** Returns an object which is an exit through which the player represented by op should be |
95 | /** Returns an object which is an exit through which the player represented by op should be |
154 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
96 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
155 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
97 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
… | |
… | |
184 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
126 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
185 | |
127 | |
186 | return 0; |
128 | return 0; |
187 | } |
129 | } |
188 | |
130 | |
|
|
131 | //-GPL |
|
|
132 | |
189 | region * |
133 | region * |
190 | region::read (object_thawer &f) |
134 | region::read (object_thawer &f) |
191 | { |
135 | { |
192 | assert (f.kw == KW_region); |
136 | assert (f.kw == KW_region); |
193 | |
137 | |
… | |
… | |
251 | |
195 | |
252 | f.next (); |
196 | f.next (); |
253 | } |
197 | } |
254 | } |
198 | } |
255 | |
199 | |
256 | /* |
200 | static void |
257 | * First initialises the archtype hash-table (init_archetable()). |
|
|
258 | * Reads and parses the archetype file (with the first and second-pass |
|
|
259 | * functions). |
|
|
260 | */ |
|
|
261 | void |
|
|
262 | init_regions (void) |
201 | init_regions (void) |
263 | { |
202 | { |
264 | if (!regions.size ()) |
203 | if (!regions.size ()) |
265 | { |
204 | { |
266 | // make sure one region is always available |
205 | // make sure one region is always available |