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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * 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 |
10 | * 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 |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | * It is useful for finding bugs in the treasures file. Since it only |
27 | * It is useful for finding bugs in the treasures file. Since it only |
… | |
… | |
34 | //#define TREASURE_VERBOSE |
35 | //#define TREASURE_VERBOSE |
35 | |
36 | |
36 | #include <global.h> |
37 | #include <global.h> |
37 | #include <treasure.h> |
38 | #include <treasure.h> |
38 | |
39 | |
|
|
40 | #include <flat_hash_map.hpp> |
|
|
41 | |
|
|
42 | // used only by treasure.C, does not handle null arch ptrs |
|
|
43 | #define IS_ARCH(arch,name) ((arch)->archname == shstr_ ## name) |
|
|
44 | |
39 | extern char *spell_mapping[]; |
45 | extern char *spell_mapping[]; |
40 | |
46 | |
41 | static treasurelist *first_treasurelist; |
47 | static treasurelist *first_treasurelist; |
42 | |
48 | |
43 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
49 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
44 | |
50 | |
45 | typedef std::tr1::unordered_map< |
51 | typedef ska::flat_hash_map< |
46 | const char *, |
52 | const char *, |
47 | treasurelist *, |
53 | treasurelist *, |
48 | str_hash, |
54 | str_hash, |
49 | str_equal, |
55 | str_equal, |
50 | slice_allocator< std::pair<const char *const, treasurelist *> > |
56 | slice_allocator< std::pair<const char *const, treasurelist *> > |
51 | > tl_map_t; |
57 | > tl_map_t; |
52 | |
58 | |
53 | static tl_map_t tl_map; |
59 | static tl_map_t tl_map; |
54 | |
60 | |
55 | //TODO: class method |
61 | //TODO: class method |
… | |
… | |
490 | { 0, 0, 0, 3, 97}, // 29 |
496 | { 0, 0, 0, 3, 97}, // 29 |
491 | { 0, 0, 0, 0, 100}, // 30 |
497 | { 0, 0, 0, 0, 100}, // 30 |
492 | { 0, 0, 0, 0, 100}, // 31 |
498 | { 0, 0, 0, 0, 100}, // 31 |
493 | }; |
499 | }; |
494 | |
500 | |
495 | /* calculate the appropriate level for wands staves and scrolls. |
501 | /* calculate the appropriate level for wands staves and scrolls. |
496 | * This code presumes that op has had its spell object created (in op->inv) |
502 | * This code presumes that op has had its spell object created (in op->inv) |
497 | * |
503 | * |
498 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
504 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
499 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
505 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
500 | */ |
506 | */ |
… | |
… | |
808 | * order to set it up right. This produced magical bonuses, puts spells |
814 | * order to set it up right. This produced magical bonuses, puts spells |
809 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
815 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
810 | */ |
816 | */ |
811 | |
817 | |
812 | /* 4/28/96 added creator object from which op may now inherit properties based on |
818 | /* 4/28/96 added creator object from which op may now inherit properties based on |
813 | * op->type. Right now, which stuff the creator passes on is object type |
819 | * op->type. Right now, which stuff the creator passes on is object type |
814 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
820 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
815 | * way to do this? b.t. */ |
821 | * way to do this? b.t. */ |
816 | |
822 | |
817 | /* |
823 | /* |
818 | * ! (flags & GT_ENVIRONMENT): |
824 | * ! (flags & GT_ENVIRONMENT): |
819 | * Automatically calls fix_flesh_item(). |
825 | * Automatically calls fix_flesh_item(). |
… | |
… | |
919 | { |
925 | { |
920 | if (op->type == POTION) |
926 | if (op->type == POTION) |
921 | /* Handle healing and magic power potions */ |
927 | /* Handle healing and magic power potions */ |
922 | if (op->stats.sp && !op->randomitems) |
928 | if (op->stats.sp && !op->randomitems) |
923 | { |
929 | { |
924 | object *tmp = get_archetype (spell_mapping [op->stats.sp]); |
930 | object *tmp = archetype::get (spell_mapping [op->stats.sp]); |
925 | insert_ob_in_ob (tmp, op); |
931 | insert_ob_in_ob (tmp, op); |
926 | op->stats.sp = 0; |
932 | op->stats.sp = 0; |
927 | } |
933 | } |
928 | } |
934 | } |
929 | else if (!op->title) /* Only modify object if not special */ |
935 | else if (!op->title) /* Only modify object if not special */ |
… | |
… | |
947 | } |
953 | } |
948 | break; |
954 | break; |
949 | |
955 | |
950 | case POTION: |
956 | case POTION: |
951 | { |
957 | { |
952 | int too_many_tries = 0, is_special = 0; |
958 | int too_many_tries = 0; |
953 | |
959 | |
954 | /* Handle healing and magic power potions */ |
960 | /* Handle healing and magic power potions */ |
955 | if (op->stats.sp && !op->randomitems) |
961 | if (op->stats.sp && !op->randomitems) |
956 | { |
962 | { |
957 | object *tmp = get_archetype (spell_mapping[op->stats.sp]); |
963 | object *tmp = archetype::get (spell_mapping[op->stats.sp]); |
958 | insert_ob_in_ob (tmp, op); |
964 | insert_ob_in_ob (tmp, op); |
959 | op->stats.sp = 0; |
965 | op->stats.sp = 0; |
960 | } |
966 | } |
961 | |
967 | |
962 | while (!(is_special = special_potion (op)) && !op->inv) |
968 | while (!special_potion (op) && !op->inv) |
963 | { |
969 | { |
964 | generate_artifact (op, difficulty); |
970 | generate_artifact (op, difficulty); |
965 | if (too_many_tries++ > 10) |
971 | if (too_many_tries++ > 10) |
966 | break; |
972 | break; |
967 | } |
973 | } |
… | |
… | |
1489 | name = tmp->name + 1, neg = 1; |
1495 | name = tmp->name + 1, neg = 1; |
1490 | else |
1496 | else |
1491 | name = tmp->name, neg = 0; |
1497 | name = tmp->name, neg = 0; |
1492 | |
1498 | |
1493 | /* If we match name, then return the opposite of 'neg' */ |
1499 | /* If we match name, then return the opposite of 'neg' */ |
1494 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1500 | if (!strcmp (name, op->arch->archname)) |
1495 | return !neg; |
1501 | return !neg; |
1496 | |
1502 | |
1497 | /* Set success as true, since if the match was an inverse, it means |
1503 | /* Set success as true, since if the match was an inverse, it means |
1498 | * everything is allowed except what we match |
1504 | * everything is allowed except what we match |
1499 | */ |
1505 | */ |