1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
28 | #include <loader.h> |
|
|
29 | |
28 | |
30 | #include <tr1/functional> |
29 | #include <tr1/functional> |
31 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
32 | |
31 | |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
… | |
… | |
213 | /* All is a very generic match - low match value */ |
212 | /* All is a very generic match - low match value */ |
214 | if (!strcmp (cp, "all")) |
213 | if (!strcmp (cp, "all")) |
215 | return 1; |
214 | return 1; |
216 | |
215 | |
217 | /* unpaid is a little more specific */ |
216 | /* unpaid is a little more specific */ |
218 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
217 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
219 | return 2; |
218 | return 2; |
220 | |
219 | |
221 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
220 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
222 | return 2; |
221 | return 2; |
223 | |
222 | |
224 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
223 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
225 | return 2; |
224 | return 2; |
226 | |
225 | |
227 | /* Allow for things like '100 arrows' */ |
226 | /* Allow for things like '100 arrows' */ |
228 | if ((count = atoi (cp)) != 0) |
227 | if ((count = atoi (cp)) != 0) |
229 | { |
228 | { |
… | |
… | |
375 | f.next (); |
374 | f.next (); |
376 | |
375 | |
377 | #if 0 |
376 | #if 0 |
378 | // implementing it here in the server does neither allow multiple inheritence |
377 | // implementing it here in the server does neither allow multiple inheritence |
379 | // nor does it cleanly "just override". it would allow use in map files, though, |
378 | // nor does it cleanly "just override". it would allow use in map files, though, |
380 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
379 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
381 | // not that any of this is relevant as of yet... |
380 | // not that any of this is relevant as of yet... |
382 | if (f.kw == KW_inherit) |
381 | if (f.kw == KW_inherit) |
383 | { |
382 | { |
384 | if (archetype *at = find (f.get_str ())) |
383 | if (archetype *at = find (f.get_str ())) |
385 | *op = at->clone; |
384 | *op = at->clone; |
… | |
… | |
442 | goto fail; |
441 | goto fail; |
443 | } |
442 | } |
444 | } |
443 | } |
445 | |
444 | |
446 | // assemble new chain |
445 | // assemble new chain |
447 | new_head->min_x = new_head->max_x = new_head->x; |
446 | new_head->max_x = new_head->x; |
448 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
449 | |
447 | |
450 | archetype *less = new_head; |
448 | archetype *less = new_head; |
451 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
449 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
452 | { |
450 | { |
453 | archetype *at = *p; |
451 | archetype *at = *p; |
… | |
… | |
458 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
456 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
459 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
457 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
460 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
458 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
461 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
459 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
462 | |
460 | |
463 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
464 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
465 | new_head->max_x = max (new_head->max_x, at->x); |
461 | new_head->max_x = max (new_head->max_x, at->x); |
466 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
467 | |
462 | |
468 | at->head = new_head; |
463 | at->head = new_head; |
469 | less->more = at; |
464 | less->more = at; |
470 | less = at; |
465 | less = at; |
471 | } |
466 | } |