@jimka/typescript-ui 0.5.0 → 0.7.0

package/dist/lib/assets/StoreWorker-CgOBYoai.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"StoreWorker-CgOBYoai.js","names":[],"sources":["../../src/typescript/lib/data/FilterDescriptor.ts","../../src/typescript/lib/data/compareValues.ts","../../src/typescript/lib/data/StoreWorker.ts"],"sourcesContent":["// SPDX-License-Identifier: PolyForm-Noncommercial-1.0.0\n\n/**\n * Serializable filter algebra for {@link AbstractStore}. Descriptors are plain objects so\n * they can cross the worker boundary via structured clone (unlike arbitrary filter\n * functions, which can't). The same evaluator runs on either side.\n *\n * @category Data\n */\nexport type FilterDescriptor =\n    | { type: 'eq';         field: string; value: any }\n    | { type: 'neq';        field: string; value: any }\n    | { type: 'contains';   field: string; value: string; caseSensitive?: boolean }\n    | { type: 'startsWith'; field: string; value: string; caseSensitive?: boolean }\n    | { type: 'gt';         field: string; value: number | string | Date }\n    | { type: 'gte';        field: string; value: number | string | Date }\n    | { type: 'lt';         field: string; value: number | string | Date }\n    | { type: 'lte';        field: string; value: number | string | Date }\n    | { type: 'in';         field: string; values: any[] }\n    | { type: 'and';        filters: FilterDescriptor[] }\n    | { type: 'or';         filters: FilterDescriptor[] }\n    | { type: 'not';        filter:  FilterDescriptor };\n\n/**\n * Looks up a field's value from either a plain data object or a ModelRecord-like\n * object that exposes a `get(field)` method. Lets the same matcher run on both\n * sides of the worker boundary.\n */\nfunction readField(record: any, field: string): any {\n    if (record && typeof record.get === 'function') {\n        return record.get(field);\n    }\n    return record ? record[field] : undefined;\n}\n\n/**\n * Evaluates a FilterDescriptor against a record. Returns true if the record\n * matches the filter. Works with both plain data objects (worker side) and\n * ModelRecord instances (main thread side).\n */\nexport function matchesFilter(record: any, descriptor: FilterDescriptor): boolean {\n    switch (descriptor.type) {\n        case 'eq':\n            return readField(record, descriptor.field) === descriptor.value;\n\n        case 'neq':\n            return readField(record, descriptor.field) !== descriptor.value;\n\n        case 'contains': {\n            const raw = readField(record, descriptor.field);\n            if (raw == null) return false;\n            const haystack = descriptor.caseSensitive ? String(raw) : String(raw).toLowerCase();\n            const needle   = descriptor.caseSensitive ? descriptor.value : descriptor.value.toLowerCase();\n            return haystack.indexOf(needle) !== -1;\n        }\n\n        case 'startsWith': {\n            const raw = readField(record, descriptor.field);\n            if (raw == null) return false;\n            const haystack = descriptor.caseSensitive ? String(raw) : String(raw).toLowerCase();\n            const needle   = descriptor.caseSensitive ? descriptor.value : descriptor.value.toLowerCase();\n            return haystack.indexOf(needle) === 0;\n        }\n\n        case 'gt':\n            return readField(record, descriptor.field) > descriptor.value;\n\n        case 'gte':\n            return readField(record, descriptor.field) >= descriptor.value;\n\n        case 'lt':\n            return readField(record, descriptor.field) < descriptor.value;\n\n        case 'lte':\n            return readField(record, descriptor.field) <= descriptor.value;\n\n        case 'in':\n            return descriptor.values.indexOf(readField(record, descriptor.field)) !== -1;\n\n        case 'and':\n            for (const f of descriptor.filters) {\n                if (!matchesFilter(record, f)) return false;\n            }\n            return true;\n\n        case 'or':\n            for (const f of descriptor.filters) {\n                if (matchesFilter(record, f)) return true;\n            }\n            return false;\n\n        case 'not':\n            return !matchesFilter(record, descriptor.filter);\n    }\n}\n","// SPDX-License-Identifier: PolyForm-Noncommercial-1.0.0\n\nimport type { FieldType } from '~/data/Field.js';\n\n/**\n * Native ordering of two non-null values via `<` / `>`, returning the\n * ascending-sense sign. Used for numeric (and any non-string, non-date) fields.\n *\n * @param av - The left operand.\n * @param bv - The right operand.\n *\n * @returns A negative, zero, or positive number in ascending sense.\n */\nfunction nativeCompare(av: any, bv: any): number {\n    return av < bv ? -1 : av > bv ? 1 : 0;\n}\n\n/**\n * Type-aware, locale-aware comparison of two raw field values, returning a\n * negative / zero / positive number in **ascending** sense. This is the single\n * comparator shared by the main thread ({@link AbstractStore}) and the\n * `StoreWorker`, so the two sort paths can never drift.\n *\n * @param av - The left value.\n * @param bv - The right value.\n * @param type - Optional. The field's {@link FieldType}, which selects the\n *   comparison strategy (string → locale, date/time → timestamp, else native).\n *   When omitted, two string operands still use the locale path.\n *\n * @returns The ascending-sense comparison result.\n *\n * @remarks\n * `null`/`undefined` sort **last**: both null compare equal (`0`), and a single\n * null returns the sign that places it after a non-null value. Callers must\n * leave a null-involving result un-negated (apply sort direction only to a\n * non-null comparison) so nulls stay last regardless of `'asc'`/`'desc'`.\n *\n * String fields (or two string operands when `type` is unknown) use\n * `localeCompare`, so `'Ä'` orders between `'a'` and `'Z'` rather than after\n * `'Z'` by code point. Date/time fields compare by `getTime()` when both\n * operands are `Date`, falling through to native comparison otherwise.\n *\n * @category Data\n */\nexport function compareValues(av: any, bv: any, type?: FieldType): number {\n    if (av == null && bv == null) {\n        return 0;\n    }\n\n    if (av == null) {\n        return 1;\n    }\n\n    if (bv == null) {\n        return -1;\n    }\n\n    if (type === 'string' || (type === undefined && typeof av === 'string' && typeof bv === 'string')) {\n        return av.localeCompare(bv);\n    }\n\n    if (type === 'date' || type === 'datetime' || type === 'time') {\n        if (av instanceof Date && bv instanceof Date) {\n            return nativeCompare(av.getTime(), bv.getTime());\n        }\n    }\n\n    return nativeCompare(av, bv);\n}\n","// SPDX-License-Identifier: PolyForm-Noncommercial-1.0.0\n/* eslint-disable local/no-raw-dom -- Web Worker entry: self/postMessage are worker-scope messaging, not DOM. */\n//\n// Worker entry point for AbstractStore sort/filter offload. Runs in a Web Worker\n// context (Vite imports it via `?worker` query). Owns a per-store snapshot of\n// plain record data so sort/filter can run without re-shipping the dataset on\n// every operation. Returns sorted indices into the snapshot — main thread maps\n// them back to ModelRecord instances itself.\n\nimport { FilterDescriptor, matchesFilter } from \"~/data/FilterDescriptor.js\";\nimport { compareValues } from \"~/data/compareValues.js\";\nimport type { FieldType } from \"~/data/Field.js\";\n\ntype Direction = \"asc\" | \"desc\";\n\ntype StoreSnapshot = Array<Record<string, any>>;\n\ntype Request =\n    | { type: \"snapshot\";   storeId: string; records: StoreSnapshot;            requestId: number }\n    | { type: \"sortFilter\"; storeId: string; sort?: { field: string; direction: Direction; fieldType?: FieldType };\n                            filter?: FilterDescriptor;                           requestId: number };\n\ntype Response = { requestId: number; indices?: number[]; error?: string };\n\nconst snapshots: Map<string, StoreSnapshot> = new Map();\n\nfunction sortIndices(records: StoreSnapshot, indices: number[], field: string, direction: Direction, fieldType?: FieldType): void {\n    indices.sort((ai, bi) => {\n        const av = records[ai] ? records[ai][field] : undefined;\n        const bv = records[bi] ? records[bi][field] : undefined;\n\n        const cmp = compareValues(av, bv, fieldType);\n\n        // Nulls sort last regardless of direction: leave a null-involving result\n        // un-negated, applying direction only to a non-null comparison. This\n        // mirrors the main-thread comparator in AbstractStore.applyView().\n        if (av == null || bv == null) {\n            return cmp;\n        }\n\n        return direction === \"asc\" ? cmp : -cmp;\n    });\n}\n\nself.onmessage = (e: MessageEvent<Request>) => {\n    const msg = e.data;\n\n    try {\n        if (msg.type === \"snapshot\") {\n            snapshots.set(msg.storeId, msg.records);\n            (self as any).postMessage({ requestId: msg.requestId } as Response);\n            return;\n        }\n\n        const records = snapshots.get(msg.storeId);\n        if (!records) {\n            (self as any).postMessage({ requestId: msg.requestId, error: \"No snapshot for storeId \" + msg.storeId } as Response);\n            return;\n        }\n\n        let indices: number[] = [];\n        for (let i = 0; i < records.length; i++) {\n            indices.push(i);\n        }\n\n        if (msg.filter) {\n            indices = indices.filter(i => matchesFilter(records[i], msg.filter!));\n        }\n\n        if (msg.sort) {\n            sortIndices(records, indices, msg.sort.field, msg.sort.direction, msg.sort.fieldType);\n        }\n\n        (self as any).postMessage({ requestId: msg.requestId, indices } as Response);\n    } catch (err: any) {\n        (self as any).postMessage({ requestId: msg.requestId, error: String(err?.message ?? err) } as Response);\n    }\n};\n"],"mappings":"YA4BA,SAAS,EAAU,EAAa,EAAoB,CAIhD,OAHI,GAAU,OAAO,EAAO,KAAQ,WACzB,EAAO,IAAI,CAAK,EAEpB,EAAS,EAAO,GAAS,IAAA,EACpC,CAOA,SAAgB,EAAc,EAAa,EAAuC,CAC9E,OAAQ,EAAW,KAAnB,CACI,IAAK,KACD,OAAO,EAAU,EAAQ,EAAW,KAAK,IAAM,EAAW,MAE9D,IAAK,MACD,OAAO,EAAU,EAAQ,EAAW,KAAK,IAAM,EAAW,MAE9D,IAAK,WAAY,CACb,IAAM,EAAM,EAAU,EAAQ,EAAW,KAAK,EAC9C,GAAI,GAAO,KAAM,MAAO,GACxB,IAAM,EAAW,EAAW,cAAgB,OAAO,CAAG,EAAI,OAAO,CAAG,CAAC,CAAC,YAAY,EAC5E,EAAW,EAAW,cAAgB,EAAW,MAAQ,EAAW,MAAM,YAAY,EAC5F,OAAO,EAAS,QAAQ,CAAM,IAAM,EACxC,CAEA,IAAK,aAAc,CACf,IAAM,EAAM,EAAU,EAAQ,EAAW,KAAK,EAC9C,GAAI,GAAO,KAAM,MAAO,GACxB,IAAM,EAAW,EAAW,cAAgB,OAAO,CAAG,EAAI,OAAO,CAAG,CAAC,CAAC,YAAY,EAC5E,EAAW,EAAW,cAAgB,EAAW,MAAQ,EAAW,MAAM,YAAY,EAC5F,OAAO,EAAS,QAAQ,CAAM,IAAM,CACxC,CAEA,IAAK,KACD,OAAO,EAAU,EAAQ,EAAW,KAAK,EAAI,EAAW,MAE5D,IAAK,MACD,OAAO,EAAU,EAAQ,EAAW,KAAK,GAAK,EAAW,MAE7D,IAAK,KACD,OAAO,EAAU,EAAQ,EAAW,KAAK,EAAI,EAAW,MAE5D,IAAK,MACD,OAAO,EAAU,EAAQ,EAAW,KAAK,GAAK,EAAW,MAE7D,IAAK,KACD,OAAO,EAAW,OAAO,QAAQ,EAAU,EAAQ,EAAW,KAAK,CAAC,IAAM,GAE9E,IAAK,MACD,IAAK,IAAM,KAAK,EAAW,QACvB,GAAI,CAAC,EAAc,EAAQ,CAAC,EAAG,MAAO,GAE1C,MAAO,GAEX,IAAK,KACD,IAAK,IAAM,KAAK,EAAW,QACvB,GAAI,EAAc,EAAQ,CAAC,EAAG,MAAO,GAEzC,MAAO,GAEX,IAAK,MACD,MAAO,CAAC,EAAc,EAAQ,EAAW,MAAM,CACvD,CACJ,CCjFA,SAAS,EAAc,EAAS,EAAiB,CAC7C,OAAO,EAAK,EAAK,GAAK,IAAK,EAC/B,CA6BA,SAAgB,EAAc,EAAS,EAAS,EAA0B,CAuBtE,OAtBI,GAAM,MAAQ,GAAM,KACb,EAGP,GAAM,KACC,EAGP,GAAM,KACC,GAGP,IAAS,UAAa,IAAS,IAAA,IAAa,OAAO,GAAO,UAAY,OAAO,GAAO,SAC7E,EAAG,cAAc,CAAE,GAG1B,IAAS,QAAU,IAAS,YAAc,IAAS,SAC/C,aAAc,MAAQ,aAAc,KAC7B,EAAc,EAAG,QAAQ,EAAG,EAAG,QAAQ,CAAC,EAIhD,EAAc,EAAI,CAAE,CAC/B,CC5CA,IAAM,EAAwC,IAAI,IAElD,SAAS,EAAY,EAAwB,EAAmB,EAAe,EAAsB,EAA6B,CAC9H,EAAQ,MAAM,EAAI,IAAO,CACrB,IAAM,EAAK,EAAQ,GAAM,EAAQ,EAAG,CAAC,GAAS,IAAA,GACxC,EAAK,EAAQ,GAAM,EAAQ,EAAG,CAAC,GAAS,IAAA,GAExC,EAAM,EAAc,EAAI,EAAI,CAAS,EAS3C,OAJI,GAAM,MAAQ,GAAM,MAIjB,IAAc,MAHV,EAGwB,CAAC,CACxC,CAAC,CACL,CAEA,KAAK,UAAa,GAA6B,CAC3C,IAAM,EAAM,EAAE,KAEd,GAAI,CACA,GAAI,EAAI,OAAS,WAAY,CACzB,EAAU,IAAI,EAAI,QAAS,EAAI,OAAO,EACtC,KAAc,YAAY,CAAE,UAAW,EAAI,SAAU,CAAa,EAClE,MACJ,CAEA,IAAM,EAAU,EAAU,IAAI,EAAI,OAAO,EACzC,GAAI,CAAC,EAAS,CACV,KAAc,YAAY,CAAE,UAAW,EAAI,UAAW,MAAO,2BAA6B,EAAI,OAAQ,CAAa,EACnH,MACJ,CAEA,IAAI,EAAoB,CAAC,EACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAChC,EAAQ,KAAK,CAAC,EAGd,EAAI,SACJ,EAAU,EAAQ,OAAO,GAAK,EAAc,EAAQ,GAAI,EAAI,MAAO,CAAC,GAGpE,EAAI,MACJ,EAAY,EAAS,EAAS,EAAI,KAAK,MAAO,EAAI,KAAK,UAAW,EAAI,KAAK,SAAS,EAGxF,KAAc,YAAY,CAAE,UAAW,EAAI,UAAW,SAAQ,CAAa,CAC/E,OAAS,EAAU,CACf,KAAc,YAAY,CAAE,UAAW,EAAI,UAAW,MAAO,OAAO,GAAK,SAAW,CAAG,CAAE,CAAa,CAC1G,CACJ"}

package/dist/lib/selectionsEqual-BrTxPMmK.js

@@ -1,2 +0,0 @@
-import{t as e}from"./DOM-Ba8YRVel.js";import{t,u as n}from"./Component-w65rPK75.js";import{t as r}from"./VirtualScroller-cvFNMS7U.js";var i=2,VirtualRowView=class extends t{_rowPool=[];_boundIndices=[];_rowGeom=[];_rowDisplayed=[];_scroller=null;_renderDeferred=!1;_renderResumed=!1;_pendingScrollX=null;_pendingScrollY=null;_pendingScrollRow=null;initScroller(e){this._scroller=new r(this,e,()=>this.onScrollerTick());for(let e of this._scroller.ownedHandles())this.trackHandle(e)}onScrollerTick(){this.renderWindow()}destructor(){for(let e of this._rowPool)e.dispose();this._scroller?.dispose(),super.destructor()}setScrollX(e){return this._scroller?.resetWheelEase(),this.holdScrollWhileFirstLayoutHeld(`x`,e)||this._scroller?.setScrollX(e),this}setScrollY(e){return this._scroller?.resetWheelEase(),this.holdScrollWhileFirstLayoutHeld(`y`,e)||this._scroller?.setScrollY(e),this}holdScrollWhileFirstLayoutHeld(e,t){return n()?(e===`x`?this._pendingScrollX=t:(this._pendingScrollY=t,this._pendingScrollRow=null),!0):(e===`x`?this._pendingScrollX=null:(this._pendingScrollY=null,this._pendingScrollRow=null),!1)}applyPendingScroll(){let e=this._pendingScrollX,t=this._pendingScrollY,n=this._pendingScrollRow;this._pendingScrollX=null,this._pendingScrollY=null,this._pendingScrollRow=null,e!==null&&this.setScrollX(e),t!==null&&this.setScrollY(t),n!==null&&this.scrollRowIntoView(n)}computeVisibleWindow(e,t,n){let r=this.getRowHeight(),a=Math.max(0,Math.floor(e/r)-i),o=Math.min(n-1,Math.ceil((e+t)/r)+i);return{firstRow:a,lastRow:o,windowSize:o-a+1>0?o-a+1:0}}computePoolTarget(e,t,n){return Math.min(n,Math.max(e,Math.ceil(t/this.getRowHeight())+4+2))}computePageSize(){let e=this.getRowHeight();return Math.max(1,Math.floor((this.getHeight()||e)/e))}growRowPool(t){if(!this._scroller||this._rowPool.length>=t)return;let n=this._scroller.getRowsContainer(),r=e.sink.createDocumentFragment();for(;this._rowPool.length<t;){let t=this.createPoolRow(),n=t.getElement(!0);e.sink.appendChild(r,n),t.setY(0),t.setWillChange(`transform`),this._rowPool.push(t),this._boundIndices.push(-1),this._rowGeom.push(null),this._rowDisplayed.push(!1)}e.sink.appendChild(n,r),e.sink.release(r)}positionRow(e,t,n){let r=this._rowPool[e],i=this.getRowHeight(),a=this._rowGeom[e],o=!a||a.ty!==t||a.w!==n||a.h!==i;return o&&(r.setAutoCommitStyle(!1),r.setX(0),r.setTranslate(0,t),r.setWidth(n),r.setHeight(i),r.setAutoCommitStyle(!0),this._rowGeom[e]={ty:t,w:n,h:i}),this._rowDisplayed[e]||(r.setDisplayed(!0),this._rowDisplayed[e]=!0),o}hideExcessPoolRows(e){for(let t=e;t<this._rowPool.length;t++)this._rowDisplayed[t]&&(this._rowPool[t].setDisplayed(!1),this._rowDisplayed[t]=!1),this._boundIndices[t]=-1,this._rowGeom[t]=null}invalidateGeom(){for(let e=0;e<this._rowGeom.length;e++)this._rowGeom[e]=null}deferRenderWhileFirstLayoutHeld(){return n()?(this._renderDeferred=!0,this.scheduleLayout(),!0):(this._renderResumed=this._renderDeferred,this._renderDeferred=!1,!1)}wasRenderDeferred(){return this._renderDeferred}finishResumedRender(){let e=this._renderResumed;return this._renderResumed=!1,this.applyPendingScroll(),e}renderWindowIfDeferred(){return!this._renderDeferred||this.isLayoutPaused()?!1:(this.renderWindow(),!0)}onThemeReflow(){this._boundIndices.fill(-1),this.invalidateGeom(),this.renderWindow()}scrollRowIntoView(e){if(e<0||!this._scroller)return;if(n()){this._pendingScrollRow=e;return}let t=this.getRowHeight(),r=e*t,i=r+t,a=this._scroller.getScrollY(),o=this.getHeight(),s=a+o,c=a;r<a?c=r:i>s&&(c=i-o),c!==a&&this.setScrollY(c)}};function selectionsEqual(e,t){if(e.size!==t.size)return!1;for(let n of e)if(!t.has(n))return!1;return!0}export{VirtualRowView as n,selectionsEqual as t};
-//# sourceMappingURL=selectionsEqual-BrTxPMmK.js.map

package/dist/lib/selectionsEqual-BrTxPMmK.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"selectionsEqual-BrTxPMmK.js","names":[],"sources":["../../src/typescript/lib/component/shared/VirtualRowView.ts","../../src/typescript/lib/component/shared/selectionsEqual.ts"],"sourcesContent":["// SPDX-License-Identifier: PolyForm-Noncommercial-1.0.0\n\nimport { Component, ComponentOptions } from \"~/core/Component.js\";\nimport { DOM } from \"~/core/DOM.js\";\nimport type { Handle } from \"~/core/DOM.js\";\nimport { VirtualScroller } from \"~/component/container/VirtualScroller.js\";\nimport { isFirstLayoutHeld } from \"~/core/FirstLayoutGate.js\";\n\n/** Number of off-screen rows to render above and below the visible viewport. */\nconst SCROLL_BUFFER = 2;\n\n/**\n * Shared transform-windowed virtual-scroll base for the data views —\n * `table/Body` and `tree/Tree` are its only two subclasses. It owns the\n * recycled row pool (`_rowPool` and the parallel `_boundIndices` / `_rowGeom` /\n * `_rowDisplayed` bookkeeping arrays), the {@link VirtualScroller} wiring, and\n * the window / pool-growth / geometry reconciliation primitives each subclass's\n * render pass composes.\n *\n * Only two things genuinely diverge between the two consumers, so only those\n * are hooks:\n *\n * - **Row height** — `Body` derives it live from the theme line box; `Tree`\n *   uses a fixed constant. Read through {@link getRowHeight} on every call so a\n *   live theme change is honoured.\n * - **Row construction** — the pool-row scaffolding (fragment batching, `setY(0)`\n *   pin, `will-change` promotion, parallel-array bookkeeping) is identical; only\n *   the row object each subclass builds differs. {@link createPoolRow} returns a\n *   fully-constructed, un-appended row and the base owns the rest.\n *\n * The per-frame render pass itself ({@link renderWindow}) stays subclass-specific\n * because the content-width derivation genuinely diverges; the base exposes the\n * shared primitives it calls ({@link computeVisibleWindow},\n * {@link computePoolTarget}, {@link growRowPool}, {@link positionRow},\n * {@link hideExcessPoolRows}).\n *\n * @typeParam TRow - The concrete pooled row component type.\n * @typeParam TOptions - The subclass's options bag.\n *\n * @internal Not barrel-exported; the two subclasses are the only consumers.\n */\nabstract class VirtualRowView<\n    TRow extends Component,\n    TOptions extends ComponentOptions = ComponentOptions,\n> extends Component<TOptions> {\n\n    protected _rowPool      : TRow[]                                              = [];\n    protected _boundIndices : number[]                                           = [];\n    protected _rowGeom      : Array<{ ty: number, w: number, h: number } | null> = [];\n    protected _rowDisplayed : boolean[]                                          = [];\n    protected _scroller     : VirtualScroller | null                             = null;\n\n    /** Whether the startup font gate skipped a render pass that still owes a run. */\n    private _renderDeferred: boolean = false;\n    /** Whether the render now in flight is the one a skipped pass left pending. */\n    private _renderResumed : boolean = false;\n    /** Scroll offsets the gate held back, applied once a render pass has run. */\n    private _pendingScrollX: number | null = null;\n    private _pendingScrollY: number | null = null;\n    /** A row reveal the gate held back, recomputed once a render pass has run. */\n    private _pendingScrollRow: number | null = null;\n\n    /**\n     * Returns the height in pixels of a single row. Read on every window /\n     * geometry calculation, so a subclass that recomputes it (e.g. on a theme\n     * change) reflects the new value immediately.\n     */\n    protected abstract getRowHeight(): number;\n\n    /**\n     * Constructs one pool row, fully wired but not yet appended to the\n     * rows container — the base's {@link growRowPool} owns the append, the\n     * `setY(0)` pin, the `will-change` promotion, and the parallel-array\n     * bookkeeping.\n     */\n    protected abstract createPoolRow(): TRow;\n\n    /**\n     * Recomputes and reconciles the visible row window against the current\n     * scroll position and dataset. Subclass-specific because the content-width\n     * derivation diverges; both implementations compose the shared primitives\n     * on this base.\n     */\n    protected abstract renderWindow(): void;\n\n    /**\n     * Constructs the {@link VirtualScroller} for this view and tracks its\n     * container handles so they are released with the component. The scroller's\n     * onScroll hook is routed through {@link onScrollerTick}.\n     *\n     * @param element - This view's initialised element handle.\n     */\n    protected initScroller(element: Handle): void {\n        this._scroller = new VirtualScroller(this, element, () => this.onScrollerTick());\n\n        // Track the scroller's created container handles so they are released\n        // with this view (on destructor or GC); the scroller is not a Component.\n        for (const handle of this._scroller.ownedHandles()) {\n            this.trackHandle(handle);\n        }\n    }\n\n    /**\n     * Invoked on every scroller tick. Default behaviour re-renders the window;\n     * `Body` overrides it to additionally emit its scroll events.\n     */\n    protected onScrollerTick(): void {\n        this.renderWindow();\n    }\n\n    /**\n     * Destroys the pooled rows and the scroller's overlay scrollbars before the\n     * inherited teardown runs.\n     *\n     * {@link growRowPool} appends each row's element straight to the rows\n     * container and keeps the row only in `_rowPool`, so a pooled row is never\n     * registered as a child component and the base destructor's recursion over\n     * `_components` cannot reach it. Without this override neither the rows nor\n     * their cells (which *are* registered on their row) release their\n     * per-instance stylesheet rules, so the shared sheet grows by roughly the\n     * view's whole cell count on every teardown. The scroller's two\n     * `Scrollbar` overlays are raw-appended the same way, so they need the\n     * same explicit disposal.\n     */\n    protected destructor(): void {\n        for (const row of this._rowPool) {\n            row.dispose();\n        }\n\n        this._scroller?.dispose();\n\n        super.destructor();\n    }\n\n    /**\n     * Sets the JS-controlled horizontal scroll position. Delegates to the\n     * underlying {@link VirtualScroller}.\n     *\n     * @param x - The new scroll position in pixels.\n     */\n    setScrollX(x: number): this {\n        // Ahead of the hold: a programmatic scroll cancels an in-flight wheel\n        // ease whether or not the offset itself has to wait.\n        this._scroller?.resetWheelEase();\n\n        if (this.holdScrollWhileFirstLayoutHeld(\"x\", x)) {\n            return this;\n        }\n\n        this._scroller?.setScrollX(x);\n\n        return this;\n    }\n\n    /**\n     * Sets the JS-controlled vertical scroll position. Delegates to the\n     * underlying {@link VirtualScroller}.\n     *\n     * @param y - The new scroll position in pixels.\n     */\n    setScrollY(y: number): this {\n        // Ahead of the hold: a programmatic scroll cancels an in-flight wheel\n        // ease whether or not the offset itself has to wait.\n        this._scroller?.resetWheelEase();\n\n        if (this.holdScrollWhileFirstLayoutHeld(\"y\", y)) {\n            return this;\n        }\n\n        this._scroller?.setScrollY(y);\n\n        return this;\n    }\n\n    /**\n     * Holds a scroll offset set while the startup font gate is holding this\n     * view's render pass, for {@link applyPendingScroll} to apply once the pass\n     * has run.\n     *\n     * @param axis - Which offset is being set.\n     * @param offset - The requested offset in pixels.\n     *\n     * @returns `true` when the caller must return without scrolling.\n     *\n     * @remarks The scroller clamps every offset against a content extent that\n     * only the render pass publishes, so an offset set while that pass is\n     * deferred clamps to 0 and the request is lost — a row revealed during\n     * startup would end up selected but off-screen. This guards the offsets\n     * that are viewport-independent and so can be replayed verbatim: the\n     * table's `scrollToRecord`, and a consumer restoring a saved offset.\n     * `scrollRowIntoView` is held one level higher instead, by row index, since\n     * its target depends on a height the gate is also holding. The table's\n     * `scrollColumnIntoView` has that same width dependence but fires only from\n     * a pooled cell's editor, which cannot exist while the pass is deferred.\n     */\n    private holdScrollWhileFirstLayoutHeld(axis: \"x\" | \"y\", offset: number): boolean {\n        if (!isFirstLayoutHeld()) {\n            // This offset is being applied for real, so it supersedes anything\n            // held for the same axis — otherwise the held one would replay on\n            // the next render and revert it. A held row reveal is a vertical\n            // request too, so it goes with the Y offset.\n            if (axis === \"x\") {\n                this._pendingScrollX = null;\n            } else {\n                this._pendingScrollY   = null;\n                this._pendingScrollRow = null;\n            }\n\n            return false;\n        }\n\n        if (axis === \"x\") {\n            this._pendingScrollX = offset;\n        } else {\n            this._pendingScrollY   = offset;\n            this._pendingScrollRow = null;\n        }\n\n        return true;\n    }\n\n    /**\n     * Applies the scroll offsets {@link holdScrollWhileFirstLayoutHeld} held\n     * back, now that a render pass has published the content extent they clamp\n     * against. A no-op once they are applied.\n     */\n    private applyPendingScroll(): void {\n        const x   = this._pendingScrollX;\n        const y   = this._pendingScrollY;\n        const row = this._pendingScrollRow;\n\n        this._pendingScrollX   = null;\n        this._pendingScrollY   = null;\n        this._pendingScrollRow = null;\n\n        if (x !== null) {\n            this.setScrollX(x);\n        }\n\n        if (y !== null) {\n            this.setScrollY(y);\n        }\n\n        // Applied after the offsets, which is what makes a reveal win over a\n        // raw offset held before it. The reverse order is handled the other\n        // way: a raw offset set later clears the reveal outright, so the two\n        // vertical requests always resolve to whichever came last.\n        if (row !== null) {\n            this.scrollRowIntoView(row);\n        }\n    }\n\n    /**\n     * Computes the `[firstRow, lastRow]` data-index window visible in the\n     * current viewport, padded by `SCROLL_BUFFER` on each side and clamped to\n     * the dataset bounds.\n     *\n     * @param scrollY - The current scroll offset in pixels.\n     * @param visibleHeight - The viewport height in pixels.\n     * @param totalRows - The total number of rows in the dataset.\n     * @returns The `firstRow` / `lastRow` data indices and the number of rows in the window.\n     */\n    protected computeVisibleWindow(scrollY: number, visibleHeight: number, totalRows: number): { firstRow: number, lastRow: number, windowSize: number } {\n        const rowHeight = this.getRowHeight();\n        const firstRow  = Math.max(0, Math.floor(scrollY / rowHeight) - SCROLL_BUFFER);\n        const lastRow   = Math.min(\n            totalRows - 1,\n            Math.ceil((scrollY + visibleHeight) / rowHeight) + SCROLL_BUFFER\n        );\n        const windowSize = lastRow - firstRow + 1 > 0 ? lastRow - firstRow + 1 : 0;\n\n        return { firstRow, lastRow, windowSize };\n    }\n\n    /**\n     * Computes the row-pool target size: the max possible window for the\n     * current viewport, not just the current windowSize. windowSize shrinks\n     * near the top/bottom edges of the dataset because firstRow clamps to 0\n     * (and lastRow to totalRows-1); growing only to windowSize would force\n     * regrowth mid-scroll once the user passes a viewport-edge boundary. Pre-\n     * growing pays the per-row first-layout cost once.\n     *\n     * @param windowSize - The current visible-window size.\n     * @param visibleHeight - The viewport height in pixels.\n     * @param totalRows - The total number of rows in the dataset.\n     * @returns The pool target size.\n     */\n    protected computePoolTarget(windowSize: number, visibleHeight: number, totalRows: number): number {\n        return Math.min(\n            totalRows,\n            Math.max(\n                windowSize,\n                Math.ceil(visibleHeight / this.getRowHeight()) + 2 * SCROLL_BUFFER + 2\n            )\n        );\n    }\n\n    /**\n     * Computes the number of whole rows a page-nav keystroke should move by:\n     * one viewport height, floored to at least one row.\n     *\n     * @returns The page size in rows.\n     */\n    protected computePageSize(): number {\n        const rowHeight = this.getRowHeight();\n\n        return Math.max(1, Math.floor((this.getHeight() || rowHeight) / rowHeight));\n    }\n\n    /**\n     * Grows the row pool up to `poolTarget`, batching new row elements through\n     * a {@link DocumentFragment} so the live rows container sees a single\n     * append instead of N. Each new slot pins its static top to 0, promotes it\n     * to its own compositor layer, and extends the parallel bookkeeping arrays\n     * in lockstep.\n     *\n     * @param poolTarget - The target pool size.\n     */\n    protected growRowPool(poolTarget: number): void {\n        if (!this._scroller || this._rowPool.length >= poolTarget) {\n            return;\n        }\n\n        const rowsContainer = this._scroller.getRowsContainer();\n        const growFragment  = DOM.sink.createDocumentFragment();\n\n        while (this._rowPool.length < poolTarget) {\n            const row   = this.createPoolRow();\n            const rowEl = row.getElement(true)!;\n\n            DOM.sink.appendChild(growFragment, rowEl);\n\n            // Pin row's static top to 0 once. Per-frame Y offset comes from\n            // translateY, which is composite-only (avoids layout/paint per\n            // scroll tick).\n            row.setY(0);\n\n            // Pre-promote pooled rows to their own compositor layer so the first\n            // scroll-driven translate doesn't pay a layer-creation cost.\n            row.setWillChange(\"transform\");\n\n            this._rowPool.push(row);\n            this._boundIndices.push(-1);\n            this._rowGeom.push(null);\n            this._rowDisplayed.push(false);\n        }\n\n        DOM.sink.appendChild(rowsContainer, growFragment);\n        DOM.sink.release(growFragment);\n    }\n\n    /**\n     * Positions the pool slot at `slot` to `targetY` and sizes it to `rowWidth`,\n     * writing the translate/size only when the cached geometry differs from the\n     * target, and toggling the row displayed on the false→true edge.\n     *\n     * @param slot - The pool-slot index.\n     * @param targetY - The row's translate-Y offset in pixels.\n     * @param rowWidth - The row's width in pixels.\n     * @returns `true` when the geometry changed (the subclass may need to re-lay\n     *   out the row's children), `false` when it was already at the target.\n     */\n    protected positionRow(slot: number, targetY: number, rowWidth: number): boolean {\n        const row       = this._rowPool[slot];\n        const rowHeight = this.getRowHeight();\n        const prev      = this._rowGeom[slot];\n        const geomChanged = !prev || prev.ty !== targetY || prev.w !== rowWidth || prev.h !== rowHeight;\n\n        if (geomChanged) {\n            row.setAutoCommitStyle(false);\n            row.setX(0);\n            row.setTranslate(0, targetY);\n            row.setWidth(rowWidth);\n            row.setHeight(rowHeight);\n            row.setAutoCommitStyle(true);\n            this._rowGeom[slot] = { ty: targetY, w: rowWidth, h: rowHeight };\n        }\n\n        if (!this._rowDisplayed[slot]) {\n            row.setDisplayed(true);\n            this._rowDisplayed[slot] = true;\n        }\n\n        return geomChanged;\n    }\n\n    /**\n     * Hides pool slots whose index falls outside the visible window and\n     * clears their cached binding so the next bind triggers a full rebuild.\n     *\n     * @param windowSize - The number of pool slots currently in use.\n     */\n    protected hideExcessPoolRows(windowSize: number): void {\n        for (let i = windowSize; i < this._rowPool.length; i++) {\n            if (this._rowDisplayed[i]) {\n                this._rowPool[i].setDisplayed(false);\n                this._rowDisplayed[i] = false;\n            }\n            this._boundIndices[i] = -1;\n            this._rowGeom[i] = null;\n        }\n    }\n\n    /**\n     * Clears the cached row geometry so the next render re-applies positions and\n     * sizes for every slot. `Body` overrides this to additionally clear its\n     * per-cell geometry cache.\n     */\n    protected invalidateGeom(): void {\n        for (let i = 0; i < this._rowGeom.length; i++) {\n            this._rowGeom[i] = null;\n        }\n    }\n\n    /**\n     * Skips a render pass while the startup font gate is held, arranging for it\n     * to run once the gate opens.\n     *\n     * @returns `true` when the caller must return without rendering.\n     *\n     * @remarks Both subclasses call {@link renderWindow} from many synchronous\n     * entry points — `init`, a data change, a selection move — so a row's\n     * geometry is routinely committed outside the coalesced layout queue, and\n     * `init` in particular commits it the moment the element exists. Holding the\n     * queue therefore does not hold these views; they have to check the gate\n     * themselves. Deferring at this one choke point covers every entry point at\n     * once, rather than guarding each caller.\n     */\n    protected deferRenderWhileFirstLayoutHeld(): boolean {\n        if (!isFirstLayoutHeld()) {\n            // This render is going ahead, which satisfies anything a held pass\n            // left pending — clearing it keeps a later layout from replaying a\n            // startup-era pass over the fresher state this one just committed.\n            // Note that it also took over that pass's unfinished business, so\n            // flag it for `finishResumedRender` to pick up once it has rendered.\n            this._renderResumed  = this._renderDeferred;\n            this._renderDeferred = false;\n\n            return false;\n        }\n\n        this._renderDeferred = true;\n        this.scheduleLayout();\n\n        return true;\n    }\n\n    /**\n     * Whether the last render pass on this view was skipped by the startup font\n     * gate and is still waiting to run.\n     *\n     * @returns `true` while a pass is pending.\n     */\n    protected wasRenderDeferred(): boolean {\n        return this._renderDeferred;\n    }\n\n    /**\n     * Reports, once, that the render now finishing is the one a held pass left\n     * pending — so the caller can redo the post-render work that pass skipped.\n     *\n     * @returns `true` exactly once per resumed pass, at the end of the render\n     *   that resumed it.\n     *\n     * @remarks Called at the tail of {@link renderWindow} rather than from a\n     * layout hook because a render resumes from whichever entry point reaches\n     * it first, and for the table body that is the parent table layout calling\n     * `renderWindow` directly rather than anything going through `doLayout`.\n     */\n    protected finishResumedRender(): boolean {\n        // Read and clear before applying the scroll: applying it re-enters\n        // `renderWindow` through the scroller's onScroll hook, and that nested\n        // pass resets this flag. Reading it afterwards would lose the caller's\n        // post-render work on exactly the passes that carry both.\n        const resumed = this._renderResumed;\n\n        this._renderResumed = false;\n\n        // This pass has published the content extent, so any held offset can be\n        // applied now — whether or not the pass is itself the deferred one.\n        this.applyPendingScroll();\n\n        return resumed;\n    }\n\n    /**\n     * Runs the render pass the startup font gate deferred, if one is pending.\n     * Each subclass calls this from its own `doLayout`, which is what picks the\n     * pass back up once the gate opens.\n     *\n     * @returns `true` when a deferred pass ran, so the caller can skip a render\n     *   of its own and refresh whatever it keeps in step with the rendered rows.\n     *\n     * @remarks A paused view keeps its pass pending rather than running it: a\n     * parent's layout recursion reaches `Body.doLayout` regardless of the\n     * child's pause state, so rendering here would defeat a `pauseLayout` the\n     * caller asked for. (`Tree.doLayout` already returns early when paused, so\n     * the guard only binds for the body.) `resumeLayout` runs a layout of its\n     * own, which picks the pass up.\n     */\n    protected renderWindowIfDeferred(): boolean {\n        if (!this._renderDeferred || this.isLayoutPaused()) {\n            return false;\n        }\n\n        // The pending flag is left for `renderWindow`'s own gate check to\n        // consume: that is what marks this render as the resumed one, which\n        // `finishResumedRender` reads at the end of the pass.\n        this.renderWindow();\n\n        return true;\n    }\n\n    /**\n     * Re-binds and re-renders every pooled row after a text-metrics reflow —\n     * a theme change, or the web font swapping in over the fallback face.\n     *\n     * @remarks Pooled rows do not ride `ThemeManager`'s reflow for free. Both\n     * subclasses render through renderers whose `Text` runs with\n     * `setAutoMeasure(false)`, so a bound row only re-measures inside the\n     * renderer's `update()` — which {@link renderWindow} skips for a slot that\n     * is already bound to its data index. Without the `_boundIndices` reset a\n     * visible row therefore keeps the width it measured against whichever font\n     * was active when it was bound, clipping the wider glyphs of the real face\n     * once it arrives. Subclasses that cache metrics-derived state of their own\n     * (row height, content width) override this to refresh it, then chain up.\n     */\n    protected onThemeReflow(): void {\n        this._boundIndices.fill(-1);\n        this.invalidateGeom();\n        this.renderWindow();\n    }\n\n    /**\n     * Scrolls the view so the row at `index` is fully visible, without moving\n     * the viewport unless necessary. Delegates through {@link VirtualScroller}\n     * so the header translate + scrollbar thumb stay in sync.\n     *\n     * @param index - The data index of the row to reveal. A negative index is a\n     *   no-op (the row is not in the current view).\n     */\n    protected scrollRowIntoView(index: number): void {\n        if (index < 0 || !this._scroller) {\n            return;\n        }\n\n        // Hold the row, not a target. The target depends on this view's height,\n        // and at startup that height arrives from the very layout the gate is\n        // holding — so computing it now would either read an unset height and\n        // reveal nothing, or read 0 and scroll the row just out of view.\n        if (isFirstLayoutHeld()) {\n            this._pendingScrollRow = index;\n\n            return;\n        }\n\n        const rowHeight      = this.getRowHeight();\n        const top            = index * rowHeight;\n        const bottom         = top + rowHeight;\n        const scrollTop      = this._scroller.getScrollY();\n        const viewportHeight = this.getHeight();\n        const visibleBottom  = scrollTop + viewportHeight;\n\n        let target = scrollTop;\n        if (top < scrollTop) {\n            target = top;\n        } else if (bottom > visibleBottom) {\n            target = bottom - viewportHeight;\n        }\n        if (target !== scrollTop) {\n            this.setScrollY(target);\n        }\n    }\n}\n\nexport { VirtualRowView };\n","// SPDX-License-Identifier: PolyForm-Noncommercial-1.0.0\n\n/**\n * Compares two selection sets by membership only — size and element\n * identity, regardless of insertion order.\n *\n * Pure; no DOM, no component state.\n *\n * @typeParam T - The selection identity type.\n * @param a - One selection set.\n * @param b - The other selection set.\n * @returns `true` when both sets have the same size and every member of\n *   `a` is present in `b`.\n *\n * @internal Shared by `Tree` and `Body`; not barrel-exported.\n */\nexport function selectionsEqual<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): boolean {\n    if (a.size !== b.size) {\n        return false;\n    }\n\n    for (const item of a) {\n        if (!b.has(item)) {\n            return false;\n        }\n    }\n\n    return true;\n}\n"],"mappings":"sIASA,IAAM,EAAgB,EAgCP,eAAf,cAGU,CAAoB,CAE1B,SAAgF,CAAC,EACjF,cAA+E,CAAC,EAChF,SAA+E,CAAC,EAChF,cAA+E,CAAC,EAChF,UAA+E,KAG/E,gBAAmC,GAEnC,eAAmC,GAEnC,gBAAyC,KACzC,gBAAyC,KAEzC,kBAA2C,KAgC3C,aAAuB,EAAuB,CAC1C,KAAK,UAAY,IAAI,EAAgB,KAAM,MAAe,KAAK,eAAe,CAAC,EAI/E,IAAK,IAAM,KAAU,KAAK,UAAU,aAAa,EAC7C,KAAK,YAAY,CAAM,CAE/B,CAMA,gBAAiC,CAC7B,KAAK,aAAa,CACtB,CAgBA,YAA6B,CACzB,IAAK,IAAM,KAAO,KAAK,SACnB,EAAI,QAAQ,EAGhB,KAAK,WAAW,QAAQ,EAExB,MAAM,WAAW,CACrB,CAQA,WAAW,EAAiB,CAWxB,OARA,KAAK,WAAW,eAAe,EAE3B,KAAK,+BAA+B,IAAK,CAAC,GAI9C,KAAK,WAAW,WAAW,CAAC,EAHjB,IAMf,CAQA,WAAW,EAAiB,CAWxB,OARA,KAAK,WAAW,eAAe,EAE3B,KAAK,+BAA+B,IAAK,CAAC,GAI9C,KAAK,WAAW,WAAW,CAAC,EAHjB,IAMf,CAuBA,+BAAuC,EAAiB,EAAyB,CAuB7E,OAtBK,EAAkB,GAenB,IAAS,IACT,KAAK,gBAAkB,GAEvB,KAAK,gBAAoB,EACzB,KAAK,kBAAoB,MAGtB,KAjBC,IAAS,IACT,KAAK,gBAAkB,MAEvB,KAAK,gBAAoB,KACzB,KAAK,kBAAoB,MAGtB,GAWf,CAOA,oBAAmC,CAC/B,IAAM,EAAM,KAAK,gBACX,EAAM,KAAK,gBACX,EAAM,KAAK,kBAEjB,KAAK,gBAAoB,KACzB,KAAK,gBAAoB,KACzB,KAAK,kBAAoB,KAErB,IAAM,MACN,KAAK,WAAW,CAAC,EAGjB,IAAM,MACN,KAAK,WAAW,CAAC,EAOjB,IAAQ,MACR,KAAK,kBAAkB,CAAG,CAElC,CAYA,qBAA+B,EAAiB,EAAuB,EAA8E,CACjJ,IAAM,EAAY,KAAK,aAAa,EAC9B,EAAY,KAAK,IAAI,EAAG,KAAK,MAAM,EAAU,CAAS,EAAI,CAAa,EACvE,EAAY,KAAK,IACnB,EAAY,EACZ,KAAK,MAAM,EAAU,GAAiB,CAAS,EAAI,CACvD,EAGA,MAAO,CAAE,WAAU,UAAS,WAFT,EAAU,EAAW,EAAI,EAAI,EAAU,EAAW,EAAI,CAElC,CAC3C,CAeA,kBAA4B,EAAoB,EAAuB,EAA2B,CAC9F,OAAO,KAAK,IACR,EACA,KAAK,IACD,EACA,KAAK,KAAK,EAAgB,KAAK,aAAa,CAAC,EAAI,EAAoB,CACzE,CACJ,CACJ,CAQA,iBAAoC,CAChC,IAAM,EAAY,KAAK,aAAa,EAEpC,OAAO,KAAK,IAAI,EAAG,KAAK,OAAO,KAAK,UAAU,GAAK,GAAa,CAAS,CAAC,CAC9E,CAWA,YAAsB,EAA0B,CAC5C,GAAI,CAAC,KAAK,WAAa,KAAK,SAAS,QAAU,EAC3C,OAGJ,IAAM,EAAgB,KAAK,UAAU,iBAAiB,EAChD,EAAgB,EAAI,KAAK,uBAAuB,EAEtD,KAAO,KAAK,SAAS,OAAS,GAAY,CACtC,IAAM,EAAQ,KAAK,cAAc,EAC3B,EAAQ,EAAI,WAAW,EAAI,EAEjC,EAAI,KAAK,YAAY,EAAc,CAAK,EAKxC,EAAI,KAAK,CAAC,EAIV,EAAI,cAAc,WAAW,EAE7B,KAAK,SAAS,KAAK,CAAG,EACtB,KAAK,cAAc,KAAK,EAAE,EAC1B,KAAK,SAAS,KAAK,IAAI,EACvB,KAAK,cAAc,KAAK,EAAK,CACjC,CAEA,EAAI,KAAK,YAAY,EAAe,CAAY,EAChD,EAAI,KAAK,QAAQ,CAAY,CACjC,CAaA,YAAsB,EAAc,EAAiB,EAA2B,CAC5E,IAAM,EAAY,KAAK,SAAS,GAC1B,EAAY,KAAK,aAAa,EAC9B,EAAY,KAAK,SAAS,GAC1B,EAAc,CAAC,GAAQ,EAAK,KAAO,GAAW,EAAK,IAAM,GAAY,EAAK,IAAM,EAiBtF,OAfI,IACA,EAAI,mBAAmB,EAAK,EAC5B,EAAI,KAAK,CAAC,EACV,EAAI,aAAa,EAAG,CAAO,EAC3B,EAAI,SAAS,CAAQ,EACrB,EAAI,UAAU,CAAS,EACvB,EAAI,mBAAmB,EAAI,EAC3B,KAAK,SAAS,GAAQ,CAAE,GAAI,EAAS,EAAG,EAAU,EAAG,CAAU,GAG9D,KAAK,cAAc,KACpB,EAAI,aAAa,EAAI,EACrB,KAAK,cAAc,GAAQ,IAGxB,CACX,CAQA,mBAA6B,EAA0B,CACnD,IAAK,IAAI,EAAI,EAAY,EAAI,KAAK,SAAS,OAAQ,IAC3C,KAAK,cAAc,KACnB,KAAK,SAAS,EAAE,CAAC,aAAa,EAAK,EACnC,KAAK,cAAc,GAAK,IAE5B,KAAK,cAAc,GAAK,GACxB,KAAK,SAAS,GAAK,IAE3B,CAOA,gBAAiC,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,SAAS,OAAQ,IACtC,KAAK,SAAS,GAAK,IAE3B,CAgBA,iCAAqD,CAgBjD,OAfK,EAAkB,GAYvB,KAAK,gBAAkB,GACvB,KAAK,eAAe,EAEb,KATH,KAAK,eAAkB,KAAK,gBAC5B,KAAK,gBAAkB,GAEhB,GAOf,CAQA,mBAAuC,CACnC,OAAO,KAAK,eAChB,CAcA,qBAAyC,CAKrC,IAAM,EAAU,KAAK,eAQrB,MANA,MAAK,eAAiB,GAItB,KAAK,mBAAmB,EAEjB,CACX,CAiBA,wBAA4C,CAUxC,MATI,CAAC,KAAK,iBAAmB,KAAK,eAAe,EACtC,IAMX,KAAK,aAAa,EAEX,GACX,CAgBA,eAAgC,CAC5B,KAAK,cAAc,KAAK,EAAE,EAC1B,KAAK,eAAe,EACpB,KAAK,aAAa,CACtB,CAUA,kBAA4B,EAAqB,CAC7C,GAAI,EAAQ,GAAK,CAAC,KAAK,UACnB,OAOJ,GAAI,EAAkB,EAAG,CACrB,KAAK,kBAAoB,EAEzB,MACJ,CAEA,IAAM,EAAiB,KAAK,aAAa,EACnC,EAAiB,EAAQ,EACzB,EAAiB,EAAM,EACvB,EAAiB,KAAK,UAAU,WAAW,EAC3C,EAAiB,KAAK,UAAU,EAChC,EAAiB,EAAY,EAE/B,EAAS,EACT,EAAM,EACN,EAAS,EACF,EAAS,IAChB,EAAS,EAAS,GAElB,IAAW,GACX,KAAK,WAAW,CAAM,CAE9B,CACJ,EC7iBA,SAAgB,gBAAmB,EAAmB,EAA4B,CAC9E,GAAI,EAAE,OAAS,EAAE,KACb,MAAO,GAGX,IAAK,IAAM,KAAQ,EACf,GAAI,CAAC,EAAE,IAAI,CAAI,EACX,MAAO,GAIf,MAAO,EACX"}

package/dist/lib/types/component/table/CellGeometry.d.ts

@@ -1,6 +0,0 @@
-import { Component } from "../../core/Component.js";
-export declare class CellGeometryCache {
-    private _geometry;
-    clear(): void;
-    apply(cell: Component, x: number, w: number, h: number): void;
-}