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

Remove unused function

Browse Source
This commit is contained in:
Nick O'Leary
2023-05-22 23:14:31 +01:00
parent 2388232179
commit 991f13e704
1 changed files with 0 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
packages/node_modules/@node-red/runtime/lib/flows/Flow.js vendored
View File

@@ -128,65 +128,6 @@ class Flow {
}
this.parent.log(msg);
}
/**
* Checks if node A and node B are in the same group.
* Node B can also be placed in a subgroup.
* If node A is not in any group, false is returned
* @param {Node} nodeIdA Node which defines the first search level
* @param {Node} nodeIdB Node which is to be searched in the group or a subgroup
* @returns {boolean} Returns true if all nodes are in the same group. If not, then false or if node A is not in a group then also false.
*/
isNodeInSameGroup(nodeIdA, nodeIdB) {
const groups = this.global.groups;
let result = false;
for(let key in groups) {
let group = groups[key];
if(!group.nodes.includes(nodeIdA.id)) {
continue;
}
if(group.nodes.includes(nodeIdB.id)) {
result = true;
break;
}
/**
* Subfunction to recursively search the groups for matches
* @param {Node} Node which is to be searched in the group or a subgroup
* @param {Group} targetGroup group currently under analysis
* @returns {boolean} Returns true if a match was found. Otherwise false.
*/
const isInSubGroup = (targetNode, targetGroup) => {
let _result = false;
if(targetGroup.nodes.includes(targetNode.id)) {
_result = true;
} else {
for(let nodeId of targetGroup.nodes) {
let node = this.getGroupNode(nodeId);
if(!node){
continue;
}
if(node.type === "group"){
let result = isInSubGroup(targetNode, node);
if(result === true){
_result = true;
break;
}
}
}
}
return _result;
};
result = isInSubGroup(nodeIdB, group);
}
return result;
}
/**
* Start this flow.