/
entity_map.h
72 lines (56 loc) · 2.3 KB
/
entity_map.h
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
/* Copyright (C) 2013-2014 Michal Brzozowski (rusolis@poczta.fm)
This file is part of KeeperRL.
KeeperRL 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 (at your option) any later version.
KeeperRL 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/ . */
#pragma once
#include "unique_entity.h"
#include "util.h"
template <typename Key, typename Value>
class EntityMap {
public:
using EntityId = typename UniqueEntity<Key>::Id;
EntityMap();
EntityMap& operator = (const EntityMap&) = default;
bool empty() const;
void clear();
int getSize() const;
vector<EntityId> getKeys() const;
void set(const Key*, const Value&);
void erase(const Key*);
const Value& getOrFail(const Key*) const;
Value& getOrFail(const Key*);
Value& getOrInit(const Key*);
optional<Value> getMaybe(const Key*) const;
const Value& getOrElse(const Key*, const Value&) const;
bool hasKey(const Key*) const;
void set(WeakPointer<const Key>, const Value&);
void erase(WeakPointer<const Key>);
const Value& getOrFail(WeakPointer<const Key>) const;
Value& getOrFail(WeakPointer<const Key>);
Value& getOrInit(WeakPointer<const Key>);
optional<Value> getMaybe(WeakPointer<const Key>) const;
const Value& getOrElse(WeakPointer<const Key>, const Value&) const;
bool hasKey(WeakPointer<const Key>) const;
void set(EntityId, const Value&);
void erase(EntityId);
const Value& getOrFail(EntityId) const;
Value& getOrFail(EntityId);
Value& getOrInit(EntityId);
optional<Value> getMaybe(EntityId) const;
const Value& getOrElse(EntityId, const Value&) const;
bool hasKey(EntityId) const;
template <class Archive>
void serialize(Archive& ar, const unsigned int version);
using Iter = typename HashMap<EntityId, Value>::const_iterator;
~EntityMap();
Iter begin() const;
Iter end() const;
private:
HashMap<EntityId, Value> SERIAL(elems);
};