1
0
mirror of https://github.com/node-red/node-red.git synced 2023-10-10 13:36:53 +02:00
node-red/nodes/core/logic/10-switch.js

110 lines
4.2 KiB
JavaScript
Raw Normal View History

2013-10-13 21:28:21 +02:00
/**
* Copyright 2013, 2015 IBM Corp.
2013-10-13 21:28:21 +02:00
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
**/
2014-05-04 00:32:04 +02:00
module.exports = function(RED) {
"use strict";
2014-05-04 00:32:04 +02:00
var operators = {
'eq': function(a, b) { return a == b; },
'neq': function(a, b) { return a != b; },
'lt': function(a, b) { return a < b; },
'lte': function(a, b) { return a <= b; },
'gt': function(a, b) { return a > b; },
'gte': function(a, b) { return a >= b; },
'btwn': function(a, b, c) { return a >= b && a <= c; },
'cont': function(a, b) { return (a + "").indexOf(b) != -1; },
'regex': function(a, b, c, d) { return (a + "").match(new RegExp(b,d?'i':'')); },
2014-05-04 00:32:04 +02:00
'true': function(a) { return a === true; },
'false': function(a) { return a === false; },
'null': function(a) { return (typeof a == "undefined" || a === null); },
'nnull': function(a) { return (typeof a != "undefined" && a !== null); },
2014-05-04 00:32:04 +02:00
'else': function(a) { return a === true; }
};
2014-05-04 00:32:04 +02:00
function SwitchNode(n) {
RED.nodes.createNode(this, n);
this.rules = n.rules || [];
2014-05-04 00:32:04 +02:00
this.property = n.property;
2015-12-31 00:09:35 +01:00
this.propertyType = n.propertyType || "msg";
2014-05-04 00:32:04 +02:00
this.checkall = n.checkall || "true";
this.previousValue = null;
var node = this;
2014-05-04 00:32:04 +02:00
for (var i=0; i<this.rules.length; i+=1) {
var rule = this.rules[i];
2015-12-31 00:09:35 +01:00
if (!rule.vt) {
if (!isNaN(Number(rule.v))) {
rule.vt = 'num';
} else {
rule.vt = 'str';
}
2015-12-31 00:09:35 +01:00
}
if (rule.vt === 'num') {
2015-12-31 00:09:35 +01:00
if (!isNaN(Number(rule.v))) {
rule.v = Number(rule.v);
}
}
if (typeof rule.v2 !== 'undefined') {
if (!rule.v2t) {
if (!isNaN(Number(rule.v2))) {
rule.v2t = 'num';
} else {
rule.v2t = 'str';
2015-12-31 00:09:35 +01:00
}
}
if (rule.v2t === 'num') {
rule.v2 = Number(rule.v2);
}
}
}
2014-05-04 00:32:04 +02:00
this.on('input', function (msg) {
var onward = [];
try {
2015-12-31 00:09:35 +01:00
var prop = RED.util.evaluateNodeProperty(node.property,node.propertyType,node,msg);
var elseflag = true;
for (var i=0; i<node.rules.length; i+=1) {
var rule = node.rules[i];
var test = prop;
var v1,v2;
if (rule.vt === 'prev') {
v1 = node.previousValue;
} else {
v1 = RED.util.evaluateNodeProperty(rule.v,rule.vt,node,msg);
}
v2 = rule.v2;
if (rule.v2t === 'prev') {
v2 = node.previousValue;
} else if (typeof v2 !== 'undefined') {
2015-12-31 00:09:35 +01:00
v2 = RED.util.evaluateNodeProperty(rule.v2,rule.v2t,node,msg);
}
node.previousValue = prop;
if (rule.t == "else") { test = elseflag; elseflag = true; }
2015-12-31 00:09:35 +01:00
if (operators[rule.t](test,v1,v2,rule.case)) {
onward.push(msg);
elseflag = false;
if (node.checkall == "false") { break; }
} else {
onward.push(null);
}
2014-05-04 00:32:04 +02:00
}
this.send(onward);
} catch(err) {
node.warn(err);
2014-05-04 00:32:04 +02:00
}
});
}
RED.nodes.registerType("switch", SwitchNode);
}