virtua 0.49.0 → 0.49.2

package/lib/vue/VList.d.ts

@@ -20,6 +20,9 @@ interface VListInstance<T = unknown> extends VListHandle {
         }) => VNode[];
     };
 }
+/**
+ * Virtualized list component. See {@link VListProps} and {@link VListHandle}.
+ */
 export declare const VList: {
     new <T = unknown>(props: VListProps<T>): VListInstance<T>;
 };

package/lib/vue/Virtualizer.d.ts

@@ -139,6 +139,9 @@ export interface VirtualizerHandle {
      */
     scrollBy(offset: number): void;
 }
+/**
+ * Customizable list virtualizer for advanced usage. See {@link VirtualizerProps} and {@link VirtualizerHandle}.
+ */
 export declare const Virtualizer: {
     new <T = unknown>(props: VirtualizerProps<T>): VirtualizerInstance<T>;
 };

package/lib/vue/WindowVirtualizer.d.ts

@@ -1,5 +1,5 @@
 /** @jsxImportSource vue */
-import { type VNode, type PublicProps, type IntrinsicElementAttributes } from "vue";
+import { type VNode, type NativeElements, type PublicProps } from "vue";
 import { type ScrollToIndexOpts, type CacheSnapshot } from "../core/index.js";
 /**
  * Props of {@link WindowVirtualizer}.
@@ -33,12 +33,12 @@ export interface WindowVirtualizerProps<T = unknown> extends PublicProps {
      * Component or element type for container element.
      * @defaultValue "div"
      */
-    as?: keyof IntrinsicElementAttributes;
+    as?: keyof NativeElements;
     /**
      * Component or element type for item element.
      * @defaultValue "div"
      */
-    item?: keyof IntrinsicElementAttributes;
+    item?: keyof NativeElements;
     /**
      * You can restore cache by passing a {@link CacheSnapshot} on mount. This is useful when you want to restore scroll position after navigation. The snapshot can be obtained from {@link WindowVirtualizerHandle.cache}.
      *
@@ -101,6 +101,9 @@ export interface WindowVirtualizerHandle {
      */
     scrollToIndex(index: number, opts?: ScrollToIndexOpts): void;
 }
+/**
+ * {@link Virtualizer} controlled by the window scrolling. See {@link WindowVirtualizerProps} and {@link WindowVirtualizerHandle}.
+ */
 export declare const WindowVirtualizer: {
     new <T = unknown>(props: WindowVirtualizerProps<T>): WindowVirtualizerInstance<T>;
 };

package/lib/vue/index.cjs

@@ -1,12 +1,12 @@
 var e = require("vue");
 
-const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n, o(t, e)), l = e => [ ...e ].sort(((e, t) => e - t)), c = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n, o(t, e)), l = e => [ ...e ].sort((e, t) => e - t), c = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
 }, a = () => {
     let e;
-    return [ new Promise((t => {
+    return [ new Promise(t => {
         e = t;
-    })), e ];
+    }), e ];
 }, u = e => {
     let t;
     return () => (e && (t = e(), e = void 0), t);
@@ -37,8 +37,8 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
 }, _ = (e, t, o) => {
     const n = t - e.l;
     return e.i = o ? -1 : r(t - 1, e.i), e.l = t, n > 0 ? (f(e.u, n), f(e.t, n, o), 
-    e.o * n) : (e.u.splice(n), (o ? e.t.splice(0, -n) : e.t.splice(n)).reduce(((t, r) => t - (-1 === r ? e.o : r)), 0));
-}, b = e => e.documentElement, g = e => e.ownerDocument, v = e => e.defaultView, y = /*#__PURE__*/ u((() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0)), S = /*#__PURE__*/ u((() => "scrollBehavior" in b(document).style)), z = (e, s = 40, i = 0, c, a = !1) => {
+    e.o * n) : (e.u.splice(n), (o ? e.t.splice(0, -n) : e.t.splice(n)).reduce((t, r) => t - (-1 === r ? e.o : r), 0));
+}, b = e => e.documentElement, g = e => e.ownerDocument, v = e => e.defaultView, y = /*#__PURE__*/ u(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), S = /*#__PURE__*/ u(() => "scrollBehavior" in b(document).style), z = (e, s = 40, i = 0, c, a = !1) => {
     let u = !!i, b = 1, g = 0, v = 0, S = 0, z = 0, x = 0, $ = 0, w = 0, I = 0, O = t, k = [ 0, u ? o(i - 1, 0) : -1 ], j = 0, N = !1;
     const q = ((e, t, n) => ({
         o: t,
@@ -115,16 +115,16 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
 
               case 3:
                 {
-                    const e = r.filter((([e, t]) => !C(e, t)));
+                    const e = r.filter(([e, t]) => !C(e, t));
                     if (!e.length) break;
-                    H(e.reduce(((e, [t, r]) => {
+                    H(e.reduce((e, [t, r]) => {
                         let o;
                         if (2 === I) o = !0; else if (O && 1 === I) o = t < O[0]; else {
                             const e = T(), r = R(t), n = A(t);
-                            o = 1 !== w && 0 === I ? r + n < e : r < e && r + n < e + g;
+                            o = 1 !== w && 0 === I ? r + n <= e : r < e && r + n < e + g;
                         }
                         return o && (e += r - A(t)), e;
-                    }), 0));
+                    }, 0));
                     for (const [t, r] of e) {
                         const e = A(t), o = p(q, t, r);
                         a && (j += o ? r : r - e);
@@ -132,9 +132,9 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                     a && g && j > g && (H(((e, t) => {
                         let r = 0;
                         const n = [];
-                        e.t.forEach(((e, o) => {
+                        e.t.forEach((e, o) => {
                             -1 !== e && (n.push(e), o < t && r++);
-                        })), e.i = -1;
+                        }), e.i = -1;
                         const s = l(n), i = s.length, c = i / 2 | 0, a = i % 2 == 0 ? (s[c - 1] + s[c]) / 2 : s[c], u = e.o;
                         return ((e.o = a) - u) * o(t - r, 0);
                     })(q, h(q, M()))), a = !1), c = 3, i = !0;
@@ -160,9 +160,9 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
               case 8:
                 O = E(r, r + g), c = 1;
             }
-            c && (b = 1 + (2147483647 & b), s && x && (z += x, x = 0), B.forEach((([e, t]) => {
+            c && (b = 1 + (2147483647 & b), s && x && (z += x, x = 0), B.forEach(([e, t]) => {
                 c & e && t(i);
-            })));
+            }));
         }
     };
 }, x = setTimeout, $ = (e, t) => t ? -e : e, w = (e, r, o, n, s, i) => {
@@ -173,12 +173,12 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
         const o = () => {
             r != t && clearTimeout(r);
         }, n = () => {
-            o(), r = x((() => {
+            o(), r = x(() => {
                 r = t, (() => {
                     if (a || u) return a = !1, void p();
                     f = !1, e.A(2);
                 })();
-            }), 150);
+            }, 150);
         };
         return n.C = o, n;
     })(), m = () => {
@@ -217,11 +217,11 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
             const [t, r] = a();
             return o = () => {
                 r(!1);
-            }, e.B() && x(o, 150), [ t, e.R(2, (() => {
+            }, e.B() && x(o, 150), [ t, e.R(2, () => {
                 r(!0);
-            })) ];
+            }) ];
         };
-        if (s && S()) e.A(8, n()), c((async () => {
+        if (s && S()) e.A(8, n()), c(async () => {
             for (;;) {
                 let t = !0;
                 for (let [r, o] = e.v(); r <= o; r++) if (e.I(r)) {
@@ -237,7 +237,7 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                 }
             }
             e.A(7), r(n(), s);
-        })); else for (;;) {
+        }); else for (;;) {
             const [t, o] = i();
             try {
                 if (e.A(7), r(n()), !await t) return;
@@ -299,10 +299,10 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
         ee: Object
     },
     setup(t) {
-        const r = e.ref(), o = e.computed((() => t.L.value && t.W.O(t.D, t.K))), n = e.computed((() => t.L.value && t.W.I(t.D)));
-        return e.watch((() => r.value && t.D), ((e, o, n) => {
+        const r = e.ref(), o = e.computed(() => t.L.value && t.W.O(t.D, t.K)), n = e.computed(() => t.L.value && t.W.I(t.D));
+        return e.watch(() => r.value && t.D, (e, o, n) => {
             n(t.Y(r.value, t.D));
-        }), {
+        }, {
             flush: "post"
         }), () => {
             const {X: s, U: i, G: l, Z: c} = t, a = n.value, {style: u, ...f} = t.ee ?? {}, d = {
@@ -363,14 +363,14 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
         let u = !!r.ssrCount;
         const f = r.horizontal, d = e.ref(), p = z(r.data.length, r.itemSize, r.ssrCount, r.cache, !r.itemSize), m = ((e, r) => {
             let o;
-            const n = r ? "width" : "height", s = new WeakMap, i = O((r => {
+            const n = r ? "width" : "height", s = new WeakMap, i = O(r => {
                 const i = [];
                 for (const {target: l, contentRect: c} of r) if (l.offsetParent) if (l === o) e.A(4, c[n]); else {
                     const e = s.get(l);
                     e != t && i.push([ e, c[n] ]);
                 }
                 i.length && e.A(3, i);
-            }));
+            });
             return {
                 te(e) {
                     i.F(o = e);
@@ -382,33 +382,33 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
             };
         })(p, f), h = ((e, t) => {
             let r, o, n = a(), s = !1;
-            const l = t ? "scrollLeft" : "scrollTop", c = t ? "overflowX" : "overflowY", [u, f] = I(e, (() => n[0]), ((e, o) => {
+            const l = t ? "scrollLeft" : "scrollTop", c = t ? "overflowX" : "overflowY", [u, f] = I(e, () => n[0], (e, o) => {
                 e = $(e, s), o ? r.scrollTo({
                     [t ? "left" : "top"]: e,
                     behavior: "smooth"
                 }) : r[l] = e;
-            }));
+            });
             return {
                 oe(i, a) {
-                    r = a, t && (s = "rtl" === getComputedStyle(a).direction), o = w(e, a, t, (() => $(a[l], s)), ((t, r, o) => {
+                    r = a, t && (s = "rtl" === getComputedStyle(a).direction), o = w(e, a, t, () => $(a[l], s), (t, r, o) => {
                         if (o) {
                             const e = a.style, t = e[c];
-                            e[c] = "hidden", x((() => {
+                            e[c] = "hidden", x(() => {
                                 e[c] = t;
-                            }));
+                            });
                         }
                         a[l] = $(e.N() + t, s), r && f();
-                    })), n[1](!0);
+                    }), n[1](!0);
                 },
                 p() {
                     o && o.H(), n[1](!1), n = a();
                 },
                 ne: () => s,
                 se(e) {
-                    u((() => e));
+                    u(() => e);
                 },
                 ie(t) {
-                    t += e.N(), u((() => t));
+                    t += e.N(), u(() => t);
                 },
                 le(t, {align: r, smooth: o, offset: n = 0} = {}) {
                     if (t = i(t, 0, e.j() - 1), "nearest" === r) {
@@ -418,47 +418,47 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                             r = "end";
                         }
                     }
-                    u((() => n + e.T() + e.O(t) + ("end" === r ? e.k(t) - e.B() : "center" === r ? (e.k(t) - e.B()) / 2 : 0)), o);
+                    u(() => n + e.T() + e.O(t) + ("end" === r ? e.k(t) - e.B() : "center" === r ? (e.k(t) - e.B()) / 2 : 0), o);
                 },
                 ce: () => {
                     o && o.V();
                 }
             };
         })(p, f), _ = e.ref(p.m());
-        p.R(1, (() => {
+        p.R(1, () => {
             _.value = p.m();
-        })), p.R(4, (() => {
+        }), p.R(4, () => {
             n("scroll", p.N());
-        })), p.R(8, (() => {
+        }), p.R(8, () => {
             n("scrollEnd");
-        }));
-        const b = e.computed((e => {
+        });
+        const b = e.computed(e => {
             _.value;
             const t = p.v(r.bufferSize);
             return e && N(e, t) ? e : t;
-        })), g = e.computed((() => _.value && p.q())), v = e.computed((() => _.value && p.M()));
-        return e.onMounted((() => {
+        }), g = e.computed(() => _.value && p.q()), v = e.computed(() => _.value && p.M());
+        return e.onMounted(() => {
             u = !1;
-            const t = d.value, o = requestAnimationFrame((() => {
+            const t = d.value, o = requestAnimationFrame(() => {
                 const e = e => {
                     m.te(e), h.oe(t, e);
                 };
                 r.scrollRef ? e(r.scrollRef) : e(t.parentElement);
-            }));
-            e.onUnmounted((() => {
+            });
+            e.onUnmounted(() => {
                 cancelAnimationFrame(o);
-            }));
-        })), e.onUnmounted((() => {
+            });
+        }), e.onUnmounted(() => {
             p.p(), m.p(), h.p();
-        })), e.watch((() => r.data.length), (e => {
+        }), e.watch(() => r.data.length, e => {
             p.A(5, [ e, r.shift ]);
-        })), e.watch((() => r.startMargin), (e => {
+        }), e.watch(() => r.startMargin, e => {
             p.A(6, e);
-        }), {
+        }, {
             immediate: !0
-        }), e.watch([ _ ], (() => {
+        }), e.watch([ _ ], () => {
             h.ce();
-        }), {
+        }, {
             flush: "post"
         }), s({
             get cache() {
@@ -505,9 +505,9 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
             if (r.keepMounted) {
                 const e = new Set(r.keepMounted);
                 for (let [t, r] = b.value; t <= r; t++) e.add(t);
-                l([ ...e ]).forEach((e => {
+                l([ ...e ]).forEach(e => {
                     i.push(a(e));
-                }));
+                });
             } else for (let [e, t] = b.value; e <= t; e++) i.push(a(e));
             return e.createVNode(t, {
                 ref: d,
@@ -620,7 +620,7 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
     emits: [ "scroll", "scrollEnd" ],
     setup(r, {emit: o, slots: n, expose: s}) {
         const l = r.horizontal, u = e.ref(), f = z(r.data.length, r.itemSize, void 0, r.cache, !r.itemSize), d = ((e, r) => {
-            const o = r ? "width" : "height", n = r ? "innerWidth" : "innerHeight", s = new WeakMap, i = O((r => {
+            const o = r ? "width" : "height", n = r ? "innerWidth" : "innerHeight", s = new WeakMap, i = O(r => {
                 const n = [];
                 for (const {target: e, contentRect: i} of r) {
                     if (!e.offsetParent) continue;
@@ -628,7 +628,7 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                     r != t && n.push([ r, i[o] ]);
                 }
                 n.length && e.A(3, n);
-            }));
+            });
             let l;
             return {
                 te(t) {
@@ -648,7 +648,7 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
             };
         })(f, l), p = ((e, t) => {
             let r, o, n = a(), s = !1;
-            const l = t ? "left" : "top", [c] = I(e, (() => n[0]), ((e, t) => {
+            const l = t ? "left" : "top", [c] = I(e, () => n[0], (e, t) => {
                 e = $(e, s);
                 const o = v(g(r));
                 t ? o.scroll({
@@ -657,7 +657,7 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                 }) : o.scroll({
                     [l]: e
                 });
-            })), u = (e, t, r, o, n = 0) => {
+            }), u = (e, t, r, o, n = 0) => {
                 const i = o ? "offsetLeft" : "offsetTop", l = n + (o && s ? r.innerWidth - e[i] - e.offsetWidth : e[i]), c = e.offsetParent;
                 return e !== t && c ? u(c, t, r, o, l) : l;
             };
@@ -665,13 +665,13 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                 oe(i) {
                     r = i;
                     const c = t ? "scrollX" : "scrollY", a = g(i), f = v(a);
-                    t && (s = "rtl" === getComputedStyle(b(a)).direction), o = w(e, f, t, (() => $(f[c], s)), ((t, r) => {
+                    t && (s = "rtl" === getComputedStyle(b(a)).direction), o = w(e, f, t, () => $(f[c], s), (t, r) => {
                         r ? f.scroll({
                             [l]: $(e.N() + t, s)
                         }) : f.scrollBy({
                             [l]: $(t, s)
                         });
-                    }), (() => u(i, a.body, f, t))), n[1](!0);
+                    }, () => u(i, a.body, f, t)), n[1](!0);
                 },
                 p() {
                     o && o.H(), r = void 0, n[1](!1), n = a();
@@ -690,32 +690,32 @@ const t = null, {min: r, max: o, abs: n, floor: s} = Math, i = (e, t, n) => r(n,
                         }
                     }
                     const a = g(r), f = v(a), d = b(a), p = () => e.B() - (t ? d.clientWidth : d.clientHeight);
-                    c((() => l + u(r, a.body, f, t) + e.O(o) + ("end" === n ? e.k(o) - (e.B() - p()) : "center" === n ? (e.k(o) - (e.B() - p())) / 2 : 0)), s);
+                    c(() => l + u(r, a.body, f, t) + e.O(o) + ("end" === n ? e.k(o) - (e.B() - p()) : "center" === n ? (e.k(o) - (e.B() - p())) / 2 : 0), s);
                 }
             };
         })(f, l), m = e.ref(f.m());
-        f.R(1, (() => {
+        f.R(1, () => {
             m.value = f.m();
-        })), f.R(4, (() => {
+        }), f.R(4, () => {
             o("scroll");
-        })), f.R(8, (() => {
+        }), f.R(8, () => {
             o("scrollEnd");
-        }));
-        const h = e.computed((e => {
+        });
+        const h = e.computed(e => {
             m.value;
             const t = f.v(r.bufferSize);
             return e && N(e, t) ? e : t;
-        })), _ = e.computed((() => m.value && f.q())), y = e.computed((() => m.value && f.M()));
-        return e.onMounted((() => {
+        }), _ = e.computed(() => m.value && f.q()), y = e.computed(() => m.value && f.M());
+        return e.onMounted(() => {
             const e = u.value;
             e && (d.te(e), p.oe(e));
-        })), e.onUnmounted((() => {
+        }), e.onUnmounted(() => {
             f.p(), d.p(), p.p();
-        })), e.watch((() => r.data.length), (e => {
+        }), e.watch(() => r.data.length, e => {
             f.A(5, [ e, r.shift ]);
-        })), e.watch([ m ], (() => {
+        }), e.watch([ m ], () => {
             p.ce();
-        }), {
+        }, {
             flush: "post"
         }), s({
             get cache() {