mirror of
https://github.com/n8n-io/n8n.git
synced 2024-11-09 22:24:05 -08:00
⚡ Fix spelling
This commit is contained in:
parent
71dccbba5c
commit
223cd75685
|
@ -457,10 +457,10 @@ export function getParameterResolveOrder(nodePropertiesArray: INodeProperties[],
|
||||||
let lastIndexLength = indexToResolve.length;
|
let lastIndexLength = indexToResolve.length;
|
||||||
let lastIndexReduction = -1;
|
let lastIndexReduction = -1;
|
||||||
|
|
||||||
let itterations = 0 ;
|
let iterations = 0 ;
|
||||||
|
|
||||||
while (indexToResolve.length !== 0) {
|
while (indexToResolve.length !== 0) {
|
||||||
itterations += 1;
|
iterations += 1;
|
||||||
|
|
||||||
index = indexToResolve.shift() as number;
|
index = indexToResolve.shift() as number;
|
||||||
property = nodePropertiesArray[index];
|
property = nodePropertiesArray[index];
|
||||||
|
@ -491,10 +491,10 @@ export function getParameterResolveOrder(nodePropertiesArray: INodeProperties[],
|
||||||
resolvedParamters.push(property.name);
|
resolvedParamters.push(property.name);
|
||||||
|
|
||||||
if (indexToResolve.length < lastIndexLength) {
|
if (indexToResolve.length < lastIndexLength) {
|
||||||
lastIndexReduction = itterations;
|
lastIndexReduction = iterations;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (itterations > lastIndexReduction + nodePropertiesArray.length) {
|
if (iterations > lastIndexReduction + nodePropertiesArray.length) {
|
||||||
throw new Error('Could not resolve parameter depenencies. Max iterations reached! Hint: If `displayOptions` are specified in any child parameter of a parent `collection` or `fixedCollection`, remove the `displayOptions` from the child parameter.');
|
throw new Error('Could not resolve parameter depenencies. Max iterations reached! Hint: If `displayOptions` are specified in any child parameter of a parent `collection` or `fixedCollection`, remove the `displayOptions` from the child parameter.');
|
||||||
}
|
}
|
||||||
lastIndexLength = indexToResolve.length;
|
lastIndexLength = indexToResolve.length;
|
||||||
|
|
Loading…
Reference in a new issue