virtua 0.48.7 → 0.49.0

package/lib/core/index.js

@@ -1,4 +1,4 @@
-const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n, o(r, e)), i = e => [ ...e ].sort(((e, t) => e - t)), c = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+const e = null, {min: t, max: o, abs: r, floor: s} = Math, n = (e, r, s) => t(s, o(r, e)), i = e => [ ...e ].sort(((e, t) => e - t)), c = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
 }, l = () => {
     let e;
@@ -16,8 +16,8 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
     const o = e.t[t];
     return -1 === o ? e.o : o;
 }, $ = (e, o, r) => {
-    const n = -1 === e.t[o];
-    return e.t[o] = r, e.i = t(o, e.i), n;
+    const s = -1 === e.t[o];
+    return e.t[o] = r, e.i = t(o, e.i), s;
 }, d = (e, t) => {
     if (!e.l) return 0;
     if (e.i >= t) return e.u[t];
@@ -28,29 +28,29 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
 }, p = (e, t, o = 0, r = e.l - 1) => {
     let i = o;
     for (;o <= r; ) {
-        const s = n((o + r) / 2);
-        d(e, s) <= t ? (i = s, o = s + 1) : r = s - 1;
+        const n = s((o + r) / 2);
+        d(e, n) <= t ? (i = n, o = n + 1) : r = n - 1;
     }
-    return s(i, 0, e.l - 1);
+    return n(i, 0, e.l - 1);
 }, h = (e, o, r) => {
-    const n = o - e.l;
-    return e.i = r ? -1 : t(o - 1, e.i), e.l = o, n > 0 ? (a(e.u, n), a(e.t, n, r), 
-    e.o * n) : (e.u.splice(n), (r ? e.t.splice(0, -n) : e.t.splice(n)).reduce(((t, o) => t - (-1 === o ? e.o : o)), 0));
-}, g = "undefined" != typeof window, m = e => e.documentElement, v = e => e.ownerDocument, b = e => e.defaultView, w = /*#__PURE__*/ f((() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0)), S = /*#__PURE__*/ f((() => "scrollBehavior" in m(document).style)), k = 5, I = 6, y = 1, x = 4, _ = 8, z = e => o(e.$getTotalSize(), e.$getViewportSize()), T = (n, s = 40, c = 0, l, f = !1) => {
+    const s = o - e.l;
+    return e.i = r ? -1 : t(o - 1, e.i), e.l = o, s > 0 ? (a(e.u, s), a(e.t, s, r), 
+    e.o * s) : (e.u.splice(s), (r ? e.t.splice(0, -s) : e.t.splice(s)).reduce(((t, o) => t - (-1 === o ? e.o : o)), 0));
+}, g = "undefined" != typeof window, m = e => e.documentElement, v = e => e.ownerDocument, b = e => e.defaultView, w = /*#__PURE__*/ f((() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0)), S = /*#__PURE__*/ f((() => "scrollBehavior" in m(document).style)), k = 5, I = 6, y = 1, x = 4, _ = 8, z = e => o(e.$getTotalSize(), e.$getViewportSize()), T = (s, n = 40, c = 0, l, f = !1) => {
     let g = !!c, m = 1, v = 0, b = 0, S = 0, k = 0, I = 0, y = 0, x = 0, _ = 0, z = e, T = [ 0, g ? o(c - 1, 0) : -1 ], M = 0, R = !1;
-    const J = ((e, r, n) => ({
+    const J = ((e, r, s) => ({
         o: r,
-        t: n ? a(n.slice(0, t(e, n.length)), o(0, e - n.length)) : a([], e),
+        t: s ? a(s.slice(0, t(e, s.length)), o(0, e - s.length)) : a([], e),
         l: e,
         i: -1,
         u: a([], e + 1)
-    }))(n, l ? l[1] : s, l && l[0]), C = new Set, W = () => S - b, B = () => W() + I + k, L = (e, o) => ((e, o, r, n) => {
-        if (n = t(n, e.l - 1), d(e, n) <= o) {
-            const t = p(e, r, n);
-            return [ p(e, o, n, t), t ];
+    }))(s, l ? l[1] : n, l && l[0]), C = new Set, W = () => S - b, B = () => W() + I + k, L = (e, o) => ((e, o, r, s) => {
+        if (s = t(s, e.l - 1), d(e, s) <= o) {
+            const t = p(e, r, s);
+            return [ p(e, o, s, t), t ];
         }
         {
-            const t = p(e, o, void 0, n);
+            const t = p(e, o, void 0, s);
             return [ t, p(e, r, t) ];
         }
     })(J, e, o, T[0]), N = () => d(J, J.l), O = (e, t) => {
@@ -67,13 +67,13 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         $getCacheSnapshot: () => (e => [ e.t.slice(), e.o ])(J),
         $getRange: (e = 200) => {
             if (!R || g) return T;
-            let r, n;
-            if (y) [r, n] = T; else {
-                let s = o(0, B()), i = s + v;
-                f || (e = o(0, e), 1 !== x && (s -= e), 2 !== x && (i += e)), [r, n] = T = L(o(0, s), o(0, i)), 
-                z && (r = t(r, z[0]), n = o(n, z[1]));
+            let r, s;
+            if (y) [r, s] = T; else {
+                let n = o(0, B()), i = n + v;
+                f || (e = o(0, e), 1 !== x && (n -= e), 2 !== x && (i += e)), [r, s] = T = L(o(0, n), o(0, i)), 
+                z && (r = t(r, z[0]), s = o(s, z[1]));
             }
-            return [ o(r, 0), t(n, J.l - 1) ];
+            return [ o(r, 0), t(s, J.l - 1) ];
         },
         $findItemIndex: e => p(J, e - b),
         $isUnmeasuredItem: q,
@@ -92,57 +92,63 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                 C.delete(o);
             };
         },
-        $update: (t, n) => {
-            let s, c, l = 0;
+        $update: (t, s) => {
+            let n, c, l = 0;
             switch (t) {
               case 1:
                 {
-                    if (n === S && 0 === _) break;
+                    if (s === S && 0 === _) break;
                     const e = y;
                     y = 0;
-                    const t = n - S, o = r(t);
-                    e && o < r(e) + 1 || 0 !== _ || (x = t < 0 ? 2 : 1), g && (g = !1), S = n, l = 4;
-                    const s = W();
-                    s >= -v && s <= N() && (l += 1, c = o > v);
+                    const t = s - S, o = r(t);
+                    e && o < r(e) + 1 || 0 !== _ || (x = t < 0 ? 2 : 1), g && (g = !1), S = s, l = 4;
+                    const n = W();
+                    n >= -v && n <= N() && (l += 1, c = o > v);
                     break;
                 }
 
               case 2:
-                l = 8, 0 !== x && (s = !0, l += 1), x = 0, _ = 0, z = e;
+                l = 8, 0 !== x && (n = !0, l += 1), x = 0, _ = 0, z = e;
                 break;
 
               case 3:
                 {
-                    const e = n.filter((([e, t]) => !q(e, t)));
+                    const e = s.filter((([e, t]) => !q(e, t)));
                     if (!e.length) break;
-                    V(e.reduce(((e, [t, o]) => ((2 === _ || (z && 1 === _ ? t < z[0] : O(1 !== x && 0 === _ ? t + 1 : t) < W())) && (e += o - P(t)), 
-                    e)), 0));
+                    V(e.reduce(((e, [t, o]) => {
+                        let r;
+                        if (2 === _) r = !0; else if (z && 1 === _) r = t < z[0]; else {
+                            const e = W(), o = O(t), s = P(t);
+                            r = 1 !== x && 0 === _ ? o + s < e : o < e && o + s < e + v;
+                        }
+                        return r && (e += o - P(t)), e;
+                    }), 0));
                     for (const [t, o] of e) {
                         const e = P(t), r = $(J, t, o);
                         f && (M += r ? o : o - e);
                     }
                     f && v && M > v && (V(((e, t) => {
                         let r = 0;
-                        const n = [];
+                        const s = [];
                         e.t.forEach(((e, o) => {
-                            -1 !== e && (n.push(e), o < t && r++);
+                            -1 !== e && (s.push(e), o < t && r++);
                         })), e.i = -1;
-                        const s = i(n), c = s.length, l = c / 2 | 0, f = c % 2 == 0 ? (s[l - 1] + s[l]) / 2 : s[l], a = e.o;
+                        const n = i(s), c = n.length, l = c / 2 | 0, f = c % 2 == 0 ? (n[l - 1] + n[l]) / 2 : n[l], a = e.o;
                         return ((e.o = f) - a) * o(t - r, 0);
                     })(J, p(J, B()))), f = !1), l = 3, c = !0;
                     break;
                 }
 
               case 4:
-                v !== n && (v || (R = c = !0), v = n, l = 3);
+                v !== s && (v || (R = c = !0), v = s, l = 3);
                 break;
 
               case 5:
-                n[1] ? (V(h(J, n[0], !0)), _ = 2, l = 1) : (h(J, n[0]), l = 1);
+                s[1] ? (V(h(J, s[0], !0)), _ = 2, l = 1) : (h(J, s[0]), l = 1);
                 break;
 
               case 6:
-                b = n;
+                b = s;
                 break;
 
               case 7:
@@ -150,21 +156,21 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                 break;
 
               case 8:
-                z = L(n, n + v), l = 1;
+                z = L(s, s + v), l = 1;
             }
-            l && (m = 1 + (2147483647 & m), s && I && (k += I, I = 0), C.forEach((([e, t]) => {
+            l && (m = 1 + (2147483647 & m), n && I && (k += I, I = 0), C.forEach((([e, t]) => {
                 l & e && t(c);
             })));
         }
     };
-}, M = setTimeout, R = (e, t) => t ? -e : e, J = (t, o, r, n, s, i) => {
+}, M = setTimeout, R = (e, t) => t ? -e : e, J = (t, o, r, s, n, i) => {
     const c = Date.now;
     let l = 0, f = !1, a = !1, u = !1, $ = !1;
     const d = (() => {
         let o;
         const r = () => {
             o != e && clearTimeout(o);
-        }, n = () => {
+        }, s = () => {
             r(), o = M((() => {
                 o = e, (() => {
                     if (f || a) return f = !1, void d();
@@ -172,9 +178,9 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                 })();
             }), 150);
         };
-        return n.p = r, n;
+        return s.p = r, s;
     })(), p = () => {
-        l = c(), u && ($ = !0), i && t.$update(6, i()), t.$update(1, n()), d();
+        l = c(), u && ($ = !0), i && t.$update(6, i()), t.$update(1, s()), d();
     }, h = e => {
         if (f || !t.$isScrolling() || e.ctrlKey) return;
         const o = c() - l;
@@ -197,12 +203,12 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         },
         m: () => {
             const [e, o] = t.$();
-            e && (s(e, o, $), $ = !1, o && t.$getViewportSize() > t.$getTotalSize() && t.$update(1, n()));
+            e && (n(e, o, $), $ = !1, o && t.$getViewportSize() > t.$getTotalSize() && t.$update(1, s()));
         }
     };
 }, C = (e, t, o) => {
     let r;
-    return [ async (n, s) => {
+    return [ async (s, n) => {
         if (!await t()) return;
         r && r();
         const i = () => {
@@ -213,7 +219,7 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                 o(!0);
             })) ];
         };
-        if (s && S()) e.$update(8, n()), c((async () => {
+        if (n && S()) e.$update(8, s()), c((async () => {
             for (;;) {
                 let t = !0;
                 for (let [o, r] = e.$getRange(); o <= r; o++) if (e.$isUnmeasuredItem(o)) {
@@ -228,11 +234,11 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                     r();
                 }
             }
-            e.$update(7), o(n(), s);
+            e.$update(7), o(s(), n);
         })); else for (;;) {
             const [t, r] = i();
             try {
-                if (e.$update(7), o(n()), !await t) return;
+                if (e.$update(7), o(s()), !await t) return;
             } finally {
                 r();
             }
@@ -241,15 +247,15 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         r && r();
     } ];
 }, W = (e, t) => {
-    let o, r, n = l(), i = !1;
-    const c = t ? "scrollLeft" : "scrollTop", f = t ? "overflowX" : "overflowY", [a, u] = C(e, (() => n[0]), ((e, r) => {
+    let o, r, s = l(), i = !1;
+    const c = t ? "scrollLeft" : "scrollTop", f = t ? "overflowX" : "overflowY", [a, u] = C(e, (() => s[0]), ((e, r) => {
         e = R(e, i), r ? o.scrollTo({
             [t ? "left" : "top"]: e,
             behavior: "smooth"
         }) : o[c] = e;
     }));
     return {
-        $observe(s, l) {
+        $observe(n, l) {
             o = l, t && (i = "rtl" === getComputedStyle(l).direction), r = J(e, l, t, (() => R(l[c], i)), ((t, o, r) => {
                 if (r) {
                     const e = l.style, t = e[f];
@@ -258,10 +264,10 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
                     }));
                 }
                 l[c] = R(e.$getScrollOffset() + t, i), o && u();
-            })), n[1](!0);
+            })), s[1](!0);
         },
         $dispose() {
-            r && r.h(), n[1](!1), n = l();
+            r && r.h(), s[1](!1), s = l();
         },
         $isNegative: () => i,
         $scrollTo(e) {
@@ -270,23 +276,23 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         $scrollBy(t) {
             t += e.$getScrollOffset(), a((() => t));
         },
-        $scrollToIndex(t, {align: o, smooth: r, offset: n = 0} = {}) {
-            if (t = s(t, 0, e.$getItemsLength() - 1), "nearest" === o) {
-                const r = e.$getItemOffset(t), n = e.$getScrollOffset();
-                if (r < n) o = "start"; else {
-                    if (!(r + e.$getItemSize(t) > n + e.$getViewportSize())) return;
+        $scrollToIndex(t, {align: o, smooth: r, offset: s = 0} = {}) {
+            if (t = n(t, 0, e.$getItemsLength() - 1), "nearest" === o) {
+                const r = e.$getItemOffset(t), s = e.$getScrollOffset();
+                if (r < s) o = "start"; else {
+                    if (!(r + e.$getItemSize(t) > s + e.$getViewportSize())) return;
                     o = "end";
                 }
             }
-            a((() => n + e.$getStartSpacerSize() + e.$getItemOffset(t) + ("end" === o ? e.$getItemSize(t) - e.$getViewportSize() : "center" === o ? (e.$getItemSize(t) - e.$getViewportSize()) / 2 : 0)), r);
+            a((() => s + e.$getStartSpacerSize() + e.$getItemOffset(t) + ("end" === o ? e.$getItemSize(t) - e.$getViewportSize() : "center" === o ? (e.$getItemSize(t) - e.$getViewportSize()) / 2 : 0)), r);
         },
         $fixScrollJump: () => {
             r && r.m();
         }
     };
 }, B = (e, t) => {
-    let o, r, n = l(), i = !1;
-    const c = t ? "left" : "top", [f] = C(e, (() => n[0]), ((e, t) => {
+    let o, r, s = l(), i = !1;
+    const c = t ? "left" : "top", [f] = C(e, (() => s[0]), ((e, t) => {
         e = R(e, i);
         const r = b(v(o));
         t ? r.scroll({
@@ -295,40 +301,40 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         }) : r.scroll({
             [c]: e
         });
-    })), a = (e, t, o, r, n = 0) => {
-        const s = r ? "offsetLeft" : "offsetTop", c = n + (r && i ? o.innerWidth - e[s] - e.offsetWidth : e[s]), l = e.offsetParent;
+    })), a = (e, t, o, r, s = 0) => {
+        const n = r ? "offsetLeft" : "offsetTop", c = s + (r && i ? o.innerWidth - e[n] - e.offsetWidth : e[n]), l = e.offsetParent;
         return e !== t && l ? a(l, t, o, r, c) : c;
     };
     return {
-        $observe(s) {
-            o = s;
-            const l = t ? "scrollX" : "scrollY", f = v(s), u = b(f);
+        $observe(n) {
+            o = n;
+            const l = t ? "scrollX" : "scrollY", f = v(n), u = b(f);
             t && (i = "rtl" === getComputedStyle(m(f)).direction), r = J(e, u, t, (() => R(u[l], i)), ((t, o) => {
                 o ? u.scroll({
                     [c]: R(e.$getScrollOffset() + t, i)
                 }) : u.scrollBy({
                     [c]: R(t, i)
                 });
-            }), (() => a(s, f.body, u, t))), n[1](!0);
+            }), (() => a(n, f.body, u, t))), s[1](!0);
         },
         $dispose() {
-            r && r.h(), o = void 0, n[1](!1), n = l();
+            r && r.h(), o = void 0, s[1](!1), s = l();
         },
         $isNegative: () => i,
         $fixScrollJump: () => {
             r && r.m();
         },
-        $scrollToIndex(r, {align: n, smooth: i, offset: c = 0} = {}) {
+        $scrollToIndex(r, {align: s, smooth: i, offset: c = 0} = {}) {
             if (!o) return;
-            if (r = s(r, 0, e.$getItemsLength() - 1), "nearest" === n) {
+            if (r = n(r, 0, e.$getItemsLength() - 1), "nearest" === s) {
                 const t = e.$getItemOffset(r), o = e.$getScrollOffset();
-                if (t < o) n = "start"; else {
+                if (t < o) s = "start"; else {
                     if (!(t + e.$getItemSize(r) > o + e.$getViewportSize())) return;
-                    n = "end";
+                    s = "end";
                 }
             }
             const l = v(o), u = b(l), $ = m(l), d = () => e.$getViewportSize() - (t ? $.clientWidth : $.clientHeight);
-            f((() => c + a(o, l.body, u, t) + e.$getItemOffset(r) + ("end" === n ? e.$getItemSize(r) - (e.$getViewportSize() - d()) : "center" === n ? (e.$getItemSize(r) - (e.$getViewportSize() - d())) / 2 : 0)), i);
+            f((() => c + a(o, l.body, u, t) + e.$getItemOffset(r) + ("end" === s ? e.$getItemSize(r) - (e.$getViewportSize() - d()) : "center" === s ? (e.$getItemSize(r) - (e.$getViewportSize() - d())) / 2 : 0)), i);
         }
     };
 }, L = (e, t) => {
@@ -369,11 +375,11 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
     };
 }, O = (t, o) => {
     let r;
-    const n = o ? "width" : "height", s = new WeakMap, i = N((o => {
+    const s = o ? "width" : "height", n = new WeakMap, i = N((o => {
         const i = [];
-        for (const {target: c, contentRect: l} of o) if (c.offsetParent) if (c === r) t.$update(4, l[n]); else {
-            const t = s.get(c);
-            t != e && i.push([ t, l[n] ]);
+        for (const {target: c, contentRect: l} of o) if (c.offsetParent) if (c === r) t.$update(4, l[s]); else {
+            const t = n.get(c);
+            t != e && i.push([ t, l[s] ]);
         }
         i.length && t.$update(3, i);
     }));
@@ -381,33 +387,33 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         $observeRoot(e) {
             i.v(r = e);
         },
-        $observeItem: (e, t) => (s.set(e, t), i.v(e), () => {
-            s.delete(e), i.S(e);
+        $observeItem: (e, t) => (n.set(e, t), i.v(e), () => {
+            n.delete(e), i.S(e);
         }),
         $dispose: i.h
     };
 }, P = (t, o) => {
-    const r = o ? "width" : "height", n = o ? "innerWidth" : "innerHeight", s = new WeakMap, i = N((o => {
-        const n = [];
+    const r = o ? "width" : "height", s = o ? "innerWidth" : "innerHeight", n = new WeakMap, i = N((o => {
+        const s = [];
         for (const {target: t, contentRect: i} of o) {
             if (!t.offsetParent) continue;
-            const o = s.get(t);
-            o != e && n.push([ o, i[r] ]);
+            const o = n.get(t);
+            o != e && s.push([ o, i[r] ]);
         }
-        n.length && t.$update(3, n);
+        s.length && t.$update(3, s);
     }));
     let l;
     return {
         $observeRoot(e) {
             const o = b(v(e)), r = () => {
-                t.$update(4, o[n]);
+                t.$update(4, o[s]);
             };
             o.addEventListener("resize", r), c(r), l = () => {
                 o.removeEventListener("resize", r);
             };
         },
-        $observeItem: (e, t) => (s.set(e, t), i.v(e), () => {
-            s.delete(e), i.S(e);
+        $observeItem: (e, t) => (n.set(e, t), i.v(e), () => {
+            n.delete(e), i.S(e);
         }),
         $dispose() {
             l && l(), i.h();
@@ -415,16 +421,16 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
     };
 }, q = (e, t) => {
     let r;
-    const n = new WeakMap, s = new Set, i = new Set, c = new Map, l = (e, t) => `${e}-${t}`, f = N((f => {
+    const s = new WeakMap, n = new Set, i = new Set, c = new Map, l = (e, t) => `${e}-${t}`, f = N((f => {
         const a = new Set, u = new Set;
-        for (const {target: o, contentRect: {width: s, height: i}} of f) if (o.offsetParent) if (o === r) e.$update(4, i), 
-        t.$update(4, s); else {
-            const e = n.get(o);
+        for (const {target: o, contentRect: {width: n, height: i}} of f) if (o.offsetParent) if (o === r) e.$update(4, i), 
+        t.$update(4, n); else {
+            const e = s.get(o);
             if (e) {
-                const [t, o] = e, r = l(t, o), n = c.get(r);
+                const [t, o] = e, r = l(t, o), s = c.get(r);
                 let f, $;
-                n ? (n[0] !== i && (f = !0), n[1] !== s && ($ = !0)) : f = $ = !0, f && a.add(t), 
-                $ && u.add(o), (f || $) && c.set(r, [ i, s ]);
+                s ? (s[0] !== i && (f = !0), s[1] !== n && ($ = !0)) : f = $ = !0, f && a.add(t), 
+                $ && u.add(o), (f || $) && c.set(r, [ i, n ]);
             }
         }
         if (a.size) {
@@ -432,8 +438,8 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
             a.forEach((e => {
                 let r = 0;
                 i.forEach((t => {
-                    const n = c.get(l(e, t));
-                    n && (r = o(r, n[0]));
+                    const s = c.get(l(e, t));
+                    s && (r = o(r, s[0]));
                 })), r && t.push([ e, r ]);
             })), e.$update(3, t);
         }
@@ -441,9 +447,9 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
             const e = [];
             u.forEach((t => {
                 let r = 0;
-                s.forEach((e => {
-                    const n = c.get(l(e, t));
-                    n && (r = o(r, n[1]));
+                n.forEach((e => {
+                    const s = c.get(l(e, t));
+                    s && (r = o(r, s[1]));
                 })), r && e.push([ t, r ]);
             })), t.$update(3, e);
         }
@@ -452,8 +458,8 @@ const e = null, {min: t, max: o, abs: r, floor: n} = Math, s = (e, r, n) => t(n,
         $observeRoot(e) {
             f.v(r = e);
         },
-        $observeItem: (e, t, o) => (n.set(e, [ t, o ]), s.add(t), i.add(o), f.v(e), () => {
-            n.delete(e), f.S(e);
+        $observeItem: (e, t, o) => (s.set(e, [ t, o ]), n.add(t), i.add(o), f.v(e), () => {
+            s.delete(e), f.S(e);
         }),
         $resizeCols(o) {
             for (const [t] of o) for (let o = 0; o < e.$getItemsLength(); o++) c.delete(l(o, t));