Start making non-red-nodes tolerant to missing payloads

This commit is contained in:
dceejay
2015-03-31 13:18:25 +01:00
parent 32f6dc0346
commit 3896a82bd8
13 changed files with 210 additions and 122 deletions

View File

@@ -29,32 +29,34 @@ module.exports = function(RED) {
var old = null;
this.on('input', function (msg) {
var n = Number(msg.payload);
if (!isNaN(n)) {
if ((node.action === "low") || (node.action === "high")) {
if (old == null) { old = n; }
old = old + (n - old) / node.count;
if (node.action === "low") { msg.payload = old; }
else { msg.payload = n - old; }
if msg.hasOwnProperty("payload")) {
var n = Number(msg.payload);
if (!isNaN(n)) {
if ((node.action === "low") || (node.action === "high")) {
if (old == null) { old = n; }
old = old + (n - old) / node.count;
if (node.action === "low") { msg.payload = old; }
else { msg.payload = n - old; }
}
else {
a.push(n);
if (a.length > node.count) { pop = a.shift(); }
if (node.action === "max") {
msg.payload = Math.max.apply(Math, a);
}
if (node.action === "min") {
msg.payload = Math.min.apply(Math, a);
}
if (node.action === "mean") {
tot = tot + n - pop;
msg.payload = tot / a.length;
}
}
if (node.round) { msg.payload = Math.round(msg.payload); }
node.send(msg);
}
else {
a.push(n);
if (a.length > node.count) { pop = a.shift(); }
if (node.action === "max") {
msg.payload = Math.max.apply(Math, a);
}
if (node.action === "min") {
msg.payload = Math.min.apply(Math, a);
}
if (node.action === "mean") {
tot = tot + n - pop;
msg.payload = tot / a.length;
}
}
if (node.round) { msg.payload = Math.round(msg.payload); }
node.send(msg);
}
else { node.log("Not a number: "+msg.payload); }
else { node.log("Not a number: "+msg.payload); }
} // ignore msg with no payload property.
});
}
RED.nodes.registerType("smooth", SmoothNode);