(d, ax, vv, rs, re, rb, ri, bs, be, bb, bi)
| 6463 | } |
| 6464 | } |
| 6465 | function bruteForceBlueFull(d, ax, vv, rs, re, rb, ri, bs, be, bb, bi) { |
| 6466 | var es = 2 * d |
| 6467 | for (var j = bs, bp = es * bs; j < be; ++j, bp += es) { |
| 6468 | var y0 = bb[ax + bp], y1 = bb[ax + bp + d], yi = bi[j] |
| 6469 | Q: for (var i = rs, rp = es * rs; i < re; ++i, rp += es) { |
| 6470 | var x0 = rb[ax + rp], x1 = rb[ax + rp + d], xi = ri[i] |
| 6471 | if (y1 < x0 || x1 < y0) continue |
| 6472 | for (var k = ax + 1; k < d; ++k) { |
| 6473 | var r0 = rb[k + rp], r1 = rb[k + d + rp], b0 = bb[k + bp], b1 = bb[k + d + bp] |
| 6474 | if (r1 < b0 || b1 < r0) continue Q |
| 6475 | } |
| 6476 | var rv = vv(xi, yi) |
| 6477 | if (rv !== void 0) return rv |
| 6478 | } |
| 6479 | } |
| 6480 | } |
| 6481 | function bruteForceFull(d, ax, vv, rs, re, rb, ri, bs, be, bb, bi) { |
| 6482 | if (re - rs > be - bs) { |
| 6483 | return bruteForceRedFull(d, ax, vv, rs, re, rb, ri, bs, be, bb, bi) |
no outgoing calls
no test coverage detected
searching dependent graphs…