X-Git-Url: https://git.lizzy.rs/?a=blobdiff_plain;f=src%2Fnodemetadata.cpp;h=2a9131be0b014c55a2cad19695f12bb414886f36;hb=2c637ce1c26145269b09c62afb451240a8def401;hp=fca4e5b845b14881d52d907022952f327755d87d;hpb=9e683fff50ba4fef407613adf8407b31adca4596;p=minetest.git diff --git a/src/nodemetadata.cpp b/src/nodemetadata.cpp index fca4e5b84..2a9131be0 100644 --- a/src/nodemetadata.cpp +++ b/src/nodemetadata.cpp @@ -1,232 +1,234 @@ /* -Minetest-c55 -Copyright (C) 2010-2011 celeron55, Perttu Ahola +Minetest +Copyright (C) 2010-2013 celeron55, Perttu Ahola 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 +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 General Public License for more details. +GNU Lesser General Public License for more details. -You should have received a copy of the GNU General Public License along +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. */ #include "nodemetadata.h" -#include "utility.h" -#include "mapnode.h" #include "exceptions.h" +#include "gamedef.h" +#include "inventory.h" +#include "log.h" +#include "util/serialize.h" +#include "constants.h" // MAP_BLOCKSIZE +#include /* NodeMetadata */ -core::map NodeMetadata::m_types; - -NodeMetadata::NodeMetadata() +NodeMetadata::NodeMetadata(IGameDef *gamedef): + m_stringvars(), + m_inventory(new Inventory(gamedef->idef())) { } NodeMetadata::~NodeMetadata() { + delete m_inventory; } -NodeMetadata* NodeMetadata::deSerialize(std::istream &is) +void NodeMetadata::serialize(std::ostream &os) const { - u8 buf[2]; - is.read((char*)buf, 2); - s16 id = readS16(buf); - - core::map::Node *n; - n = m_types.find(id); - if(n == NULL) - { - dstream<<"NodeMetadata(): No factory for typeId="<first); + os << serializeLongString(it->second); } - - Factory f = n->getValue(); - NodeMetadata *meta = (*f)(is); - return meta; + + m_inventory->serialize(os); } -void NodeMetadata::serialize(std::ostream &os) +void NodeMetadata::deSerialize(std::istream &is) { - u8 buf[2]; - writeU16(buf, typeId()); - os.write((char*)buf, 2); + m_stringvars.clear(); + int num_vars = readU32(is); + for(int i=0; ideSerialize(is); } -void NodeMetadata::registerType(u16 id, Factory f) +void NodeMetadata::clear() { - core::map::Node *n; - n = m_types.find(id); - if(n) - return; - m_types.insert(id, f); + m_stringvars.clear(); + m_inventory->clear(); } /* - SignNodeMetadata + NodeMetadataList */ -SignNodeMetadata::SignNodeMetadata(std::string text): - m_text(text) -{ - NodeMetadata::registerType(typeId(), create); -} -u16 SignNodeMetadata::typeId() const -{ - return CONTENT_SIGN_WALL; -} -NodeMetadata* SignNodeMetadata::create(std::istream &is) +void NodeMetadataList::serialize(std::ostream &os) const { - std::string text = deSerializeString(is); - return new SignNodeMetadata(text); -} -NodeMetadata* SignNodeMetadata::clone() -{ - return new SignNodeMetadata(m_text); -} -void SignNodeMetadata::serializeBody(std::ostream &os) -{ - os<::Iterator - i = m_data.getIterator(); - i.atEnd()==false; i++) + for(std::map::const_iterator + i = m_data.begin(); + i != m_data.end(); ++i) { - v3s16 p = i.getNode()->getKey(); - NodeMetadata *data = i.getNode()->getValue(); - + v3s16 p = i->first; + NodeMetadata *data = i->second; + u16 p16 = p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X; - writeU16(buf, p16); - os.write((char*)buf, 2); + writeU16(os, p16); data->serialize(os); } - } -void NodeMetadataList::deSerialize(std::istream &is) + +void NodeMetadataList::deSerialize(std::istream &is, IGameDef *gamedef) { - m_data.clear(); + clear(); + + u8 version = readU8(is); + + if(version == 0){ + // Nothing + return; + } + + if(version != 1){ + infostream<<__FUNCTION_NAME<<": version "<deSerialize(is); + m_data[p] = data; } } - + NodeMetadataList::~NodeMetadataList() { - for(core::map::Iterator - i = m_data.getIterator(); - i.atEnd()==false; i++) - { - delete i.getNode()->getValue(); - } + clear(); +} + +std::vector NodeMetadataList::getAllKeys() +{ + std::vector keys; + + std::map::const_iterator it; + for (it = m_data.begin(); it != m_data.end(); ++it) + keys.push_back(it->first); + + return keys; } -NodeMetadata* NodeMetadataList::get(v3s16 p) +NodeMetadata *NodeMetadataList::get(v3s16 p) { - core::map::Node *n; - n = m_data.find(p); - if(n == NULL) + std::map::const_iterator n = m_data.find(p); + if (n == m_data.end()) return NULL; - return n->getValue(); + return n->second; } void NodeMetadataList::remove(v3s16 p) { NodeMetadata *olddata = get(p); - if(olddata) - { + if (olddata) { delete olddata; - m_data.remove(p); + m_data.erase(p); } } void NodeMetadataList::set(v3s16 p, NodeMetadata *d) { remove(p); - m_data.insert(p, d); + m_data.insert(std::make_pair(p, d)); +} + +void NodeMetadataList::clear() +{ + std::map::iterator it; + for (it = m_data.begin(); it != m_data.end(); ++it) { + delete it->second; + } + m_data.clear(); +} + +std::string NodeMetadata::getString(const std::string &name, + unsigned short recursion) const +{ + StringMap::const_iterator it = m_stringvars.find(name); + if (it == m_stringvars.end()) + return ""; + + return resolveString(it->second, recursion); +} + +void NodeMetadata::setString(const std::string &name, const std::string &var) +{ + if (var.empty()) { + m_stringvars.erase(name); + } else { + m_stringvars[name] = var; + } +} + +std::string NodeMetadata::resolveString(const std::string &str, + unsigned short recursion) const +{ + if (recursion > 1) { + return str; + } + if (str.substr(0, 2) == "${" && str[str.length() - 1] == '}') { + return getString(str.substr(2, str.length() - 3), recursion + 1); + } + return str; }