具有递归自调用的重写函数，以便解决RangeError最大调用堆栈大小

Question

I have a function that calls itself and I don't see any potential infinite-loops and I am only running the loop if the counter is less than the length of an array.

Does anyone have any idea why the call stack size is throwing an error?

function train(i, data, n, nTwo, func){
        if(i===data.length && nTwo!==undefined) done();
        else if(netTwo===undefined) func();
        else (new Trainer(n)).workerTrain([data[i]], train(i++,     trainingSet, l, y));
    }
    train(0, trainingSet, l, y);

I can't run this inside a for-loop as I can initiate a worker until the previous one is done. Or at least when I tried to, I got an error. So I'm running the next worker in the previous worker's callback function.

Answer 1

You are using the post-increment operator ( i++ ), which returns the current value before incrementing the variable. In other words, you always call you function with the same i .

Using the pre-incremenet ( ++i ) instead should solve the issue:

else (new Trainer(n)).workerTrain([data[i]], train(++i, trainingSet, l, y));

Answer 2

netTwo is not defined. nTwo is a parameter in the function and used in the first if clause. But the else if clause has an undefined variable named "netTwo." I therefore would expect a problem.