3 ms·
Unfortunately, that requires repeating the entire body of the loop, and so isn't workable/acceptable for our purposes. If you'd like to see the original conver
by jashkenas 15y ago
Unfortunately, that requires repeating the entire body of the loop, and so isn't workable/acceptable for our purposes. If you'd like to see the original conversation that led to the current compilation, it's all available on the GitHub issues.
- repsilat 15y agoI'll have a look for the discussion. Any idea if the branches are more expensive than some multiplies? step = (a<=b)?1:-1; for (i = a; step*i < step*b; i += step) { doSomething(); } I guess if the branch predictor is any good it could be slower with multiplies, but I have no idea what to expect in a dynamic language.