… | |
… | |
119 | } |
119 | } |
120 | |
120 | |
121 | i = 0; |
121 | i = 0; |
122 | while (spell_mapping[i]) |
122 | while (spell_mapping[i]) |
123 | { |
123 | { |
124 | if (!find_archetype (spell_mapping[i])) |
124 | if (!archetype::find (spell_mapping[i])) |
125 | { |
125 | { |
126 | LOG (llevError, "Unable to find spell mapping %s (%i)\n", spell_mapping[i], i); |
126 | LOG (llevError, "Unable to find spell mapping %s (%i)\n", spell_mapping[i], i); |
127 | } |
127 | } |
128 | i++; |
128 | i++; |
129 | } |
129 | } |
… | |
… | |
789 | archetype *at; |
789 | archetype *at; |
790 | int dir; |
790 | int dir; |
791 | |
791 | |
792 | /* Handle cases where we are passed a bogus mosntername */ |
792 | /* Handle cases where we are passed a bogus mosntername */ |
793 | |
793 | |
794 | if ((at = find_archetype (monstername)) == NULL) |
794 | if ((at = archetype::find (monstername)) == NULL) |
795 | return; |
795 | return; |
796 | |
796 | |
797 | /* find a free square nearby |
797 | /* find a free square nearby |
798 | * first we check the closest square for free squares |
798 | * first we check the closest square for free squares |
799 | */ |
799 | */ |