forked from Ares-Developers/YRpp
-
Notifications
You must be signed in to change notification settings - Fork 25
/
IndexClass.h
279 lines (231 loc) · 5.92 KB
/
IndexClass.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
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
#pragma once
#include <YRPPCore.h>
#include <GenericList.h>
/*
* IndexClass, most impl from CCR
* --secsome
*/
// TKey is always int in WW's code
template<typename TKey, typename TValue>
class IndexClass
{
public:
IndexClass(void);
~IndexClass(void);
constexpr bool AddIndex(TKey id, const TValue& data);
bool AddIndex(TKey id, TValue&& data);
bool RemoveIndex(TKey id);
bool IsPresent(TKey id) const;
int Count() const;
const TValue& FetchIndex(TKey id) const;
TValue& FetchIndex(TKey id);
void Clear();
bool Reverse(int nAmount);
inline void Sort();
static int __cdecl Comparator(void const* ptr, void const* ptr2);
struct NodeElement
{
NodeElement& operator=(const NodeElement& node) { ID = node.ID; Data = node.Data; return *this; }
bool operator<(const NodeElement& another) const { return ID < another.ID; }
bool operator==(const NodeElement& another) const { return ID == another.ID; }
TKey ID;
TValue Data;
};
NodeElement* IndexTable;
int IndexCount;
int IndexSize;
bool IsSorted;
PROTECTED_PROPERTY(char, padding[3]);
NodeElement* Archive;
// ranged for support
NodeElement* begin() const { return IndexTable; }
NodeElement* end() const { return &IndexTable[IndexCount]; }
private:
bool IncreaseTableSize(int nAmount);
bool IsArchiveSame(TKey id) const;
void InvalidateArchive();
void SetArchive(NodeElement const* pNode);
NodeElement const* SearchForNode(TKey id) const;
};
template<typename TKey, typename TValue>
IndexClass<TKey, TValue>::IndexClass() :
IndexTable(0),
IndexCount(0),
IndexSize(0),
IsSorted(false),
Archive(0)
{
InvalidateArchive();
}
template<typename TKey, typename TValue>
IndexClass<TKey, TValue>::~IndexClass()
{
Clear();
}
template<typename TKey, typename TValue>
void IndexClass<TKey, TValue>::Clear()
{
GameDelete(IndexTable);
IndexTable = 0;
IndexCount = 0;
IndexSize = 0;
IsSorted = false;
InvalidateArchive();
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::IncreaseTableSize(int amount)
{
if (amount < 0) return false;
NodeElement* table = GameCreateArray<NodeElement>(IndexSize + amount);
if (table != nullptr)
{
for (int i = 0; i < IndexCount; ++i)
table[i] = IndexTable[i];
GameDelete(IndexTable);
IndexTable = table;
IndexSize += amount;
InvalidateArchive();
return true;
}
return false;
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::Reverse(int amount)
{
Clear();
return IncreaseTableSize(amount);
}
template<typename TKey, typename TValue>
inline void IndexClass<TKey, TValue>::Sort()
{
if (!IsSorted)
{
std::sort(&IndexTable[0], &IndexTable[IndexCount]);
InvalidateArchive();
IsSorted = true;
}
}
template<typename TKey, typename TValue>
int IndexClass<TKey, TValue>::Count() const
{
return IndexCount;
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::IsPresent(TKey id) const
{
if (!IndexCount)
return false;
if (IsArchiveSame(id))
return true;
NodeElement const* nodeptr = SearchForNode(id);
if (nodeptr != nullptr)
{
const_cast<IndexClass<TKey, TValue>*>(this)->SetArchive(nodeptr);
return true;
}
return false;
}
template<typename TKey, typename TValue>
const TValue& IndexClass<TKey, TValue>::FetchIndex(TKey id) const
{
return IsPresent(id) ? Archive->Data : TValue();
}
template<typename TKey, typename TValue>
TValue& IndexClass<TKey, TValue>::FetchIndex(TKey id)
{
if (!IsPresent(id))
{
AddIndex(id, TValue());
IsPresent(id);
}
return Archive->Data;
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::IsArchiveSame(TKey id) const
{
return Archive != 0 && Archive->ID == id;
}
template<typename TKey, typename TValue>
void IndexClass<TKey, TValue>::InvalidateArchive()
{
Archive = nullptr;
}
template<typename TKey, typename TValue>
void IndexClass<TKey, TValue>::SetArchive(NodeElement const* node)
{
Archive = const_cast<NodeElement*>(node);
}
template<typename TKey, typename TValue>
constexpr bool IndexClass<TKey, TValue>::AddIndex(TKey id, const TValue& data)
{
if (IndexCount + 1 > IndexSize)
{
if (!IncreaseTableSize(IndexSize == 0 ? 10 : IndexSize))
return false;
}
IndexTable[IndexCount].ID = std::move(id);
IndexTable[IndexCount].Data = std::move(data);
++IndexCount;
IsSorted = false;
return true;
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::AddIndex(TKey id, TValue&& data)
{
if (IndexCount + 1 > IndexSize)
{
if (!IncreaseTableSize(IndexSize == 0 ? 10 : IndexSize))
return false;
}
IndexTable[IndexCount].ID = std::move(id);
IndexTable[IndexCount].Data = std::move(data);
++IndexCount;
IsSorted = false;
return true;
}
template<typename TKey, typename TValue>
bool IndexClass<TKey, TValue>::RemoveIndex(TKey id)
{
int found_index = -1;
for (int i = 0; i < IndexCount; ++i)
{
if (IndexTable[i].ID == id)
{
found_index = i;
break;
}
}
if (found_index != -1)
{
for (int i = found_index + 1; i < IndexCount; ++i)
IndexTable[i - 1] = IndexTable[i];
--IndexCount;
IndexTable[IndexCount] = std::move(NodeElement(TKey(), TValue())); // zap last (now unused) element
InvalidateArchive();
return true;
}
return false;
}
// See RA1 code
template<typename TKey, typename TValue>
int __cdecl IndexClass<TKey, TValue>::Comparator(void const* ptr1, void const* ptr2)
{
const NodeElement* n1 = static_cast<const NodeElement*>(ptr1);
const NodeElement* n2 = static_cast<const NodeElement*>(ptr2);
if (n1->ID == n2->ID)
return 0;
if (n1->ID < n2->ID)
return -1;
return 1;
}
template<typename TKey, typename TValue>
typename IndexClass<TKey, TValue>::NodeElement const* IndexClass<TKey, TValue>::SearchForNode(TKey id) const
{
if (!IndexCount)
return 0;
const_cast<IndexClass<TKey, TValue>*>(this)->Sort();
NodeElement node;
node.ID = id;
//return std::lower_bound(&IndexTable[0], &IndexTable[IndexCount], node);
return static_cast<const NodeElement*>(std::bsearch(&node, &IndexTable[0], IndexCount, sizeof(IndexTable[0]), Comparator));
}