// 1array.forEach(()=>{...});// 2array.map(()=>{...});// 3array.reduce(()=>{...});// 4for(leti=0;i<array.length;i++){...}// 5for(letiinarray){if(!array.hasOwnProperty(i))continue;...}// 6for(letiofarray){...}// 7 - do not try this at home!letrecursiveArrayHandling;recursiveArrayHandling=(array,i)=>{i=i||0;constitem=array[i];...if(i+1<array.length)recursiveArrayHandling(array,i+1);};recursiveArrayHandling(array);
I didn't explain much, just wrote down the first few I could think of. I didn't even say why you should avoid recursion (you might overflow the call stack).
Nuh-uh, bronathan! In fact, I assume that the logic / base case of the handling is void-returning.
The return here is purely to opt in to tail call optimization, which means you won't run out of stack :)
Once again, only implemented on Apple browsers at the moment, and probably staying that way.
Your misunderstanding might be resolved if you take the following as an example:
constarray=newArray();array.length=1/0;...
An extreme example, I concede, but as an exercise, you can try to figure out the call stack sizes for different JS engines (and AFAIK they're all smaller than the maximum number the 52bit mantissa of a Number can store).
I guess you could add a few more...
@alex Nicely explained...Thanks..!
I didn't explain much, just wrote down the first few I could think of. I didn't even say why you should avoid recursion (you might overflow the call stack).
I'd be more wary of someone that does #5 :)
Or 2 or 3 for side effects.
So long as you add return:
You will be fine in Apple browsers :D
I knew I forgot something :-)
In any case, you won't be fine if the lenght of the array exceeds the one of the call stack.
Nuh-uh, bronathan! In fact, I assume that the logic / base case of the handling is void-returning.
The
return
here is purely to opt in to tail call optimization, which means you won't run out of stack :)Once again, only implemented on Apple browsers at the moment, and probably staying that way.
Your misunderstanding might be resolved if you take the following as an example:
An extreme example, I concede, but as an exercise, you can try to figure out the call stack sizes for different JS engines (and AFAIK they're all smaller than the maximum number the 52bit mantissa of a Number can store).
Optimized tail calls don't grow the stack.
They're implemented with a goto, it's basically a loop.
On most browsers this will give you a number.
On Safari, Mobile Safari, and some embeddable runtimes like latest Duktape It will be an infinite loop.