virtua 0.52.7 → 0.52.8

package/lib/index.js

@@ -13,93 +13,86 @@ var f, u = [], {min: d, max: h, abs: g, floor: $} = Math, p = (e, t, o) => d(o,
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, I = () => (null == f && (f = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
-f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m: i, S: c, _: a}, f = 0) => {
-    let u = !!a, $ = !!f, p = 1, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, b = null, k = [ 0, $ ? h(f - 1, 0) : -1 ], R = 0, T = !1;
-    const M = /* @__PURE__ */ new Set, C = () => S - w, O = () => C() + v + _, E = e => o(e) - v, L = e => {
-        e && (I() && 0 !== y || b && 1 === x ? v += e : _ += e);
+}, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, b = () => (null == f && (f = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
+f), I = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m: i, S: c, _: a, v: f}, u = 0) => {
+    let $ = !!u, p = 1, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, I = null, k = [ 0, $ ? h(u - 1, 0) : -1 ], R = !1;
+    const T = /* @__PURE__ */ new Set, M = () => S - w, C = () => M() + v + _, O = e => o(e) - v, E = e => {
+        if (2 === x) return !0;
+        if (I && 1 === x) return e < I[0];
+        const t = M(), o = O(e), r = n(e);
+        return 1 !== y && 0 === x ? o + r <= t : o < t && o + r < t + m;
+    }, L = e => {
+        e && (b() && 0 !== y || I && 1 === x ? v += e : _ += e);
     };
     return {
-        v: () => {
-            M.clear();
+        I: () => {
+            T.clear();
         },
-        I: () => p,
+        k: () => p,
         l: (t = 200) => {
-            if (!T || $) return k;
+            if (!R || $) return k;
             let o, n;
             if (z) [o, n] = k; else {
-                let r = h(0, O()), s = r + m;
-                u || (t = h(0, t), 1 !== y && (r -= t), 2 !== y && (s += t)), [o, n] = k = e(h(0, r), h(0, s)), 
-                b && (o = d(o, b[0]), n = h(n, b[1]));
+                let r = h(0, C()), s = r + m;
+                c() || (t = h(0, t), 1 !== y && (r -= t), 2 !== y && (s += t)), [o, n] = k = e(h(0, r), h(0, s)), 
+                I && (o = d(o, I[0]), n = h(n, I[1]));
             }
-            return [ h(o, 0), d(n, i() - 1) ];
+            return [ h(o, 0), d(n, l() - 1) ];
         },
-        k: e => t(e - w),
-        R: s,
-        u: E,
+        R: e => t(e - w),
+        T: r,
+        u: O,
         h: n,
-        T: i,
-        M: () => S,
-        C: () => 0 !== y,
+        M: l,
+        C: () => S,
+        O: () => 0 !== y,
         o: () => m,
-        O: () => w,
-        t: l,
-        L: () => (z = _, _ = 0, [ z, 2 === x ]),
+        L: () => w,
+        t: s,
+        W: () => (z = _, _ = 0, [ z, 2 === x ]),
         A: (e, t) => {
             const o = [ e, t ];
-            return M.add(o), () => {
-                M.delete(o);
+            return T.add(o), () => {
+                T.delete(o);
             };
         },
-        W: (o, i) => {
-            let f, d, h = 0;
-            switch (o) {
+        H: (t, o) => {
+            let n, l, c = 0;
+            switch (t) {
               case 1:
                 {
-                    if (i === S && 0 === x) break;
+                    if (o === S && 0 === x) break;
                     const e = z;
                     z = 0;
-                    const t = i - S, o = g(t);
-                    e && o < g(e) + 1 || 0 !== x || (y = t < 0 ? 2 : 1), $ && ($ = !1), S = i, h = 4;
-                    const n = C();
-                    n >= -m && n <= l() && (h += 1, d = o > m);
+                    const t = o - S, n = g(t);
+                    e && n < g(e) + 1 || 0 !== x || (y = t < 0 ? 2 : 1), $ && ($ = !1), S = o, c = 4;
+                    const r = M();
+                    r >= -m && r <= s() && (c += 1, l = n > m);
                     break;
                 }
 
               case 2:
-                h = 8, 0 !== y && (f = !0, h += 1), y = 0, x = 0, b = null;
+                c = 8, 0 !== y && (n = !0, c += 1), y = 0, x = 0, I = null;
                 break;
 
               case 3:
                 {
-                    const e = i.filter(([e, t]) => !s(e, t));
+                    const e = o.filter(([e, t]) => !r(e, t));
                     if (!e.length) break;
-                    L(e.reduce((e, [t, o]) => {
-                        let r;
-                        if (2 === x) r = !0; else if (b && 1 === x) r = t < b[0]; else {
-                            const e = C(), o = E(t), s = n(t);
-                            r = 1 !== y && 0 === x ? o + s <= e : o < e && o + s < e + m;
-                        }
-                        return r && (e += o - n(t)), e;
-                    }, 0));
-                    for (const [t, o] of e) {
-                        const e = n(t), s = r(t, o);
-                        u && (R += s ? o : o - e);
-                    }
-                    u && m && R > m && (L(a(t(O()))), u = !1), h = 3, d = !0;
+                    L(a(e, E, C(), m)), c = 3, l = !0;
                     break;
                 }
 
               case 4:
-                m !== i && (m || (T = d = !0), m = i, h = 3);
+                m !== o && (m || (R = l = !0), m = o, c = 3);
                 break;
 
               case 5:
-                i[1] ? (L(c(i[0], !0)), x = 2, h = 1) : (c(i[0]), h = 1);
+                o[1] ? (L(i(o[0], !0)), x = 2, c = 1) : (i(o[0]), c = 1);
                 break;
 
               case 6:
-                w = i;
+                w = o;
                 break;
 
               case 7:
@@ -107,14 +100,17 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
                 break;
 
               case 9:
-                L(i), h = 3;
-                break;
+                {
+                    const e = f(o, C());
+                    null != e && (L(e), c = 3);
+                    break;
+                }
 
               case 8:
-                b = e(i, i + m), h = 1;
+                I = e(o, o + m), c = 1;
             }
-            h && (p = 1 + (2147483647 & p), f && v && (_ += v, v = 0), M.forEach(([e, t]) => {
-                h & e && t(d);
+            c && (p = 1 + (2147483647 & p), n && v && (_ += v, v = 0), T.forEach(([e, t]) => {
+                c & e && t(l);
             }));
         }
     };
@@ -130,140 +126,140 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
     }
     return p(s, 0, t - 1);
 }, M = (e, t, o) => {
-    let n = o && o[1] || t || 40, r = -1, s = 0;
-    const l = o && o[0], i = l ? R(l.slice(0, d(e, l.length)), h(0, e - l.length)) : R([], e), c = R([], e + 1), a = e => {
-        const t = i[e];
+    let n = o && o[1] || t || 40, r = -1, s = 0, l = !t, i = 0;
+    const c = o && o[0], a = c ? R(c.slice(0, d(e, c.length)), h(0, e - c.length)) : R([], e), f = R([], e + 1), u = e => {
+        const t = a[e];
         return -1 === t ? n : t;
-    }, f = t => {
+    }, g = t => {
         if (!e) return 0;
-        if (r >= t) return c[t];
-        r < 0 && (c[0] = 0, r = 0);
-        let o = r, n = c[o];
-        for (;o < t; ) n += a(o), c[++o] = n;
+        if (r >= t) return f[t];
+        r < 0 && (f[0] = 0, r = 0);
+        let o = r, n = f[o];
+        for (;o < t; ) n += u(o), f[++o] = n;
         return r = t, n;
     };
     return {
         l: (t, o) => {
             let n, r;
-            return s = d(s, e - 1), f(s) <= t ? (r = T(f, e, o, s), n = T(f, e, t, s, r)) : (n = T(f, e, t, void 0, s), 
-            r = T(f, e, o, n)), s = n, [ n, r ];
-        },
-        i: t => T(f, e, t),
-        u: f,
-        h: a,
-        $: (e, t) => {
-            const o = -1 === i[e];
-            return i[e] = t, r = d(e, r), o;
-        },
-        p: (e, t = -1) => i[e] === t,
-        t: () => f(e),
-        m: () => e,
-        S: (t, o) => {
+            return i = d(i, e - 1), g(i) <= t ? (r = T(g, e, o, i), n = T(g, e, t, i, r)) : (n = T(g, e, t, void 0, i), 
+            r = T(g, e, o, n)), i = n, [ n, r ];
+        },
+        i: t => T(g, e, t),
+        u: g,
+        h: u,
+        $: (e, t = -1) => a[e] === t,
+        _: (t, o, i, c) => {
+            let f = t.reduce((e, [t, n]) => o(t) ? e + (n - u(t)) : e, 0);
+            for (const [e, o] of t) s += -1 === a[e] ? o : o - u(e), a[e] = o, r = d(e, r);
+            if (l && c && s > c) {
+                let t = 0;
+                const o = T(g, e, i + f), s = [];
+                a.forEach((e, n) => {
+                    -1 !== e && (e && s.push(e), n < o && t++);
+                }), r = -1, m(s);
+                const c = s.length, u = c / 2 | 0, d = c % 2 == 0 ? (s[u - 1] + s[u]) / 2 : s[u], $ = n;
+                f += ((n = d) - $) * h(o - t, 0), l = !1;
+            }
+            return f;
+        },
+        t: () => g(e),
+        p: () => e,
+        m: (t, o) => {
             const s = t - e;
-            return r = o ? -1 : d(t - 1, r), e = t, s > 0 ? (R(c, s), R(i, s, o), n * s) : (c.splice(s), 
-            (o ? i.splice(0, -s) : i.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
-        },
-        _: t ? void 0 : e => {
-            let t = 0;
-            const o = [];
-            i.forEach((n, r) => {
-                -1 !== n && (n && o.push(n), r < e && t++);
-            }), r = -1, m(o);
-            const s = o.length, l = s / 2 | 0, c = s % 2 == 0 ? (o[l - 1] + o[l]) / 2 : o[l], a = n;
-            return ((n = c) - a) * h(e - t, 0);
-        },
-        H: () => [ i.slice(), n ]
+            return r = o ? -1 : d(t - 1, r), e = t, s > 0 ? (R(f, s), R(a, s, o), n * s) : (f.splice(s), 
+            (o ? a.splice(0, -s) : a.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
+        },
+        S: () => l,
+        q: () => [ a.slice(), n ]
     };
 }, C = e => "number" == typeof e ? e : e.length, O = (e, t) => "number" == typeof e ? t : e[t], E = (e, t, o = 0) => {
     let n = C(e);
     const r = "number" == typeof t, s = "auto" === t;
-    let l = (r ? t : 40) + o, i = -1, c = 0, a = 0, f = null;
-    const u = [], g = [], w = [], S = e => s || !!w[e], _ = () => {
-        u.length || R(u, n);
-    }, v = e => {
-        const t = u[e];
+    let l = (r ? t : 40) + o, i = -1, c = 0, a = s, f = 0, u = 0, g = null;
+    const w = [], S = [], _ = [], v = e => s || !!_[e], z = () => {
+        w.length || R(w, n);
+    }, y = e => {
+        const t = w[e];
         return -1 === t ? l : t;
-    }, z = e => {
+    }, x = e => {
         if (!n) return 0;
-        if (!u.length) return e * l;
-        if (i >= e) return g[e];
-        i < 0 && (g[0] = 0, i = 0);
-        let t = i, o = g[t];
-        for (;t < e; ) o += v(t), g[++t] = o;
+        if (!w.length) return e * l;
+        if (i >= e) return S[e];
+        i < 0 && (S[0] = 0, i = 0);
+        let t = i, o = S[t];
+        for (;t < e; ) o += y(t), S[++t] = o;
         return i = e, o;
-    }, y = (e, t) => {
-        u[e] = t, i = d(e, i);
-    }, x = e => u.length ? T(z, n, e) : l ? p($(e / l), 0, n - 1) : 0, I = () => d(c, n), b = () => h(n - a, I());
+    }, b = (e, t) => {
+        w[e] = t, i = d(e, i);
+    }, I = e => w.length ? T(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, k = () => d(f, n), M = () => h(n - u, k()), O = e => (w.length ? y(e) : l) - o;
     return {
         l: (e, t) => {
-            const r = z(I()), s = z(n) - z(b()), l = e + (r ? r - o : 0);
-            return [ x(l), x(h(l, t - (s ? s - o : 0))) ];
-        },
-        i: x,
-        u: z,
-        h: e => (u.length ? v(e) : l) - o,
-        $: (e, t) => {
-            if (!S(e)) return !1;
-            _();
-            const n = -1 === u[e];
-            return y(e, t + o), n;
-        },
-        p: (e, t) => (u.length ? u[e] : -1) === t + o,
-        t: () => n ? z(n) - o : 0,
-        m: () => n,
-        S: e => {
+            const r = x(k()), s = x(n) - x(M()), l = e + (r ? r - o : 0);
+            return [ I(l), I(h(l, t - (s ? s - o : 0))) ];
+        },
+        i: I,
+        u: x,
+        h: O,
+        _: (e, t, n, r) => {
+            let s = e.reduce((e, [o, n]) => v(o) && t(o) ? e + (n - O(o)) : e, 0);
+            for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - O(t), b(t, n + o));
+            if (a && r && c > r) {
+                let e = 0;
+                const t = I(n + s), o = [];
+                w.forEach((n, r) => {
+                    -1 !== n && (n && o.push(n), r < t && e++);
+                }), i = -1, m(o);
+                const r = o.length, c = r / 2 | 0, f = r % 2 == 0 ? (o[c - 1] + o[c]) / 2 : o[c], u = l;
+                s += ((l = f) - u) * h(t - e, 0), a = !1;
+            }
+            return s;
+        },
+        $: (e, t = -1) => {
+            const n = w.length ? w[e] : -1;
+            return -1 === t ? v(e) && -1 === n : n === t + o;
+        },
+        t: () => n ? x(n) - o : 0,
+        p: () => n,
+        m: e => {
             const t = e - n;
-            return i = d(e - 1, i), n = e, u.length && (t > 0 ? R(u, t) : u.splice(t)), 0;
-        },
-        _: s ? e => {
-            let t = 0;
-            const o = [];
-            u.forEach((n, r) => {
-                -1 !== n && (n && o.push(n), r < e && t++);
-            }), i = -1, m(o);
-            const n = o.length, r = n / 2 | 0, s = n % 2 == 0 ? (o[r - 1] + o[r]) / 2 : o[r], c = l;
-            return ((l = s) - c) * h(e - t, 0);
-        } : void 0,
-        q: S,
-        P: (e = 0, t = 0) => {
-            c = e, a = t;
-        },
-        B: I,
-        D: b,
-        V: (e, t) => "number" == typeof t ? r ? t : null : r || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
-        X: (e, t) => {
+            return i = d(e - 1, i), n = e, w.length && (t > 0 ? R(w, t) : w.splice(t)), 0;
+        },
+        S: () => a,
+        P: v,
+        B: (e = 0, t = 0) => {
+            f = e, u = t;
+        },
+        V: k,
+        X: M,
+        Y: (e, t) => "number" == typeof t ? r ? t : null : r || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        v: (e, t) => {
             if (null == e) return;
             if ("number" == typeof e) {
                 const n = e + o;
                 if (n === l) return;
-                const r = x(t) * (n - l);
+                const r = I(t) * (n - l);
                 return l = n, r;
             }
-            if (e === f && n === w.length) return;
-            f = e, w.length = n, _();
-            const r = x(t), s = z(r);
+            if (e === g && n === _.length) return;
+            g = e, _.length = n, z();
+            const r = I(t), s = x(r);
             let i;
             for (let t = 0; t < n; t++) {
                 const n = e[t], r = "number" != typeof n;
-                if (!r || !w[t]) {
-                    w[t] = r;
+                if (!r || !_[t]) {
+                    _[t] = r;
                     const e = r ? -1 : n + o;
-                    u[t] !== e && (y(t, e), i = !0);
+                    w[t] !== e && (b(t, e), i = !0);
                 }
             }
-            return i ? z(r) - s : void 0;
+            return i ? x(r) - s : void 0;
         }
     };
-}, L = (e, t, o, n, r, s) => {
-    const l = C(o);
-    t.P(r, s), l !== e.T() && e.W(5, [ l ]);
-    const i = t.X(n, e.M() - e.u(0));
-    null != i && e.W(9, i);
-}, A = /*#__PURE__*/ new WeakMap, W = (e, t, o) => {
+}, L = /*#__PURE__*/ new WeakMap, W = (e, t, o) => {
     const n = [];
     for (const r of e) r >= t && r < o && n.push(r);
     return m(n);
-}, H = (e, t, o) => {
+}, A = (e, t, o) => {
     if (t >= o) return -1;
     let n = 0, r = e.length;
     for (;n < r; ) {
@@ -271,22 +267,22 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         e[o] <= t ? n = o + 1 : r = o;
     }
     return n - 1;
-}, q = (e, t, o, n, r) => {
+}, H = (e, t, o, n, r) => {
     const s = t.length;
     for (;o < s && t[o] < n; o++) {
         const n = t[o];
         n > r && (e.push(n), r = n);
     }
     return o;
-}, P = (e, t, o, n, r, s) => {
+}, q = (e, t, o, n, r, s) => {
     const l = [];
     for (let e = 0; e < o; e++) l.push(e);
-    const i = q(l, e, 0, n, o - 1);
+    const i = H(l, e, 0, n, o - 1);
     for (let e = n; e <= r; e++) l.push(e);
-    q(l, e, i, s, r);
+    H(l, e, i, s, r);
     for (let e = s; e < t; e++) l.push(e);
     return l;
-}, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), D = (e, t) => d(e.colIndex + (e.colSpan || 1), t), V = (e, t, o, n, r, s) => {
+}, P = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), B = (e, t) => d(e.colIndex + (e.colSpan || 1), t), V = (e, t, o, n, r, s) => {
     const l = t.length, i = n.length;
     let c = "[l0]", a = 0, f = 0, u = 0;
     for (;a < s; ) {
@@ -313,13 +309,13 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
 }, Y = e => {
     let t;
     return {
-        Y(o) {
+        J(o) {
             (t || (t = new (x(y(o)).ResizeObserver)(e))).observe(o);
         },
-        J(e) {
+        j(e) {
             t.unobserve(e);
         },
-        j() {
+        D() {
             t && t.disconnect();
         }
     };
@@ -332,40 +328,40 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         });
     }, y = () => {
         if (f || u) return f = !1, void x();
-        d = !1, e.W(2);
+        d = !1, e.H(2);
     }, x = () => {
         S(c), c = w(y, 150);
-    }, b = () => {
-        a = g(), d && (h = !0), l && e.W(6, l()), e.W(1, v()), x();
+    }, I = () => {
+        a = g(), d && (h = !0), l && e.H(6, l()), e.H(1, v()), x();
     }, k = t => {
-        if (f || !e.C() || t.ctrlKey) return;
+        if (f || !e.O() || t.ctrlKey) return;
         const o = g() - a;
         150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (f = !0);
     }, R = () => {
         u = !0, d = h = !1;
     }, T = () => {
-        u = !1, I() && (d = !0);
+        u = !1, b() && (d = !0);
     };
-    return t.addEventListener("scroll", b), t.addEventListener("wheel", k, {
+    return t.addEventListener("scroll", I), t.addEventListener("wheel", k, {
         passive: !0
     }), t.addEventListener("touchstart", R, {
         passive: !0
     }), t.addEventListener("touchend", T, {
         passive: !0
     }), {
-        j: () => {
-            t.removeEventListener("scroll", b), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", R), 
+        D: () => {
+            t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", R), 
             t.removeEventListener("touchend", T), S(c);
         },
         U: () => {
-            const [t, n] = e.L();
+            const [t, n] = e.W();
             if (!t) return;
             h && s && s(), h = !1;
-            const r = e.M() + t;
-            r <= 0 || r >= e.O() + e.t() - e.o() ? z(r) : o.scrollBy({
+            const r = e.C(), l = r + t, c = e.L() + e.t() - e.o();
+            l <= 0 || l >= c || r >= c ? z(l) : o.scrollBy({
                 [p]: m(t),
                 behavior: "instant"
-            }), n && (i && i(), e.o() > e.t() && e.W(1, v()));
+            }), n && (i && i(), e.o() > e.t() && e.H(1, v()));
         },
         F: (t, o) => {
             let n, r, s;
@@ -375,10 +371,10 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
             }, c = () => {
                 if (!n) {
                     if (e.o() && (S(r), r = w(l, 150)), o) {
-                        for (let [t, o] = e.l(0); t <= o; t++) if (e.R(t)) return;
+                        for (let [t, o] = e.l(0); t <= o; t++) if (e.T(t)) return;
                         l();
                     }
-                    e.W(7), z(t(), o);
+                    e.H(7), z(t(), o);
                 }
             }, a = () => {
                 if (n) return;
@@ -389,33 +385,33 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
                     }));
                 }), c();
             };
-            o ? (e.W(8, t()), _(a)) : a();
+            o ? (e.H(8, t()), _(a)) : a();
         }
     };
 }, j = (e, t) => {
     let o, n, r = v();
     const s = /* @__PURE__ */ new WeakMap, l = Y(n => {
         const r = [];
-        for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === o) (i || c) && e.W(4, t ? i : c); else if (l.offsetParent) {
+        for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === o) (i || c) && e.H(4, t ? i : c); else if (l.offsetParent) {
             const e = s.get(l);
             null != e && r.push([ e, t ? i : c ]);
         }
-        r.length && e.W(3, r);
+        r.length && e.H(3, r);
     });
     return {
         G(s, i = s.parentElement) {
-            l.Y(o = i), n = J(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+            l.J(o = i), n = J(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                 const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
                 o[e] = "hidden", w(() => {
                     o[e] = n;
                 });
             }), r[1](!0);
         },
-        v() {
-            l.j(), n && n.j(), r[1](!1), r = v();
+        I() {
+            l.D(), n && n.D(), r[1](!1), r = v();
         },
-        K: (e, t) => (s.set(e, t), l.Y(e), () => {
-            s.delete(e), l.J(e);
+        K: (e, t) => (s.set(e, t), l.J(e), () => {
+            s.delete(e), l.j(e);
         }),
         async N(e, t) {
             await r[0] && n.F(e, t);
@@ -423,9 +419,9 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         Z() {
             n && n.U();
         },
-        ee: e.O
+        ee: e.L
     };
-}, U = (e, t) => {
+}, D = (e, t) => {
     let o, n, r, s, l, i = v();
     const c = /* @__PURE__ */ new WeakMap, a = Y(n => {
         const r = [];
@@ -433,7 +429,7 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
             const o = c.get(e);
             null != o && r.push([ o, t ? s : i ]);
         }
-        r.length && e.W(3, r);
+        r.length && e.H(3, r);
     });
     return {
         G(c) {
@@ -441,17 +437,17 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
                 const s = n ? "offsetLeft" : "offsetTop", l = r + (h ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
                 return e !== o && i ? g(i, t, o, n, l) : l;
             }, $ = s = () => g(c, d, f.body, t), p = l = () => {
-                e.W(4, d[t ? "clientWidth" : "clientHeight"]);
+                e.H(4, d[t ? "clientWidth" : "clientHeight"]);
             };
-            u.addEventListener("resize", p), a.Y(d), r = () => {
+            u.addEventListener("resize", p), a.J(d), r = () => {
                 u.removeEventListener("resize", p);
             }, n = J(e, u, d, t, h, null, $), i[1](!0);
         },
-        v() {
-            r && r(), a.j(), n && n.j(), i[1](!1), i = v();
+        I() {
+            r && r(), a.D(), n && n.D(), i[1](!1), i = v();
         },
-        K: (e, t) => (c.set(e, t), a.Y(e), () => {
-            c.delete(e), a.J(e);
+        K: (e, t) => (c.set(e, t), a.J(e), () => {
+            c.delete(e), a.j(e);
         }),
         async N(e, t) {
             await i[0] && n.F(e, t);
@@ -461,16 +457,16 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         },
         ee: () => s()
     };
-}, F = (e, t) => {
+}, U = (e, t) => {
     let o, n, r, s = v();
     const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = Y(n => {
         const r = [], s = [];
-        for (const {target: c, contentRect: {width: a, height: f}} of n) if (c === o) (a || f) && (e.W(4, f), 
-        t.W(4, a)); else if (c.offsetParent) {
+        for (const {target: c, contentRect: {width: a, height: f}} of n) if (c === o) (a || f) && (e.H(4, f), 
+        t.H(4, a)); else if (c.offsetParent) {
             const e = l.get(c), t = i.get(c);
             null != e && r.push([ e, f ]), null != t && s.push([ t, a ]);
         }
-        r.length && e.W(3, r), s.length && t.W(3, s);
+        r.length && e.H(3, r), s.length && t.H(3, s);
     });
     return {
         async N(e, t) {
@@ -478,7 +474,7 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         },
         G(l) {
             const i = o = l.parentElement;
-            c.Y(i);
+            c.J(i);
             const a = (e, t) => J(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                 const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
                 o[e] = "hidden", w(() => {
@@ -487,34 +483,34 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
             });
             n = a(e, !1), r = a(t, !0), s[1](!0);
         },
-        v() {
-            c.j(), n && n.j(), r && r.j(), s[1](!1), s = v();
+        I() {
+            c.D(), n && n.D(), r && r.D(), s[1](!1), s = v();
         },
-        K: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.Y(e), () => {
-            l.delete(e), i.delete(e), c.J(e);
+        K: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.J(e), () => {
+            l.delete(e), i.delete(e), c.j(e);
         }),
         Z() {
             n && n.U(), r && r.U();
         }
     };
-}, G = (e, t) => {
+}, F = (e, t) => {
     e.N(() => t);
-}, K = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
-    if (o = p(o, 0, t.T() - 1), "nearest" === n) {
-        const e = t.u(o), r = t.M();
+}, G = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
+    if (o = p(o, 0, t.M() - 1), "nearest" === n) {
+        const e = t.u(o), r = t.C();
         if (e < r) n = "start"; else {
             if (!(e + t.h(o) > r + t.o())) return;
             n = "end";
         }
     }
     e.N(() => s + e.ee() + t.u(o) + ("end" === n ? t.h(o) - t.o() : "center" === n ? (t.h(o) - t.o()) / 2 : 0), r);
-}, N = (e, t, o, n, r, s, l) => {
-    const i = t.T(), c = o.B(), a = o.D();
+}, K = (e, t, o, n, r, s, l) => {
+    const i = t.M(), c = o.V(), a = o.X();
     r = p(r, 0, i - 1);
-    const f = W(n, c, a), u = H(f, r, a), g = u < 0 ? -1 : f[u], $ = () => o.u(c) + (g < 0 || g === r ? 0 : o.u(g + 1) - o.u(g)), m = () => o.u(i) - o.u(a);
+    const f = W(n, c, a), u = A(f, r, a), g = u < 0 ? -1 : f[u], $ = () => o.u(c) + (g < 0 || g === r ? 0 : o.u(g + 1) - o.u(g)), m = () => o.u(i) - o.u(a);
     if ("nearest" === s) {
         if (r < c || r >= a) return;
-        const e = $(), o = t.M() + e, n = t.o() - e - m(), l = t.h(r);
+        const e = $(), o = t.C() + e, n = t.o() - e - m(), l = t.h(r);
         let i = t.u(r);
         if (g === r) {
             const e = (u + 1 < f.length ? f[u + 1] : a) - 1;
@@ -529,22 +525,22 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         const e = $(), o = t.h(r) - (t.o() - e - m());
         return t.u(r) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
     });
-}, Q = z ? r : o, Z = "current", ee = (e, t) => {
-    if (Array.isArray(e)) for (const o of e) ee(o, t); else null == e || "boolean" == typeof e || t.push(e);
-}, te = (e, t) => {
+}, N = z ? r : o, Q = "current", Z = (e, t) => {
+    if (Array.isArray(e)) for (const o of e) Z(o, t); else null == e || "boolean" == typeof e || t.push(e);
+}, ee = (e, t) => {
     const o = e.key;
     return null != o ? o : "_" + t;
-}, oe = e => {
+}, te = e => {
     const t = i(null);
     return t.current || (t.current = e());
-}, ne = e => {
+}, oe = e => {
     const t = i(e);
-    return Q(() => {
-        t[Z] = e;
+    return N(() => {
+        t[Q] = e;
     }, [ e ]), t;
-}, re = /*#__PURE__*/ t(({te: e, oe: t, ne: o, re: n, se: r, le: l, ie: a, ce: f}) => {
+}, ne = /*#__PURE__*/ t(({te: e, oe: t, ne: o, re: n, se: r, le: l, ie: a, ce: f}) => {
     const u = i(null);
-    Q(() => t(u[Z], o), [ o ]);
+    N(() => t(u[Q], o), [ o ]);
     const d = s(() => {
         const e = {
             contain: "layout style",
@@ -567,92 +563,92 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         index: o,
         children: e
     });
-}), se = (e, t) => s(() => {
+}), re = (e, t) => s(() => {
     if ("function" == typeof e) return [ o => e(t[o], o), t.length ];
     const o = (e => {
         const t = [];
-        return ee(e, t), t;
+        return Z(e, t), t;
     })(e);
     return [ e => o[e], o.length ];
-}, [ e, t ]), le = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: f, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: S, onScrollEnd: v}, z) => {
-    const [y, x] = se(e, t), I = i(null), R = i(!!g), T = ne(S), C = ne(v), [O, E, L, A] = oe(() => {
+}, [ e, t ]), se = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: f, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: S, onScrollEnd: v}, z) => {
+    const [y, x] = re(e, t), b = i(null), R = i(!!g), T = oe(S), C = oe(v), [O, E, L, W] = te(() => {
         const e = !!f, t = M(x, r, d), o = k(t, g);
         return [ o, t, j(o, e), e ];
     });
-    x !== O.T() && O.W(5, [ x, s ]), h !== O.O() && O.W(6, h);
-    const [W, H] = l(O.I, void 0, O.I), q = O.C(), P = O.t(), B = [], D = e => {
+    x !== O.M() && O.H(5, [ x, s ]), h !== O.L() && O.H(6, h);
+    const [A, H] = l(O.k, void 0, O.k), q = O.O(), P = O.t(), B = [], V = e => {
         const t = y(e);
         /* @__PURE__ */
-        return c(re, {
+        return c(ne, {
             oe: L.K,
             ne: e,
             re: O.u(e),
-            se: O.R(e),
+            se: O.T(e),
             le: p,
             te: t,
-            ie: A,
-            ce: R[Z]
-        }, te(t, e));
+            ie: W,
+            ce: R[Q]
+        }, ee(t, e));
     };
-    if (Q(() => {
-        R[Z] = !1, O.A(1, e => {
+    if (N(() => {
+        R[Q] = !1, O.A(1, e => {
             e ? a(H) : H();
         }), O.A(4, () => {
-            T.current && T.current(O.M());
+            T.current && T.current(O.C());
         }), O.A(8, () => {
             C.current && C.current();
         });
-        const e = I[Z];
+        const e = b[Q];
         return w ? _(() => {
-            w.current && L.G(e, w[Z]);
+            w.current && L.G(e, w[Q]);
         }) : L.G(e), () => {
-            O.v(), L.v();
+            O.I(), L.I();
         };
-    }, []), Q(() => {
+    }, []), N(() => {
         L.Z();
-    }, [ W ]), n(z, () => ({
+    }, [ A ]), n(z, () => ({
         get cache() {
-            return E.H();
+            return E.q();
         },
         get scrollOffset() {
-            return O.M();
+            return O.C();
         },
         get scrollSize() {
-            return b(O);
+            return I(O);
         },
         get viewportSize() {
             return O.o();
         },
-        findItemIndex: O.k,
+        findItemIndex: O.R,
         getItemOffset: O.u,
         getItemSize: O.h,
-        scrollToIndex: (e, t) => K(L, O, e, t),
-        scrollTo: e => G(L, e),
+        scrollToIndex: (e, t) => G(L, O, e, t),
+        scrollTo: e => F(L, e),
         scrollBy: e => ((e, t, o) => {
-            G(e, o + t.M());
+            F(e, o + t.C());
         })(L, O, e)
     }), []), u) {
         const e = new Set(u);
         for (let [t, n] = O.l(o); t <= n; t++) e.add(t);
         m([ ...e ]).forEach(e => {
-            e < x && B.push(D(e));
+            e < x && B.push(V(e));
         });
-    } else for (let [e, t] = O.l(o); e <= t; e++) B.push(D(e));
+    } else for (let [e, t] = O.l(o); e <= t; e++) B.push(V(e));
     /* @__PURE__ */
     return c($, {
-        ref: I,
+        ref: b,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: A ? P : "100%",
-            height: A ? "100%" : P,
+            width: W ? P : "100%",
+            height: W ? "100%" : P,
             pointerEvents: q ? "none" : void 0
         },
         children: B
     });
-}), ie = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: a, item: f, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ c("div", {
+}), le = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: a, item: f, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ c("div", {
     ...g,
     style: {
         display: s ? "inline-block" : "block",
@@ -662,7 +658,7 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         height: "100%",
         ...h
     },
-    children: /* @__PURE__ */ c(le, {
+    children: /* @__PURE__ */ c(se, {
         ref: $,
         data: t,
         bufferSize: o,
@@ -677,50 +673,50 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         onScrollEnd: d,
         children: e
     })
-})), ce = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: f, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p}, m) => {
-    const [w, S] = se(e, t), _ = i(null), v = ne($), z = ne(p), y = i(!!d), [x, I, b, R] = oe(() => {
+})), ie = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: f, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p}, m) => {
+    const [w, S] = re(e, t), _ = i(null), v = oe($), z = oe(p), y = i(!!d), [x, b, I, R] = te(() => {
         const e = !!f, t = M(S, r, u), o = k(t, d);
-        return [ o, t, U(o, e), e ];
+        return [ o, t, D(o, e), e ];
     });
-    S !== x.T() && x.W(5, [ S, s ]);
-    const [T, C] = l(x.I, void 0, x.I), O = x.C(), E = x.t(), L = [];
-    Q(() => (y[Z] = !1, x.A(1, e => {
+    S !== x.M() && x.H(5, [ S, s ]);
+    const [T, C] = l(x.k, void 0, x.k), O = x.O(), E = x.t(), L = [];
+    N(() => (y[Q] = !1, x.A(1, e => {
         e ? a(C) : C();
     }), x.A(4, () => {
         v.current && v.current();
     }), x.A(8, () => {
         z.current && z.current();
-    }), b.G(_[Z]), () => {
-        x.v(), b.v();
-    }), []), Q(() => {
-        b.Z();
+    }), I.G(_[Q]), () => {
+        x.I(), I.I();
+    }), []), N(() => {
+        I.Z();
     }, [ T ]), n(m, () => ({
         get cache() {
-            return I.H();
+            return b.q();
         },
         get scrollOffset() {
-            return x.M();
+            return x.C();
         },
         get viewportSize() {
             return x.o();
         },
-        findItemIndex: x.k,
+        findItemIndex: x.R,
         getItemOffset: x.u,
         getItemSize: x.h,
-        scrollToIndex: (e, t) => K(b, x, e, t)
+        scrollToIndex: (e, t) => G(I, x, e, t)
     }), []);
     for (let [e, t] = x.l(o); e <= t; e++) {
         const t = w(e);
-        L.push(/* @__PURE__ */ c(re, {
-            oe: b.K,
+        L.push(/* @__PURE__ */ c(ne, {
+            oe: I.K,
             ne: e,
             re: x.u(e),
-            se: x.R(e),
+            se: x.T(e),
             le: g,
             te: t,
             ie: R,
-            ce: y[Z]
-        }, te(t, e)));
+            ce: y[Q]
+        }, ee(t, e)));
     }
     /* @__PURE__ */
     return c(h, {
@@ -736,10 +732,10 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         },
         children: L
     });
-}), ae = /*#__PURE__*/ t(({ae: {fe: e, ue: t, de: o, he: n, ge: r, $e: s, pe: l, me: a}, te: f, we: u, Se: d, _e: h, oe: g}) => {
+}), ce = /*#__PURE__*/ t(({ae: {fe: e, ue: t, de: o, he: n, ge: r, $e: s, pe: l, me: a}, te: f, we: u, Se: d, _e: h, oe: g}) => {
     const $ = i(null);
-    return Q(() => {
-        if (null != n || null != r) return g($[Z], n, r);
+    return N(() => {
+        if (null != n || null != r) return g($[Q], n, r);
     }, [ n, r, g ]), /* @__PURE__ */ c("div", {
         ref: $,
         role: s,
@@ -753,11 +749,11 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
             colIndex: e
         })
     });
-}), fe = /*#__PURE__*/ t(({ae: {ve: e, ze: t, me: o}, te: n, we: r, ye: s, oe: l}) => /* @__PURE__ */ c("div", {
+}), ae = /*#__PURE__*/ t(({ae: {ve: e, ze: t, me: o}, te: n, we: r, ye: s, oe: l}) => /* @__PURE__ */ c("div", {
     role: "row",
     "aria-rowindex": e + 1,
     style: o,
-    children: t.map(t => /* @__PURE__ */ c(ae, {
+    children: t.map(t => /* @__PURE__ */ c(ce, {
         ae: t,
         te: n,
         we: r,
@@ -765,21 +761,21 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         _e: e,
         oe: l
     }, t.fe))
-})), ue = ({ae: {xe: e, me: t}, te: o, Ie: n, ye: r, oe: s}) => /* @__PURE__ */ c("div", {
+})), fe = ({ae: {xe: e, me: t}, te: o, be: n, ye: r, oe: s}) => /* @__PURE__ */ c("div", {
     role: "rowgroup",
     style: t,
-    children: e.map(e => /* @__PURE__ */ c(fe, {
+    children: e.map(e => /* @__PURE__ */ c(ae, {
         ae: e,
         te: o,
         we: O(n, e.ve),
         ye: r,
         oe: s
     }, e.ve))
-}), de = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: f, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: _, spans: v, keepMounted: z, bufferSize: y, gap: x = 0, ariaSort: I, onVerticalScroll: R, onHorizontalScroll: T, onScrollEnd: M, style: C, ...q}, Y) => {
-    const J = i(null), j = ne(R), U = ne(T), G = ne(M), [K, ee, te, re, se] = oe(() => {
+}), ue = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: f, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: _, spans: v, keepMounted: z, bufferSize: y, gap: x = 0, ariaSort: b, onVerticalScroll: R, onHorizontalScroll: T, onScrollEnd: M, style: H, ...Y}, J) => {
+    const j = i(null), D = oe(R), F = oe(T), G = oe(M), [Z, ee, ne, re, se] = te(() => {
         const e = E(t, r, x), n = E(o, f, x), s = k(e), l = k(n);
-        return [ s, l, e, n, F(s, l) ];
-    }), le = s(() => te.V(t, r), [ t, r ]), ie = s(() => re.V(o, f), [ o, f ]), ce = s(() => ((e = u) => {
+        return [ s, l, e, n, U(s, l) ];
+    }), le = s(() => ne.Y(t, r), [ t, r ]), ie = s(() => re.Y(o, f), [ o, f ]), ce = s(() => ((e = u) => {
         const t = /* @__PURE__ */ new Map;
         for (const o of e) {
             const e = o.rowIndex + (o.rowSpan || 1);
@@ -790,76 +786,78 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
         }
         return t;
     })(v), [ v ]);
-    L(K, te, t, le, g, w), L(ee, re, o, ie, S, _);
-    const ae = () => K.I() + ee.I(), [de, he] = l(ae, void 0, ae), ge = K.C() || ee.C(), $e = K.u(0), pe = ee.u(0), me = K.T(), we = ee.T(), Se = ((e, t, [o, n], [r, s], l, i = u, c = u, a) => {
-        const f = e.m(), g = t.m(), $ = e.B(), w = e.D(), S = t.B(), _ = t.D();
+    ne.B(g, w), re.B(S, _);
+    const ue = C(t), de = C(o);
+    ue !== Z.M() && Z.H(5, [ ue ]), de !== ee.M() && ee.H(5, [ de ]), Z.H(9, le), ee.H(9, ie);
+    const he = () => Z.k() + ee.k(), [ge, $e] = l(he, void 0, he), pe = Z.O() || ee.O(), me = Z.u(0), we = ee.u(0), Se = Z.M(), _e = ee.M(), ve = ((e, t, [o, n], [r, s], l, i = u, c = u, a) => {
+        const f = e.p(), g = t.p(), $ = e.V(), w = e.X(), S = t.V(), _ = t.X();
         o = p(o, $, w), n = d(n, w - 1), r = p(r, S, _), s = d(s, _ - 1);
-        const v = W(i, $, w), z = h(S - 1, 0), y = [], x = [], I = [];
-        for (const e of c) e.rowIndex < f && e.colIndex < g && (I.push(e), y.push(e.rowIndex));
-        const b = I.length, k = H(v, o, w), R = k < 0 ? -1 : v[k];
+        const v = W(i, $, w), z = h(S - 1, 0), y = [], x = [], b = [];
+        for (const e of c) e.rowIndex < f && e.colIndex < g && (b.push(e), y.push(e.rowIndex));
+        const I = b.length, k = A(v, o, w), R = k < 0 ? -1 : v[k];
         R >= 0 && y.push(R);
-        const T = P(m(y), f, $, o, n, w);
+        const T = q(m(y), f, $, o, n, w);
         for (let e = 0; e < T.length; e++) for (const t of l.get(T[e]) || u) {
-            const {rowIndex: l, colIndex: i} = t, c = B(t, f), a = D(t, g);
+            const {rowIndex: l, colIndex: i} = t, c = P(t, f), a = B(t, g);
             if ((e < 1 || T[e - 1] < l) && i < g && (c - l > 1 || a - i > 1)) {
                 let e = (l < $ || h(l, o) < d(c, n + 1) || w < c || R >= l && R < c) && (i < S || h(i, r) < d(a, s + 1) || _ < a);
-                for (let t = 0; !e && t < b; t++) {
-                    const o = I[t];
+                for (let t = 0; !e && t < I; t++) {
+                    const o = b[t];
                     e = o.rowIndex >= l && o.rowIndex < c && o.colIndex >= i && o.colIndex < a;
                 }
-                e && I.push(t);
+                e && b.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of I) {
-            const o = H(v, e, w);
+        for (const {rowIndex: e, colIndex: t} of b) {
+            const o = A(v, e, w);
             y.push(e), o >= 0 && y.push(v[o]), x.push(t);
         }
         m(y), m(x);
-        const M = P(y, f, $, o, n, w), C = P(x, g, S, r, s, _), O = M.length, E = C.length, L = /* @__PURE__ */ new Map, q = [], Y = [];
-        for (const e of I) {
-            const t = B(e, f), o = D(e, g);
-            q.push(t), Y.push(o);
+        const M = q(y, f, $, o, n, w), C = q(x, g, S, r, s, _), O = M.length, E = C.length, H = /* @__PURE__ */ new Map, Y = [], J = [];
+        for (const e of b) {
+            const t = P(e, f), o = B(e, g);
+            Y.push(t), J.push(o);
             const n = C.indexOf(e.colIndex);
             for (let r = M.indexOf(e.rowIndex); r < O && M[r] < t; r++) {
                 const t = M[r] * g;
-                for (let r = n; r < E && C[r] < o; r++) L.set(t + C[r], e);
+                for (let r = n; r < E && C[r] < o; r++) H.set(t + C[r], e);
             }
         }
-        const J = [];
-        for (const e of C) J.push(!t.q(e) && null);
-        const j = [], U = e.u($), F = [];
+        const j = [];
+        for (const e of C) j.push(!t.P(e) && null);
+        const D = [], U = e.u($), F = [];
         let G = F;
-        const K = A.get(e), N = /* @__PURE__ */ new Map;
+        const K = L.get(e), N = /* @__PURE__ */ new Map;
         for (const l of M) {
-            const i = l < $, c = l >= w, u = H(v, l, w), d = i ? 0 : c ? w : u < 0 ? -1 : v[u];
+            const i = l < $, c = l >= w, u = A(v, l, w), d = i ? 0 : c ? w : u < 0 ? -1 : v[u];
             if (l === d) {
                 const e = i ? $ : c ? f : u + 1 < v.length ? v[u + 1] : w;
-                q.push(e);
+                Y.push(e);
                 const t = [];
                 F.push({
-                    be: i ? -1 : c ? -2 : -3 - d,
+                    Ie: i ? -1 : c ? -2 : -3 - d,
                     xe: t,
                     me: X(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
                 }), G = t;
             } else d < 0 && (G = F);
-            const p = u >= 0 && l === d, m = i || c || l === R || l >= o && l <= n, y = p ? U : null, x = l * g, I = K && K.get(l), b = I && I.ze, k = [];
-            let T = 0, M = !e.q(l) && null, O = l + 1, A = !1;
+            const p = u >= 0 && l === d, m = i || c || l === R || l >= o && l <= n, y = p ? U : null, x = l * g, b = K && K.get(l), I = b && b.ze, k = [];
+            let T = 0, M = !e.P(l) && null, O = l + 1, L = !1;
             for (let e = 0; e < E; e++) {
-                const o = C[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = L.get(x + o);
+                const o = C[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = H.get(x + o);
                 if (d ? d.rowIndex === l && d.colIndex === o : m && u) {
-                    const r = d ? B(d, f) : l + 1, s = d ? D(d, g) : o + 1, u = r - l, $ = s - o, m = u > 1, w = $ > 1, S = m || w;
+                    const r = d ? P(d, f) : l + 1, s = d ? B(d, g) : o + 1, u = r - l, $ = s - o, m = u > 1, w = $ > 1, S = m || w;
                     let _, v;
                     O = h(O, r);
                     const y = n ? t.u(o) : null, x = c ? t.u(g) - t.u(s) : null;
-                    !1 !== M || m || (_ = l, M = !0), !1 !== J[e] || w || (v = o, J[e] = !0);
-                    const I = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", R = S ? u : void 0, C = S ? $ : void 0, E = "cell" !== I && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
-                    let L;
-                    if (b) {
-                        const e = b.length;
-                        for (;T < e && b[T].fe < o; ) T++;
-                        T < e && b[T].fe === o && (L = b[T]);
+                    !1 !== M || m || (_ = l, M = !0), !1 !== j[e] || w || (v = o, j[e] = !0);
+                    const b = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", R = S ? u : void 0, C = S ? $ : void 0, E = "cell" !== b && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
+                    let W;
+                    if (I) {
+                        const e = I.length;
+                        for (;T < e && I[T].fe < o; ) T++;
+                        T < e && I[T].fe === o && (W = I[T]);
                     }
-                    if (!L || L.ue !== R || L.de !== C || L.ke !== y || L.Re !== x || L.he !== _ || L.ge !== v || L.$e !== I || L.pe !== E) {
+                    if (!W || W.ue !== R || W.de !== C || W.ke !== y || W.Re !== x || W.he !== _ || W.ge !== v || W.$e !== b || W.pe !== E) {
                         let e = "1/l" + o;
                         S && (e += "/l" + r + "/l" + s);
                         const t = {
@@ -869,24 +867,24 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
                         };
                         m && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), w && (t.width = "0px", 
                         t.minWidth = "100%"), (n || c) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
-                        t.position = "sticky", t.zIndex = 2), L = {
+                        t.position = "sticky", t.zIndex = 2), W = {
                             fe: o,
                             ue: R,
                             de: C,
                             he: _,
                             ge: v,
-                            $e: I,
+                            $e: b,
                             pe: E,
                             me: t,
                             ke: y,
                             Re: x
-                        }, A = !0;
+                        }, L = !0;
                     }
-                    k.push(L);
+                    k.push(W);
                 }
             }
-            if (j.push(M), k.length) {
-                const e = I && !A && I.ze.length === k.length && I.Te === y ? I : {
+            if (D.push(M), k.length) {
+                const e = b && !L && b.ze.length === k.length && b.Te === y ? b : {
                     ve: l,
                     ze: k,
                     me: X(l, O, y, "top", 3),
@@ -895,106 +893,106 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
                 N.set(l, e), G.push(e);
             }
         }
-        return A.set(e, N), {
-            Me: V(e, M, j, m(q), "max-content", f),
-            Ce: V(t, C, J, m(Y), "minmax(max-content,auto)", g),
+        return L.set(e, N), {
+            Me: V(e, M, D, m(Y), "max-content", f),
+            Ce: V(t, C, j, m(J), "minmax(max-content,auto)", g),
             Oe: F
         };
-    })(te, re, K.l(y), ee.l(y), ce, $, z, I), _e = ne(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: a}) => {
-        null != l && N(e, t, n, s, l, c, !1), null != i && N(e, o, r, u, i, a, !0);
-    })(se, K, ee, te, re, $, e));
-    return Q(() => {
+    })(ne, re, Z.l(y), ee.l(y), ce, $, z, b), ze = oe(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: a}) => {
+        null != l && K(e, t, n, s, l, c, !1), null != i && K(e, o, r, u, i, a, !0);
+    })(se, Z, ee, ne, re, $, e));
+    return N(() => {
         const e = e => {
-            e ? a(he) : he();
+            e ? a($e) : $e();
         };
-        K.A(1, e), ee.A(1, e);
+        Z.A(1, e), ee.A(1, e);
         let t = !1;
-        K.A(4, () => {
-            t = !0, j.current && j.current(K.M());
+        Z.A(4, () => {
+            t = !0, D.current && D.current(Z.C());
         }), ee.A(4, () => {
-            t = !0, U.current && U.current(ee.M());
+            t = !0, F.current && F.current(ee.C());
         });
         const o = () => {
-            !t || K.C() || ee.C() || (t = !1, G.current && G.current());
+            !t || Z.O() || ee.O() || (t = !1, G.current && G.current());
         };
-        return K.A(8, o), ee.A(8, o), se.G(J[Z]), () => {
-            K.v(), ee.v(), se.v();
+        return Z.A(8, o), ee.A(8, o), se.G(j[Q]), () => {
+            Z.I(), ee.I(), se.I();
         };
-    }, []), Q(() => {
+    }, []), N(() => {
         se.Z();
-    }, [ de ]), n(Y, () => ({
+    }, [ ge ]), n(J, () => ({
         get verticalScrollOffset() {
-            return K.M();
+            return Z.C();
         },
         get horizontalScrollOffset() {
-            return ee.M();
+            return ee.C();
         },
         get scrollHeight() {
-            return b(K);
+            return I(Z);
         },
         get scrollWidth() {
-            return b(ee);
+            return I(ee);
         },
         get viewportHeight() {
-            return K.o();
+            return Z.o();
         },
         get viewportWidth() {
             return ee.o();
         },
-        findRowIndex: K.k,
-        findColIndex: ee.k,
-        getRowOffset: K.u,
+        findRowIndex: Z.R,
+        findColIndex: ee.R,
+        getRowOffset: Z.u,
         getColOffset: ee.u,
-        getRowSize: K.h,
+        getRowSize: Z.h,
         getColSize: ee.h,
-        scrollToIndex: e => _e[Z](e),
+        scrollToIndex: e => ze[Q](e),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
             null != t && e.N(!1, () => t), null != o && e.N(!0, () => o);
         })(se, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, n, r) => {
             if (null != n) {
-                const o = n + t.M();
+                const o = n + t.C();
                 e.N(!1, () => o);
             }
             if (null != r) {
-                const t = r + o.M();
+                const t = r + o.C();
                 e.N(!0, () => t);
             }
-        })(se, K, ee, e, t)
+        })(se, Z, ee, e, t)
     }), []), /* @__PURE__ */ c("div", {
         role: "table",
-        "aria-rowcount": me,
-        "aria-colcount": we,
-        ...q,
+        "aria-rowcount": Se,
+        "aria-colcount": _e,
+        ...Y,
         style: {
             overflow: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...C
+            ...H
         },
         children: /* @__PURE__ */ c("div", {
-            ref: J,
+            ref: j,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 display: "grid",
-                gridTemplateRows: Se.Me,
-                gridTemplateColumns: Se.Ce,
+                gridTemplateRows: ve.Me,
+                gridTemplateColumns: ve.Ce,
                 gap: x,
-                marginTop: $e,
-                marginInlineStart: pe,
-                height: b(K) - $e,
-                pointerEvents: ge ? "none" : void 0
+                marginTop: me,
+                marginInlineStart: we,
+                height: I(Z) - me,
+                pointerEvents: pe ? "none" : void 0
             },
-            children: Se.Oe.map(n => "xe" in n ? /* @__PURE__ */ c(ue, {
+            children: ve.Oe.map(n => "xe" in n ? /* @__PURE__ */ c(fe, {
                 ae: n,
                 te: e,
-                Ie: t,
+                be: t,
                 ye: o,
                 oe: se.K
-            }, n.be) : /* @__PURE__ */ c(fe, {
+            }, n.Ie) : /* @__PURE__ */ c(ae, {
                 ae: n,
                 te: e,
                 we: O(t, n.ve),
@@ -1005,5 +1003,5 @@ f), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, p: s, t: l, m:
     });
 });
 
-export { de as VGrid, ie as VList, le as Virtualizer, ce as WindowVirtualizer };
+export { ue as VGrid, le as VList, se as Virtualizer, ie as WindowVirtualizer };
 //# sourceMappingURL=index.js.map