mirror of
https://git.huckle.dev/Huckles-Minecraft-Archive/4jcraft.git
synced 2026-09-27 23:40:46 +00:00
chore: format Minecraft.World
This commit is contained in:
Tropical
@@ -9,469 +9,460 @@
|
||||
|
||||
Random EnchantmentHelper::random;
|
||||
|
||||
int EnchantmentHelper::getEnchantmentLevel(int enchantmentId, std::shared_ptr<ItemInstance> piece)
|
||||
{
|
||||
if (piece == NULL)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
ListTag<CompoundTag> *enchantmentTags = piece->getEnchantmentTags();
|
||||
if (enchantmentTags == NULL)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
for (int i = 0; i < enchantmentTags->size(); i++)
|
||||
{
|
||||
int type = enchantmentTags->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_ID);
|
||||
int level = enchantmentTags->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_LEVEL);
|
||||
int EnchantmentHelper::getEnchantmentLevel(
|
||||
int enchantmentId, std::shared_ptr<ItemInstance> piece) {
|
||||
if (piece == NULL) {
|
||||
return 0;
|
||||
}
|
||||
ListTag<CompoundTag>* enchantmentTags = piece->getEnchantmentTags();
|
||||
if (enchantmentTags == NULL) {
|
||||
return 0;
|
||||
}
|
||||
for (int i = 0; i < enchantmentTags->size(); i++) {
|
||||
int type = enchantmentTags->get(i)->getShort(
|
||||
(wchar_t*)ItemInstance::TAG_ENCH_ID);
|
||||
int level = enchantmentTags->get(i)->getShort(
|
||||
(wchar_t*)ItemInstance::TAG_ENCH_LEVEL);
|
||||
|
||||
if (type == enchantmentId)
|
||||
{
|
||||
return level;
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
if (type == enchantmentId) {
|
||||
return level;
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
std::unordered_map<int, int> *EnchantmentHelper::getEnchantments(std::shared_ptr<ItemInstance> item)
|
||||
{
|
||||
std::unordered_map<int, int> *result = new std::unordered_map<int, int>();
|
||||
ListTag<CompoundTag> *list = item->id == Item::enchantedBook_Id ? Item::enchantedBook->getEnchantments(item) : item->getEnchantmentTags();
|
||||
std::unordered_map<int, int>* EnchantmentHelper::getEnchantments(
|
||||
std::shared_ptr<ItemInstance> item) {
|
||||
std::unordered_map<int, int>* result = new std::unordered_map<int, int>();
|
||||
ListTag<CompoundTag>* list =
|
||||
item->id == Item::enchantedBook_Id
|
||||
? Item::enchantedBook->getEnchantments(item)
|
||||
: item->getEnchantmentTags();
|
||||
|
||||
if (list != NULL)
|
||||
{
|
||||
for (int i = 0; i < list->size(); i++)
|
||||
{
|
||||
int type = list->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_ID);
|
||||
int level = list->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_LEVEL);
|
||||
if (list != NULL) {
|
||||
for (int i = 0; i < list->size(); i++) {
|
||||
int type =
|
||||
list->get(i)->getShort((wchar_t*)ItemInstance::TAG_ENCH_ID);
|
||||
int level =
|
||||
list->get(i)->getShort((wchar_t*)ItemInstance::TAG_ENCH_LEVEL);
|
||||
|
||||
result->insert( std::unordered_map<int, int>::value_type(type, level));
|
||||
}
|
||||
}
|
||||
result->insert(
|
||||
std::unordered_map<int, int>::value_type(type, level));
|
||||
}
|
||||
}
|
||||
|
||||
return result;
|
||||
return result;
|
||||
}
|
||||
|
||||
void EnchantmentHelper::setEnchantments(std::unordered_map<int, int> *enchantments, std::shared_ptr<ItemInstance> item)
|
||||
{
|
||||
ListTag<CompoundTag> *list = new ListTag<CompoundTag>();
|
||||
void EnchantmentHelper::setEnchantments(
|
||||
std::unordered_map<int, int>* enchantments,
|
||||
std::shared_ptr<ItemInstance> item) {
|
||||
ListTag<CompoundTag>* list = new ListTag<CompoundTag>();
|
||||
|
||||
//for (int id : enchantments.keySet())
|
||||
for(AUTO_VAR(it, enchantments->begin()); it != enchantments->end(); ++it)
|
||||
{
|
||||
int id = it->first;
|
||||
CompoundTag *tag = new CompoundTag();
|
||||
// for (int id : enchantments.keySet())
|
||||
for (AUTO_VAR(it, enchantments->begin()); it != enchantments->end(); ++it) {
|
||||
int id = it->first;
|
||||
CompoundTag* tag = new CompoundTag();
|
||||
|
||||
tag->putShort((wchar_t *)ItemInstance::TAG_ENCH_ID, (short) id);
|
||||
tag->putShort((wchar_t *)ItemInstance::TAG_ENCH_LEVEL, (short)(int)it->second);
|
||||
tag->putShort((wchar_t*)ItemInstance::TAG_ENCH_ID, (short)id);
|
||||
tag->putShort((wchar_t*)ItemInstance::TAG_ENCH_LEVEL,
|
||||
(short)(int)it->second);
|
||||
|
||||
list->add(tag);
|
||||
list->add(tag);
|
||||
|
||||
if (item->id == Item::enchantedBook_Id)
|
||||
{
|
||||
Item::enchantedBook->addEnchantment(item, new EnchantmentInstance(id, it->second));
|
||||
}
|
||||
}
|
||||
if (item->id == Item::enchantedBook_Id) {
|
||||
Item::enchantedBook->addEnchantment(
|
||||
item, new EnchantmentInstance(id, it->second));
|
||||
}
|
||||
}
|
||||
|
||||
if (list->size() > 0)
|
||||
{
|
||||
if (item->id != Item::enchantedBook_Id)
|
||||
{
|
||||
item->addTagElement(L"ench", list);
|
||||
}
|
||||
}
|
||||
else if (item->hasTag())
|
||||
{
|
||||
item->getTag()->remove(L"ench");
|
||||
}
|
||||
if (list->size() > 0) {
|
||||
if (item->id != Item::enchantedBook_Id) {
|
||||
item->addTagElement(L"ench", list);
|
||||
}
|
||||
} else if (item->hasTag()) {
|
||||
item->getTag()->remove(L"ench");
|
||||
}
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getEnchantmentLevel(int enchantmentId, ItemInstanceArray inventory)
|
||||
{
|
||||
int bestLevel = 0;
|
||||
//for (ItemInstance piece : inventory)
|
||||
for(unsigned int i = 0; i < inventory.length; ++i)
|
||||
{
|
||||
int newLevel = getEnchantmentLevel(enchantmentId, inventory[i]);
|
||||
if (newLevel > bestLevel)
|
||||
{
|
||||
bestLevel = newLevel;
|
||||
}
|
||||
}
|
||||
return bestLevel;
|
||||
int EnchantmentHelper::getEnchantmentLevel(int enchantmentId,
|
||||
ItemInstanceArray inventory) {
|
||||
int bestLevel = 0;
|
||||
// for (ItemInstance piece : inventory)
|
||||
for (unsigned int i = 0; i < inventory.length; ++i) {
|
||||
int newLevel = getEnchantmentLevel(enchantmentId, inventory[i]);
|
||||
if (newLevel > bestLevel) {
|
||||
bestLevel = newLevel;
|
||||
}
|
||||
}
|
||||
return bestLevel;
|
||||
}
|
||||
|
||||
void EnchantmentHelper::runIterationOnItem(EnchantmentIterationMethod &method, std::shared_ptr<ItemInstance> piece)
|
||||
{
|
||||
if (piece == NULL)
|
||||
{
|
||||
return;
|
||||
}
|
||||
ListTag<CompoundTag> *enchantmentTags = piece->getEnchantmentTags();
|
||||
if (enchantmentTags == NULL)
|
||||
{
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < enchantmentTags->size(); i++)
|
||||
{
|
||||
int type = enchantmentTags->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_ID);
|
||||
int level = enchantmentTags->get(i)->getShort((wchar_t *)ItemInstance::TAG_ENCH_LEVEL);
|
||||
void EnchantmentHelper::runIterationOnItem(
|
||||
EnchantmentIterationMethod& method, std::shared_ptr<ItemInstance> piece) {
|
||||
if (piece == NULL) {
|
||||
return;
|
||||
}
|
||||
ListTag<CompoundTag>* enchantmentTags = piece->getEnchantmentTags();
|
||||
if (enchantmentTags == NULL) {
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < enchantmentTags->size(); i++) {
|
||||
int type = enchantmentTags->get(i)->getShort(
|
||||
(wchar_t*)ItemInstance::TAG_ENCH_ID);
|
||||
int level = enchantmentTags->get(i)->getShort(
|
||||
(wchar_t*)ItemInstance::TAG_ENCH_LEVEL);
|
||||
|
||||
if (Enchantment::enchantments[type] != NULL)
|
||||
{
|
||||
method.doEnchantment(Enchantment::enchantments[type], level);
|
||||
}
|
||||
}
|
||||
if (Enchantment::enchantments[type] != NULL) {
|
||||
method.doEnchantment(Enchantment::enchantments[type], level);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void EnchantmentHelper::runIterationOnInventory(EnchantmentIterationMethod &method, ItemInstanceArray inventory)
|
||||
{
|
||||
//for (ItemInstance piece : inventory)
|
||||
for(unsigned int i = 0; i < inventory.length; ++i)
|
||||
{
|
||||
runIterationOnItem(method, inventory[i]);
|
||||
}
|
||||
void EnchantmentHelper::runIterationOnInventory(
|
||||
EnchantmentIterationMethod& method, ItemInstanceArray inventory) {
|
||||
// for (ItemInstance piece : inventory)
|
||||
for (unsigned int i = 0; i < inventory.length; ++i) {
|
||||
runIterationOnItem(method, inventory[i]);
|
||||
}
|
||||
}
|
||||
|
||||
void EnchantmentHelper::GetDamageProtectionIteration::doEnchantment(Enchantment *enchantment, int level)
|
||||
{
|
||||
sum += enchantment->getDamageProtection(level, source);
|
||||
void EnchantmentHelper::GetDamageProtectionIteration::doEnchantment(
|
||||
Enchantment* enchantment, int level) {
|
||||
sum += enchantment->getDamageProtection(level, source);
|
||||
}
|
||||
|
||||
EnchantmentHelper::GetDamageProtectionIteration EnchantmentHelper::getDamageProtectionIteration;
|
||||
EnchantmentHelper::GetDamageProtectionIteration
|
||||
EnchantmentHelper::getDamageProtectionIteration;
|
||||
|
||||
/**
|
||||
* Fetches the protection value for enchanted items.
|
||||
*
|
||||
* @param inventory
|
||||
* @param source
|
||||
* @return
|
||||
*/
|
||||
int EnchantmentHelper::getDamageProtection(std::shared_ptr<Inventory> inventory, DamageSource *source)
|
||||
{
|
||||
getDamageProtectionIteration.sum = 0;
|
||||
getDamageProtectionIteration.source = source;
|
||||
* Fetches the protection value for enchanted items.
|
||||
*
|
||||
* @param inventory
|
||||
* @param source
|
||||
* @return
|
||||
*/
|
||||
int EnchantmentHelper::getDamageProtection(std::shared_ptr<Inventory> inventory,
|
||||
DamageSource* source) {
|
||||
getDamageProtectionIteration.sum = 0;
|
||||
getDamageProtectionIteration.source = source;
|
||||
|
||||
runIterationOnInventory(getDamageProtectionIteration, inventory->armor);
|
||||
runIterationOnInventory(getDamageProtectionIteration, inventory->armor);
|
||||
|
||||
if (getDamageProtectionIteration.sum > 25)
|
||||
{
|
||||
getDamageProtectionIteration.sum = 25;
|
||||
}
|
||||
// enchantment protection is on the scale of 0 to 25, where 20 or more
|
||||
// will nullify nearly all damage (there will be damage spill)
|
||||
return ((getDamageProtectionIteration.sum + 1) >> 1) + random.nextInt((getDamageProtectionIteration.sum >> 1) + 1);
|
||||
if (getDamageProtectionIteration.sum > 25) {
|
||||
getDamageProtectionIteration.sum = 25;
|
||||
}
|
||||
// enchantment protection is on the scale of 0 to 25, where 20 or more
|
||||
// will nullify nearly all damage (there will be damage spill)
|
||||
return ((getDamageProtectionIteration.sum + 1) >> 1) +
|
||||
random.nextInt((getDamageProtectionIteration.sum >> 1) + 1);
|
||||
}
|
||||
|
||||
void EnchantmentHelper::GetDamageBonusIteration::doEnchantment(Enchantment *enchantment, int level)
|
||||
{
|
||||
sum += enchantment->getDamageBonus(level, target);
|
||||
void EnchantmentHelper::GetDamageBonusIteration::doEnchantment(
|
||||
Enchantment* enchantment, int level) {
|
||||
sum += enchantment->getDamageBonus(level, target);
|
||||
}
|
||||
|
||||
|
||||
EnchantmentHelper::GetDamageBonusIteration EnchantmentHelper::getDamageBonusIteration;
|
||||
EnchantmentHelper::GetDamageBonusIteration
|
||||
EnchantmentHelper::getDamageBonusIteration;
|
||||
|
||||
/**
|
||||
*
|
||||
* @param inventory
|
||||
* @param target
|
||||
* @return
|
||||
*/
|
||||
int EnchantmentHelper::getDamageBonus(std::shared_ptr<Inventory> inventory, std::shared_ptr<Mob> target)
|
||||
{
|
||||
*
|
||||
* @param inventory
|
||||
* @param target
|
||||
* @return
|
||||
*/
|
||||
int EnchantmentHelper::getDamageBonus(std::shared_ptr<Inventory> inventory,
|
||||
std::shared_ptr<Mob> target) {
|
||||
getDamageBonusIteration.sum = 0;
|
||||
getDamageBonusIteration.target = target;
|
||||
|
||||
getDamageBonusIteration.sum = 0;
|
||||
getDamageBonusIteration.target = target;
|
||||
runIterationOnItem(getDamageBonusIteration, inventory->getSelected());
|
||||
|
||||
runIterationOnItem(getDamageBonusIteration, inventory->getSelected());
|
||||
|
||||
if (getDamageBonusIteration.sum > 0)
|
||||
{
|
||||
return 1 + random.nextInt(getDamageBonusIteration.sum);
|
||||
}
|
||||
return 0;
|
||||
if (getDamageBonusIteration.sum > 0) {
|
||||
return 1 + random.nextInt(getDamageBonusIteration.sum);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getKnockbackBonus(std::shared_ptr<Inventory> inventory, std::shared_ptr<Mob> target)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::knockback->id, inventory->getSelected());
|
||||
int EnchantmentHelper::getKnockbackBonus(std::shared_ptr<Inventory> inventory,
|
||||
std::shared_ptr<Mob> target) {
|
||||
return getEnchantmentLevel(Enchantment::knockback->id,
|
||||
inventory->getSelected());
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getFireAspect(std::shared_ptr<Mob> source)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::fireAspect->id, source->getCarriedItem());
|
||||
int EnchantmentHelper::getFireAspect(std::shared_ptr<Mob> source) {
|
||||
return getEnchantmentLevel(Enchantment::fireAspect->id,
|
||||
source->getCarriedItem());
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getOxygenBonus(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::drownProtection->id, inventory->armor);
|
||||
int EnchantmentHelper::getOxygenBonus(std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::drownProtection->id,
|
||||
inventory->armor);
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getDiggingBonus(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::diggingBonus->id, inventory->getSelected());
|
||||
int EnchantmentHelper::getDiggingBonus(std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::diggingBonus->id,
|
||||
inventory->getSelected());
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getDigDurability(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::digDurability->id, inventory->getSelected());
|
||||
int EnchantmentHelper::getDigDurability(std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::digDurability->id,
|
||||
inventory->getSelected());
|
||||
}
|
||||
|
||||
bool EnchantmentHelper::hasSilkTouch(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::untouching->id, inventory->getSelected()) > 0;
|
||||
bool EnchantmentHelper::hasSilkTouch(std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::untouching->id,
|
||||
inventory->getSelected()) > 0;
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getDiggingLootBonus(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::resourceBonus->id, inventory->getSelected());
|
||||
int EnchantmentHelper::getDiggingLootBonus(
|
||||
std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::resourceBonus->id,
|
||||
inventory->getSelected());
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getKillingLootBonus(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::lootBonus->id, inventory->getSelected());
|
||||
int EnchantmentHelper::getKillingLootBonus(
|
||||
std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::lootBonus->id,
|
||||
inventory->getSelected());
|
||||
}
|
||||
|
||||
bool EnchantmentHelper::hasWaterWorkerBonus(std::shared_ptr<Inventory> inventory)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::waterWorker->id, inventory->armor) > 0;
|
||||
bool EnchantmentHelper::hasWaterWorkerBonus(
|
||||
std::shared_ptr<Inventory> inventory) {
|
||||
return getEnchantmentLevel(Enchantment::waterWorker->id, inventory->armor) >
|
||||
0;
|
||||
}
|
||||
|
||||
int EnchantmentHelper::getArmorThorns(std::shared_ptr<Mob> source)
|
||||
{
|
||||
return getEnchantmentLevel(Enchantment::thorns->id, source->getEquipmentSlots());
|
||||
int EnchantmentHelper::getArmorThorns(std::shared_ptr<Mob> source) {
|
||||
return getEnchantmentLevel(Enchantment::thorns->id,
|
||||
source->getEquipmentSlots());
|
||||
}
|
||||
|
||||
std::shared_ptr<ItemInstance> EnchantmentHelper::getRandomItemWith(Enchantment *enchantment, std::shared_ptr<Mob> source)
|
||||
{
|
||||
ItemInstanceArray items = source->getEquipmentSlots();
|
||||
for(unsigned int i = 0; i < items.length; ++i)
|
||||
{
|
||||
std::shared_ptr<ItemInstance> item = items[i];
|
||||
if (item != NULL && getEnchantmentLevel(enchantment->id, item) > 0)
|
||||
{
|
||||
return item;
|
||||
}
|
||||
}
|
||||
std::shared_ptr<ItemInstance> EnchantmentHelper::getRandomItemWith(
|
||||
Enchantment* enchantment, std::shared_ptr<Mob> source) {
|
||||
ItemInstanceArray items = source->getEquipmentSlots();
|
||||
for (unsigned int i = 0; i < items.length; ++i) {
|
||||
std::shared_ptr<ItemInstance> item = items[i];
|
||||
if (item != NULL && getEnchantmentLevel(enchantment->id, item) > 0) {
|
||||
return item;
|
||||
}
|
||||
}
|
||||
|
||||
return nullptr;
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
/**
|
||||
*
|
||||
* @param random
|
||||
* @param slot
|
||||
* The table slot, 0-2
|
||||
* @param bookcases
|
||||
* How many book cases that are found around the table.
|
||||
* @param itemInstance
|
||||
* Which item that is being enchanted.
|
||||
* @return The enchantment cost, 0 means unchantable, 50 is max.
|
||||
*/
|
||||
int EnchantmentHelper::getEnchantmentCost(Random *random, int slot, int bookcases, std::shared_ptr<ItemInstance> itemInstance)
|
||||
{
|
||||
Item *item = itemInstance->getItem();
|
||||
int itemValue = item->getEnchantmentValue();
|
||||
*
|
||||
* @param random
|
||||
* @param slot
|
||||
* The table slot, 0-2
|
||||
* @param bookcases
|
||||
* How many book cases that are found around the table.
|
||||
* @param itemInstance
|
||||
* Which item that is being enchanted.
|
||||
* @return The enchantment cost, 0 means unchantable, 50 is max.
|
||||
*/
|
||||
int EnchantmentHelper::getEnchantmentCost(
|
||||
Random* random, int slot, int bookcases,
|
||||
std::shared_ptr<ItemInstance> itemInstance) {
|
||||
Item* item = itemInstance->getItem();
|
||||
int itemValue = item->getEnchantmentValue();
|
||||
|
||||
if (itemValue <= 0)
|
||||
{
|
||||
// not enchantable
|
||||
return 0;
|
||||
}
|
||||
if (itemValue <= 0) {
|
||||
// not enchantable
|
||||
return 0;
|
||||
}
|
||||
|
||||
// 4J Stu - Updated function to 1.3 version for TU7
|
||||
if (bookcases > 15)
|
||||
{
|
||||
bookcases = 15;
|
||||
}
|
||||
// 4J Stu - Updated function to 1.3 version for TU7
|
||||
if (bookcases > 15) {
|
||||
bookcases = 15;
|
||||
}
|
||||
|
||||
int selected = random->nextInt(8) + 1 + (bookcases >> 1) + random->nextInt(bookcases + 1);
|
||||
if (slot == 0)
|
||||
{
|
||||
return std::max((selected / 3), 1);
|
||||
}
|
||||
if (slot == 1)
|
||||
{
|
||||
return std::max(selected, bookcases * 2);
|
||||
}
|
||||
return selected;
|
||||
int selected = random->nextInt(8) + 1 + (bookcases >> 1) +
|
||||
random->nextInt(bookcases + 1);
|
||||
if (slot == 0) {
|
||||
return std::max((selected / 3), 1);
|
||||
}
|
||||
if (slot == 1) {
|
||||
return std::max(selected, bookcases * 2);
|
||||
}
|
||||
return selected;
|
||||
}
|
||||
|
||||
std::shared_ptr<ItemInstance> EnchantmentHelper::enchantItem(Random *random, std::shared_ptr<ItemInstance> itemInstance, int enchantmentCost)
|
||||
{
|
||||
std::vector<EnchantmentInstance *> *newEnchantment = EnchantmentHelper::selectEnchantment(random, itemInstance, enchantmentCost);
|
||||
bool isBook = itemInstance->id == Item::book_Id;
|
||||
std::shared_ptr<ItemInstance> EnchantmentHelper::enchantItem(
|
||||
Random* random, std::shared_ptr<ItemInstance> itemInstance,
|
||||
int enchantmentCost) {
|
||||
std::vector<EnchantmentInstance*>* newEnchantment =
|
||||
EnchantmentHelper::selectEnchantment(random, itemInstance,
|
||||
enchantmentCost);
|
||||
bool isBook = itemInstance->id == Item::book_Id;
|
||||
|
||||
if (isBook) itemInstance->id = Item::enchantedBook_Id;
|
||||
if (isBook) itemInstance->id = Item::enchantedBook_Id;
|
||||
|
||||
if (newEnchantment != NULL)
|
||||
{
|
||||
for(AUTO_VAR(it, newEnchantment->begin()); it != newEnchantment->end(); ++it)
|
||||
{
|
||||
EnchantmentInstance *e = *it;
|
||||
if (isBook)
|
||||
{
|
||||
Item::enchantedBook->addEnchantment(itemInstance, e);
|
||||
}
|
||||
else
|
||||
{
|
||||
itemInstance->enchant(e->enchantment, e->level);
|
||||
}
|
||||
delete e;
|
||||
}
|
||||
delete newEnchantment;
|
||||
}
|
||||
return itemInstance;
|
||||
if (newEnchantment != NULL) {
|
||||
for (AUTO_VAR(it, newEnchantment->begin()); it != newEnchantment->end();
|
||||
++it) {
|
||||
EnchantmentInstance* e = *it;
|
||||
if (isBook) {
|
||||
Item::enchantedBook->addEnchantment(itemInstance, e);
|
||||
} else {
|
||||
itemInstance->enchant(e->enchantment, e->level);
|
||||
}
|
||||
delete e;
|
||||
}
|
||||
delete newEnchantment;
|
||||
}
|
||||
return itemInstance;
|
||||
}
|
||||
|
||||
/**
|
||||
*
|
||||
* @param random
|
||||
* @param itemInstance
|
||||
* @param enchantmentCost
|
||||
* @return
|
||||
*/
|
||||
std::vector<EnchantmentInstance *> *EnchantmentHelper::selectEnchantment(Random *random, std::shared_ptr<ItemInstance> itemInstance, int enchantmentCost)
|
||||
{
|
||||
// withdraw bonus from item
|
||||
Item *item = itemInstance->getItem();
|
||||
int itemBonus = item->getEnchantmentValue();
|
||||
*
|
||||
* @param random
|
||||
* @param itemInstance
|
||||
* @param enchantmentCost
|
||||
* @return
|
||||
*/
|
||||
std::vector<EnchantmentInstance*>* EnchantmentHelper::selectEnchantment(
|
||||
Random* random, std::shared_ptr<ItemInstance> itemInstance,
|
||||
int enchantmentCost) {
|
||||
// withdraw bonus from item
|
||||
Item* item = itemInstance->getItem();
|
||||
int itemBonus = item->getEnchantmentValue();
|
||||
|
||||
if (itemBonus <= 0)
|
||||
{
|
||||
return NULL;
|
||||
}
|
||||
// 4J Stu - Update function to 1.3 version for TU7
|
||||
itemBonus /= 2;
|
||||
itemBonus = 1 + random->nextInt((itemBonus >> 1) + 1) + random->nextInt((itemBonus >> 1) + 1);
|
||||
if (itemBonus <= 0) {
|
||||
return NULL;
|
||||
}
|
||||
// 4J Stu - Update function to 1.3 version for TU7
|
||||
itemBonus /= 2;
|
||||
itemBonus = 1 + random->nextInt((itemBonus >> 1) + 1) +
|
||||
random->nextInt((itemBonus >> 1) + 1);
|
||||
|
||||
int enchantmentValue = itemBonus + enchantmentCost;
|
||||
int enchantmentValue = itemBonus + enchantmentCost;
|
||||
|
||||
// the final enchantment cost will have another random span of +- 15%
|
||||
float deviation = (random->nextFloat() + random->nextFloat() - 1.0f) * .15f;
|
||||
int realValue = (int) ((float) enchantmentValue * (1.0f + deviation) + .5f);
|
||||
if (realValue < 1)
|
||||
{
|
||||
realValue = 1;
|
||||
}
|
||||
// the final enchantment cost will have another random span of +- 15%
|
||||
float deviation = (random->nextFloat() + random->nextFloat() - 1.0f) * .15f;
|
||||
int realValue = (int)((float)enchantmentValue * (1.0f + deviation) + .5f);
|
||||
if (realValue < 1) {
|
||||
realValue = 1;
|
||||
}
|
||||
|
||||
std::vector<EnchantmentInstance *> *results = NULL;
|
||||
std::vector<EnchantmentInstance*>* results = NULL;
|
||||
|
||||
std::unordered_map<int, EnchantmentInstance *> *availableEnchantments = getAvailableEnchantmentResults(realValue, itemInstance);
|
||||
if (availableEnchantments != NULL && !availableEnchantments->empty())
|
||||
{
|
||||
std::vector<WeighedRandomItem *> values;
|
||||
for(AUTO_VAR(it, availableEnchantments->begin()); it != availableEnchantments->end(); ++it)
|
||||
{
|
||||
values.push_back(it->second);
|
||||
}
|
||||
EnchantmentInstance *instance = (EnchantmentInstance *) WeighedRandom::getRandomItem(random, &values);
|
||||
values.clear();
|
||||
std::unordered_map<int, EnchantmentInstance*>* availableEnchantments =
|
||||
getAvailableEnchantmentResults(realValue, itemInstance);
|
||||
if (availableEnchantments != NULL && !availableEnchantments->empty()) {
|
||||
std::vector<WeighedRandomItem*> values;
|
||||
for (AUTO_VAR(it, availableEnchantments->begin());
|
||||
it != availableEnchantments->end(); ++it) {
|
||||
values.push_back(it->second);
|
||||
}
|
||||
EnchantmentInstance* instance =
|
||||
(EnchantmentInstance*)WeighedRandom::getRandomItem(random, &values);
|
||||
values.clear();
|
||||
|
||||
if (instance != NULL)
|
||||
{
|
||||
results = new std::vector<EnchantmentInstance *>();
|
||||
results->push_back( instance->copy() ); // 4J Stu - Inserting a copy so we can clear memory from the availableEnchantments collection
|
||||
if (instance != NULL) {
|
||||
results = new std::vector<EnchantmentInstance*>();
|
||||
results->push_back(
|
||||
instance->copy()); // 4J Stu - Inserting a copy so we can clear
|
||||
// memory from the availableEnchantments
|
||||
// collection
|
||||
|
||||
int bonusChance = realValue;
|
||||
while (random->nextInt(50) <= bonusChance)
|
||||
{
|
||||
int bonusChance = realValue;
|
||||
while (random->nextInt(50) <= bonusChance) {
|
||||
// remove incompatible enchantments from previous result
|
||||
// final Iterator<Integer> mapIter =
|
||||
// availableEnchantments.keySet().iterator(); while
|
||||
// (mapIter.hasNext())
|
||||
for (AUTO_VAR(it, availableEnchantments->begin());
|
||||
it != availableEnchantments->end();) {
|
||||
int nextEnchantment = it->first; // mapIter.next();
|
||||
bool valid = true;
|
||||
// for (EnchantmentInstance *current : results)
|
||||
for (AUTO_VAR(resIt, results->begin());
|
||||
resIt != results->end(); ++resIt) {
|
||||
EnchantmentInstance* current = *resIt;
|
||||
if (!current->enchantment->isCompatibleWith(
|
||||
Enchantment::enchantments[nextEnchantment])) {
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!valid) {
|
||||
// mapIter.remove();
|
||||
delete it->second;
|
||||
it = availableEnchantments->erase(it);
|
||||
} else {
|
||||
++it;
|
||||
}
|
||||
}
|
||||
|
||||
// remove incompatible enchantments from previous result
|
||||
//final Iterator<Integer> mapIter = availableEnchantments.keySet().iterator();
|
||||
//while (mapIter.hasNext())
|
||||
for(AUTO_VAR(it, availableEnchantments->begin()); it != availableEnchantments->end();)
|
||||
{
|
||||
int nextEnchantment = it->first;//mapIter.next();
|
||||
bool valid = true;
|
||||
//for (EnchantmentInstance *current : results)
|
||||
for(AUTO_VAR(resIt, results->begin()); resIt != results->end(); ++resIt)
|
||||
{
|
||||
EnchantmentInstance *current = *resIt;
|
||||
if (!current->enchantment->isCompatibleWith(Enchantment::enchantments[nextEnchantment]))
|
||||
{
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!valid)
|
||||
{
|
||||
//mapIter.remove();
|
||||
delete it->second;
|
||||
it = availableEnchantments->erase(it);
|
||||
}
|
||||
else
|
||||
{
|
||||
++it;
|
||||
}
|
||||
}
|
||||
if (!availableEnchantments->empty()) {
|
||||
for (AUTO_VAR(it, availableEnchantments->begin());
|
||||
it != availableEnchantments->end(); ++it) {
|
||||
values.push_back(it->second);
|
||||
}
|
||||
EnchantmentInstance* nextInstance =
|
||||
(EnchantmentInstance*)WeighedRandom::getRandomItem(
|
||||
random, &values);
|
||||
values.clear();
|
||||
results->push_back(
|
||||
nextInstance
|
||||
->copy()); // 4J Stu - Inserting a copy so we can
|
||||
// clear memory from the
|
||||
// availableEnchantments collection
|
||||
}
|
||||
|
||||
if (!availableEnchantments->empty())
|
||||
{
|
||||
for(AUTO_VAR(it, availableEnchantments->begin()); it != availableEnchantments->end(); ++it)
|
||||
{
|
||||
values.push_back(it->second);
|
||||
}
|
||||
EnchantmentInstance *nextInstance = (EnchantmentInstance *) WeighedRandom::getRandomItem(random, &values);
|
||||
values.clear();
|
||||
results->push_back( nextInstance->copy() ); // 4J Stu - Inserting a copy so we can clear memory from the availableEnchantments collection
|
||||
}
|
||||
bonusChance >>= 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (availableEnchantments != NULL) {
|
||||
for (AUTO_VAR(it, availableEnchantments->begin());
|
||||
it != availableEnchantments->end(); ++it) {
|
||||
delete it->second;
|
||||
}
|
||||
delete availableEnchantments;
|
||||
}
|
||||
|
||||
bonusChance >>= 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
if(availableEnchantments != NULL)
|
||||
{
|
||||
for(AUTO_VAR(it, availableEnchantments->begin()); it != availableEnchantments->end(); ++it)
|
||||
{
|
||||
delete it->second;
|
||||
}
|
||||
delete availableEnchantments;
|
||||
}
|
||||
|
||||
return results;
|
||||
return results;
|
||||
}
|
||||
|
||||
std::unordered_map<int, EnchantmentInstance *> *EnchantmentHelper::getAvailableEnchantmentResults(int value, std::shared_ptr<ItemInstance> itemInstance)
|
||||
{
|
||||
Item *item = itemInstance->getItem();
|
||||
std::unordered_map<int, EnchantmentInstance *> *results = NULL;
|
||||
std::unordered_map<int, EnchantmentInstance*>*
|
||||
EnchantmentHelper::getAvailableEnchantmentResults(
|
||||
int value, std::shared_ptr<ItemInstance> itemInstance) {
|
||||
Item* item = itemInstance->getItem();
|
||||
std::unordered_map<int, EnchantmentInstance*>* results = NULL;
|
||||
|
||||
bool isBook = itemInstance->id == Item::book_Id;
|
||||
bool isBook = itemInstance->id == Item::book_Id;
|
||||
|
||||
//for (Enchantment e : Enchantment.enchantments)
|
||||
for(unsigned int i = 0; i < Enchantment::enchantments.length; ++i)
|
||||
{
|
||||
Enchantment *e = Enchantment::enchantments[i];
|
||||
if (e == NULL)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
// for (Enchantment e : Enchantment.enchantments)
|
||||
for (unsigned int i = 0; i < Enchantment::enchantments.length; ++i) {
|
||||
Enchantment* e = Enchantment::enchantments[i];
|
||||
if (e == NULL) {
|
||||
continue;
|
||||
}
|
||||
|
||||
// Only picks "normal" enchantments, no specialcases
|
||||
if (!e->category->canEnchant(item) && !isBook)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
// Only picks "normal" enchantments, no specialcases
|
||||
if (!e->category->canEnchant(item) && !isBook) {
|
||||
continue;
|
||||
}
|
||||
|
||||
for (int level = e->getMinLevel(); level <= e->getMaxLevel(); level++)
|
||||
{
|
||||
if (value >= e->getMinCost(level) && value <= e->getMaxCost(level))
|
||||
{
|
||||
if (results == NULL)
|
||||
{
|
||||
results = new std::unordered_map<int, EnchantmentInstance *>();
|
||||
}
|
||||
AUTO_VAR(it, results->find(e->id));
|
||||
if(it != results->end())
|
||||
{
|
||||
delete it->second;
|
||||
}
|
||||
(*results)[e->id] = new EnchantmentInstance(e, level);
|
||||
}
|
||||
}
|
||||
}
|
||||
for (int level = e->getMinLevel(); level <= e->getMaxLevel(); level++) {
|
||||
if (value >= e->getMinCost(level) &&
|
||||
value <= e->getMaxCost(level)) {
|
||||
if (results == NULL) {
|
||||
results =
|
||||
new std::unordered_map<int, EnchantmentInstance*>();
|
||||
}
|
||||
AUTO_VAR(it, results->find(e->id));
|
||||
if (it != results->end()) {
|
||||
delete it->second;
|
||||
}
|
||||
(*results)[e->id] = new EnchantmentInstance(e, level);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return results;
|
||||
return results;
|
||||
}
|
||||
Reference in New Issue
Block a user