minetest/src/inventory.cpp

981 lines
19 KiB
C++
Raw Normal View History

/*
2013-02-24 18:40:43 +01:00
Minetest
2013-02-24 19:38:45 +01:00
Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser 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-27 00:02:21 +01:00
#include "inventory.h"
#include "serialization.h"
#include "debug.h"
#include <sstream>
2011-10-17 00:03:45 +02:00
#include "log.h"
#include "itemdef.h"
#include "strfnd.h"
#include "content_mapnode.h" // For loading legacy MaterialItems
#include "nameidmapping.h" // For loading legacy MaterialItems
#include "util/serialize.h"
#include "util/string.h"
2010-11-27 00:02:21 +01:00
/*
ItemStack
2010-11-27 00:02:21 +01:00
*/
static content_t content_translate_from_19_to_internal(content_t c_from)
2010-11-27 00:02:21 +01:00
{
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;
2010-11-27 00:02:21 +01:00
}
// If the string contains spaces, quotes or control characters, encodes as JSON.
// Else returns the string unmodified.
static std::string serializeJsonStringIfNeeded(const std::string &s)
2010-11-27 00:02:21 +01:00
{
for(size_t i = 0; i < s.size(); ++i)
{
if(s[i] <= 0x1f || s[i] >= 0x7f || s[i] == ' ' || s[i] == '\"')
return serializeJsonString(s);
}
return s;
2010-11-27 00:02:21 +01:00
}
// Parses a string serialized by serializeJsonStringIfNeeded.
static std::string deSerializeJsonStringIfNeeded(std::istream &is)
{
std::ostringstream tmp_os;
bool expect_initial_quote = true;
bool is_json = false;
bool was_backslash = false;
for(;;)
{
char c = is.get();
if(is.eof())
break;
if(expect_initial_quote && c == '"')
{
tmp_os << c;
is_json = true;
}
else if(is_json)
{
tmp_os << c;
if(was_backslash)
was_backslash = false;
else if(c == '\\')
was_backslash = true;
else if(c == '"')
break; // Found end of string
}
else
{
if(c == ' ')
{
// Found end of word
is.unget();
break;
}
else
{
tmp_os << c;
}
}
expect_initial_quote = false;
}
if(is_json)
{
std::istringstream tmp_is(tmp_os.str(), std::ios::binary);
return deSerializeJsonString(tmp_is);
}
else
return tmp_os.str();
}
ItemStack::ItemStack(std::string name_, u16 count_,
u16 wear_, std::string metadata_,
IItemDefManager *itemdef)
{
name = itemdef->getAlias(name_);
count = count_;
wear = wear_;
metadata = metadata_;
if(name.empty() || count == 0)
clear();
else if(itemdef->get(name).type == ITEM_TOOL)
count = 1;
}
void ItemStack::serialize(std::ostream &os) const
2010-11-27 00:02:21 +01:00
{
DSTACK(__FUNCTION_NAME);
if(empty())
return;
// Check how many parts of the itemstring are needed
int parts = 1;
if(count != 1)
parts = 2;
if(wear != 0)
parts = 3;
if(metadata != "")
parts = 4;
os<<serializeJsonStringIfNeeded(name);
if(parts >= 2)
os<<" "<<count;
if(parts >= 3)
os<<" "<<wear;
if(parts >= 4)
os<<" "<<serializeJsonStringIfNeeded(metadata);
}
void ItemStack::deSerialize(std::istream &is, IItemDefManager *itemdef)
{
DSTACK(__FUNCTION_NAME);
clear();
2010-11-27 00:02:21 +01:00
// Read name
name = deSerializeJsonStringIfNeeded(is);
// Skip space
std::string tmp;
std::getline(is, tmp, ' ');
if(!tmp.empty())
throw SerializationError("Unexpected text after item name");
2010-11-27 00:02:21 +01:00
if(name == "MaterialItem")
{
// Obsoleted on 2011-07-30
u16 material;
is>>material;
u16 materialcount;
is>>materialcount;
// Convert old materials
if(material <= 0xff)
material = content_translate_from_19_to_internal(material);
if(material > MAX_CONTENT)
throw SerializationError("Too large material number");
// Convert old id to name
NameIdMapping legacy_nimap;
content_mapnode_get_name_id_mapping(&legacy_nimap);
legacy_nimap.getName(material, name);
if(name == "")
name = "unknown_block";
name = itemdef->getAlias(name);
count = materialcount;
}
else if(name == "MaterialItem2")
{
// Obsoleted on 2011-11-16
2010-11-27 00:02:21 +01:00
u16 material;
is>>material;
u16 materialcount;
is>>materialcount;
2011-07-23 15:55:26 +02:00
if(material > MAX_CONTENT)
2010-11-27 00:02:21 +01:00
throw SerializationError("Too large material number");
// Convert old id to name
NameIdMapping legacy_nimap;
content_mapnode_get_name_id_mapping(&legacy_nimap);
legacy_nimap.getName(material, name);
if(name == "")
name = "unknown_block";
name = itemdef->getAlias(name);
count = materialcount;
2010-11-27 00:02:21 +01:00
}
else if(name == "node" || name == "NodeItem" || name == "MaterialItem3"
|| name == "craft" || name == "CraftItem")
{
// Obsoleted on 2012-01-07
std::string all;
std::getline(is, all, '\n');
2011-11-16 21:47:37 +01:00
// First attempt to read inside ""
Strfnd fnd(all);
fnd.next("\"");
2011-11-16 21:47:37 +01:00
// If didn't skip to end, we have ""s
if(!fnd.atend()){
name = fnd.next("\"");
2011-11-16 21:47:37 +01:00
} else { // No luck, just read a word then
fnd.start(all);
name = fnd.next(" ");
2011-11-16 21:47:37 +01:00
}
fnd.skip_over(" ");
name = itemdef->getAlias(name);
count = stoi(trim(fnd.next("")));
2011-11-30 23:04:21 +01:00
if(count == 0)
count = 1;
}
2010-11-27 00:02:21 +01:00
else if(name == "MBOItem")
{
// Obsoleted on 2011-10-14
2011-10-15 01:28:57 +02:00
throw SerializationError("MBOItem not supported anymore");
2010-11-27 00:02:21 +01:00
}
else if(name == "tool" || name == "ToolItem")
2010-12-24 02:08:05 +01:00
{
// Obsoleted on 2012-01-07
2011-11-16 21:47:37 +01:00
std::string all;
std::getline(is, all, '\n');
// First attempt to read inside ""
Strfnd fnd(all);
fnd.next("\"");
// If didn't skip to end, we have ""s
if(!fnd.atend()){
name = fnd.next("\"");
2011-11-16 21:47:37 +01:00
} else { // No luck, just read a word then
fnd.start(all);
name = fnd.next(" ");
2011-11-16 21:47:37 +01:00
}
count = 1;
2011-11-16 21:47:37 +01:00
// Then read wear
fnd.skip_over(" ");
2012-01-22 15:13:00 +01:00
name = itemdef->getAlias(name);
wear = stoi(trim(fnd.next("")));
2010-12-24 02:08:05 +01:00
}
2010-11-27 00:02:21 +01:00
else
{
do // This loop is just to allow "break;"
{
// The real thing
// Apply item aliases
name = itemdef->getAlias(name);
// Read the count
std::string count_str;
std::getline(is, count_str, ' ');
if(count_str.empty())
{
count = 1;
break;
}
else
count = stoi(count_str);
2011-11-13 15:38:14 +01:00
// Read the wear
std::string wear_str;
std::getline(is, wear_str, ' ');
if(wear_str.empty())
break;
else
wear = stoi(wear_str);
// Read metadata
metadata = deSerializeJsonStringIfNeeded(is);
// In case fields are added after metadata, skip space here:
//std::getline(is, tmp, ' ');
//if(!tmp.empty())
// throw SerializationError("Unexpected text after metadata");
} while(false);
}
2011-04-19 16:09:45 +02:00
if(name.empty() || count == 0)
clear();
else if(itemdef->get(name).type == ITEM_TOOL)
count = 1;
}
void ItemStack::deSerialize(const std::string &str, IItemDefManager *itemdef)
{
std::istringstream is(str, std::ios::binary);
deSerialize(is, itemdef);
2011-04-05 09:59:48 +02:00
}
std::string ItemStack::getItemString() const
{
// Get item string
std::ostringstream os(std::ios::binary);
serialize(os);
return os.str();
}
ItemStack ItemStack::addItem(const ItemStack &newitem_,
IItemDefManager *itemdef)
{
ItemStack newitem = newitem_;
2011-11-29 16:15:18 +01:00
// If the item is empty or the position invalid, bail out
if(newitem.empty())
{
// nothing can be added trivially
}
// If this is an empty item, it's an easy job.
else if(empty())
{
*this = newitem;
newitem.clear();
}
// If item name differs, bail out
else if(name != newitem.name)
{
// cannot be added
}
// If the item fits fully, add counter and delete it
else if(newitem.count <= freeSpace(itemdef))
{
add(newitem.count);
newitem.clear();
}
// Else the item does not fit fully. Add all that fits and return
// the rest.
else
{
u16 freespace = freeSpace(itemdef);
add(freespace);
newitem.remove(freespace);
}
2011-11-29 16:15:18 +01:00
return newitem;
}
bool ItemStack::itemFits(const ItemStack &newitem_,
ItemStack *restitem,
IItemDefManager *itemdef) const
{
ItemStack newitem = newitem_;
2011-11-29 16:15:18 +01:00
// If the item is empty or the position invalid, bail out
if(newitem.empty())
2011-11-29 16:15:18 +01:00
{
// nothing can be added trivially
2011-11-29 16:15:18 +01:00
}
// If this is an empty item, it's an easy job.
else if(empty())
2011-11-29 16:15:18 +01:00
{
newitem.clear();
2011-11-29 16:15:18 +01:00
}
// If item name differs, bail out
else if(name != newitem.name)
2011-11-29 16:15:18 +01:00
{
// cannot be added
2011-11-29 16:15:18 +01:00
}
// If the item fits fully, delete it
else if(newitem.count <= freeSpace(itemdef))
{
newitem.clear();
}
// Else the item does not fit fully. Return the rest.
// the rest.
2011-11-29 16:15:18 +01:00
else
{
u16 freespace = freeSpace(itemdef);
newitem.remove(freespace);
2011-11-29 16:15:18 +01:00
}
if(restitem)
*restitem = newitem;
return newitem.empty();
2011-11-29 16:15:18 +01:00
}
ItemStack ItemStack::takeItem(u32 takecount)
2011-11-29 16:15:18 +01:00
{
if(takecount == 0 || count == 0)
return ItemStack();
2011-11-29 16:15:18 +01:00
ItemStack result = *this;
if(takecount >= count)
2011-11-29 16:15:18 +01:00
{
// Take all
clear();
2011-11-29 16:15:18 +01:00
}
else
{
// Take part
remove(takecount);
result.count = takecount;
2011-11-29 16:15:18 +01:00
}
return result;
}
ItemStack ItemStack::peekItem(u32 peekcount) const
{
if(peekcount == 0 || count == 0)
return ItemStack();
ItemStack result = *this;
if(peekcount < count)
result.count = peekcount;
return result;
}
2010-11-27 00:02:21 +01:00
/*
Inventory
*/
InventoryList::InventoryList(std::string name, u32 size, IItemDefManager *itemdef)
2010-11-27 00:02:21 +01:00
{
2010-12-22 10:29:06 +01:00
m_name = name;
2010-11-27 00:02:21 +01:00
m_size = size;
m_width = 0;
m_itemdef = itemdef;
2010-11-27 00:02:21 +01:00
clearItems();
//m_dirty = false;
2010-11-27 00:02:21 +01:00
}
2010-12-22 10:29:06 +01:00
InventoryList::~InventoryList()
2010-11-27 00:02:21 +01:00
{
}
2010-12-22 10:29:06 +01:00
void InventoryList::clearItems()
2010-11-27 00:02:21 +01:00
{
m_items.clear();
2010-12-22 10:29:06 +01:00
2010-11-27 00:02:21 +01:00
for(u32 i=0; i<m_size; i++)
{
m_items.push_back(ItemStack());
2010-11-27 00:02:21 +01:00
}
//setDirty(true);
2010-11-27 00:02:21 +01:00
}
void InventoryList::setSize(u32 newsize)
{
if(newsize != m_items.size())
m_items.resize(newsize);
m_size = newsize;
}
void InventoryList::setWidth(u32 newwidth)
{
m_width = newwidth;
}
2012-06-02 23:32:49 +02:00
void InventoryList::setName(const std::string &name)
{
m_name = name;
}
2011-08-10 23:22:44 +02:00
void InventoryList::serialize(std::ostream &os) const
2010-11-27 00:02:21 +01:00
{
//os.imbue(std::locale("C"));
os<<"Width "<<m_width<<"\n";
2010-11-27 00:02:21 +01:00
for(u32 i=0; i<m_items.size(); i++)
{
const ItemStack &item = m_items[i];
if(item.empty())
2010-11-27 00:02:21 +01:00
{
os<<"Empty";
2010-11-27 00:02:21 +01:00
}
else
{
os<<"Item ";
item.serialize(os);
2010-11-27 00:02:21 +01:00
}
os<<"\n";
}
os<<"EndInventoryList\n";
2010-11-27 00:02:21 +01:00
}
void InventoryList::deSerialize(std::istream &is)
2010-11-27 00:02:21 +01:00
{
//is.imbue(std::locale("C"));
clearItems();
u32 item_i = 0;
m_width = 0;
2010-11-27 00:02:21 +01:00
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, ' ');
if(name == "EndInventoryList")
2010-11-27 00:02:21 +01:00
{
break;
}
// This is a temporary backwards compatibility fix
else if(name == "end")
{
break;
}
else if(name == "Width")
{
iss >> m_width;
if (iss.fail())
throw SerializationError("incorrect width property");
}
2010-11-27 00:02:21 +01:00
else if(name == "Item")
{
if(item_i > getSize() - 1)
throw SerializationError("too many items");
ItemStack item;
item.deSerialize(iss, m_itemdef);
2010-11-27 00:02:21 +01:00
m_items[item_i++] = item;
}
else if(name == "Empty")
{
if(item_i > getSize() - 1)
throw SerializationError("too many items");
m_items[item_i++].clear();
2010-11-27 00:02:21 +01:00
}
}
}
2010-12-22 10:29:06 +01:00
InventoryList::InventoryList(const InventoryList &other)
{
*this = other;
}
InventoryList & InventoryList::operator = (const InventoryList &other)
2010-11-27 00:02:21 +01:00
{
m_items = other.m_items;
2010-11-27 00:02:21 +01:00
m_size = other.m_size;
m_width = other.m_width;
m_name = other.m_name;
m_itemdef = other.m_itemdef;
//setDirty(true);
2010-11-27 00:02:21 +01:00
return *this;
}
2011-08-10 11:38:49 +02:00
const std::string &InventoryList::getName() const
2010-12-22 10:29:06 +01:00
{
return m_name;
}
u32 InventoryList::getSize() const
2010-11-27 00:02:21 +01:00
{
return m_items.size();
}
u32 InventoryList::getWidth() const
{
return m_width;
}
u32 InventoryList::getUsedSlots() const
2010-11-27 00:02:21 +01:00
{
u32 num = 0;
for(u32 i=0; i<m_items.size(); i++)
{
if(!m_items[i].empty())
2010-11-27 00:02:21 +01:00
num++;
}
return num;
}
u32 InventoryList::getFreeSlots() const
2011-04-05 09:59:48 +02:00
{
return getSize() - getUsedSlots();
}
const ItemStack& InventoryList::getItem(u32 i) const
2011-08-10 11:38:49 +02:00
{
assert(i < m_size);
2011-08-10 11:38:49 +02:00
return m_items[i];
}
ItemStack& InventoryList::getItem(u32 i)
2010-11-27 00:02:21 +01:00
{
assert(i < m_size);
2010-11-27 00:02:21 +01:00
return m_items[i];
}
ItemStack InventoryList::changeItem(u32 i, const ItemStack &newitem)
2010-11-27 00:02:21 +01:00
{
2011-11-28 13:55:24 +01:00
if(i >= m_items.size())
return newitem;
2010-11-27 00:02:21 +01:00
ItemStack olditem = m_items[i];
2010-11-27 00:02:21 +01:00
m_items[i] = newitem;
//setDirty(true);
2010-11-27 00:02:21 +01:00
return olditem;
}
2010-12-22 10:29:06 +01:00
void InventoryList::deleteItem(u32 i)
2010-11-27 00:02:21 +01:00
{
assert(i < m_items.size());
m_items[i].clear();
2010-11-27 00:02:21 +01:00
}
ItemStack InventoryList::addItem(const ItemStack &newitem_)
2010-11-27 00:02:21 +01:00
{
ItemStack newitem = newitem_;
if(newitem.empty())
return newitem;
/*
First try to find if it could be added to some existing items
*/
for(u32 i=0; i<m_items.size(); i++)
2010-11-27 00:02:21 +01:00
{
// Ignore empty slots
if(m_items[i].empty())
continue;
// Try adding
newitem = addItem(i, newitem);
if(newitem.empty())
return newitem; // All was eaten
2010-11-27 00:02:21 +01:00
}
/*
Then try to add it to empty slots
*/
2010-11-27 00:02:21 +01:00
for(u32 i=0; i<m_items.size(); i++)
{
// Ignore unempty slots
if(!m_items[i].empty())
2010-11-27 00:02:21 +01:00
continue;
// Try adding
newitem = addItem(i, newitem);
if(newitem.empty())
return newitem; // All was eaten
2010-11-27 00:02:21 +01:00
}
// Return leftover
return newitem;
2010-11-27 00:02:21 +01:00
}
ItemStack InventoryList::addItem(u32 i, const ItemStack &newitem)
2010-12-22 15:30:23 +01:00
{
2011-11-28 13:55:24 +01:00
if(i >= m_items.size())
return newitem;
ItemStack leftover = m_items[i].addItem(newitem, m_itemdef);
//if(leftover != newitem)
// setDirty(true);
return leftover;
}
2010-12-22 15:30:23 +01:00
bool InventoryList::itemFits(const u32 i, const ItemStack &newitem,
ItemStack *restitem) const
2011-04-05 01:56:29 +02:00
{
if(i >= m_items.size())
2011-04-05 01:56:29 +02:00
{
if(restitem)
*restitem = newitem;
2011-04-05 01:56:29 +02:00
return false;
}
return m_items[i].itemFits(newitem, restitem, m_itemdef);
2011-04-05 01:56:29 +02:00
}
bool InventoryList::roomForItem(const ItemStack &item_) const
{
ItemStack item = item_;
ItemStack leftover;
for(u32 i=0; i<m_items.size(); i++)
{
if(itemFits(i, item, &leftover))
return true;
item = leftover;
}
return false;
}
bool InventoryList::containsItem(const ItemStack &item) const
{
u32 count = item.count;
if(count == 0)
return true;
for(std::vector<ItemStack>::const_reverse_iterator
i = m_items.rbegin();
i != m_items.rend(); i++)
{
if(count == 0)
break;
if(i->name == item.name)
{
if(i->count >= count)
return true;
else
count -= i->count;
}
2010-12-22 15:30:23 +01:00
}
return false;
}
ItemStack InventoryList::removeItem(const ItemStack &item)
2010-12-22 15:30:23 +01:00
{
ItemStack removed;
for(std::vector<ItemStack>::reverse_iterator
i = m_items.rbegin();
i != m_items.rend(); i++)
2010-12-22 15:30:23 +01:00
{
if(i->name == item.name)
{
u32 still_to_remove = item.count - removed.count;
removed.addItem(i->takeItem(still_to_remove), m_itemdef);
if(removed.count == item.count)
break;
}
2010-12-22 15:30:23 +01:00
}
return removed;
2010-12-22 15:30:23 +01:00
}
ItemStack InventoryList::takeItem(u32 i, u32 takecount)
2010-11-27 00:02:21 +01:00
{
if(i >= m_items.size())
return ItemStack();
ItemStack taken = m_items[i].takeItem(takecount);
//if(!taken.empty())
// setDirty(true);
return taken;
}
ItemStack InventoryList::peekItem(u32 i, u32 peekcount) const
{
if(i >= m_items.size())
return ItemStack();
return m_items[i].peekItem(peekcount);
2010-11-27 00:02:21 +01:00
}
2010-12-22 10:29:06 +01:00
void InventoryList::moveItem(u32 i, InventoryList *dest, u32 dest_i, u32 count)
{
if(this == dest && i == dest_i)
return;
// Take item from source list
ItemStack item1;
if(count == 0)
item1 = changeItem(i, ItemStack());
else
item1 = takeItem(i, count);
if(item1.empty())
return;
// Try to add the item to destination list
u32 oldcount = item1.count;
item1 = dest->addItem(dest_i, item1);
// If something is returned, the item was not fully added
if(!item1.empty())
{
// If olditem is returned, nothing was added.
bool nothing_added = (item1.count == oldcount);
// If something else is returned, part of the item was left unadded.
// Add the other part back to the source item
addItem(i, item1);
// If olditem is returned, nothing was added.
// Swap the items
if(nothing_added)
{
// Take item from source list
item1 = changeItem(i, ItemStack());
// Adding was not possible, swap the items.
ItemStack item2 = dest->changeItem(dest_i, item1);
// Put item from destination list to the source list
changeItem(i, item2);
}
}
}
2010-12-22 10:29:06 +01:00
/*
Inventory
*/
Inventory::~Inventory()
{
clear();
}
void Inventory::clear()
{
for(u32 i=0; i<m_lists.size(); i++)
{
delete m_lists[i];
}
m_lists.clear();
}
void Inventory::clearContents()
{
for(u32 i=0; i<m_lists.size(); i++)
{
InventoryList *list = m_lists[i];
for(u32 j=0; j<list->getSize(); j++)
{
list->deleteItem(j);
}
}
}
Inventory::Inventory(IItemDefManager *itemdef)
2010-12-22 10:29:06 +01:00
{
m_itemdef = itemdef;
2010-12-22 10:29:06 +01:00
}
Inventory::Inventory(const Inventory &other)
{
*this = other;
}
Inventory & Inventory::operator = (const Inventory &other)
{
// Gracefully handle self assignment
if(this != &other)
2010-12-22 10:29:06 +01:00
{
clear();
m_itemdef = other.m_itemdef;
for(u32 i=0; i<other.m_lists.size(); i++)
{
m_lists.push_back(new InventoryList(*other.m_lists[i]));
}
2010-12-22 10:29:06 +01:00
}
return *this;
}
2011-08-10 23:22:44 +02:00
void Inventory::serialize(std::ostream &os) const
2010-12-22 10:29:06 +01: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);
}
os<<"EndInventory\n";
2010-12-22 10:29:06 +01:00
}
void Inventory::deSerialize(std::istream &is)
2010-12-22 10:29:06 +01:00
{
clear();
for(;;)
{
std::string line;
std::getline(is, line, '\n');
std::istringstream iss(line);
std::string name;
std::getline(iss, name, ' ');
if(name == "EndInventory")
2010-12-22 10:29:06 +01:00
{
break;
}
// This is a temporary backwards compatibility fix
else if(name == "end")
{
break;
}
2010-12-22 10:29:06 +01:00
else if(name == "List")
{
std::string listname;
u32 listsize;
std::getline(iss, listname, ' ');
iss>>listsize;
InventoryList *list = new InventoryList(listname, listsize, m_itemdef);
list->deSerialize(is);
2010-12-22 10:29:06 +01:00
m_lists.push_back(list);
}
else
{
throw SerializationError("invalid inventory specifier");
}
2010-12-22 10:29:06 +01:00
}
}
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, m_itemdef);
2010-12-22 10:29:06 +01:00
}
return m_lists[i];
}
else
{
InventoryList *list = new InventoryList(name, size, m_itemdef);
m_lists.push_back(list);
return list;
2010-12-22 10:29:06 +01:00
}
}
InventoryList * Inventory::getList(const std::string &name)
{
s32 i = getListIndex(name);
if(i == -1)
return NULL;
return m_lists[i];
}
std::vector<const InventoryList*> Inventory::getLists()
{
std::vector<const InventoryList*> lists;
for(u32 i=0; i<m_lists.size(); i++)
{
InventoryList *list = m_lists[i];
lists.push_back(list);
}
return lists;
}
2011-11-28 13:55:24 +01:00
bool Inventory::deleteList(const std::string &name)
{
s32 i = getListIndex(name);
if(i == -1)
return false;
delete m_lists[i];
m_lists.erase(m_lists.begin() + i);
2011-11-28 13:55:24 +01:00
return true;
}
2011-08-10 11:38:49 +02: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 10:29:06 +01:00
{
for(u32 i=0; i<m_lists.size(); i++)
{
if(m_lists[i]->getName() == name)
return i;
}
return -1;
}
2010-11-27 00:02:21 +01:00
//END