summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
8bd2188)
Larger limits avoids clipping legit data. Using the same filter time
for both ascent and descent makes the results look a bit cleaner.
Signed-off-by: Keith Packard <keithp@keithp.com>
- static final double ascent_filter_len = 0.1;
- static final double descent_filter_len = 2.0;
+ static final double ascent_filter_len = 0.5;
+ static final double descent_filter_len = 0.5;
private double max_value;
private double set_time;
private double prev_set_time;
private double max_value;
private double set_time;
private double prev_set_time;
- private double max_rate = 1000.0;
void set(double new_value, double time) {
if (new_value != AltosLib.MISSING) {
void set(double new_value, double time) {
if (new_value != AltosLib.MISSING) {
double ddt = in.time() - pt;
double ddv = (n - p) / ddt;
double ddt = in.time() - pt;
double ddv = (n - p) / ddt;
+ final double max = 100000;
+
- if (Math.abs(ddv) > 1000) {
+ if (Math.abs(ddv) > max) {