blob: 2b60697597a05bc570bf73da5488d6759b7f0412 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* The Mana Server
* Copyright (C) 2013 The Mana Developers
*
* This file is part of The Mana Server.
*
* The Mana Server is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* any later version.
*
* The Mana Server 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with The Mana Server. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef IDMANAGER_H
#define IDMANAGER_H
#include <unordered_map>
/**
* A very simplistic ID manager.
*
* Does not have any error handling on the premise that other problems will
* occur before hitting UINT_MAX allocated IDs.
*/
template <typename Value>
class IdManager
{
public:
IdManager() : mLastId(0) {}
IdManager(const IdManager&) = delete;
unsigned allocate(Value *t);
void free(unsigned id);
Value *find(unsigned id) const;
private:
std::unordered_map<unsigned, Value*> mIdMap;
unsigned mLastId;
};
template <typename Value>
inline unsigned IdManager<Value>::allocate(Value *t)
{
do {
++mLastId;
} while (mIdMap.find(mLastId) != mIdMap.end());
mIdMap.emplace(mLastId, t);
return mLastId;
}
template <typename Value>
inline void IdManager<Value>::free(unsigned id)
{
mIdMap.erase(id);
}
template <typename Value>
inline Value *IdManager<Value>::find(unsigned id) const
{
auto it = mIdMap.find(id);
return it != mIdMap.end() ? it->second : nullptr;
}
#endif // IDMANAGER_H
|
