forked from DeanCording/node-red-contrib-assert
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathassert.js
More file actions
145 lines (130 loc) · 6.59 KB
/
Copy pathassert.js
File metadata and controls
145 lines (130 loc) · 6.59 KB
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
/**
* Copyright 2013, 2015 IBM Corp.
* Copyright 2018 Dean Cording <dean@cording.id.au>
*
* 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.
**/
module.exports = function(RED) {
"use strict";
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; },
'within': function(a, b, c) { return a >= c-b && a <= c+b;},
'cont': function(a, b) { return (a + "").indexOf(b) != -1; },
'regex': function(a, b, c, d) { return (a + "").match(new RegExp(b,d?'i':'')); },
'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); },
'type': function(a, b) { if (b == "array") return Array.isArray(a); else if (b == "buffer") return Buffer.isBuffer(a); else return (typeof a == b) && !Array.isArray(a) && !Buffer.isBuffer(a); }
};
var operatorsDesc = {
'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 + " is between " + b + " and " + c; },
'within': function(a, b, c) { return "" + a + " is within " + b + " of " + c; },
'cont': function(a, b) { return "" + a + " contains " + b; },
'regex': function(a, b, c, d) { return "" + a + " " + b + " case insensitive: " + d; },
'true': function(a) { return "" + a + " is true"; },
'false': function(a) { return "" + a + " is false"; },
'null': function(a) { return "" + a + " is null"; },
'nnull': function(a) { return "" + a + " is not null"; },
'type': function(a, b) { return (Array.isArray(a)?"array":(Buffer.isBuffer(a)?"buffer":(typeof a))) + " is " + b;}
};
function AssertNode(n) {
RED.nodes.createNode(this, n);
this.rules = n.rules || [];
var node = this;
for (var i=0; i<this.rules.length; i+=1) {
var rule = this.rules[i];
rule.propertyType = rule.propertyType || "msg";
rule.previousValue = [];
rule.meanSize = 1;
if (!rule.valueType) {
if (!isNaN(parseFloat(rule.value))) {
rule.valueType = 'num';
} else {
rule.valueType = 'str';
}
}
if (rule.valueType === 'num') {
rule.value = parseFloat(rule.value);
}
if (typeof rule.value2 !== 'undefined') {
if (!rule.value2Type) {
if (!isNaN(parseFloat(rule.value2))) {
rule.value2Type = 'num';
} else {
rule.value2Type = 'str';
}
}
if (rule.value2Type === 'num') {
rule.value2 = parseFloat(rule.value2);
} else if (rule.value2Type === 'mean') {
rule.meanSize = parseInt(rule.value2);
}
}
}
node.on('input', function (msg) {
try {
for (var i=0; i<node.rules.length; i+=1) {
var rule = node.rules[i];
var test = RED.util.evaluateNodeProperty(rule.property,rule.propertyType,node,msg);
var pass = true;
if (!(((rule.valueType === 'prev') || (rule.value2Type === 'prev')
|| (rule.valueType === 'mean') || (rule.value2Type === 'mean'))
&& (rule.previousValue.length == 0))) {
var v1,v2;
if (rule.valueType === 'prev') {
v1 = rule.previousValue[0];
} else if (rule.valueType === 'mean') {
v1 = rule.previousValue.reduce((previous, current) => current += previous) / rule.previousValue.length;
} else {
v1 = RED.util.evaluateNodeProperty(rule.value,rule.valueType,node,msg);
}
v2 = rule.value2;
if (rule.value2Type === 'prev') {
v2 = rule.previousValue[0];
} else if (rule.value2Type === 'mean') {
v2 = rule.previousValue.reduce((previous, current) => current += previous) / rule.previousValue.length;
} else if (typeof v2 !== 'undefined') {
v2 = RED.util.evaluateNodeProperty(rule.value2,rule.value2Type,node,msg);
}
pass = operators[rule.type](test,v1,v2,rule.case);
}
rule.previousValue.push(test);
while (rule.previousValue.length > rule.meanSize)
rule.previousValue.shift();
if (!pass) {
node.status({fill:"red",shape:"dot",text:(rule.failMsg.length > 1) ? rule.failMsg : "Assertion " + (i+1) + " failed"});
throw new Error("Assertion " + (i+1) + " failed: " + " " + rule.propertyType + ":" + rule.property + ": " + operatorsDesc[rule.type](test,v1,v2,rule.case) + " " + rule.failMsg );
}
}
node.status({fill:"green",shape:"dot",text:"ok"});
node.send(msg);
} catch(err) {
node.error(err,msg);
}
});
}
RED.nodes.registerType("assert", AssertNode);
}