3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 #include "nodetimer.h"
22 #include "serialization.h"
23 #include "util/serialize.h"
24 #include "constants.h" // MAP_BLOCKSIZE
30 void NodeTimer::serialize(std::ostream &os) const
32 writeF1000(os, timeout);
33 writeF1000(os, elapsed);
36 void NodeTimer::deSerialize(std::istream &is)
38 timeout = readF1000(is);
39 elapsed = readF1000(is);
46 void NodeTimerList::serialize(std::ostream &os, u8 map_format_version) const
48 if(map_format_version == 24){
49 // Version 0 is a placeholder for "nothing to see here; go away."
51 writeU8(os, 0); // version
54 writeU8(os, 1); // version
55 writeU16(os, m_data.size());
58 if(map_format_version >= 25){
60 writeU16(os, m_data.size());
63 for(std::map<v3s16, NodeTimer>::const_iterator
65 i != m_data.end(); i++){
67 NodeTimer t = i->second;
69 u16 p16 = p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X;
75 void NodeTimerList::deSerialize(std::istream &is, u8 map_format_version)
79 if(map_format_version == 24){
80 u8 timer_version = readU8(is);
81 if(timer_version == 0)
83 if(timer_version != 1)
84 throw SerializationError("unsupported NodeTimerList version");
87 if(map_format_version >= 25){
88 u8 timer_data_len = readU8(is);
89 if(timer_data_len != 2+4+4)
90 throw SerializationError("unsupported NodeTimer data length");
93 u16 count = readU16(is);
95 for(u16 i=0; i<count; i++)
97 u16 p16 = readU16(is);
100 p.Z = p16 / MAP_BLOCKSIZE / MAP_BLOCKSIZE;
101 p16 &= MAP_BLOCKSIZE * MAP_BLOCKSIZE - 1;
102 p.Y = p16 / MAP_BLOCKSIZE;
103 p16 &= MAP_BLOCKSIZE - 1;
111 infostream<<"WARNING: NodeTimerList::deSerialize(): "
112 <<"invalid data at position"
113 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<"): Ignoring."
118 if(m_data.find(p) != m_data.end())
120 infostream<<"WARNING: NodeTimerList::deSerialize(): "
121 <<"already set data at position"
122 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<"): Ignoring."
127 m_data.insert(std::make_pair(p, t));
131 std::map<v3s16, NodeTimer> NodeTimerList::step(float dtime)
133 std::map<v3s16, NodeTimer> elapsed_timers;
135 for(std::map<v3s16, NodeTimer>::iterator
137 i != m_data.end(); i++){
139 NodeTimer t = i->second;
141 if(t.elapsed >= t.timeout)
142 elapsed_timers.insert(std::make_pair(p, t));
146 // Delete elapsed timers
147 for(std::map<v3s16, NodeTimer>::const_iterator
148 i = elapsed_timers.begin();
149 i != elapsed_timers.end(); i++){
153 return elapsed_timers;