-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathFunctions.cpp
More file actions
365 lines (271 loc) · 8.55 KB
/
Functions.cpp
File metadata and controls
365 lines (271 loc) · 8.55 KB
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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
#include "Pch.h"
#include "Functions.h"
#include "Formula.h"
#include <ctime>
Result FunctionBetween (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
--(*pindex);
Result v2 = termSource.EvaluateSubexpression(context, pindex);
if(v2.code != RESULT_CODE_OK)
return v2;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if(v1.code != RESULT_CODE_OK)
return v1;
--(*pindex);
Result t = termSource.EvaluateSubexpression(context, pindex);
if(t.code != RESULT_CODE_OK)
return t;
ret.payload.num.value = (v1.payload.num.value < t.payload.num.value && t.payload.num.value < v2.payload.num.value) ? ValueT(1.0) : ValueT(0.0);
ret.code = RESULT_CODE_OK;
return ret;
}
Result FunctionDistance (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
--(*pindex);
Result v2 = termSource.EvaluateSubexpression(context, pindex);
if (v2.code != RESULT_CODE_OK)
return v2;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if (v1.code != RESULT_CODE_OK)
return v1;
ValueT x1 = v1.payload.num.value;
ValueT y1 = v1.payload.num.value2;
ValueT x2 = v2.payload.num.value;
ValueT y2 = v2.payload.num.value2;
ValueT dx = x2 - x1;
ValueT dy = y2 - y1;
ret.payload.num.value = sqrt((dx * dx) + (dy * dy));
ret.code = RESULT_CODE_OK;
return ret;
}
Result FunctionEqual (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
ret.code = RESULT_CODE_OK;
ret.payload.num.value = 0.0f;
--(*pindex);
Result v2 = termSource.EvaluateSubexpression(context, pindex);
if (v2.code != RESULT_CODE_OK)
return v2;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if (v1.code != RESULT_CODE_OK)
return v1;
if (v1.type == v2.type) {
switch (v1.type) {
case RESULT_TYPE_SCALAR:
if (v1.payload.num.value == v2.payload.num.value)
ret.payload.num.value = 1.0f;
break;
case RESULT_TYPE_TOKEN:
if (v1.payload.txt.token == v2.payload.txt.token)
ret.payload.num.value = 1.0f;
break;
case RESULT_TYPE_VECTOR2:
if (v1.payload.num.value == v2.payload.num.value && v1.payload.num.value2 == v2.payload.num.value2)
ret.payload.num.value = 1.0f;
break;
default:
assert(false);
}
}
return ret;
}
Result FunctionFuzzyMatch (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
ret.code = RESULT_CODE_OK;
ret.payload.num.value = 0.0f;
--(*pindex);
Result v2 = termSource.EvaluateSubexpression(context, pindex);
if (v2.code != RESULT_CODE_OK)
return v2;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if (v1.code != RESULT_CODE_OK)
return v1;
if (v1.type == v2.type) {
if (v1.type == RESULT_TYPE_TOKEN) {
std::string token1, token2;
if (context->ResolveToken(v1.payload.txt.scope, v1.payload.txt.token, &token1) && context->ResolveToken(v2.payload.txt.scope, v2.payload.txt.token, &token2)) {
if (token2.length() > 0 && token1.find(token2) != std::string::npos)
ret.payload.num.value = 1.0f;
// TODO - richer fuzzy text matching?
}
}
}
return ret;
}
Result FunctionLess (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
ret.code = RESULT_CODE_OK;
ret.payload.num.value = 0.0f;
--(*pindex);
Result v2 = termSource.EvaluateSubexpression(context, pindex);
if (v2.code != RESULT_CODE_OK)
return v2;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if (v1.code != RESULT_CODE_OK)
return v1;
if (v1.type == v2.type) {
switch (v1.type) {
case RESULT_TYPE_SCALAR:
if (v1.payload.num.value < v2.payload.num.value)
ret.payload.num.value = 1.0f;
break;
default:
assert(false);
}
}
return ret;
}
Result FunctionLimit (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
--(*pindex);
Result lim = termSource.EvaluateSubexpression(context, pindex);
if(lim.code != RESULT_CODE_OK)
return lim;
--(*pindex);
Result v = termSource.EvaluateSubexpression(context, pindex);
if(v.code != RESULT_CODE_OK)
return v;
// TODO - type checking in all functions
ValueT x = v.payload.num.value;
ValueT y = v.payload.num.value2;
ValueT mag = sqrt((x * x) + (y * y));
if(mag <= lim.payload.num.value)
return v;
ValueT scale = lim.payload.num.value / mag;
x *= scale;
y *= scale;
Result ret;
ret.code = RESULT_CODE_OK;
ret.type = RESULT_TYPE_VECTOR2;
ret.payload.num.value = x;
ret.payload.num.value2 = y;
return ret;
}
Result FunctionNormalize (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
ret.type = RESULT_TYPE_SCALAR;
--(*pindex);
Result v1 = termSource.EvaluateSubexpression(context, pindex);
if (v1.code != RESULT_CODE_OK)
return v1;
ValueT x1 = v1.payload.num.value;
ValueT y1 = v1.payload.num.value2;
ValueT mag = sqrt((x1 * x1) + (y1 * y1));
x1 /= mag;
y1 /= mag;
ret.payload.num.value = x1;
ret.payload.num.value2 = y1;
ret.type = RESULT_TYPE_VECTOR2;
ret.code = RESULT_CODE_OK;
return ret;
}
Result FunctionRandom (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
static std::default_random_engine s_generator((unsigned)(time(nullptr)));
Result ret;
--(*pindex);
Result param = termSource.EvaluateSubexpression(context, pindex);
if (param.code != RESULT_CODE_OK)
return param;
std::uniform_real_distribution<ValueT> distribution(0.0, param.payload.num.value);
ret.payload.num.value = distribution(s_generator);
ret.code = RESULT_CODE_OK;
return ret;
}
Result FunctionRound (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
--(*pindex);
Result param = termSource.EvaluateSubexpression(context, pindex);
if (param.code != RESULT_CODE_OK)
return param;
ret.code = RESULT_CODE_OK;
ret.payload.num.value = std::round(param.payload.num.value);
return ret;
}
Result FunctionSumOfList (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
--(*pindex);
unsigned parameterListScope = 0;
unsigned parameterListName = 0;
if (!termSource.EvaluateScopedToken(*pindex, ¶meterListScope, ¶meterListName)) {
ret.code = RESULT_CODE_SYNTAX_ERROR;
ret.payload.num.value = 0.0;
return ret;
}
if (!context) {
ret.code = RESULT_CODE_MISSING_DEFINITION;
ret.payload.num.value = 0.0;
return ret;
}
ListResult listresult = context->ResolveList(*context, parameterListScope, parameterListName);
if (listresult.code != RESULT_CODE_OK) {
ret.code = listresult.code;
ret.payload.num.value = 0.0;
return ret;
}
ret.payload.num.value = 0.0;
for (auto val : listresult.values)
ret.payload.num.value += val;
ret.code = RESULT_CODE_OK;
return ret;
}
Result FunctionVector (const IFormulaContext * context, const class Formula & termSource, unsigned * pindex) {
Result ret;
// Always retrieve parameter values right to left
--(*pindex);
Result yparam = termSource.EvaluateSubexpression(context, pindex);
--(*pindex);
Result xparam = termSource.EvaluateSubexpression(context, pindex);
ret.code = RESULT_CODE_OK;
ret.type = RESULT_TYPE_VECTOR2;
ret.payload.num.value = xparam.payload.num.value;
ret.payload.num.value2 = yparam.payload.num.value;
return ret;
}
struct HashFunc {
int operator() (const char * str) const {
int seed = 131;
int hash = 0;
while (*str) {
hash = (hash * seed) + (*str);
++str;
}
return (hash & 0x7fffffff);
}
};
struct EqualityFunc {
bool operator() (const char * a, const char * b) const {
return (std::strcmp(a, b) == 0);
}
};
FTerminalEvaluator GetFunctionEvaluatorByName (const char str[]) {
static const std::unordered_map<const char *, FTerminalEvaluator, HashFunc, EqualityFunc> evalNames =
{
{ "Between", &FunctionBetween },
{ "Distance", &FunctionDistance },
{ "Equal", &FunctionEqual },
{ "FuzzyMatch", &FunctionFuzzyMatch },
{ "Less", &FunctionLess },
{ "Limit", &FunctionLimit },
{ "Normalize", &FunctionNormalize },
{ "Random", &FunctionRandom },
{ "Round", &FunctionRound },
{ "SumOf", &FunctionSumOfList },
{ "Vec", &FunctionVector },
};
auto iter = evalNames.find(str);
if (iter != evalNames.end())
return iter->second;
return nullptr;
}
FTerminalEvaluator GetFunctionEvaluatorMakeVector () {
return &FunctionVector;
}