3 Copyright (C) 2010-2018 nerzhul, Loic BLOT <loic.blot@unix-experience.fr>
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.
22 #include <unordered_map>
23 #include "irrlichttypes.h"
25 class TestClientActiveObjectMgr;
26 class TestServerActiveObjectMgr;
31 friend class ::TestClientActiveObjectMgr;
32 friend class ::TestServerActiveObjectMgr;
35 virtual void step(float dtime, const std::function<void(T *)> &f) = 0;
36 virtual bool registerObject(T *obj) = 0;
37 virtual void removeObject(u16 id) = 0;
39 T *getActiveObject(u16 id)
41 typename std::unordered_map<u16, T *>::const_iterator n =
42 m_active_objects.find(id);
43 return (n != m_active_objects.end() ? n->second : nullptr);
49 // try to reuse id's as late as possible
50 static thread_local u16 last_used_id = 0;
51 u16 startid = last_used_id;
52 while (!isFreeId(++last_used_id)) {
53 if (last_used_id == startid)
60 bool isFreeId(u16 id) const
62 return id != 0 && m_active_objects.find(id) == m_active_objects.end();
65 std::unordered_map<u16, T *> m_active_objects;