react-virtual-renderer 1.1.3 → 1.1.5

package/dist/components/VirtualList.js

@@ -1,20 +1,12 @@
-import { jsx as _jsx } from "react/jsx-runtime";
+import { jsx as _jsx, jsxs as _jsxs } from "react/jsx-runtime";
 import React, { forwardRef, useEffect, useImperativeHandle, useRef, } from 'react';
 import { useVirtualList } from '../hooks/useVirtualList';
-/**
- * VirtualList Component
- * Drop-in replacement for long lists with virtualization support
- */
-export const VirtualList = forwardRef(({ items, renderItem, itemWrapper, itemKey, height = 400, width = 500, itemSize, overscan = 5, scrollDirection = 'forward', onScroll, className = '', itemClassName = '', style = {}, estimatedItemSize = 35, getItemSize, stickyIndices = [], onScrollEnd, innerRef, scrollOffsetRef, }, containerRef) => {
-    const { virtualItems, isScrolling, scrollOffset, totalSize, containerRef: internalContainerRef, innerRef: internalInnerRef, getItemStyle, } = useVirtualList({
+export const VirtualList = forwardRef(({ items, renderItem, itemWrapper, itemKey, height = 400, width = 500, itemSize, overscan = 5, scrollDirection = 'forward', onScroll, className = '', itemClassName = '', style = {}, innerClassName = '', innerStyle = {}, itemStyle = {}, estimatedItemSize = 35, getItemSize, stickyIndices = [], onScrollEnd, innerRef, scrollOffsetRef, footer, }, containerRef) => {
+    const { virtualItems, isScrolling, scrollOffset, totalSize, containerRef: internalContainerRef, innerRef: internalInnerRef, getItemStyle, observeItem, unobserveItem, } = useVirtualList({
         items,
         getItemKey: itemKey,
-        containerHeight: typeof height === 'number'
-            ? height
-            : 400,
-        containerWidth: typeof width === 'number'
-            ? width
-            : 500,
+        containerHeight: typeof height === 'number' ? height : 400,
+        containerWidth: typeof width === 'number' ? width : 500,
         itemSize: getItemSize || itemSize,
         overscan,
         scrollDirection,
@@ -23,31 +15,15 @@ export const VirtualList = forwardRef(({ items, renderItem, itemWrapper, itemKey
         onScrollEnd,
         stickyIndices,
     });
-    /**
-     * Local refs
-     */
     const mergedContainerRef = useRef(null);
     const mergedInnerRef = useRef(null);
-    /**
-     * Expose container ref
-     */
     useImperativeHandle(containerRef, () => mergedContainerRef.current);
-    /**
-     * Expose inner ref
-     */
     useImperativeHandle(innerRef, () => mergedInnerRef.current);
-    /**
-     * Expose current scroll offset
-     */
     useEffect(() => {
         if (scrollOffsetRef) {
-            scrollOffsetRef.current =
-                scrollOffset;
+            scrollOffsetRef.current = scrollOffset;
         }
     }, [scrollOffset, scrollOffsetRef]);
-    /**
-     * Container styles
-     */
     const containerStyle = {
         height,
         width,
@@ -55,70 +31,84 @@ export const VirtualList = forwardRef(({ items, renderItem, itemWrapper, itemKey
         position: 'relative',
         ...style,
     };
-    /**
-     * Inner wrapper styles
-     */
-    const innerStyle = {
+    const innerStyleComputed = {
+        width: '100%',
+        ...innerStyle,
         position: 'relative',
         height: totalSize,
-        width: '100%',
     };
+    const cx = (...parts) => parts.filter(Boolean).join(' ').trim();
+    /**
+     * FIX: tracks the currently-mounted element per index, so the ref
+     * callback below can unobserve the OLD element when it unmounts
+     * (React gives you `null` on unmount, not the removed element, so
+     * you need to have kept a reference yourself to unobserve it -
+     * without this, ResizeObserver keeps a permanent reference to
+     * every item that's ever scrolled past = memory leak).
+     */
+    const observedElementsRef = useRef(new Map());
+    const measureRef = (index) => (el) => {
+        const prev = observedElementsRef.current.get(index);
+        if (prev && prev !== el) {
+            unobserveItem(prev);
+            observedElementsRef.current.delete(index);
+        }
+        if (el) {
+            observedElementsRef.current.set(index, el);
+            observeItem(index, el);
+        }
+    };
+    // stop observing everything on full unmount
+    useEffect(() => {
+        return () => {
+            observedElementsRef.current.forEach((el) => unobserveItem(el));
+            observedElementsRef.current.clear();
+        };
+        // eslint-disable-next-line react-hooks/exhaustive-deps
+    }, []);
     return (_jsx("div", { ref: (el) => {
-            mergedContainerRef.current =
-                el;
-            internalContainerRef.current =
-                el;
-        }, className: `virtualize-container ${className}`, style: containerStyle, onScroll: (e) => {
+            mergedContainerRef.current = el;
+            internalContainerRef.current = el;
+        }, className: cx('virtualize-container', className), style: containerStyle, onScroll: (e) => {
             const target = e.target;
             const handler = renderItem?.__scrollHandler;
-            if (handler) {
+            if (handler)
                 handler(e);
-            }
-            if (onScroll) {
+            if (onScroll)
                 onScroll(target.scrollTop, 'auto');
-            }
-        }, children: _jsx("div", { ref: (el) => {
-                mergedInnerRef.current =
-                    el;
-                internalInnerRef.current =
-                    el;
-            }, style: innerStyle, className: "virtualize-inner", children: virtualItems.map((virtualItem) => {
-                const item = items[virtualItem.index];
-                const key = itemKey
-                    ? itemKey(virtualItem.index, item)
-                    : virtualItem.index;
-                const virtualStyle = getItemStyle(virtualItem.index, virtualItem.size);
-                const renderProps = {
-                    item,
-                    index: virtualItem.index,
-                    /**
-                     * @deprecated
-                     * Kept only for backwards compatibility.
-                     * Avoid spreading this style in renderItem.
-                     */
-                    style: virtualStyle,
-                    isScrolling,
-                };
-                const content = renderItem(renderProps);
-                /**
-                 * Advanced wrapper API
-                 */
-                if (itemWrapper) {
-                    return (_jsx(React.Fragment, { children: itemWrapper({
-                            item,
-                            index: virtualItem.index,
-                            style: virtualStyle,
-                            children: content,
-                        }) }, key));
-                }
-                /**
-                 * Default wrapper
-                 */
-                return (_jsx("div", { "data-virtualize-index": virtualItem.index, className: itemClassName, style: {
-                        ...virtualStyle,
-                        boxSizing: 'border-box',
-                    }, children: content }, key));
-            }) }) }));
+        }, children: _jsxs("div", { ref: (el) => {
+                mergedInnerRef.current = el;
+                internalInnerRef.current = el;
+            }, style: innerStyleComputed, className: cx('virtualize-inner', innerClassName), children: [virtualItems.map((virtualItem) => {
+                    const item = items[virtualItem.index];
+                    const key = itemKey ? itemKey(virtualItem.index, item) : virtualItem.index;
+                    const virtualStyle = getItemStyle(virtualItem.index, virtualItem.size);
+                    const renderProps = {
+                        item,
+                        index: virtualItem.index,
+                        style: virtualStyle,
+                        isScrolling,
+                    };
+                    const content = renderItem(renderProps);
+                    if (itemWrapper) {
+                        // Advanced API: consumer owns the wrapper DOM node, so
+                        // THEY need to attach measureRef(index) to their root
+                        // element for dynamic-height measurement to work here -
+                        // we can't reach into arbitrary returned JSX to do it
+                        // for them. Documented in types-patch.md.
+                        return (_jsx(React.Fragment, { children: itemWrapper({
+                                item,
+                                index: virtualItem.index,
+                                style: virtualStyle,
+                                children: content,
+                            }) }, key));
+                    }
+                    return (_jsx("div", { ref: measureRef(virtualItem.index), "data-virtualize-index": virtualItem.index, className: cx('virtualize-item', itemClassName), style: {
+                            ...itemStyle,
+                            ...virtualStyle,
+                            boxSizing: 'border-box',
+                        }, children: content }, key));
+                }), footer && (_jsx("div", { style: { position: 'absolute', top: totalSize, left: 0, width: '100%' }, children: footer }))] }) }));
 });
 VirtualList.displayName = 'VirtualList';
 //# sourceMappingURL=VirtualList.js.map

package/dist/components/VirtualList.js.map

@@ -1 +1 @@
-{"version":3,"file":"VirtualList.js","sourceRoot":"","sources":["../../src/components/VirtualList.tsx"],"names":[],"mappings":";AAAA,OAAO,KAAK,EAAE,EACV,UAAU,EACV,SAAS,EACT,mBAAmB,EACnB,MAAM,GACT,MAAM,OAAO,CAAC;AAEf,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAMzD;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,UAAU,CAIjC,CACI,EACI,KAAK,EACL,UAAU,EACV,WAAW,EACX,OAAO,EACP,MAAM,GAAG,GAAG,EACZ,KAAK,GAAG,GAAG,EACX,QAAQ,EACR,QAAQ,GAAG,CAAC,EACZ,eAAe,GAAG,SAAS,EAC3B,QAAQ,EACR,SAAS,GAAG,EAAE,EACd,aAAa,GAAG,EAAE,EAClB,KAAK,GAAG,EAAE,EACV,iBAAiB,GAAG,EAAE,EACtB,WAAW,EACX,aAAa,GAAG,EAAE,EAClB,WAAW,EACX,QAAQ,EACR,eAAe,GAClB,EACD,YAAY,EACd,EAAE;IACA,MAAM,EACF,YAAY,EACZ,WAAW,EACX,YAAY,EACZ,SAAS,EACT,YAAY,EAAE,oBAAoB,EAClC,QAAQ,EAAE,gBAAgB,EAC1B,YAAY,GACf,GAAG,cAAc,CAAC;QACf,KAAK;QACL,UAAU,EAAE,OAAO;QACnB,eAAe,EACX,OAAO,MAAM,KAAK,QAAQ;YACtB,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,GAAG;QACb,cAAc,EACV,OAAO,KAAK,KAAK,QAAQ;YACrB,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,GAAG;QACb,QAAQ,EAAE,WAAW,IAAI,QAAQ;QACjC,QAAQ;QACR,eAAe;QACf,iBAAiB;QACjB,QAAQ;QACR,WAAW;QACX,aAAa;KAChB,CAAC,CAAC;IAEH;;OAEG;IACH,MAAM,kBAAkB,GACpB,MAAM,CAAwB,IAAI,CAAC,CAAC;IAExC,MAAM,cAAc,GAChB,MAAM,CAAwB,IAAI,CAAC,CAAC;IAExC;;OAEG;IACH,mBAAmB,CACf,YAAY,EACZ,GAAG,EAAE,CAAC,kBAAkB,CAAC,OAAyB,CACrD,CAAC;IAEF;;OAEG;IACH,mBAAmB,CACf,QAAQ,EACR,GAAG,EAAE,CAAC,cAAc,CAAC,OAAyB,CACjD,CAAC;IAEF;;OAEG;IACH,SAAS,CAAC,GAAG,EAAE;QACX,IAAI,eAAe,EAAE,CAAC;YAClB,eAAe,CAAC,OAAO;gBACnB,YAAY,CAAC;QACrB,CAAC;IACL,CAAC,EAAE,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC;IAEpC;;OAEG;IACH,MAAM,cAAc,GACpB;QACI,MAAM;QACN,KAAK;QACL,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,UAAU;QACpB,GAAG,KAAK;KACX,CAAC;IAEF;;OAEG;IACH,MAAM,UAAU,GAAwB;QACpC,QAAQ,EAAE,UAAU;QACpB,MAAM,EAAE,SAAS;QACjB,KAAK,EAAE,MAAM;KAChB,CAAC;IAEF,OAAO,CACH,cACI,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE;YACR,kBAAkB,CAAC,OAAO;gBACtB,EAAE,CAAC;YAEP,oBAAoB,CAAC,OAAO;gBACxB,EAAE,CAAC;QACX,CAAC,EACD,SAAS,EAAE,wBAAwB,SAAS,EAAE,EAC9C,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE;YACZ,MAAM,MAAM,GACR,CAAC,CAAC,MAAqB,CAAC;YAE5B,MAAM,OAAO,GACT,UACH,EAAE,eAAe,CAAC;YAEnB,IAAI,OAAO,EAAE,CAAC;gBACV,OAAO,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;YAED,IAAI,QAAQ,EAAE,CAAC;gBACX,QAAQ,CACJ,MAAM,CAAC,SAAS,EAChB,MAAM,CACT,CAAC;YACN,CAAC;QACL,CAAC,YAED,cACI,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE;gBACR,cAAc,CAAC,OAAO;oBAClB,EAAE,CAAC;gBAEP,gBAAgB,CAAC,OAAO;oBACpB,EAAE,CAAC;YACX,CAAC,EACD,KAAK,EAAE,UAAU,EACjB,SAAS,EAAC,kBAAkB,YAE3B,YAAY,CAAC,GAAG,CACb,CAAC,WAAW,EAAE,EAAE;gBACZ,MAAM,IAAI,GACN,KAAK,CACL,WAAW,CAAC,KAAK,CAChB,CAAC;gBAEN,MAAM,GAAG,GAAG,OAAO;oBACf,CAAC,CAAC,OAAO,CACL,WAAW,CAAC,KAAK,EACjB,IAAI,CACP;oBACD,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC;gBAExB,MAAM,YAAY,GACd,YAAY,CACR,WAAW,CAAC,KAAK,EACjB,WAAW,CAAC,IAAI,CACnB,CAAC;gBAEN,MAAM,WAAW,GACjB;oBACI,IAAI;oBACJ,KAAK,EACD,WAAW,CAAC,KAAK;oBAErB;;;;uBAIG;oBACH,KAAK,EACD,YAAY;oBAEhB,WAAW;iBACd,CAAC;gBAEF,MAAM,OAAO,GACT,UAAU,CACN,WAAW,CACd,CAAC;gBAEN;;mBAEG;gBACH,IAAI,WAAW,EAAE,CAAC;oBACd,OAAO,CACH,KAAC,KAAK,CAAC,QAAQ,cAGV,WAAW,CAAC;4BACT,IAAI;4BACJ,KAAK,EACD,WAAW,CAAC,KAAK;4BACrB,KAAK,EACD,YAAY;4BAChB,QAAQ,EACJ,OAAO;yBACd,CAAC,IAVG,GAAG,CAWK,CACpB,CAAC;gBACN,CAAC;gBAED;;mBAEG;gBACH,OAAO,CACH,uCAGQ,WAAW,CAAC,KAAK,EAErB,SAAS,EACL,aAAa,EAEjB,KAAK,EAAE;wBACH,GAAG,YAAY;wBACf,SAAS,EACL,YAAY;qBACnB,YAEA,OAAO,IAbH,GAAG,CAcN,CACT,CAAC;YACN,CAAC,CACJ,GACC,GACJ,CACT,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,WAAW,CAAC,WAAW,GAAG,aAAa,CAAC"}
+{"version":3,"file":"VirtualList.js","sourceRoot":"","sources":["../../src/components/VirtualList.tsx"],"names":[],"mappings":";AAAA,OAAO,KAAK,EAAE,EACV,UAAU,EACV,SAAS,EACT,mBAAmB,EACnB,MAAM,GACT,MAAM,OAAO,CAAC;AAEf,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAMzD,MAAM,CAAC,MAAM,WAAW,GAAG,UAAU,CAIjC,CACI,EACI,KAAK,EACL,UAAU,EACV,WAAW,EACX,OAAO,EACP,MAAM,GAAG,GAAG,EACZ,KAAK,GAAG,GAAG,EACX,QAAQ,EACR,QAAQ,GAAG,CAAC,EACZ,eAAe,GAAG,SAAS,EAC3B,QAAQ,EACR,SAAS,GAAG,EAAE,EACd,aAAa,GAAG,EAAE,EAClB,KAAK,GAAG,EAAE,EACV,cAAc,GAAG,EAAE,EACnB,UAAU,GAAG,EAAE,EACf,SAAS,GAAG,EAAE,EACd,iBAAiB,GAAG,EAAE,EACtB,WAAW,EACX,aAAa,GAAG,EAAE,EAClB,WAAW,EACX,QAAQ,EACR,eAAe,EACf,MAAM,GACT,EACD,YAAY,EACd,EAAE;IACA,MAAM,EACF,YAAY,EACZ,WAAW,EACX,YAAY,EACZ,SAAS,EACT,YAAY,EAAE,oBAAoB,EAClC,QAAQ,EAAE,gBAAgB,EAC1B,YAAY,EACZ,WAAW,EACX,aAAa,GAChB,GAAG,cAAc,CAAC;QACf,KAAK;QACL,UAAU,EAAE,OAAO;QACnB,eAAe,EAAE,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG;QAC1D,cAAc,EAAE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;QACvD,QAAQ,EAAE,WAAW,IAAI,QAAQ;QACjC,QAAQ;QACR,eAAe;QACf,iBAAiB;QACjB,QAAQ;QACR,WAAW;QACX,aAAa;KAChB,CAAC,CAAC;IAEH,MAAM,kBAAkB,GAAG,MAAM,CAAwB,IAAI,CAAC,CAAC;IAC/D,MAAM,cAAc,GAAG,MAAM,CAAwB,IAAI,CAAC,CAAC;IAE3D,mBAAmB,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,kBAAkB,CAAC,OAAyB,CAAC,CAAC;IACtF,mBAAmB,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,cAAc,CAAC,OAAyB,CAAC,CAAC;IAE9E,SAAS,CAAC,GAAG,EAAE;QACX,IAAI,eAAe,EAAE,CAAC;YAClB,eAAe,CAAC,OAAO,GAAG,YAAY,CAAC;QAC3C,CAAC;IACL,CAAC,EAAE,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC;IAEpC,MAAM,cAAc,GAAwB;QACxC,MAAM;QACN,KAAK;QACL,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,UAAU;QACpB,GAAG,KAAK;KACX,CAAC;IAEF,MAAM,kBAAkB,GAAwB;QAC5C,KAAK,EAAE,MAAM;QACb,GAAG,UAAU;QACb,QAAQ,EAAE,UAAU;QACpB,MAAM,EAAE,SAAS;KACpB,CAAC;IAEF,MAAM,EAAE,GAAG,CAAC,GAAG,KAAwC,EAAE,EAAE,CACvD,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAE3C;;;;;;;OAOG;IACH,MAAM,mBAAmB,GAAG,MAAM,CAA2B,IAAI,GAAG,EAAE,CAAC,CAAC;IAExE,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,EAAyB,EAAE,EAAE;QAChE,MAAM,IAAI,GAAG,mBAAmB,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEpD,IAAI,IAAI,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YACtB,aAAa,CAAC,IAAI,CAAC,CAAC;YACpB,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,EAAE,EAAE,CAAC;YACL,mBAAmB,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC3C,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC,CAAC;IAEF,4CAA4C;IAC5C,SAAS,CAAC,GAAG,EAAE;QACX,OAAO,GAAG,EAAE;YACR,mBAAmB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/D,mBAAmB,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACxC,CAAC,CAAC;QACF,uDAAuD;IAC3D,CAAC,EAAE,EAAE,CAAC,CAAC;IAEP,OAAO,CACH,cACI,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE;YACR,kBAAkB,CAAC,OAAO,GAAG,EAAE,CAAC;YAChC,oBAAoB,CAAC,OAAO,GAAG,EAAE,CAAC;QACtC,CAAC,EACD,SAAS,EAAE,EAAE,CAAC,sBAAsB,EAAE,SAAS,CAAC,EAChD,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE;YACZ,MAAM,MAAM,GAAG,CAAC,CAAC,MAAqB,CAAC;YACvC,MAAM,OAAO,GAAI,UAAkB,EAAE,eAAe,CAAC;YACrD,IAAI,OAAO;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,QAAQ;gBAAE,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACrD,CAAC,YAED,eACI,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE;gBACR,cAAc,CAAC,OAAO,GAAG,EAAE,CAAC;gBAC5B,gBAAgB,CAAC,OAAO,GAAG,EAAE,CAAC;YAClC,CAAC,EACD,KAAK,EAAE,kBAAkB,EACzB,SAAS,EAAE,EAAE,CAAC,kBAAkB,EAAE,cAAc,CAAC,aAEhD,YAAY,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE;oBAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;oBACtC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC;oBAC3E,MAAM,YAAY,GAAG,YAAY,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;oBAEvE,MAAM,WAAW,GAAyB;wBACtC,IAAI;wBACJ,KAAK,EAAE,WAAW,CAAC,KAAK;wBACxB,KAAK,EAAE,YAAY;wBACnB,WAAW;qBACd,CAAC;oBAEF,MAAM,OAAO,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;oBAExC,IAAI,WAAW,EAAE,CAAC;wBACd,uDAAuD;wBACvD,sDAAsD;wBACtD,wDAAwD;wBACxD,sDAAsD;wBACtD,0CAA0C;wBAC1C,OAAO,CACH,KAAC,KAAK,CAAC,QAAQ,cACV,WAAW,CAAC;gCACT,IAAI;gCACJ,KAAK,EAAE,WAAW,CAAC,KAAK;gCACxB,KAAK,EAAE,YAAY;gCACnB,QAAQ,EAAE,OAAO;6BACpB,CAAC,IANe,GAAG,CAOP,CACpB,CAAC;oBACN,CAAC;oBAED,OAAO,CACH,cAEI,GAAG,EAAE,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,2BACX,WAAW,CAAC,KAAK,EACxC,SAAS,EAAE,EAAE,CAAC,iBAAiB,EAAE,aAAa,CAAC,EAC/C,KAAK,EAAE;4BACH,GAAG,SAAS;4BACZ,GAAG,YAAY;4BACf,SAAS,EAAE,YAAY;yBAC1B,YAEA,OAAO,IAVH,GAAG,CAWN,CACT,CAAC;gBACN,CAAC,CAAC,EAED,MAAM,IAAI,CACP,cAAK,KAAK,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,YACvE,MAAM,GACL,CACT,IACC,GACJ,CACT,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,WAAW,CAAC,WAAW,GAAG,aAAa,CAAC"}

package/dist/components/VirtualLiveRegion.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Visually-hidden aria-live region that announces the visible range
+ * once scrolling settles (debounced), so screen reader users get
+ * "showing items 240 to 260 of 50,000" instead of silence.
+ */
+export declare function VirtualLiveRegion({ start, end, total, isScrolling }: {
+    start: number;
+    end: number;
+    total: number;
+    isScrolling: boolean;
+}): import("react/jsx-runtime").JSX.Element;
+//# sourceMappingURL=VirtualLiveRegion.d.ts.map

package/dist/components/VirtualLiveRegion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualLiveRegion.d.ts","sourceRoot":"","sources":["../../src/components/VirtualLiveRegion.tsx"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE;IAClE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,OAAO,CAAC;CACnE,2CAyBA"}

package/dist/components/VirtualLiveRegion.js

@@ -0,0 +1,27 @@
+import { jsx as _jsx } from "react/jsx-runtime";
+import { useEffect, useRef, useState } from 'react';
+/**
+ * Visually-hidden aria-live region that announces the visible range
+ * once scrolling settles (debounced), so screen reader users get
+ * "showing items 240 to 260 of 50,000" instead of silence.
+ */
+export function VirtualLiveRegion({ start, end, total, isScrolling }) {
+    const [announcement, setAnnouncement] = useState('');
+    const timeoutRef = useRef(null);
+    useEffect(() => {
+        if (isScrolling)
+            return; // only announce once scrolling has settled
+        if (timeoutRef.current)
+            clearTimeout(timeoutRef.current);
+        timeoutRef.current = setTimeout(() => {
+            setAnnouncement(`Showing items ${start + 1} to ${end + 1} of ${total}`);
+        }, 400);
+        return () => { if (timeoutRef.current)
+            clearTimeout(timeoutRef.current); };
+    }, [start, end, total, isScrolling]);
+    return (_jsx("div", { "aria-live": "polite", "aria-atomic": "true", style: {
+            position: 'absolute', width: 1, height: 1, padding: 0, margin: -1,
+            overflow: 'hidden', clip: 'rect(0,0,0,0)', whiteSpace: 'nowrap', border: 0,
+        }, children: announcement }));
+}
+//# sourceMappingURL=VirtualLiveRegion.js.map

package/dist/components/VirtualLiveRegion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualLiveRegion.js","sourceRoot":"","sources":["../../src/components/VirtualLiveRegion.tsx"],"names":[],"mappings":";AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AAEpD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,EAEjE;IACG,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACrD,MAAM,UAAU,GAAG,MAAM,CAAuC,IAAI,CAAC,CAAC;IAEtE,SAAS,CAAC,GAAG,EAAE;QACX,IAAI,WAAW;YAAE,OAAO,CAAC,2CAA2C;QACpE,IAAI,UAAU,CAAC,OAAO;YAAE,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzD,UAAU,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE;YACjC,eAAe,CAAC,iBAAiB,KAAK,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC;QAC5E,CAAC,EAAE,GAAG,CAAC,CAAC;QACR,OAAO,GAAG,EAAE,GAAG,IAAI,UAAU,CAAC,OAAO;YAAE,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;IAErC,OAAO,CACH,2BACc,QAAQ,iBACN,MAAM,EAClB,KAAK,EAAE;YACH,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YACjE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;SAC7E,YAEA,YAAY,GACX,CACT,CAAC;AACN,CAAC"}

package/dist/core/FenwickTree.d.ts

@@ -0,0 +1,47 @@
+export declare class FenwickTree {
+    private capacity;
+    private tree;
+    private raw;
+    private n;
+    constructor(initialCount?: number);
+    size(): number;
+    /**
+     * Full linear-time rebuild from `raw[]`, the source of truth. Only
+     * called when capacity changes (doubling) - never on the per-item
+     * update hot path.
+     */
+    private rebuild;
+    /**
+     * Grow or shrink to hold `count` items. New slots default to
+     * `defaultValue` (the estimated item size). Shrinking zeroes the
+     * vacated raw slots so a later regrow never resurfaces stale data.
+     */
+    resize(count: number, defaultValue: number): void;
+    /**
+     * Point update: set the value at `index` (0-indexed) to `value`.
+     * O(log n) - safe at any time because it never needs to propagate
+     * beyond the current (fixed until the next doubling) capacity.
+     */
+    update(index: number, value: number): void;
+    /** Value currently stored at `index` (0-indexed). O(1). */
+    getValue(index: number): number;
+    /** Sum of values in [0, index) - the pixel offset at which `index` starts. O(log n). */
+    prefixSum(index: number): number;
+    /** Sum of all n values - the total content size. O(log n). */
+    total(): number;
+    /**
+     * Locate the index whose range contains cumulative offset `target`.
+     * Runs on every scroll frame - an O(log n) walk directly over the
+     * tree structure (the classic Fenwick "find by prefix sum" walk),
+     * so it never needs a separately-maintained sorted array.
+     */
+    findIndexAtOffset(target: number): number;
+    /**
+     * Reset every value to `defaultValue` without changing capacity.
+     * Intentionally the one O(n)-ish path in this class (a full rebuild
+     * plus n point updates), reserved for explicit full invalidation -
+     * never used on the scroll hot path.
+     */
+    resetAll(defaultValue: number): void;
+}
+//# sourceMappingURL=FenwickTree.d.ts.map

package/dist/core/FenwickTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FenwickTree.d.ts","sourceRoot":"","sources":["../../src/core/FenwickTree.ts"],"names":[],"mappings":"AAqDA,qBAAa,WAAW;IACpB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,IAAI,CAAW;IACvB,OAAO,CAAC,GAAG,CAAW;IACtB,OAAO,CAAC,CAAC,CAAK;gBAEF,YAAY,SAAI;IAU5B,IAAI,IAAI,MAAM;IAId;;;;OAIG;IACH,OAAO,CAAC,OAAO;IAYf;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI;IAgCjD;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAY1C,2DAA2D;IAC3D,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI/B,wFAAwF;IACxF,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAQhC,8DAA8D;IAC9D,KAAK,IAAI,MAAM;IAIf;;;;;OAKG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAiBzC;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI;CASvC"}

package/dist/core/FenwickTree.js

@@ -0,0 +1,206 @@
+/**
+ * Fenwick Tree (Binary Indexed Tree) specialized for virtualization
+ * offset math.
+ *
+ * WHY THIS EXISTS:
+ * The previous VirtualizationEngine kept a plain prefix-sum array and
+ * rebuilt it in FULL - O(n) - every time a single item's measured size
+ * changed. For a dynamic-height list, that's not an edge case, it's the
+ * hot path: every batch of newly-measured rows during scroll paid an
+ * O(n) cost. That's the exact "gets slower as the list grows" trap
+ * virtualization exists to avoid.
+ *
+ * CORRECTNESS NOTE (read this before changing the growth logic):
+ * An earlier version of this class grew the tree by simply extending
+ * the array and point-updating only the newly added indices. That is
+ * WRONG for a Fenwick tree: a point update only propagates up to
+ * whatever `n` (capacity) was AT THE TIME of the update. If the tree
+ * later grows past that bound, ancestor nodes that only come into
+ * existence at the larger size never receive the earlier elements'
+ * contributions, and totals silently undercount. This was caught by
+ * a differential test against a naive reference array (see the repo's
+ * verify/fenwick_v2.test.mjs) - total() returned 3 instead of 8 in a
+ * minimal repro.
+ *
+ * The fix used here is the standard one: capacity is always a power
+ * of two, `raw[]` is kept as the single source of truth, and growth
+ * beyond current capacity triggers a full O(capacity) rebuild from
+ * raw[] (not from partial tree state). Because capacity doubles each
+ * time, the total rebuild work across the tree's lifetime is a
+ * geometric series - amortized O(1) extra cost per element, the same
+ * argument as dynamic array doubling. Growth WITHIN current capacity,
+ * and ordinary re-measurement of existing items, stay O(log n) point
+ * updates with no rebuild at all.
+ *
+ * Complexity summary for a tree of n items:
+ *   - re-measure one item:                  O(log n)  (O(capacity) amortized O(1) on the rare doubling frame)
+ *   - cumulative offset of any index:       O(log n)
+ *   - total content size:                   O(log n)
+ *   - locate the item under a scroll offset (every scroll frame): O(log n)
+ *   - append k new items:                   O(k log n), amortized
+ *
+ * All indices in the public API are 0-indexed.
+ */
+function lowbit(i) {
+    return i & -i;
+}
+function nextPow2(x) {
+    let p = 1;
+    while (p < x)
+        p <<= 1;
+    return p;
+}
+export class FenwickTree {
+    constructor(initialCount = 0) {
+        Object.defineProperty(this, "capacity", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "tree", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "raw", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "n", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: 0
+        });
+        this.capacity = nextPow2(Math.max(1, initialCount));
+        this.tree = new Array(this.capacity + 1).fill(0);
+        this.raw = new Array(this.capacity).fill(0);
+        if (initialCount > 0) {
+            this.resize(initialCount, 0);
+        }
+    }
+    size() {
+        return this.n;
+    }
+    /**
+     * Full linear-time rebuild from `raw[]`, the source of truth. Only
+     * called when capacity changes (doubling) - never on the per-item
+     * update hot path.
+     */
+    rebuild() {
+        this.tree = new Array(this.capacity + 1).fill(0);
+        for (let i = 1; i <= this.capacity; i++) {
+            this.tree[i] += this.raw[i - 1] ?? 0;
+            const parent = i + lowbit(i);
+            if (parent <= this.capacity) {
+                this.tree[parent] += this.tree[i];
+            }
+        }
+    }
+    /**
+     * Grow or shrink to hold `count` items. New slots default to
+     * `defaultValue` (the estimated item size). Shrinking zeroes the
+     * vacated raw slots so a later regrow never resurfaces stale data.
+     */
+    resize(count, defaultValue) {
+        if (count > this.capacity) {
+            const newCapacity = nextPow2(count);
+            const oldRaw = this.raw;
+            this.raw = new Array(newCapacity).fill(0);
+            for (let i = 0; i < oldRaw.length; i++) {
+                this.raw[i] = oldRaw[i];
+            }
+            for (let i = this.n; i < count; i++) {
+                this.raw[i] = defaultValue;
+            }
+            this.capacity = newCapacity;
+            this.rebuild();
+            this.n = count;
+            return;
+        }
+        if (count > this.n) {
+            for (let i = this.n; i < count; i++) {
+                this.update(i, defaultValue);
+            }
+            this.n = count;
+        }
+        else if (count < this.n) {
+            for (let i = count; i < this.n; i++) {
+                this.update(i, 0);
+            }
+            this.n = count;
+        }
+    }
+    /**
+     * Point update: set the value at `index` (0-indexed) to `value`.
+     * O(log n) - safe at any time because it never needs to propagate
+     * beyond the current (fixed until the next doubling) capacity.
+     */
+    update(index, value) {
+        if (index < 0 || index >= this.capacity)
+            return;
+        const delta = value - (this.raw[index] ?? 0);
+        if (delta === 0)
+            return;
+        this.raw[index] = value;
+        for (let i = index + 1; i <= this.capacity; i += lowbit(i)) {
+            this.tree[i] += delta;
+        }
+    }
+    /** Value currently stored at `index` (0-indexed). O(1). */
+    getValue(index) {
+        return this.raw[index] ?? 0;
+    }
+    /** Sum of values in [0, index) - the pixel offset at which `index` starts. O(log n). */
+    prefixSum(index) {
+        let sum = 0;
+        for (let i = Math.min(index, this.n); i > 0; i -= lowbit(i)) {
+            sum += this.tree[i];
+        }
+        return sum;
+    }
+    /** Sum of all n values - the total content size. O(log n). */
+    total() {
+        return this.prefixSum(this.n);
+    }
+    /**
+     * Locate the index whose range contains cumulative offset `target`.
+     * Runs on every scroll frame - an O(log n) walk directly over the
+     * tree structure (the classic Fenwick "find by prefix sum" walk),
+     * so it never needs a separately-maintained sorted array.
+     */
+    findIndexAtOffset(target) {
+        if (this.n === 0)
+            return 0;
+        let pos = 0;
+        let remaining = target;
+        for (let pw = this.capacity; pw > 0; pw >>= 1) {
+            const next = pos + pw;
+            if (next <= this.capacity && this.tree[next] <= remaining) {
+                pos = next;
+                remaining -= this.tree[next];
+            }
+        }
+        return Math.min(pos, this.n - 1);
+    }
+    /**
+     * Reset every value to `defaultValue` without changing capacity.
+     * Intentionally the one O(n)-ish path in this class (a full rebuild
+     * plus n point updates), reserved for explicit full invalidation -
+     * never used on the scroll hot path.
+     */
+    resetAll(defaultValue) {
+        for (let i = 0; i < this.n; i++) {
+            this.raw[i] = 0;
+        }
+        this.rebuild();
+        for (let i = 0; i < this.n; i++) {
+            this.update(i, defaultValue);
+        }
+    }
+}
+//# sourceMappingURL=FenwickTree.js.map

package/dist/core/FenwickTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FenwickTree.js","sourceRoot":"","sources":["../../src/core/FenwickTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,SAAS,MAAM,CAAC,CAAS;IACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACvB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC;QAAE,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,CAAC,CAAC;AACb,CAAC;AAED,MAAM,OAAO,WAAW;IAMpB,YAAY,YAAY,GAAG,CAAC;QALpB;;;;;WAAiB;QACjB;;;;;WAAe;QACf;;;;;WAAc;QACd;;;;mBAAI,CAAC;WAAC;QAGV,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE5C,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,OAAO;QACX,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAa,EAAE,YAAoB;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC;YAExB,IAAI,CAAC,GAAG,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;YAC/B,CAAC;YAED,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC;YAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;YACf,OAAO;QACX,CAAC;QAED,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YACjC,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;QACnB,CAAC;aAAM,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAa,EAAE,KAAa;QAC/B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEhD,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7C,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO;QAExB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;QAC1B,CAAC;IACL,CAAC;IAED,2DAA2D;IAC3D,QAAQ,CAAC,KAAa;QAClB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,wFAAwF;IACxF,SAAS,CAAC,KAAa;QACnB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED,8DAA8D;IAC9D,KAAK;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACH,iBAAiB,CAAC,MAAc;QAC5B,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE3B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,SAAS,GAAG,MAAM,CAAC;QAEvB,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;YACtB,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;gBACxD,GAAG,GAAG,IAAI,CAAC;gBACX,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,YAAoB;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;CACJ"}

package/dist/core/GridLayoutEngine.d.ts

@@ -0,0 +1,64 @@
+import { GridPosition } from '../types';
+export type RowHeightInput = number | ((index: number) => number);
+export interface GridLayoutParams {
+    cols: number;
+    colWidth: number;
+    gap: number;
+    layout: 'grid' | 'masonry';
+    rowHeight: RowHeightInput;
+}
+/**
+ * Incremental, append-only masonry/grid position engine.
+ *
+ * PERFORMANCE: the previous VirtualGrid recomputed EVERY item's
+ * position from scratch (a full O(n) pass) whenever the items array
+ * changed identity - including the ordinary infinite-scroll case of
+ * appending 20 new items to an existing 50,000-item masonry board,
+ * which turned a single "load more" into an O(n) pass over everything
+ * already laid out.
+ *
+ * This engine keeps running state - per-column heights for masonry, a
+ * running row-offset for dynamic-height grid rows - and only computes
+ * positions for items it hasn't seen before. Appending k new items
+ * costs O(k), never O(n + k). A full reset (columns/width/gap/layout
+ * changed) is the only path that pays an O(n) cost, same as any other
+ * virtualization library when the layout itself is invalidated.
+ *
+ * NOTE ON VIRTUAL_GRID'S FAST PATH: this engine is only used for
+ * masonry layout, or grid layout with a per-index rowHeight function.
+ * Plain grid layout with a fixed numeric rowHeight never touches this
+ * file at all - VirtualGrid computes those positions with direct O(1)
+ * arithmetic and no array (see VirtualGrid.tsx), which is faster still.
+ */
+export declare class GridLayoutEngine {
+    private positions;
+    private colHeights;
+    private rowOffsets;
+    private currentRowMax;
+    private maxBottom;
+    private params;
+    private sameParams;
+    private reset;
+    private sizeOf;
+    /** Masonry: place each new item in whichever column is currently shortest. */
+    private appendMasonry;
+    /**
+     * Grid with per-index rowHeight function: rows advance by the
+     * tallest item seen in that row so far. `rowOffsets[r]` is only
+     * ever written once (when row r's first item is appended), reading
+     * `currentRowMax` accumulated while row r-1 was being built - so
+     * this stays correct across multiple incremental append() calls,
+     * not just a single full pass.
+     */
+    private appendGrid;
+    /**
+     * Ensure positions exist for `itemCount` items under the given
+     * params. Existing entries are reused by reference - callers get
+     * back the same array instances for indices they've already seen,
+     * which keeps this cheap to call on every render.
+     */
+    sync(itemCount: number, p: GridLayoutParams): GridPosition[];
+    /** O(1) - tracked incrementally as items are appended, never rescanned. */
+    getTotalHeight(): number;
+}
+//# sourceMappingURL=GridLayoutEngine.d.ts.map

package/dist/core/GridLayoutEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GridLayoutEngine.d.ts","sourceRoot":"","sources":["../../src/core/GridLayoutEngine.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAExC,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;AAElE,MAAM,WAAW,gBAAgB;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,SAAS,EAAE,cAAc,CAAC;CAC7B;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,qBAAa,gBAAgB;IACzB,OAAO,CAAC,SAAS,CAAsB;IACvC,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,UAAU,CAAiB;IACnC,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,MAAM,CAAiC;IAE/C,OAAO,CAAC,UAAU;IAWlB,OAAO,CAAC,KAAK;IASb,OAAO,CAAC,MAAM;IAId,8EAA8E;IAC9E,OAAO,CAAC,aAAa;IAmBrB;;;;;;;OAOG;IACH,OAAO,CAAC,UAAU;IAyBlB;;;;;OAKG;IACH,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,gBAAgB,GAAG,YAAY,EAAE;IAiB5D,2EAA2E;IAC3E,cAAc,IAAI,MAAM;CAG3B"}