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
|
/* Copyright (c) 2012-2016 Stanislaw Halik
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*/
#include "ftnoir_filter_accela.h"
#include "compat/math.hpp"
#include "api/plugin-api.hpp"
#include <algorithm>
#include <QDebug>
#include <QMutexLocker>
#include "compat/math-imports.hpp"
#include "compat/time.hpp"
accela::accela()
{
s.make_splines(spline_rot, spline_pos);
}
template<typename F>
never_inline
static void do_deltas(const double* deltas, double* output, F&& fun)
{
constexpr unsigned N = 3;
double norm[N];
double dist = 0;
for (unsigned k = 0; k < N; k++)
dist += deltas[k]*deltas[k];
dist = sqrt(dist);
const double value = fun(dist);
for (unsigned k = 0; k < N; k++)
{
const double c = dist > 1e-6 ? std::clamp((fabs(deltas[k]) / dist), 0., 1.) : 0;
norm[k] = c;
}
double n = 0;
for (unsigned k = 0; k < N; k++) // NOLINT(modernize-loop-convert)
n += norm[k];
if (n > 1e-6)
{
const double ret = 1./n;
for (unsigned k = 0; k < N; k++) // NOLINT(modernize-loop-convert)
norm[k] *= ret;
}
else
for (unsigned k = 0; k < N; k++) // NOLINT(modernize-loop-convert)
norm[k] = 0;
for (unsigned k = 0; k < N; k++)
{
const double d = norm[k] * value;
output[k] = signum(deltas[k]) * d;
}
}
void accela::filter(const double* input, double *output)
{
static constexpr double full_turn = 360.0;
static constexpr double half_turn = 180.0;
if (unlikely(first_run))
{
first_run = false;
for (int i = 0; i < 6; i++)
{
const double f = input[i];
output[i] = f;
last_output[i] = f;
}
t.start();
#if defined DEBUG_ACCELA
debug_max = 0;
debug_timer.start();
#endif
return;
}
const double rot_thres{s.rot_smoothing};
const double pos_thres{s.pos_smoothing};
const double dt = t.elapsed_seconds();
t.start();
const double rot_dz{ s.rot_deadzone};
const double pos_dz{ s.pos_deadzone};
// rot
for (unsigned i = 3; i < 6; i++)
{
double d = input[i] - last_output[i];
if (fabs(d) > half_turn) d -= copysign(full_turn, d);
if (fabs(d) > rot_dz)
d -= copysign(rot_dz, d);
else
d = 0;
deltas[i] = d / rot_thres;
}
do_deltas(&deltas[Yaw], &output[Yaw], [this](double x) {
return spline_rot.get_value_no_save(x);
});
// pos
for (unsigned i = 0; i < 3; i++)
{
double d = input[i] - last_output[i];
if (fabs(d) > pos_dz)
d -= copysign(pos_dz, d);
else
d = 0;
deltas[i] = d / pos_thres;
}
do_deltas(&deltas[TX], &output[TX], [this](double x) {
return spline_pos.get_value_no_save(x);
});
// end
for (unsigned k = 0; k < 6; k++)
{
output[k] *= dt;
output[k] += last_output[k];
if (fabs(output[k]) > half_turn) output[k] -= copysign(full_turn, output[k]);
last_output[k] = output[k];
}
}
namespace detail::accela {
void settings_accela::make_splines(spline& rot, spline& pos)
{
rot.clear(); pos.clear();
for (const auto& val : rot_gains)
rot.add_point({ val.x, val.y });
for (const auto& val : pos_gains)
pos.add_point({ val.x, val.y });
}
} // ns detail::accela
OPENTRACK_DECLARE_FILTER(accela, dialog_accela, accelaDll)
|
