2012-03-19 01:08:04 +01:00
|
|
|
/*
|
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>
|
2012-03-19 01:08:04 +01:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
2012-06-05 16:56:56 +02:00
|
|
|
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
|
2012-03-19 01:08:04 +01:00
|
|
|
(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
|
2012-06-05 16:56:56 +02:00
|
|
|
GNU Lesser General Public License for more details.
|
2012-03-19 01:08:04 +01:00
|
|
|
|
2012-06-05 16:56:56 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
2012-03-19 01:08:04 +01:00
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef NODETIMER_HEADER
|
|
|
|
#define NODETIMER_HEADER
|
|
|
|
|
2013-08-11 04:09:45 +02:00
|
|
|
#include "irr_v3d.h"
|
2012-03-19 01:08:04 +01:00
|
|
|
#include <iostream>
|
|
|
|
#include <map>
|
2016-03-21 12:58:52 +01:00
|
|
|
#include <vector>
|
2012-03-19 01:08:04 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
NodeTimer provides per-node timed callback functionality.
|
|
|
|
Can be used for:
|
|
|
|
- Furnaces, to keep the fire burnin'
|
|
|
|
- "activated" nodes that snap back to their original state
|
|
|
|
after a fixed amount of time (mesecons buttons, for example)
|
|
|
|
*/
|
|
|
|
|
|
|
|
class NodeTimer
|
|
|
|
{
|
|
|
|
public:
|
2017-06-18 19:55:15 +02:00
|
|
|
NodeTimer() {}
|
2016-03-21 12:58:52 +01:00
|
|
|
NodeTimer(const v3s16 &position_):
|
2017-06-18 19:55:15 +02:00
|
|
|
position(position_) {}
|
2016-03-21 12:58:52 +01:00
|
|
|
NodeTimer(f32 timeout_, f32 elapsed_, v3s16 position_):
|
|
|
|
timeout(timeout_), elapsed(elapsed_), position(position_) {}
|
2012-03-19 01:08:04 +01:00
|
|
|
~NodeTimer() {}
|
2017-06-18 19:55:15 +02:00
|
|
|
|
2012-03-19 01:08:04 +01:00
|
|
|
void serialize(std::ostream &os) const;
|
|
|
|
void deSerialize(std::istream &is);
|
2017-06-18 19:55:15 +02:00
|
|
|
|
|
|
|
f32 timeout = 0.0f;
|
|
|
|
f32 elapsed = 0.0f;
|
2016-03-21 12:58:52 +01:00
|
|
|
v3s16 position;
|
2012-03-19 01:08:04 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
List of timers of all the nodes of a block
|
|
|
|
*/
|
|
|
|
|
|
|
|
class NodeTimerList
|
|
|
|
{
|
|
|
|
public:
|
2017-06-18 19:55:15 +02:00
|
|
|
NodeTimerList() {}
|
2012-03-19 01:08:04 +01:00
|
|
|
~NodeTimerList() {}
|
2017-06-18 19:55:15 +02:00
|
|
|
|
2012-07-24 13:56:32 +02:00
|
|
|
void serialize(std::ostream &os, u8 map_format_version) const;
|
|
|
|
void deSerialize(std::istream &is, u8 map_format_version);
|
2017-06-18 19:55:15 +02:00
|
|
|
|
2012-03-19 01:08:04 +01:00
|
|
|
// Get timer
|
2016-03-21 12:58:52 +01:00
|
|
|
NodeTimer get(const v3s16 &p) {
|
|
|
|
std::map<v3s16, std::multimap<double, NodeTimer>::iterator>::iterator n =
|
|
|
|
m_iterators.find(p);
|
|
|
|
if (n == m_iterators.end())
|
2012-03-19 01:08:04 +01:00
|
|
|
return NodeTimer();
|
2016-03-21 12:58:52 +01:00
|
|
|
NodeTimer t = n->second->second;
|
|
|
|
t.elapsed = t.timeout - (n->second->first - m_time);
|
|
|
|
return t;
|
2012-03-19 01:08:04 +01:00
|
|
|
}
|
|
|
|
// Deletes timer
|
2016-03-21 12:58:52 +01:00
|
|
|
void remove(v3s16 p) {
|
|
|
|
std::map<v3s16, std::multimap<double, NodeTimer>::iterator>::iterator n =
|
|
|
|
m_iterators.find(p);
|
|
|
|
if(n != m_iterators.end()) {
|
|
|
|
double removed_time = n->second->first;
|
|
|
|
m_timers.erase(n->second);
|
|
|
|
m_iterators.erase(n);
|
|
|
|
// Yes, this is float equality, but it is not a problem
|
|
|
|
// since we only test equality of floats as an ordered type
|
|
|
|
// and thus we never lose precision
|
|
|
|
if (removed_time == m_next_trigger_time) {
|
|
|
|
if (m_timers.empty())
|
|
|
|
m_next_trigger_time = -1.;
|
|
|
|
else
|
|
|
|
m_next_trigger_time = m_timers.begin()->first;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Undefined behaviour if there already is a timer
|
|
|
|
void insert(NodeTimer timer) {
|
|
|
|
v3s16 p = timer.position;
|
|
|
|
double trigger_time = m_time + (double)(timer.timeout - timer.elapsed);
|
|
|
|
std::multimap<double, NodeTimer>::iterator it =
|
|
|
|
m_timers.insert(std::pair<double, NodeTimer>(
|
|
|
|
trigger_time, timer
|
|
|
|
));
|
|
|
|
m_iterators.insert(
|
|
|
|
std::pair<v3s16, std::multimap<double, NodeTimer>::iterator>(p, it));
|
|
|
|
if (m_next_trigger_time == -1. || trigger_time < m_next_trigger_time)
|
|
|
|
m_next_trigger_time = trigger_time;
|
2012-03-19 01:08:04 +01:00
|
|
|
}
|
|
|
|
// Deletes old timer and sets a new one
|
2016-03-21 12:58:52 +01:00
|
|
|
inline void set(const NodeTimer &timer) {
|
|
|
|
remove(timer.position);
|
|
|
|
insert(timer);
|
2012-03-19 01:08:04 +01:00
|
|
|
}
|
|
|
|
// Deletes all timers
|
2016-03-21 12:58:52 +01:00
|
|
|
void clear() {
|
|
|
|
m_timers.clear();
|
|
|
|
m_iterators.clear();
|
|
|
|
m_next_trigger_time = -1.;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline double getNextTriggerTime() {
|
|
|
|
return m_next_trigger_time;
|
2012-03-19 01:08:04 +01:00
|
|
|
}
|
|
|
|
|
2016-03-21 12:58:52 +01:00
|
|
|
// Move forward in time, returns elapsed timers
|
|
|
|
std::vector<NodeTimer> step(float dtime);
|
2012-03-19 01:08:04 +01:00
|
|
|
|
|
|
|
private:
|
2016-03-21 12:58:52 +01:00
|
|
|
std::multimap<double, NodeTimer> m_timers;
|
|
|
|
std::map<v3s16, std::multimap<double, NodeTimer>::iterator> m_iterators;
|
2017-06-18 19:55:15 +02:00
|
|
|
double m_next_trigger_time = -1.0;
|
|
|
|
double m_time = 0.0;
|
2012-03-19 01:08:04 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|