| 23768 | for (let t = 1; t <= iF; ++t) |
| 23769 | ((aF[t] = (aF[t - 1] << 1) | 1), (oF[t] = ~aF[t])); |
| 23770 | function sF(t, e, n) { |
| 23771 | const r = Math.max(1, Math.sqrt((t * e) / 1e6)), |
| 23772 | i = ~~((t + 2 * n + r) / r), |
| 23773 | o = ~~((e + 2 * n + r) / r), |
| 23774 | a = (t) => ~~((t + n) / r); |
| 23775 | return ( |
| 23776 | (a.invert = (t) => t * r - n), |
| 23777 | (a.bitmap = () => |
| 23778 | (function (t, e) { |
| 23779 | const n = new Uint32Array(~~((t * e + iF) / iF)); |
| 23780 | function r(t, e) { |
| 23781 | n[t] |= e; |
| 23782 | } |
| 23783 | function i(t, e) { |
| 23784 | n[t] &= e; |
| 23785 | } |
| 23786 | return { |
| 23787 | array: n, |
| 23788 | get: (e, r) => { |
| 23789 | const i = r * t + e; |
| 23790 | return n[i >>> nF] & (1 << (i & rF)); |
| 23791 | }, |
| 23792 | set: (e, n) => { |
| 23793 | const i = n * t + e; |
| 23794 | r(i >>> nF, 1 << (i & rF)); |
| 23795 | }, |
| 23796 | clear: (e, n) => { |
| 23797 | const r = n * t + e; |
| 23798 | i(r >>> nF, ~(1 << (r & rF))); |
| 23799 | }, |
| 23800 | getRange: (e, r, i, o) => { |
| 23801 | let a, |
| 23802 | s, |
| 23803 | u, |
| 23804 | l, |
| 23805 | c = o; |
| 23806 | for (; c >= r; --c) |
| 23807 | if ( |
| 23808 | ((a = c * t + e), |
| 23809 | (s = c * t + i), |
| 23810 | (u = a >>> nF), |
| 23811 | (l = s >>> nF), |
| 23812 | u === l) |
| 23813 | ) { |
| 23814 | if (n[u] & oF[a & rF] & aF[1 + (s & rF)]) return !0; |
| 23815 | } else { |
| 23816 | if (n[u] & oF[a & rF]) return !0; |
| 23817 | if (n[l] & aF[1 + (s & rF)]) return !0; |
| 23818 | for (let t = u + 1; t < l; ++t) if (n[t]) return !0; |
| 23819 | } |
| 23820 | return !1; |
| 23821 | }, |
| 23822 | setRange: (e, n, i, o) => { |
| 23823 | let a, s, u, l, c; |
| 23824 | for (; n <= o; ++n) |
| 23825 | if ( |
| 23826 | ((a = n * t + e), |
| 23827 | (s = n * t + i), |