(a, x, lo = 0, hi = a.length)
| 20 | } |
| 21 | |
| 22 | function left(a, x, lo = 0, hi = a.length) { |
| 23 | if (lo < hi) { |
| 24 | if (compare1(x, x) !== 0) return hi; |
| 25 | do { |
| 26 | const mid = (lo + hi) >>> 1; |
| 27 | if (compare2(a[mid], x) < 0) lo = mid + 1; |
| 28 | else hi = mid; |
| 29 | } while (lo < hi); |
| 30 | } |
| 31 | return lo; |
| 32 | } |
| 33 | |
| 34 | function right(a, x, lo = 0, hi = a.length) { |
| 35 | if (lo < hi) { |
no outgoing calls
no test coverage detected
searching dependent graphs…