(x: Interval | IntervalResult)
| 487 | if (m !== 0) vs = scalePow2(v, -n * m); |
| 488 | } |
| 489 | |
| 490 | const guess = Math.pow(vs, 1 / n); |
| 491 | let lo = guess; |
| 492 | let move = 1; |
| 493 | for (let attempt = 0; powChainUp(lo, n) > vs; attempt++) { |
| 494 | // Giving up is sound, not merely conservative: 0 is below every root of a |
| 495 | // positive number, and `Infinity` is above every root. |
| 496 | if (attempt >= MAX_ROOT_SEARCH_ATTEMPTS) { |
| 497 | lo = 0; |
no test coverage detected