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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/* Copyright (C) 2019 Wildfire Games.
* This file is part of 0 A.D.
*
* 0 A.D. 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.
*
* 0 A.D. 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 0 A.D. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef INCLUDED_DELTAARRAY
#define INCLUDED_DELTAARRAY
template<typename T> class DeltaArray2D
{
public:
virtual ~DeltaArray2D() {}
T get(ssize_t x, ssize_t y);
void set(ssize_t x, ssize_t y, const T& val);
void OverlayWith(const DeltaArray2D<T>& overlayer);
void Undo();
void Redo();
protected:
virtual T getOld(ssize_t x, ssize_t y) = 0;
virtual void setNew(ssize_t x, ssize_t y, const T& val) = 0;
private:
// TODO: more efficient representation
using Data = std::unordered_map<std::pair<ssize_t, ssize_t>, std::pair<T, T> >; // map of <x,y> -> <old_val, new_val>
Data m_Data;
};
namespace std
{
template<>
struct hash<std::pair<ssize_t, ssize_t> >
{
std::size_t operator()(const std::pair<ssize_t, ssize_t>& p) const
{
std::size_t seed = 0;
hash_combine(seed, p.first << 16);
hash_combine(seed, p.second);
return seed;
}
// Same as boost::hash_combine
void hash_combine(std::size_t& seed, const ssize_t val) const
{
seed ^= m_SizeHash(val) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
private:
std::hash<ssize_t> m_SizeHash;
};
}
//////////////////////////////////////////////////////////////////////////
template<typename T>
T DeltaArray2D<T>::get(ssize_t x, ssize_t y)
{
typename Data::iterator it = m_Data.find(std::make_pair(x, y));
if (it == m_Data.end())
return getOld(x, y);
else
return it->second.second;
}
template<typename T>
void DeltaArray2D<T>::set(ssize_t x, ssize_t y, const T& val)
{
typename Data::iterator it = m_Data.find(std::make_pair(x, y));
if (it == m_Data.end())
m_Data.insert(std::make_pair(std::make_pair(x, y), std::make_pair(getOld(x, y), val)));
else
it->second.second = val;
setNew(x, y, val);
}
template <typename T>
void DeltaArray2D<T>::OverlayWith(const DeltaArray2D<T>& overlayer)
{
for (typename Data::const_iterator it = overlayer.m_Data.begin(); it != overlayer.m_Data.end(); ++it)
{
typename Data::iterator it2 = m_Data.find(it->first);
if (it2 == m_Data.end())
m_Data.insert(*it);
else
{
//ENSURE(it2->second.second == it->second.first);
it2->second.second = it->second.second;
}
}
}
template <typename T>
void DeltaArray2D<T>::Undo()
{
for (typename Data::iterator it = m_Data.begin(); it != m_Data.end(); ++it)
setNew(it->first.first, it->first.second, it->second.first);
}
template <typename T>
void DeltaArray2D<T>::Redo()
{
for (typename Data::iterator it = m_Data.begin(); it != m_Data.end(); ++it)
setNew(it->first.first, it->first.second, it->second.second);
}
#endif // INCLUDED_DELTAARRAY
|
