2010-11-29 13:13:04 -05:00
|
|
|
/*
|
|
|
|
Minetest-c55
|
2011-11-13 17:19:48 -05:00
|
|
|
Copyright (C) 2010-2011 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2010-11-29 13:13:04 -05:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License along
|
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
2010-11-26 18:02:21 -05:00
|
|
|
#include "inventory.h"
|
|
|
|
#include "serialization.h"
|
|
|
|
#include "utility.h"
|
|
|
|
#include "debug.h"
|
|
|
|
#include <sstream>
|
2011-11-13 17:19:48 -05:00
|
|
|
#include "main.h" // For tsrc, g_toolmanager
|
2011-04-10 08:16:27 -04:00
|
|
|
#include "serverobject.h"
|
2011-06-17 15:20:15 -04:00
|
|
|
#include "content_mapnode.h"
|
2011-06-17 19:30:33 -04:00
|
|
|
#include "content_inventory.h"
|
2011-06-26 08:48:56 -04:00
|
|
|
#include "content_sao.h"
|
2011-07-30 11:51:15 -04:00
|
|
|
#include "player.h"
|
2011-10-16 18:03:45 -04:00
|
|
|
#include "log.h"
|
2011-11-14 14:41:30 -05:00
|
|
|
#include "nodedef.h"
|
|
|
|
#include "tooldef.h"
|
2011-11-13 17:19:48 -05:00
|
|
|
#include "gamedef.h"
|
2010-11-26 18:02:21 -05:00
|
|
|
|
|
|
|
/*
|
|
|
|
InventoryItem
|
|
|
|
*/
|
|
|
|
|
2011-11-13 17:19:48 -05:00
|
|
|
InventoryItem::InventoryItem(IGameDef *gamedef, u16 count):
|
|
|
|
m_gamedef(gamedef),
|
|
|
|
m_count(count)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
assert(m_gamedef);
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
InventoryItem::~InventoryItem()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-07-30 19:20:40 -04:00
|
|
|
content_t content_translate_from_19_to_internal(content_t c_from)
|
|
|
|
{
|
|
|
|
for(u32 i=0; i<sizeof(trans_table_19)/sizeof(trans_table_19[0]); i++)
|
|
|
|
{
|
|
|
|
if(trans_table_19[i][1] == c_from)
|
|
|
|
{
|
|
|
|
return trans_table_19[i][0];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return c_from;
|
|
|
|
}
|
|
|
|
|
2011-11-13 17:19:48 -05:00
|
|
|
InventoryItem* InventoryItem::deSerialize(std::istream &is, IGameDef *gamedef)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
DSTACK(__FUNCTION_NAME);
|
|
|
|
|
|
|
|
//is.imbue(std::locale("C"));
|
|
|
|
// Read name
|
|
|
|
std::string name;
|
|
|
|
std::getline(is, name, ' ');
|
|
|
|
|
|
|
|
if(name == "MaterialItem")
|
|
|
|
{
|
|
|
|
// u16 reads directly as a number (u8 doesn't)
|
2011-07-30 19:20:40 -04:00
|
|
|
u16 material;
|
|
|
|
is>>material;
|
|
|
|
u16 count;
|
|
|
|
is>>count;
|
|
|
|
// Convert old materials
|
|
|
|
if(material <= 0xff)
|
|
|
|
{
|
|
|
|
material = content_translate_from_19_to_internal(material);
|
|
|
|
}
|
|
|
|
if(material > MAX_CONTENT)
|
|
|
|
throw SerializationError("Too large material number");
|
2011-11-13 17:19:48 -05:00
|
|
|
return new MaterialItem(gamedef, material, count);
|
2011-07-30 19:20:40 -04:00
|
|
|
}
|
|
|
|
else if(name == "MaterialItem2")
|
|
|
|
{
|
2010-11-26 18:02:21 -05:00
|
|
|
u16 material;
|
|
|
|
is>>material;
|
|
|
|
u16 count;
|
|
|
|
is>>count;
|
2011-07-23 09:55:26 -04:00
|
|
|
if(material > MAX_CONTENT)
|
2010-11-26 18:02:21 -05:00
|
|
|
throw SerializationError("Too large material number");
|
2011-11-13 17:19:48 -05:00
|
|
|
return new MaterialItem(gamedef, material, count);
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
else if(name == "MBOItem")
|
|
|
|
{
|
|
|
|
std::string inventorystring;
|
|
|
|
std::getline(is, inventorystring, '|');
|
2011-10-14 19:28:57 -04:00
|
|
|
throw SerializationError("MBOItem not supported anymore");
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
2010-12-24 10:08:50 -05:00
|
|
|
else if(name == "CraftItem")
|
|
|
|
{
|
|
|
|
std::string subname;
|
|
|
|
std::getline(is, subname, ' ');
|
|
|
|
u16 count;
|
|
|
|
is>>count;
|
2011-11-13 17:19:48 -05:00
|
|
|
return new CraftItem(gamedef, subname, count);
|
2010-12-24 10:08:50 -05:00
|
|
|
}
|
2010-12-23 20:08:05 -05:00
|
|
|
else if(name == "ToolItem")
|
|
|
|
{
|
|
|
|
std::string toolname;
|
|
|
|
std::getline(is, toolname, ' ');
|
|
|
|
u16 wear;
|
|
|
|
is>>wear;
|
2011-11-13 17:19:48 -05:00
|
|
|
return new ToolItem(gamedef, toolname, wear);
|
2010-12-23 20:08:05 -05:00
|
|
|
}
|
2010-11-26 18:02:21 -05:00
|
|
|
else
|
|
|
|
{
|
2011-10-16 18:03:45 -04:00
|
|
|
infostream<<"Unknown InventoryItem name=\""<<name<<"\""<<std::endl;
|
2010-11-26 18:02:21 -05:00
|
|
|
throw SerializationError("Unknown InventoryItem name");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-01 17:16:55 -04:00
|
|
|
std::string InventoryItem::getItemString() {
|
|
|
|
// Get item string
|
|
|
|
std::ostringstream os(std::ios_base::binary);
|
|
|
|
serialize(os);
|
|
|
|
return os.str();
|
|
|
|
}
|
|
|
|
|
2011-04-10 08:16:27 -04:00
|
|
|
ServerActiveObject* InventoryItem::createSAO(ServerEnvironment *env, u16 id, v3f pos)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
Create an ItemSAO
|
|
|
|
*/
|
2011-11-12 08:14:24 -05:00
|
|
|
pos.Y -= BS*0.25; // let it drop a bit
|
|
|
|
// Randomize a bit
|
|
|
|
pos.X += BS*0.2*(float)myrand_range(-1000,1000)/1000.0;
|
|
|
|
pos.Z += BS*0.2*(float)myrand_range(-1000,1000)/1000.0;
|
2011-04-10 08:16:27 -04:00
|
|
|
// Create object
|
2011-11-11 12:33:17 -05:00
|
|
|
ServerActiveObject *obj = new ItemSAO(env, pos, getItemString());
|
2011-04-10 08:16:27 -04:00
|
|
|
return obj;
|
|
|
|
}
|
|
|
|
|
2011-04-05 03:59:48 -04:00
|
|
|
/*
|
|
|
|
MaterialItem
|
|
|
|
*/
|
|
|
|
|
2011-11-13 03:57:55 -05:00
|
|
|
#ifndef SERVER
|
2011-11-13 17:19:48 -05:00
|
|
|
video::ITexture * MaterialItem::getImage(ITextureSource *tsrc) const
|
2011-11-13 03:57:55 -05:00
|
|
|
{
|
2011-11-14 14:41:30 -05:00
|
|
|
return m_gamedef->getNodeDefManager()->get(m_content).inventory_texture;
|
2011-11-13 03:57:55 -05:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
bool MaterialItem::isCookable() const
|
2011-04-05 11:23:30 -04:00
|
|
|
{
|
2011-11-15 18:34:09 -05:00
|
|
|
INodeDefManager *ndef = m_gamedef->ndef();
|
|
|
|
const ContentFeatures &f = ndef->get(m_content);
|
|
|
|
return (f.cookresult_item != "");
|
2011-04-05 11:23:30 -04:00
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
InventoryItem *MaterialItem::createCookResult() const
|
2011-04-05 03:59:48 -04:00
|
|
|
{
|
2011-11-15 18:34:09 -05:00
|
|
|
INodeDefManager *ndef = m_gamedef->ndef();
|
|
|
|
const ContentFeatures &f = ndef->get(m_content);
|
|
|
|
std::istringstream is(f.cookresult_item, std::ios::binary);
|
|
|
|
return InventoryItem::deSerialize(is, m_gamedef);
|
2011-04-05 11:23:30 -04:00
|
|
|
}
|
|
|
|
|
2011-11-15 19:22:41 -05:00
|
|
|
float MaterialItem::getCookTime() const
|
|
|
|
{
|
|
|
|
INodeDefManager *ndef = m_gamedef->ndef();
|
|
|
|
const ContentFeatures &f = ndef->get(m_content);
|
|
|
|
return f.furnace_cooktime;
|
|
|
|
}
|
|
|
|
|
|
|
|
float MaterialItem::getBurnTime() const
|
|
|
|
{
|
|
|
|
INodeDefManager *ndef = m_gamedef->ndef();
|
|
|
|
const ContentFeatures &f = ndef->get(m_content);
|
|
|
|
return f.furnace_burntime;
|
|
|
|
}
|
|
|
|
|
2011-11-13 09:38:14 -05:00
|
|
|
/*
|
|
|
|
ToolItem
|
|
|
|
*/
|
|
|
|
|
|
|
|
std::string ToolItem::getImageBasename() const
|
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
return m_gamedef->getToolDefManager()->getImagename(m_toolname);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef SERVER
|
|
|
|
video::ITexture * ToolItem::getImage(ITextureSource *tsrc) const
|
|
|
|
{
|
|
|
|
if(tsrc == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
std::string basename = getImageBasename();
|
|
|
|
|
|
|
|
/*
|
|
|
|
Calculate a progress value with sane amount of
|
|
|
|
maximum states
|
|
|
|
*/
|
|
|
|
u32 maxprogress = 30;
|
|
|
|
u32 toolprogress = (65535-m_wear)/(65535/maxprogress);
|
|
|
|
|
|
|
|
float value_f = (float)toolprogress / (float)maxprogress;
|
|
|
|
std::ostringstream os;
|
|
|
|
os<<basename<<"^[progressbar"<<value_f;
|
|
|
|
|
|
|
|
return tsrc->getTextureRaw(os.str());
|
|
|
|
}
|
|
|
|
|
|
|
|
video::ITexture * ToolItem::getImageRaw(ITextureSource *tsrc) const
|
|
|
|
{
|
|
|
|
if(tsrc == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return tsrc->getTextureRaw(getImageBasename());
|
2011-11-13 09:38:14 -05:00
|
|
|
}
|
2011-11-13 17:19:48 -05:00
|
|
|
#endif
|
2011-11-13 09:38:14 -05:00
|
|
|
|
2011-04-05 11:23:30 -04:00
|
|
|
/*
|
|
|
|
CraftItem
|
|
|
|
*/
|
|
|
|
|
2011-04-10 08:16:27 -04:00
|
|
|
#ifndef SERVER
|
2011-11-13 17:19:48 -05:00
|
|
|
video::ITexture * CraftItem::getImage(ITextureSource *tsrc) const
|
2011-04-10 08:16:27 -04:00
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
if(tsrc == NULL)
|
2011-04-10 08:16:27 -04:00
|
|
|
return NULL;
|
|
|
|
|
2011-11-13 17:19:48 -05:00
|
|
|
std::string name = item_craft_get_image_name(m_subname, m_gamedef);
|
2011-04-10 08:16:27 -04:00
|
|
|
|
|
|
|
// Get such a texture
|
2011-11-13 17:19:48 -05:00
|
|
|
return tsrc->getTextureRaw(name);
|
2011-04-10 08:16:27 -04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
ServerActiveObject* CraftItem::createSAO(ServerEnvironment *env, u16 id, v3f pos)
|
|
|
|
{
|
|
|
|
// Special cases
|
2011-11-11 12:33:17 -05:00
|
|
|
ServerActiveObject *obj = item_craft_create_object(m_subname, env, pos);
|
2011-06-17 19:30:33 -04:00
|
|
|
if(obj)
|
2011-04-10 08:16:27 -04:00
|
|
|
return obj;
|
|
|
|
// Default
|
2011-06-17 19:30:33 -04:00
|
|
|
return InventoryItem::createSAO(env, id, pos);
|
2011-04-10 08:16:27 -04:00
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
u16 CraftItem::getDropCount() const
|
2011-04-19 10:09:45 -04:00
|
|
|
{
|
|
|
|
// Special cases
|
2011-11-13 17:19:48 -05:00
|
|
|
s16 dc = item_craft_get_drop_count(m_subname, m_gamedef);
|
2011-06-17 19:30:33 -04:00
|
|
|
if(dc != -1)
|
|
|
|
return dc;
|
2011-04-19 10:09:45 -04:00
|
|
|
// Default
|
2011-06-17 19:30:33 -04:00
|
|
|
return InventoryItem::getDropCount();
|
2011-04-19 10:09:45 -04:00
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
bool CraftItem::isCookable() const
|
2011-04-05 11:23:30 -04:00
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
return item_craft_is_cookable(m_subname, m_gamedef);
|
2011-04-05 11:23:30 -04:00
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
InventoryItem *CraftItem::createCookResult() const
|
2011-04-05 11:23:30 -04:00
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
return item_craft_create_cook_result(m_subname, m_gamedef);
|
2011-04-05 03:59:48 -04:00
|
|
|
}
|
|
|
|
|
2011-11-15 19:22:41 -05:00
|
|
|
float CraftItem::getCookTime() const
|
|
|
|
{
|
|
|
|
return 3.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
float CraftItem::getBurnTime() const
|
|
|
|
{
|
|
|
|
if(m_subname == "lump_of_coal")
|
|
|
|
return 40;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2011-11-12 10:37:14 -05:00
|
|
|
bool CraftItem::use(ServerEnvironment *env, ServerActiveObject *user)
|
2011-07-30 11:51:15 -04:00
|
|
|
{
|
2011-11-13 17:19:48 -05:00
|
|
|
if(!item_craft_is_eatable(m_subname, m_gamedef))
|
2011-11-12 10:37:14 -05:00
|
|
|
return false;
|
|
|
|
|
|
|
|
u16 result_count = getCount() - 1; // Eat one at a time
|
2011-11-13 17:19:48 -05:00
|
|
|
s16 hp_change = item_craft_eat_hp_change(m_subname, m_gamedef);
|
2011-11-12 10:37:14 -05:00
|
|
|
s16 hp = user->getHP();
|
|
|
|
hp += hp_change;
|
|
|
|
if(hp < 0)
|
|
|
|
hp = 0;
|
|
|
|
user->setHP(hp);
|
|
|
|
|
|
|
|
if(result_count < 1)
|
|
|
|
return true;
|
2011-09-01 17:16:55 -04:00
|
|
|
|
2011-11-12 10:37:14 -05:00
|
|
|
setCount(result_count);
|
2011-07-30 11:51:15 -04:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-11-26 18:02:21 -05:00
|
|
|
/*
|
|
|
|
Inventory
|
|
|
|
*/
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
InventoryList::InventoryList(std::string name, u32 size)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2010-12-22 04:29:06 -05:00
|
|
|
m_name = name;
|
2010-11-26 18:02:21 -05:00
|
|
|
m_size = size;
|
|
|
|
clearItems();
|
2011-04-11 14:28:04 -04:00
|
|
|
//m_dirty = false;
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
InventoryList::~InventoryList()
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
2010-12-22 04:29:06 -05:00
|
|
|
if(m_items[i])
|
|
|
|
delete m_items[i];
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
void InventoryList::clearItems()
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2010-12-22 04:29:06 -05:00
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
|
|
|
if(m_items[i])
|
|
|
|
delete m_items[i];
|
|
|
|
}
|
|
|
|
|
2010-11-26 18:02:21 -05:00
|
|
|
m_items.clear();
|
2010-12-22 04:29:06 -05:00
|
|
|
|
2010-11-26 18:02:21 -05:00
|
|
|
for(u32 i=0; i<m_size; i++)
|
|
|
|
{
|
|
|
|
m_items.push_back(NULL);
|
|
|
|
}
|
2011-04-11 14:28:04 -04:00
|
|
|
|
|
|
|
//setDirty(true);
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
|
2011-08-10 17:22:44 -04:00
|
|
|
void InventoryList::serialize(std::ostream &os) const
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
//os.imbue(std::locale("C"));
|
|
|
|
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
|
|
|
InventoryItem *item = m_items[i];
|
|
|
|
if(item != NULL)
|
|
|
|
{
|
|
|
|
os<<"Item ";
|
|
|
|
item->serialize(os);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
os<<"Empty";
|
|
|
|
}
|
|
|
|
os<<"\n";
|
|
|
|
}
|
|
|
|
|
2011-01-27 18:38:16 -05:00
|
|
|
os<<"EndInventoryList\n";
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
|
2011-11-13 17:19:48 -05:00
|
|
|
void InventoryList::deSerialize(std::istream &is, IGameDef *gamedef)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
//is.imbue(std::locale("C"));
|
|
|
|
|
|
|
|
clearItems();
|
|
|
|
u32 item_i = 0;
|
|
|
|
|
|
|
|
for(;;)
|
|
|
|
{
|
|
|
|
std::string line;
|
|
|
|
std::getline(is, line, '\n');
|
|
|
|
|
|
|
|
std::istringstream iss(line);
|
|
|
|
//iss.imbue(std::locale("C"));
|
|
|
|
|
|
|
|
std::string name;
|
|
|
|
std::getline(iss, name, ' ');
|
|
|
|
|
2011-01-27 18:38:16 -05:00
|
|
|
if(name == "EndInventoryList")
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
2011-02-03 08:45:53 -05:00
|
|
|
// This is a temporary backwards compatibility fix
|
|
|
|
else if(name == "end")
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
2010-11-26 18:02:21 -05:00
|
|
|
else if(name == "Item")
|
|
|
|
{
|
|
|
|
if(item_i > getSize() - 1)
|
|
|
|
throw SerializationError("too many items");
|
2011-11-13 17:19:48 -05:00
|
|
|
InventoryItem *item = InventoryItem::deSerialize(iss, gamedef);
|
2010-11-26 18:02:21 -05:00
|
|
|
m_items[item_i++] = item;
|
|
|
|
}
|
|
|
|
else if(name == "Empty")
|
|
|
|
{
|
|
|
|
if(item_i > getSize() - 1)
|
|
|
|
throw SerializationError("too many items");
|
|
|
|
m_items[item_i++] = NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
throw SerializationError("Unknown inventory identifier");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
InventoryList::InventoryList(const InventoryList &other)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
Do this so that the items get cloned. Otherwise the pointers
|
|
|
|
in the array will just get copied.
|
|
|
|
*/
|
|
|
|
*this = other;
|
|
|
|
}
|
|
|
|
|
|
|
|
InventoryList & InventoryList::operator = (const InventoryList &other)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2010-12-22 04:29:06 -05:00
|
|
|
m_name = other.m_name;
|
2010-11-26 18:02:21 -05:00
|
|
|
m_size = other.m_size;
|
|
|
|
clearItems();
|
|
|
|
for(u32 i=0; i<other.m_items.size(); i++)
|
|
|
|
{
|
|
|
|
InventoryItem *item = other.m_items[i];
|
|
|
|
if(item != NULL)
|
|
|
|
{
|
|
|
|
m_items[i] = item->clone();
|
|
|
|
}
|
|
|
|
}
|
2011-04-11 14:28:04 -04:00
|
|
|
//setDirty(true);
|
2010-11-26 18:02:21 -05:00
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
const std::string &InventoryList::getName() const
|
2010-12-22 04:29:06 -05:00
|
|
|
{
|
|
|
|
return m_name;
|
|
|
|
}
|
|
|
|
|
|
|
|
u32 InventoryList::getSize()
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
return m_items.size();
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
u32 InventoryList::getUsedSlots()
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
u32 num = 0;
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
|
|
|
InventoryItem *item = m_items[i];
|
|
|
|
if(item != NULL)
|
|
|
|
num++;
|
|
|
|
}
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2011-04-05 03:59:48 -04:00
|
|
|
u32 InventoryList::getFreeSlots()
|
|
|
|
{
|
|
|
|
return getSize() - getUsedSlots();
|
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
const InventoryItem * InventoryList::getItem(u32 i) const
|
|
|
|
{
|
|
|
|
if(i > m_items.size() - 1)
|
|
|
|
return NULL;
|
|
|
|
return m_items[i];
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
InventoryItem * InventoryList::getItem(u32 i)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
if(i > m_items.size() - 1)
|
|
|
|
return NULL;
|
|
|
|
return m_items[i];
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
InventoryItem * InventoryList::changeItem(u32 i, InventoryItem *newitem)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
assert(i < m_items.size());
|
|
|
|
|
|
|
|
InventoryItem *olditem = m_items[i];
|
|
|
|
m_items[i] = newitem;
|
2011-04-11 14:28:04 -04:00
|
|
|
//setDirty(true);
|
2010-11-26 18:02:21 -05:00
|
|
|
return olditem;
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
void InventoryList::deleteItem(u32 i)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
|
|
|
assert(i < m_items.size());
|
|
|
|
InventoryItem *item = changeItem(i, NULL);
|
|
|
|
if(item)
|
|
|
|
delete item;
|
|
|
|
}
|
|
|
|
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem * InventoryList::addItem(InventoryItem *newitem)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2011-04-05 11:23:30 -04:00
|
|
|
if(newitem == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2010-12-24 10:08:50 -05:00
|
|
|
/*
|
|
|
|
First try to find if it could be added to some existing items
|
|
|
|
*/
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2010-12-24 10:08:50 -05:00
|
|
|
// Ignore empty slots
|
|
|
|
if(m_items[i] == NULL)
|
|
|
|
continue;
|
|
|
|
// Try adding
|
|
|
|
newitem = addItem(i, newitem);
|
|
|
|
if(newitem == NULL)
|
|
|
|
return NULL; // All was eaten
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
2010-12-24 10:08:50 -05:00
|
|
|
|
|
|
|
/*
|
|
|
|
Then try to add it to empty slots
|
|
|
|
*/
|
2010-11-26 18:02:21 -05:00
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
2010-12-24 10:08:50 -05:00
|
|
|
// Ignore unempty slots
|
|
|
|
if(m_items[i] != NULL)
|
2010-11-26 18:02:21 -05:00
|
|
|
continue;
|
2010-12-24 10:08:50 -05:00
|
|
|
// Try adding
|
|
|
|
newitem = addItem(i, newitem);
|
|
|
|
if(newitem == NULL)
|
|
|
|
return NULL; // All was eaten
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
2010-12-24 10:08:50 -05:00
|
|
|
|
|
|
|
// Return leftover
|
|
|
|
return newitem;
|
2010-11-26 18:02:21 -05:00
|
|
|
}
|
|
|
|
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem * InventoryList::addItem(u32 i, InventoryItem *newitem)
|
2010-12-22 09:30:23 -05:00
|
|
|
{
|
2011-04-05 11:23:30 -04:00
|
|
|
if(newitem == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2011-04-11 14:28:04 -04:00
|
|
|
//setDirty(true);
|
|
|
|
|
2010-12-22 09:30:23 -05:00
|
|
|
// If it is an empty position, it's an easy job.
|
2011-06-19 12:40:41 -04:00
|
|
|
InventoryItem *to_item = getItem(i);
|
2010-12-24 10:08:50 -05:00
|
|
|
if(to_item == NULL)
|
2010-12-22 09:30:23 -05:00
|
|
|
{
|
|
|
|
m_items[i] = newitem;
|
2010-12-24 10:08:50 -05:00
|
|
|
return NULL;
|
2010-12-22 09:30:23 -05:00
|
|
|
}
|
2010-12-24 10:08:50 -05:00
|
|
|
|
|
|
|
// If not addable, return the item
|
|
|
|
if(newitem->addableTo(to_item) == false)
|
|
|
|
return newitem;
|
|
|
|
|
|
|
|
// If the item fits fully in the slot, add counter and delete it
|
|
|
|
if(newitem->getCount() <= to_item->freeSpace())
|
|
|
|
{
|
|
|
|
to_item->add(newitem->getCount());
|
|
|
|
delete newitem;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
// Else the item does not fit fully. Add all that fits and return
|
|
|
|
// the rest.
|
|
|
|
else
|
2010-12-22 09:30:23 -05:00
|
|
|
{
|
2010-12-24 10:08:50 -05:00
|
|
|
u16 freespace = to_item->freeSpace();
|
|
|
|
to_item->add(freespace);
|
|
|
|
newitem->remove(freespace);
|
|
|
|
return newitem;
|
|
|
|
}
|
|
|
|
}
|
2010-12-22 09:30:23 -05:00
|
|
|
|
2011-08-25 19:27:50 -04:00
|
|
|
bool InventoryList::itemFits(const u32 i, const InventoryItem *newitem)
|
2011-04-04 19:56:29 -04:00
|
|
|
{
|
|
|
|
// If it is an empty position, it's an easy job.
|
2011-08-10 05:38:49 -04:00
|
|
|
const InventoryItem *to_item = getItem(i);
|
2011-04-04 19:56:29 -04:00
|
|
|
if(to_item == NULL)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-08-25 19:27:50 -04:00
|
|
|
// If not addable, fail
|
2011-04-04 19:56:29 -04:00
|
|
|
if(newitem->addableTo(to_item) == false)
|
|
|
|
return false;
|
|
|
|
|
2011-08-25 19:27:50 -04:00
|
|
|
// If the item fits fully in the slot, pass
|
2011-04-04 19:56:29 -04:00
|
|
|
if(newitem->getCount() <= to_item->freeSpace())
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-08-25 19:27:50 -04:00
|
|
|
bool InventoryList::roomForItem(const InventoryItem *item)
|
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
if(itemFits(i, item))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool InventoryList::roomForCookedItem(const InventoryItem *item)
|
|
|
|
{
|
2011-08-30 11:38:53 -04:00
|
|
|
if(!item)
|
|
|
|
return false;
|
2011-08-25 19:27:50 -04:00
|
|
|
const InventoryItem *cook = item->createCookResult();
|
|
|
|
if(!cook)
|
|
|
|
return false;
|
|
|
|
bool room = roomForItem(cook);
|
|
|
|
delete cook;
|
|
|
|
return room;
|
|
|
|
}
|
|
|
|
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem * InventoryList::takeItem(u32 i, u32 count)
|
|
|
|
{
|
|
|
|
if(count == 0)
|
|
|
|
return NULL;
|
2011-04-11 14:28:04 -04:00
|
|
|
|
|
|
|
//setDirty(true);
|
2010-12-24 10:08:50 -05:00
|
|
|
|
2011-06-19 12:40:41 -04:00
|
|
|
InventoryItem *item = getItem(i);
|
2010-12-24 10:08:50 -05:00
|
|
|
// If it is an empty position, return NULL
|
|
|
|
if(item == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if(count >= item->getCount())
|
|
|
|
{
|
|
|
|
// Get the item by swapping NULL to its place
|
|
|
|
return changeItem(i, NULL);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
InventoryItem *item2 = item->clone();
|
|
|
|
item->remove(count);
|
|
|
|
item2->setCount(count);
|
|
|
|
return item2;
|
2010-12-22 09:30:23 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void InventoryList::decrementMaterials(u16 count)
|
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem *item = takeItem(i, count);
|
|
|
|
if(item)
|
|
|
|
delete item;
|
2010-12-22 09:30:23 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-22 04:29:06 -05:00
|
|
|
void InventoryList::print(std::ostream &o)
|
2010-11-26 18:02:21 -05:00
|
|
|
{
|
2010-12-22 04:29:06 -05:00
|
|
|
o<<"InventoryList:"<<std::endl;
|
2010-11-26 18:02:21 -05:00
|
|
|
for(u32 i=0; i<m_items.size(); i++)
|
|
|
|
{
|
|
|
|
InventoryItem *item = m_items[i];
|
|
|
|
if(item != NULL)
|
|
|
|
{
|
|
|
|
o<<i<<": ";
|
|
|
|
item->serialize(o);
|
|
|
|
o<<"\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-12-22 04:29:06 -05:00
|
|
|
|
|
|
|
/*
|
|
|
|
Inventory
|
|
|
|
*/
|
|
|
|
|
|
|
|
Inventory::~Inventory()
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Inventory::clear()
|
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_lists.size(); i++)
|
|
|
|
{
|
|
|
|
delete m_lists[i];
|
|
|
|
}
|
|
|
|
m_lists.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
Inventory::Inventory()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
Inventory::Inventory(const Inventory &other)
|
|
|
|
{
|
|
|
|
*this = other;
|
|
|
|
}
|
|
|
|
|
|
|
|
Inventory & Inventory::operator = (const Inventory &other)
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
for(u32 i=0; i<other.m_lists.size(); i++)
|
|
|
|
{
|
|
|
|
m_lists.push_back(new InventoryList(*other.m_lists[i]));
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2011-08-10 17:22:44 -04:00
|
|
|
void Inventory::serialize(std::ostream &os) const
|
2010-12-22 04:29:06 -05:00
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_lists.size(); i++)
|
|
|
|
{
|
|
|
|
InventoryList *list = m_lists[i];
|
|
|
|
os<<"List "<<list->getName()<<" "<<list->getSize()<<"\n";
|
|
|
|
list->serialize(os);
|
|
|
|
}
|
|
|
|
|
2011-01-27 18:38:16 -05:00
|
|
|
os<<"EndInventory\n";
|
2010-12-22 04:29:06 -05:00
|
|
|
}
|
|
|
|
|
2011-11-13 17:19:48 -05:00
|
|
|
void Inventory::deSerialize(std::istream &is, IGameDef *gamedef)
|
2010-12-22 04:29:06 -05:00
|
|
|
{
|
|
|
|
clear();
|
|
|
|
|
|
|
|
for(;;)
|
|
|
|
{
|
|
|
|
std::string line;
|
|
|
|
std::getline(is, line, '\n');
|
|
|
|
|
|
|
|
std::istringstream iss(line);
|
|
|
|
|
|
|
|
std::string name;
|
|
|
|
std::getline(iss, name, ' ');
|
|
|
|
|
2011-01-27 18:38:16 -05:00
|
|
|
if(name == "EndInventory")
|
2010-12-22 04:29:06 -05:00
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
2011-02-03 08:45:53 -05:00
|
|
|
// This is a temporary backwards compatibility fix
|
|
|
|
else if(name == "end")
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
2010-12-22 04:29:06 -05:00
|
|
|
else if(name == "List")
|
|
|
|
{
|
|
|
|
std::string listname;
|
|
|
|
u32 listsize;
|
|
|
|
|
|
|
|
std::getline(iss, listname, ' ');
|
|
|
|
iss>>listsize;
|
|
|
|
|
|
|
|
InventoryList *list = new InventoryList(listname, listsize);
|
2011-11-13 17:19:48 -05:00
|
|
|
list->deSerialize(is, gamedef);
|
2010-12-22 04:29:06 -05:00
|
|
|
|
|
|
|
m_lists.push_back(list);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
throw SerializationError("Unknown inventory identifier");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
InventoryList * Inventory::addList(const std::string &name, u32 size)
|
|
|
|
{
|
|
|
|
s32 i = getListIndex(name);
|
|
|
|
if(i != -1)
|
|
|
|
{
|
|
|
|
if(m_lists[i]->getSize() != size)
|
|
|
|
{
|
|
|
|
delete m_lists[i];
|
|
|
|
m_lists[i] = new InventoryList(name, size);
|
|
|
|
}
|
|
|
|
return m_lists[i];
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_lists.push_back(new InventoryList(name, size));
|
|
|
|
return m_lists.getLast();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
InventoryList * Inventory::getList(const std::string &name)
|
|
|
|
{
|
|
|
|
s32 i = getListIndex(name);
|
|
|
|
if(i == -1)
|
|
|
|
return NULL;
|
|
|
|
return m_lists[i];
|
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
const InventoryList * Inventory::getList(const std::string &name) const
|
|
|
|
{
|
|
|
|
s32 i = getListIndex(name);
|
|
|
|
if(i == -1)
|
|
|
|
return NULL;
|
|
|
|
return m_lists[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
const s32 Inventory::getListIndex(const std::string &name) const
|
2010-12-22 04:29:06 -05:00
|
|
|
{
|
|
|
|
for(u32 i=0; i<m_lists.size(); i++)
|
|
|
|
{
|
|
|
|
if(m_lists[i]->getName() == name)
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2010-12-22 09:30:23 -05:00
|
|
|
/*
|
|
|
|
InventoryAction
|
|
|
|
*/
|
|
|
|
|
|
|
|
InventoryAction * InventoryAction::deSerialize(std::istream &is)
|
|
|
|
{
|
|
|
|
std::string type;
|
|
|
|
std::getline(is, type, ' ');
|
|
|
|
|
|
|
|
InventoryAction *a = NULL;
|
|
|
|
|
|
|
|
if(type == "Move")
|
|
|
|
{
|
|
|
|
a = new IMoveAction(is);
|
|
|
|
}
|
|
|
|
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
2011-10-16 18:03:45 -04:00
|
|
|
static std::string describeC(const struct InventoryContext *c)
|
2010-12-22 09:30:23 -05:00
|
|
|
{
|
2011-10-16 18:03:45 -04:00
|
|
|
if(c->current_player == NULL)
|
|
|
|
return "current_player=NULL";
|
|
|
|
else
|
|
|
|
return std::string("current_player=") + c->current_player->getName();
|
|
|
|
}
|
2011-04-04 08:13:19 -04:00
|
|
|
|
2011-11-15 14:00:39 -05:00
|
|
|
IMoveAction::IMoveAction(std::istream &is)
|
|
|
|
{
|
|
|
|
std::string ts;
|
|
|
|
|
|
|
|
std::getline(is, ts, ' ');
|
|
|
|
count = stoi(ts);
|
|
|
|
|
|
|
|
std::getline(is, from_inv, ' ');
|
|
|
|
|
|
|
|
std::getline(is, from_list, ' ');
|
|
|
|
|
|
|
|
std::getline(is, ts, ' ');
|
|
|
|
from_i = stoi(ts);
|
|
|
|
|
|
|
|
std::getline(is, to_inv, ' ');
|
|
|
|
|
|
|
|
std::getline(is, to_list, ' ');
|
|
|
|
|
|
|
|
std::getline(is, ts, ' ');
|
|
|
|
to_i = stoi(ts);
|
|
|
|
}
|
|
|
|
|
2011-10-16 18:03:45 -04:00
|
|
|
void IMoveAction::apply(InventoryContext *c, InventoryManager *mgr)
|
|
|
|
{
|
2011-04-04 08:13:19 -04:00
|
|
|
Inventory *inv_from = mgr->getInventory(c, from_inv);
|
|
|
|
Inventory *inv_to = mgr->getInventory(c, to_inv);
|
2011-10-16 18:03:45 -04:00
|
|
|
|
|
|
|
if(!inv_from){
|
|
|
|
infostream<<"IMoveAction::apply(): FAIL: source inventory not found: "
|
|
|
|
<<"context=["<<describeC(c)<<"], from_inv=\""<<from_inv<<"\""
|
|
|
|
<<", to_inv=\""<<to_inv<<"\""<<std::endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(!inv_to){
|
|
|
|
infostream<<"IMoveAction::apply(): FAIL: destination inventory not found: "
|
|
|
|
"context=["<<describeC(c)<<"], from_inv=\""<<from_inv<<"\""
|
|
|
|
<<", to_inv=\""<<to_inv<<"\""<<std::endl;
|
2011-04-04 08:13:19 -04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
InventoryList *list_from = inv_from->getList(from_list);
|
|
|
|
InventoryList *list_to = inv_to->getList(to_list);
|
|
|
|
|
2010-12-24 10:08:50 -05:00
|
|
|
/*
|
|
|
|
If a list doesn't exist or the source item doesn't exist
|
|
|
|
*/
|
2011-10-16 18:03:45 -04:00
|
|
|
if(!list_from){
|
|
|
|
infostream<<"IMoveAction::apply(): FAIL: source list not found: "
|
|
|
|
<<"context=["<<describeC(c)<<"], from_inv=\""<<from_inv<<"\""
|
|
|
|
<<", from_list=\""<<from_list<<"\""<<std::endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(!list_to){
|
|
|
|
infostream<<"IMoveAction::apply(): FAIL: destination list not found: "
|
|
|
|
<<"context=["<<describeC(c)<<"], to_inv=\""<<to_inv<<"\""
|
|
|
|
<<", to_list=\""<<to_list<<"\""<<std::endl;
|
2011-04-04 08:13:19 -04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(list_from->getItem(from_i) == NULL)
|
|
|
|
{
|
2011-10-16 18:03:45 -04:00
|
|
|
infostream<<"IMoveAction::apply(): FAIL: source item not found: "
|
|
|
|
<<"context=["<<describeC(c)<<"], from_inv=\""<<from_inv<<"\""
|
|
|
|
<<", from_list=\""<<from_list<<"\""
|
|
|
|
<<" from_i="<<from_i<<std::endl;
|
2011-04-04 08:13:19 -04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
If the source and the destination slots are the same
|
|
|
|
*/
|
|
|
|
if(inv_from == inv_to && list_from == list_to && from_i == to_i)
|
2010-12-22 09:30:23 -05:00
|
|
|
{
|
2011-10-16 18:03:45 -04:00
|
|
|
infostream<<"IMoveAction::apply(): FAIL: source and destination slots "
|
|
|
|
<<"are the same: inv=\""<<from_inv<<"\" list=\""<<from_list
|
|
|
|
<<"\" i="<<from_i<<std::endl;
|
2010-12-22 09:30:23 -05:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Take item from source list
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem *item1 = NULL;
|
|
|
|
if(count == 0)
|
|
|
|
item1 = list_from->changeItem(from_i, NULL);
|
|
|
|
else
|
|
|
|
item1 = list_from->takeItem(from_i, count);
|
|
|
|
|
2010-12-22 09:30:23 -05:00
|
|
|
// Try to add the item to destination list
|
2010-12-24 10:08:50 -05:00
|
|
|
InventoryItem *olditem = item1;
|
|
|
|
item1 = list_to->addItem(to_i, item1);
|
|
|
|
|
2011-04-04 08:13:19 -04:00
|
|
|
// If something is returned, the item was not fully added
|
|
|
|
if(item1 != NULL)
|
2010-12-24 10:08:50 -05:00
|
|
|
{
|
2011-04-04 08:13:19 -04:00
|
|
|
// If olditem is returned, nothing was added.
|
|
|
|
bool nothing_added = (item1 == olditem);
|
|
|
|
|
|
|
|
// If something else is returned, part of the item was left unadded.
|
|
|
|
// Add the other part back to the source item
|
|
|
|
list_from->addItem(from_i, item1);
|
|
|
|
|
|
|
|
// If olditem is returned, nothing was added.
|
|
|
|
// Swap the items
|
|
|
|
if(nothing_added)
|
|
|
|
{
|
|
|
|
// Take item from source list
|
|
|
|
item1 = list_from->changeItem(from_i, NULL);
|
|
|
|
// Adding was not possible, swap the items.
|
|
|
|
InventoryItem *item2 = list_to->changeItem(to_i, item1);
|
|
|
|
// Put item from destination list to the source list
|
|
|
|
list_from->changeItem(from_i, item2);
|
|
|
|
}
|
2010-12-22 09:30:23 -05:00
|
|
|
}
|
2011-04-04 08:13:19 -04:00
|
|
|
|
|
|
|
mgr->inventoryModified(c, from_inv);
|
|
|
|
if(from_inv != to_inv)
|
|
|
|
mgr->inventoryModified(c, to_inv);
|
2011-10-16 18:03:45 -04:00
|
|
|
|
|
|
|
infostream<<"IMoveAction::apply(): moved at "
|
|
|
|
<<"["<<describeC(c)<<"]"
|
|
|
|
<<" from inv=\""<<from_inv<<"\""
|
|
|
|
<<" list=\""<<from_list<<"\""
|
|
|
|
<<" i="<<from_i
|
|
|
|
<<" to inv=\""<<to_inv<<"\""
|
|
|
|
<<" list=\""<<to_list<<"\""
|
|
|
|
<<" i="<<to_i
|
|
|
|
<<std::endl;
|
2010-12-22 09:30:23 -05:00
|
|
|
}
|
2011-04-04 19:56:29 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
Craft checking system
|
|
|
|
*/
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
bool ItemSpec::checkItem(const InventoryItem *item) const
|
2011-04-04 19:56:29 -04:00
|
|
|
{
|
|
|
|
if(type == ITEM_NONE)
|
|
|
|
{
|
|
|
|
// Has to be no item
|
|
|
|
if(item != NULL)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// There should be an item
|
|
|
|
if(item == NULL)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
std::string itemname = item->getName();
|
|
|
|
|
|
|
|
if(type == ITEM_MATERIAL)
|
|
|
|
{
|
|
|
|
if(itemname != "MaterialItem")
|
|
|
|
return false;
|
|
|
|
MaterialItem *mitem = (MaterialItem*)item;
|
|
|
|
if(mitem->getMaterial() != num)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
else if(type == ITEM_CRAFT)
|
|
|
|
{
|
|
|
|
if(itemname != "CraftItem")
|
|
|
|
return false;
|
|
|
|
CraftItem *mitem = (CraftItem*)item;
|
|
|
|
if(mitem->getSubName() != name)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
else if(type == ITEM_TOOL)
|
|
|
|
{
|
|
|
|
// Not supported yet
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
else if(type == ITEM_MBO)
|
|
|
|
{
|
|
|
|
// Not supported yet
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Not supported yet
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-08-10 05:38:49 -04:00
|
|
|
bool checkItemCombination(InventoryItem const * const *items, const ItemSpec *specs)
|
2011-04-04 19:56:29 -04:00
|
|
|
{
|
|
|
|
u16 items_min_x = 100;
|
|
|
|
u16 items_max_x = 100;
|
|
|
|
u16 items_min_y = 100;
|
|
|
|
u16 items_max_y = 100;
|
|
|
|
for(u16 y=0; y<3; y++)
|
|
|
|
for(u16 x=0; x<3; x++)
|
|
|
|
{
|
|
|
|
if(items[y*3 + x] == NULL)
|
|
|
|
continue;
|
|
|
|
if(items_min_x == 100 || x < items_min_x)
|
|
|
|
items_min_x = x;
|
|
|
|
if(items_min_y == 100 || y < items_min_y)
|
|
|
|
items_min_y = y;
|
|
|
|
if(items_max_x == 100 || x > items_max_x)
|
|
|
|
items_max_x = x;
|
|
|
|
if(items_max_y == 100 || y > items_max_y)
|
|
|
|
items_max_y = y;
|
|
|
|
}
|
|
|
|
// No items at all, just return false
|
|
|
|
if(items_min_x == 100)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
u16 items_w = items_max_x - items_min_x + 1;
|
|
|
|
u16 items_h = items_max_y - items_min_y + 1;
|
|
|
|
|
|
|
|
u16 specs_min_x = 100;
|
|
|
|
u16 specs_max_x = 100;
|
|
|
|
u16 specs_min_y = 100;
|
|
|
|
u16 specs_max_y = 100;
|
|
|
|
for(u16 y=0; y<3; y++)
|
|
|
|
for(u16 x=0; x<3; x++)
|
|
|
|
{
|
|
|
|
if(specs[y*3 + x].type == ITEM_NONE)
|
|
|
|
continue;
|
|
|
|
if(specs_min_x == 100 || x < specs_min_x)
|
|
|
|
specs_min_x = x;
|
|
|
|
if(specs_min_y == 100 || y < specs_min_y)
|
|
|
|
specs_min_y = y;
|
|
|
|
if(specs_max_x == 100 || x > specs_max_x)
|
|
|
|
specs_max_x = x;
|
|
|
|
if(specs_max_y == 100 || y > specs_max_y)
|
|
|
|
specs_max_y = y;
|
|
|
|
}
|
|
|
|
// No specs at all, just return false
|
|
|
|
if(specs_min_x == 100)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
u16 specs_w = specs_max_x - specs_min_x + 1;
|
|
|
|
u16 specs_h = specs_max_y - specs_min_y + 1;
|
|
|
|
|
|
|
|
// Different sizes
|
|
|
|
if(items_w != specs_w || items_h != specs_h)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for(u16 y=0; y<specs_h; y++)
|
|
|
|
for(u16 x=0; x<specs_w; x++)
|
|
|
|
{
|
|
|
|
u16 items_x = items_min_x + x;
|
|
|
|
u16 items_y = items_min_y + y;
|
|
|
|
u16 specs_x = specs_min_x + x;
|
|
|
|
u16 specs_y = specs_min_y + y;
|
2011-08-10 05:38:49 -04:00
|
|
|
const InventoryItem *item = items[items_y * 3 + items_x];
|
|
|
|
const ItemSpec &spec = specs[specs_y * 3 + specs_x];
|
2011-04-04 19:56:29 -04:00
|
|
|
|
|
|
|
if(spec.checkItem(item) == false)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
2010-11-26 18:02:21 -05:00
|
|
|
|
|
|
|
//END
|