blob: b9fc38c49f953312ad4441e29d908e34b9bde448 (
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
|
#ifndef TMWA_GENERIC_INTERN_POOL_HPP
#define TMWA_GENERIC_INTERN_POOL_HPP
// intern-pool.hpp - Cached integer/string lookups.
//
// Copyright © 2013 Ben Longbons <b.r.longbons@gmail.com>
//
// This file is part of The Mana World (Athena server)
//
// This program 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 3 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
# include "fwd.hpp"
# include <cassert>
# include <map>
# include <vector>
# include "../strings/rstring.hpp"
# include "../strings/zstring.hpp"
# include "../strings/xstring.hpp"
class InternPool
{
std::map<RString, size_t> known;
std::vector<RString> names;
public:
size_t intern(XString name_)
{
// TODO just look up the XString, the memory should not move by now
RString name = name_;
// hm, I could change this to do aliases
auto pair = known.insert({name, known.size()});
if (pair.second)
names.push_back(name);
assert (known.size() == names.size());
return pair.first->second;
}
ZString outtern(size_t sz) const
{
assert (sz < names.size());
return names[sz];
}
size_t size() const
{
return known.size();
}
};
#endif // TMWA_GENERIC_INTERN_POOL_HPP
|
