frodovdr/node-red-nodes
1
0
Fork 0
mirror of https://github.com/node-red/node-red-nodes.git synced 2025-03-01 10:37:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge 870e9cdd45 into 97f8e03c71

Browse Source
This commit is contained in:
andowinger
2025-02-08 16:30:17 +08:00
committed by GitHub
parent 97f8e03c71 870e9cdd45
commit aa5e64ea1b
3 changed files with 37 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
function/smooth/17-smooth.html
View File

@@ -14,6 +14,7 @@
<option value="max">Return the maximum value seen</option>
<option value="min">Return the minimum value seen</option>
<option value="mean">Return the mean value</option>
<option value="median">Return the median value</option>
<option value="sd">Return the standard deviation</option>
<option value="low">Perform low pass filter</option>
<option value="high">Perform high pass filter</option>

11
function/smooth/17-smooth.js
View File

@@ -54,6 +54,17 @@ module.exports = function(RED) {
v[top].tot = v[top].tot + n - v[top].pop;
value = v[top].tot / v[top].a.length;
}
if (node.action === "median") {
var sortedForMedian = v[top].a.slice().sort((a, b) => a - b);
var medianIndex = Math.floor(v[top].iter / 2);
if (v[top].iter % 2 === 0) {
value = (sortedForMedian[medianIndex - 1] + sortedForMedian[medianIndex]) / 2;
}
else {
value = sortedForMedian[medianIndex]
}
}
if (node.action === "sd") {
v[top].tot = v[top].tot + n - v[top].pop;
v[top].tot2 = v[top].tot2 + (n*n) - (v[top].pop * v[top].pop);