virtua 0.53.0 → 0.53.2

package/lib/core/index.cjs

@@ -182,8 +182,8 @@ t), m = (t, e, o) => {
 };
 
 exports.ACTION_ITEMS_LENGTH_CHANGE = 5, exports.ACTION_RELAYOUT = 9, exports.ACTION_START_OFFSET_CHANGE = 6, 
-exports.UPDATE_SCROLL_END_EVENT = 8, exports.UPDATE_SCROLL_EVENT = 4, exports.UPDATE_VIRTUAL_STATE = 1, 
-exports.createContainerDriver = (t, e) => {
+exports.UPDATE_SCROLL_END_EVENT = 8, exports.UPDATE_SCROLL_EVENT = 4, exports.UPDATE_SIZE_EVENT = 2, 
+exports.UPDATE_VIRTUAL_STATE = 1, exports.createContainerDriver = (t, e) => {
     let o, n, r = a(), s = !0;
     const l = /* @__PURE__ */ new WeakMap, c = T(r => {
         const c = [];
@@ -360,18 +360,18 @@ exports.createContainerDriver = (t, e) => {
         O.push(t), o >= 0 && O.push(L[o]), E.push(e);
     }
     c(O), c(E);
-    const A = y(O, d, x, s, i, w), B = y(E, m, v, f, u, T), J = A.length, V = B.length, X = /* @__PURE__ */ new Map, Y = [], j = [];
+    const A = y(O, d, x, s, i, w), V = y(E, m, v, f, u, T), B = A.length, J = V.length, X = /* @__PURE__ */ new Map, Y = [], j = [];
     for (const t of _) {
         const e = I(t, d), o = z(t, m);
         Y.push(e), j.push(o);
-        const n = B.indexOf(t.colIndex);
-        for (let r = A.indexOf(t.rowIndex); r < J && A[r] < e; r++) {
+        const n = V.indexOf(t.colIndex);
+        for (let r = A.indexOf(t.rowIndex); r < B && A[r] < e; r++) {
             const e = A[r] * m;
-            for (let r = n; r < V && B[r] < o; r++) X.set(e + B[r], t);
+            for (let r = n; r < J && V[r] < o; r++) X.set(e + V[r], t);
         }
     }
     const D = [];
-    for (const t of B) D.push(!r.$isMeasurable(t) && null);
+    for (const t of V) D.push(!r.$isMeasurable(t) && null);
     const G = [], U = t.$getItemOffset(x), Z = [];
     let F = Z;
     const H = h.get(t), K = /* @__PURE__ */ new Map;
@@ -389,8 +389,8 @@ exports.createContainerDriver = (t, e) => {
         } else a < 0 && (F = Z);
         const $ = c >= 0 && e === a, p = o || l || e === P || e >= s && e <= i, h = $ ? U : null, b = e * m, y = H && H.get(e), k = y && y.$cells, O = [];
         let E = 0, _ = !t.$isMeasurable(e) && null, q = e + 1, C = !1;
-        for (let t = 0; t < V; t++) {
-            const s = B[t], l = s < v, c = s >= T, i = l || c || s >= f && s <= u, a = X.get(b + s);
+        for (let t = 0; t < J; t++) {
+            const s = V[t], l = s < v, c = s >= T, i = l || c || s >= f && s <= u, a = X.get(b + s);
             if (a ? a.rowIndex === e && a.colIndex === s : p && i) {
                 const i = a ? I(a, d) : e + 1, f = a ? z(a, m) : s + 1, u = i - e, p = f - s, x = u > 1, w = p > 1, h = x || w;
                 let b, S;
@@ -442,7 +442,7 @@ exports.createContainerDriver = (t, e) => {
     }
     return h.set(t, K), {
         $rowTemplate: k(t, A, G, c(Y), "max-content", d),
-        $colTemplate: k(r, B, D, c(j), "minmax(max-content,auto)", m),
+        $colTemplate: k(r, V, D, c(j), "minmax(max-content,auto)", m),
         $groups: Z
     };
 }, exports.createGridSpanIndex = (t = e) => {
@@ -503,179 +503,172 @@ exports.createContainerDriver = (t, e) => {
         $snapshot: () => [ $.slice(), s ]
     };
 }, exports.createMasonryLayout = (t, e, r = 0, s, l) => {
-    let i = n(e, 1), f = i, u = r, a = l && l[1] || s || 40, $ = -1, p = s ? void 0 : /* @__PURE__ */ new Set, g = !s;
-    const d = l && l[0], w = d ? m(d.slice(0, o(t, d.length)), n(0, t - d.length)) : m([], t), h = [], b = [], S = [], v = t => {
-        const e = w[t];
-        return -1 === e ? a : e;
-    }, y = e => {
-        if (e = o(e, t - 1), $ >= e) return;
+    let i = n(e, 1), f = l && l[1] || s || 40, u = -1, a = s ? void 0 : /* @__PURE__ */ new Set, $ = !s;
+    const p = l && l[0], g = p ? m(p.slice(0, o(t, p.length)), n(0, t - p.length)) : m([], t), d = [], w = [], h = [], b = t => {
+        const e = g[t];
+        return -1 === e ? f : e;
+    }, S = e => {
+        if (e = o(e, t - 1), u >= e) return;
         const s = [], l = [];
         for (let t = 0; t < i; t++) s.push(0), l.push(-1);
-        for (let t = $, e = i; t >= 0 && e; t--) {
-            const o = b[t];
-            -1 === l[o] && (l[o] = t, s[o] = h[t] + v(t), e--);
+        for (let t = u, e = i; t >= 0 && e; t--) {
+            const o = w[t];
+            -1 === l[o] && (l[o] = t, s[o] = d[t] + b(t), e--);
         }
-        for (;$ < e; ) {
-            const t = ++$;
+        for (;u < e; ) {
+            const t = ++u;
             let e = 0, o = 1 / 0, c = 1 / 0;
             for (let t = 0; t < i; t++) {
                 const n = s[t] + (l[t] >= 0 ? r : 0);
                 (n < o || n === o && l[t] < c) && (e = t, o = n, c = l[t]);
             }
-            h[t] = o, b[t] = e, s[e] = o + v(t), l[e] = t, S[t] = n(t ? S[t - 1] : 0, s[e]);
+            d[t] = o, w[t] = e, s[e] = o + b(t), l[e] = t, h[t] = n(t ? h[t - 1] : 0, s[e]);
         }
-    }, I = e => e >= t ? k() : (y(e), h[e]), z = t => (y(t), S[t]), k = () => t ? z(t - 1) : 0, M = e => {
+    }, v = e => e >= t ? I() : (S(e), d[e]), y = t => (S(t), h[t]), I = () => t ? y(t - 1) : 0, z = e => {
         if (!t) return 0;
-        const o = x(z, t, e);
-        return z(o) <= e ? o + 1 : o;
+        const o = x(y, t, e);
+        return y(o) <= e ? o + 1 : o;
     };
     return {
         $getRange: (e, n) => {
-            const r = x(I, t, n);
-            return [ o(M(e), r), r ];
+            const r = x(v, t, n);
+            return [ o(z(e), r), r ];
         },
-        $findIndex: e => x(I, t, e),
-        $getItemOffset: I,
-        $getItemSize: v,
-        $isSizeEqual: (t, e = -1) => w[t] === e,
+        $getItemOffset: v,
+        $getItemSize: b,
+        $isSizeEqual: (t, e = -1) => g[t] === e,
         $resize: (e, n, s, l) => {
-            let f = M(s);
-            for (;f > 0 && !n(f - 1); ) f--;
-            for (;f < t && n(f); ) f++;
-            const u = I(f);
-            for (const [t, n] of e) w[t] = n, p && p.add(t), $ = o(t - 1, $);
-            let d = I(f) - u;
-            if (p && l) {
+            let p = z(s);
+            for (;p > 0 && !n(p - 1); ) p--;
+            for (;p < t && n(p); ) p++;
+            const d = v(p);
+            for (const [t, n] of e) g[t] = n, a && a.add(t), u = o(t - 1, u);
+            let m = v(p) - d;
+            if (a && l) {
                 const t = [];
                 let e = 0;
-                if (p.forEach(o => {
-                    const n = w[o];
+                if (a.forEach(o => {
+                    const n = g[o];
                     n > 0 && (t.push(n), e += n + r);
                 }), e > l * i) {
                     c(t);
-                    const e = t.length, o = e / 2 | 0, n = e % 2 == 0 ? (t[o - 1] + t[o]) / 2 : t[o], r = M(s + d), l = I(r);
-                    a = n, $ = -1, d += I(r) - l, p = void 0, g = !1;
+                    const e = t.length, o = e / 2 | 0, n = e % 2 == 0 ? (t[o - 1] + t[o]) / 2 : t[o], r = z(s + m), l = v(r);
+                    f = n, u = -1, m += v(r) - l, a = void 0, $ = !1;
                 }
             }
-            return d;
+            return m;
         },
-        $getTotalSize: k,
+        $getTotalSize: I,
         $getLength: () => t,
         $setLength: e => {
             const n = e - t;
-            return $ = o(e - 1, $), t = e, n > 0 ? m(w, n) : w.splice(n), 0;
-        },
-        $relayout: (t, e) => {
-            if (f === i && u === r) return;
-            const o = M(e), n = I(o);
-            return i = f, r = u, $ = -1, p = s ? void 0 : /* @__PURE__ */ new Set, I(o) - n;
+            return u = o(e - 1, u), t = e, n > 0 ? m(g, n) : g.splice(n), 0;
         },
-        $setOptions: (t, e = 0) => {
-            f = n(t, 1), u = e;
+        $relayout: (t, e = 0, o) => {
+            if ((t = n(t, 1)) === i && e === r) return;
+            const l = z(o), c = v(l);
+            return i = t, r = e, u = -1, a = s ? void 0 : /* @__PURE__ */ new Set, v(l) - c;
         },
-        $isEstimating: () => g,
-        $snapshot: () => [ w.slice(), a ],
+        $isEstimating: () => $,
+        $snapshot: () => [ g.slice(), f ],
         $getLanes: () => i,
         $getGap: () => r,
-        $getItemLane: t => (y(t), b[t])
+        $getItemLane: t => (S(t), w[t])
     };
-}, exports.createVirtualStore = ({$getRange: t, $findIndex: e, $getItemOffset: s, $getItemSize: l, $isSizeEqual: c, $getTotalSize: i, $getLength: f, $setLength: u, $isEstimating: a, $resize: $, $relayout: p}, g = 0) => {
-    let m = !!g, x = 1, w = 0, h = 0, b = 0, S = 0, v = 0, y = 0, I = 0, z = 0, k = null, M = [ 0, m ? n(g - 1, 0) : -1 ], T = !1;
-    const L = /* @__PURE__ */ new Set, R = () => b - h, O = () => R() + v + S, E = t => s(t) - v, _ = t => {
-        if (2 === z) return !0;
-        if (k && 1 === z) return t < k[0];
-        const e = R(), o = E(t), n = l(t);
-        return 1 !== I && 0 === z ? o + n <= e : o < e && o + n < e + w;
-    }, q = t => {
-        t && (d() && 0 !== I || k && 1 === z ? v += t : S += t);
+}, exports.createVirtualStore = ({$getRange: t, $getItemOffset: e, $getItemSize: s, $isSizeEqual: l, $getTotalSize: c, $getLength: i, $setLength: f, $isEstimating: u, $resize: a}, $ = 0) => {
+    let p = !!$, g = 1, m = 0, x = 0, w = 0, h = 0, b = 0, S = 0, v = 0, y = 0, I = null, z = [ 0, p ? n($ - 1, 0) : -1 ], k = !1;
+    const M = /* @__PURE__ */ new Set, T = () => w - x, L = () => T() + b + h, R = t => e(t) - b, O = t => {
+        if (2 === y) return !0;
+        if (I && 1 === y) return t < I[0];
+        const e = T(), o = R(t), n = s(t);
+        return 1 !== v && 0 === y ? o + n <= e : o < e && o + n < e + m;
+    }, E = t => {
+        t && (d() && 0 !== v || I && 1 === y ? b += t : h += t);
     };
     return {
         $dispose: () => {
-            L.clear();
+            M.clear();
         },
-        $getStateVersion: () => x,
+        $getStateVersion: () => g,
         $getRange: (e = 200) => {
-            if (!T || m) return M;
+            if (!k || p) return z;
             let r, s;
-            if (y) [r, s] = M; else {
-                let l = n(0, O()), c = l + w;
-                a() || (e = n(0, e), 1 !== I && (l -= e), 2 !== I && (c += e)), [r, s] = M = t(n(0, l), n(0, c)), 
-                k && (r = o(r, k[0]), s = n(s, k[1]));
+            if (S) [r, s] = z; else {
+                let l = n(0, L()), c = l + m;
+                u() || (e = n(0, e), 1 !== v && (l -= e), 2 !== v && (c += e)), [r, s] = z = t(n(0, l), n(0, c)), 
+                I && (r = o(r, I[0]), s = n(s, I[1]));
             }
-            return [ n(r, 0), o(s, f() - 1) ];
+            return [ n(r, 0), o(s, i() - 1) ];
         },
-        $findItemIndex: t => e(t - h),
-        $isUnmeasuredItem: c,
-        $getItemOffset: E,
-        $getItemSize: l,
-        $getItemsLength: f,
-        $getScrollOffset: () => b,
-        $isScrolling: () => 0 !== I,
-        $getViewportSize: () => w,
-        $getStartSpacerSize: () => h,
-        $getTotalSize: i,
-        $: () => (y = S, S = 0, [ y, 2 === z ]),
+        $isUnmeasuredItem: l,
+        $getItemOffset: R,
+        $getItemSize: s,
+        $getItemsLength: i,
+        $getScrollOffset: () => w,
+        $getVisibleOffset: L,
+        $isScrolling: () => 0 !== v,
+        $getViewportSize: () => m,
+        $getStartSpacerSize: () => x,
+        $getTotalSize: c,
+        $: () => (S = h, h = 0, [ S, 2 === y ]),
         $subscribe: (t, e) => {
             const o = [ t, e ];
-            return L.add(o), () => {
-                L.delete(o);
+            return M.add(o), () => {
+                M.delete(o);
             };
         },
         $update: (e, o) => {
-            let n, s, l = 0;
+            let n, s, i = 0;
             switch (e) {
               case 1:
                 {
-                    if (o === b && 0 === z) break;
-                    const t = y;
-                    y = 0;
-                    const e = o - b, n = r(e);
-                    t && n < r(t) + 1 || 0 !== z || (I = e < 0 ? 2 : 1), m && (m = !1), b = o, l = 4;
-                    const c = R();
-                    c >= -w && c <= i() && (l += 1, s = n > w);
+                    if (o === w && 0 === y) break;
+                    const t = S;
+                    S = 0;
+                    const e = o - w, n = r(e);
+                    t && n < r(t) + 1 || 0 !== y || (v = e < 0 ? 2 : 1), p && (p = !1), w = o, i = 4;
+                    const l = T();
+                    l >= -m && l <= c() && (i += 1, s = n > m);
                     break;
                 }
 
               case 2:
-                l = 8, 0 !== I && (n = !0, l += 1), I = 0, z = 0, k = null;
+                i = 8, 0 !== v && (n = !0, i += 1), v = 0, y = 0, I = null;
                 break;
 
               case 3:
                 {
-                    const t = o.filter(([t, e]) => !c(t, e));
+                    const t = o.filter(([t, e]) => !l(t, e));
                     if (!t.length) break;
-                    q($(t, _, O(), w)), l = 3, s = !0;
+                    E(a(t, O, L(), m)), i = 3, s = !0;
                     break;
                 }
 
               case 4:
-                w !== o && (w || (T = s = !0), w = o, l = 3);
+                m !== o && (m || (k = s = !0), m = o, i = 3);
                 break;
 
               case 5:
-                o[1] ? (q(u(o[0], !0)), z = 2, l = 1) : (u(o[0]), l = 1);
+                o[1] ? (E(f(o[0], !0)), y = 2, i = 1) : (f(o[0]), i = 1);
                 break;
 
               case 6:
-                h = o;
+                x = o;
                 break;
 
               case 7:
-                z = 1;
+                y = 1;
                 break;
 
               case 9:
-                {
-                    const t = p(o, O());
-                    null != t && (q(t), l = 3);
-                    break;
-                }
+                null != o && (E(o), i = 3);
+                break;
 
               case 8:
-                k = t(o, o + w), l = 1;
+                I = t(o, o + m), i = 1;
             }
-            l && (x = 1 + (2147483647 & x), n && v && (S += v, v = 0), L.forEach(([t, e]) => {
-                l & t && e(s);
+            i && (g = 1 + (2147483647 & g), n && b && (h += b, b = 0), M.forEach(([t, e]) => {
+                i & t && e(s);
             }));
         }
     };