Improve route programming: - advtrains.git - Advtrains mod for minetest.

diff options

author	orwell96 <orwell@bleipb.de>	2018-10-07 22:21:49 +0200
committer	orwell96 <orwell@bleipb.de>	2018-10-07 22:21:49 +0200
commit	8df7bcf6b6ea6333b3df925af528e23574974d69 (patch)
tree	416d247272b6d6878b6e5024eca6965c21d81c22 /advtrains/models/advtrains_signal_60.b3d
parent	8e70c070c1be102a679ff3fd6f71669c883ec510 (diff)
download	advtrains-8df7bcf6b6ea6333b3df925af528e23574974d69.tar.gz advtrains-8df7bcf6b6ea6333b3df925af528e23574974d69.tar.bz2 advtrains-8df7bcf6b6ea6333b3df925af528e23574974d69.zip

Improve route programming:

- Formspec for TCBs instead of unhandy chatcommands - Ability to advance route over the next secction without punching end - Better visualization - Ability to route into dead-end sections

Diffstat (limited to 'advtrains/models/advtrains_signal_60.b3d')

0 files changed, 0 insertions, 0 deletions

/* Minetest-c55 Copyright (C) 2010-2012 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. */ #ifndef UTIL_CONTAINER_HEADER #define UTIL_CONTAINER_HEADER #include "../irrlichttypes.h" #include <jmutex.h> #include <jmutexautolock.h> #include "../porting.h" // For sleep_ms /* Queue with unique values with fast checking of value existence */ template<typename Value> class UniqueQueue { public: /* Does nothing if value is already queued. Return value: true: value added false: value already exists */ bool push_back(Value value) { // Check if already exists if(m_map.find(value) != NULL) return false; // Add m_map.insert(value, 0); m_list.push_back(value); return true; } Value pop_front() { typename core::list<Value>::Iterator i = m_list.begin(); Value value = *i; m_map.remove(value); m_list.erase(i); return value; } u32 size() { assert(m_list.size() == m_map.size()); return m_list.size(); } private: core::map<Value, u8> m_map; core::list<Value> m_list; }; #if 1 template<typename Key, typename Value> class MutexedMap { public: MutexedMap() { m_mutex.Init(); assert(m_mutex.IsInitialized()); } void set(const Key &name, const Value &value) { JMutexAutoLock lock(m_mutex); m_values[name] = value; } bool get(const Key &name, Value *result) { JMutexAutoLock lock(m_mutex); typename core::map<Key, Value>::Node *n; n = m_values.find(name); if(n == NULL) return false; if(result != NULL) *result = n->getValue(); return true; } private: core::map<Key, Value> m_values; JMutex m_mutex; }; #endif /* Generates ids for comparable values. Id=0 is reserved for "no value". Is fast at: - Returning value by id (very fast) - Returning id by value - Generating a new id for a value Is not able to: - Remove an id/value pair (is possible to implement but slow) */ template<typename T> class MutexedIdGenerator { public: MutexedIdGenerator() { m_mutex.Init(); assert(m_mutex.IsInitialized()); } // Returns true if found bool getValue(u32 id, T &value) { if(id == 0) return false; JMutexAutoLock lock(m_mutex); if(m_id_to_value.size() < id) return false; value = m_id_to_value[id-1]; return true; } // If id exists for value, returns the id. // Otherwise generates an id for the value. u32 getId(const T &value) { JMutexAutoLock lock(m_mutex); typename core::map<T, u32>::Node *n;


context:
space:
mode: