aboutsummaryrefslogtreecommitdiff
path: root/advtrains_train_japan
diff options
context:
space:
mode:
authororwell96 <orwell@bleipb.de>2018-10-26 19:44:16 +0200
committerorwell96 <orwell@bleipb.de>2018-10-26 19:44:16 +0200
commitc1d5fb0e8ccc30e39919a910b30d5466a84a8464 (patch)
treefa3af1943faf7b0799b698b2dd2a7312fcdd62d0 /advtrains_train_japan
parent012c01fcc71bcc0b41617af59a9cae9dcfa467ec (diff)
downloadadvtrains-c1d5fb0e8ccc30e39919a910b30d5466a84a8464.tar.gz
advtrains-c1d5fb0e8ccc30e39919a910b30d5466a84a8464.tar.bz2
advtrains-c1d5fb0e8ccc30e39919a910b30d5466a84a8464.zip
Add Interlocking Tool to inspect route locks
Diffstat (limited to 'advtrains_train_japan')
0 files changed, 0 insertions, 0 deletions
generated by cgit v1.2.3 (git 2.39.1) at 2025-01-31 16:50:39 +0000
is 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. */ /* Dummy database class */ #include "database-dummy.h" #include "remoteplayer.h" bool Database_Dummy::saveBlock(const v3s16 &pos, const std::string &data) { m_database[getBlockAsInteger(pos)] = data; return true; } void Database_Dummy::loadBlock(const v3s16 &pos, std::string *block) { s64 i = getBlockAsInteger(pos); auto it = m_database.find(i); if (it == m_database.end()) { *block = ""; return; } *block = it->second; } bool Database_Dummy::deleteBlock(const v3s16 &pos) { m_database.erase(getBlockAsInteger(pos)); return true; } void Database_Dummy::listAllLoadableBlocks(std::vector<v3s16> &dst) { dst.reserve(m_database.size()); for (std::map<s64, std::string>::const_iterator x = m_database.begin(); x != m_database.end(); ++x) { dst.push_back(getIntegerAsBlock(x->first)); } } void Database_Dummy::savePlayer(RemotePlayer *player) { m_player_database.insert(player->getName()); } bool Database_Dummy::loadPlayer(RemotePlayer *player, PlayerSAO *sao) { return m_player_database.find(player->getName()) != m_player_database.end(); } bool Database_Dummy::removePlayer(const std::string &name) { m_player_database.erase(name); return true; } void Database_Dummy::listPlayers(std::vector<std::string> &res) { for (const auto &player : m_player_database) { res.emplace_back(player); } } bool Database_Dummy::getModEntries(const std::string &modname, StringMap *storage) { const auto mod_pair = m_mod_meta_database.find(modname); if (mod_pair != m_mod_meta_database.cend()) { for (const auto &pair : mod_pair->second) { (*storage)[pair.first] = pair.second; } } return true; } bool Database_Dummy::setModEntry(const std::string &modname, const std::string &key, const std::string &value) { auto mod_pair = m_mod_meta_database.find(modname); if (mod_pair == m_mod_meta_database.end()) { m_mod_meta_database[modname] = StringMap({{key, value}}); } else { mod_pair->second[key] = value; } return true; } bool Database_Dummy::removeModEntry(const std::string &modname, const std::string &key) { auto mod_pair = m_mod_meta_database.find(modname); if (mod_pair != m_mod_meta_database.end()) return mod_pair->second.erase(key) > 0; return false; } void Database_Dummy::listMods(std::vector<std::string> *res) { for (const auto &pair : m_mod_meta_database) { res->push_back(pair.first); } }