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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
#include "inputactions.hpp"
#include <queue>
#include <set>
#include <components/debug/debuglog.hpp>
#include "luastate.hpp"
namespace LuaUtil
{
namespace InputAction
{
namespace
{
std::string_view typeName(Type actionType)
{
switch (actionType)
{
case Type::Boolean:
return "Boolean";
case Type::Number:
return "Number";
case Type::Range:
return "Range";
default:
throw std::logic_error("Unknown input action type");
}
}
}
MultiTree::Node MultiTree::insert()
{
size_t nextId = size();
mChildren.push_back({});
mParents.push_back({});
return nextId;
}
bool MultiTree::validateTree() const
{
std::vector<bool> complete(size(), false);
traverse([&complete](Node node) { complete[node] = true; });
return std::find(complete.begin(), complete.end(), false) == complete.end();
}
template <typename Function>
void MultiTree::traverse(Function callback) const
{
std::queue<Node> nodeQueue;
std::vector<bool> complete(size(), false);
for (Node root = 0; root < size(); ++root)
{
if (!complete[root])
nodeQueue.push(root);
while (!nodeQueue.empty())
{
Node node = nodeQueue.back();
nodeQueue.pop();
bool isComplete = true;
for (Node parent : mParents[node])
isComplete = isComplete && complete[parent];
complete[node] = isComplete;
if (isComplete)
{
callback(node);
for (Node child : mChildren[node])
nodeQueue.push(child);
}
}
}
}
bool MultiTree::multiEdge(Node target, const std::vector<Node>& source)
{
mParents[target].reserve(mParents[target].size() + source.size());
for (Node s : source)
{
mParents[target].push_back(s);
mChildren[s].push_back(target);
}
bool validTree = validateTree();
if (!validTree)
{
for (Node s : source)
{
mParents[target].pop_back();
mChildren[s].pop_back();
}
}
return validTree;
}
namespace
{
bool validateActionValue(sol::object value, Type type)
{
switch (type)
{
case Type::Boolean:
return value.get_type() == sol::type::boolean;
case Type::Number:
return value.get_type() == sol::type::number;
case Type::Range:
if (value.get_type() != sol::type::number)
return false;
double d = value.as<double>();
return 0.0 <= d && d <= 1.0;
}
throw std::invalid_argument("Unknown action type");
}
}
void Registry::insert(const Info& info)
{
if (mIds.find(info.mKey) != mIds.end())
throw std::domain_error("Action key \"" + info.mKey + "\" is already in use");
if (info.mKey.empty())
throw std::domain_error("Action key can't be an empty string");
if (info.mL10n.empty())
throw std::domain_error("Localization context can't be empty");
if (!validateActionValue(info.mDefaultValue, info.mType))
throw std::logic_error("Invalid value: \"" + LuaUtil::toString(info.mDefaultValue) + "\" for action \""
+ info.mKey + "\"");
Id id = mBindingTree.insert();
mKeys.push_back(info.mKey);
mIds[std::string(info.mKey)] = id;
mInfo.push_back(info);
mHandlers.push_back({});
mBindings.push_back({});
mValues.push_back(info.mDefaultValue);
}
std::optional<std::string> Registry::nextKey(std::string_view key) const
{
auto it = mIds.find(key);
if (it == mIds.end())
return std::nullopt;
auto nextId = it->second + 1;
if (nextId >= mKeys.size())
return std::nullopt;
return mKeys.at(nextId);
}
std::optional<Info> Registry::operator[](std::string_view actionKey)
{
auto iter = mIds.find(actionKey);
if (iter == mIds.end())
return std::nullopt;
return mInfo[iter->second];
}
Registry::Id Registry::safeIdByKey(std::string_view key)
{
auto iter = mIds.find(key);
if (iter == mIds.end())
throw std::logic_error("Unknown action key: \"" + std::string(key) + "\"");
return iter->second;
}
bool Registry::bind(
std::string_view key, const LuaUtil::Callback& callback, const std::vector<std::string_view>& dependencies)
{
Id id = safeIdByKey(key);
std::vector<Id> dependencyIds;
dependencyIds.reserve(dependencies.size());
for (std::string_view s : dependencies)
dependencyIds.push_back(safeIdByKey(s));
bool validEdge = mBindingTree.multiEdge(id, dependencyIds);
if (validEdge)
mBindings[id].push_back(Binding{
callback,
std::move(dependencyIds),
});
return validEdge;
}
sol::object Registry::valueOfType(std::string_view key, Type type)
{
Id id = safeIdByKey(key);
Info info = mInfo[id];
if (info.mType != type)
{
std::string message("Attempt to get value of type \"");
message += typeName(type);
message += "\" from action \"";
message += key;
message += "\" with type \"";
message += typeName(info.mType);
message += "\"";
throw std::logic_error(message);
}
return mValues[id];
}
void Registry::update(double dt)
{
std::vector<sol::object> dependencyValues;
mBindingTree.traverse([this, &dependencyValues, dt](Id node) {
sol::main_object newValue = mValues[node];
std::vector<Binding>& bindings = mBindings[node];
bindings.erase(std::remove_if(bindings.begin(), bindings.end(),
[&](const Binding& binding) {
if (!binding.mCallback.isValid())
return true;
dependencyValues.clear();
for (Id parent : binding.mDependencies)
dependencyValues.push_back(mValues[parent]);
try
{
newValue = sol::main_object(
binding.mCallback.call(dt, newValue, sol::as_args(dependencyValues)));
}
catch (std::exception& e)
{
if (!validateActionValue(newValue, mInfo[node].mType))
Log(Debug::Error)
<< "Error due to invalid value of action \"" << mKeys[node]
<< "\"(\"" << LuaUtil::toString(newValue) << "\"): " << e.what();
else
Log(Debug::Error) << "Error in callback: " << e.what();
}
return false;
}),
bindings.end());
if (!validateActionValue(newValue, mInfo[node].mType))
Log(Debug::Error) << "Invalid value of action \"" << mKeys[node]
<< "\": " << LuaUtil::toString(newValue);
if (mValues[node] != newValue)
{
mValues[node] = sol::object(newValue);
std::vector<LuaUtil::Callback>& handlers = mHandlers[node];
handlers.erase(std::remove_if(handlers.begin(), handlers.end(),
[&](const LuaUtil::Callback& handler) {
if (!handler.isValid())
return true;
handler.tryCall(newValue);
return false;
}),
handlers.end());
}
});
}
void Registry::clear(bool force)
{
std::vector<Info> infoToKeep;
if (!force)
{
for (const Info& info : mInfo)
if (info.mPersistent)
infoToKeep.push_back(info);
}
mKeys.clear();
mIds.clear();
mInfo.clear();
mHandlers.clear();
mBindings.clear();
mValues.clear();
mBindingTree.clear();
if (!force)
{
for (const Info& i : infoToKeep)
insert(i);
}
}
}
namespace InputTrigger
{
Registry::Id Registry::safeIdByKey(std::string_view key)
{
auto it = mIds.find(key);
if (it == mIds.end())
throw std::domain_error("Unknown trigger key \"" + std::string(key) + "\"");
return it->second;
}
void Registry::insert(const Info& info)
{
if (mIds.find(info.mKey) != mIds.end())
throw std::domain_error("Trigger key \"" + info.mKey + "\" is already in use");
if (info.mKey.empty())
throw std::domain_error("Trigger key can't be an empty string");
if (info.mL10n.empty())
throw std::domain_error("Localization context can't be empty");
Id id = mIds.size();
mIds[info.mKey] = id;
mInfo.push_back(info);
mHandlers.push_back({});
}
std::optional<Info> Registry::operator[](std::string_view key)
{
auto iter = mIds.find(key);
if (iter == mIds.end())
return std::nullopt;
return mInfo[iter->second];
}
void Registry::registerHandler(std::string_view key, const LuaUtil::Callback& callback)
{
Id id = safeIdByKey(key);
mHandlers[id].push_back(callback);
}
void Registry::activate(std::string_view key)
{
Id id = safeIdByKey(key);
std::vector<LuaUtil::Callback>& handlers = mHandlers[id];
handlers.erase(std::remove_if(handlers.begin(), handlers.end(),
[&](const LuaUtil::Callback& handler) {
if (!handler.isValid())
return true;
handler.tryCall();
return false;
}),
handlers.end());
}
void Registry::clear(bool force)
{
std::vector<Info> infoToKeep;
if (!force)
{
for (const Info& info : mInfo)
if (info.mPersistent)
infoToKeep.push_back(info);
}
mInfo.clear();
mHandlers.clear();
mIds.clear();
if (!force)
{
for (const Info& i : infoToKeep)
insert(i);
}
}
}
}
|
