@aiquants/virtualscroll 1.18.0 → 1.18.3

package/dist/useFenwickMapTree.d.ts

@@ -0,0 +1,451 @@
+type MaterializeRange = {
+    from: number;
+    to: number;
+};
+type MaterializeOption = {
+    materialize: boolean;
+    ranges?: MaterializeRange[];
+};
+type MaterializeConfig = {
+    materializeOption?: MaterializeOption;
+};
+type DeltaUpdate = {
+    index: number;
+    change: number;
+};
+type ValueUpdate = {
+    index: number;
+    value: number;
+};
+/**
+ * @class FenwickTree
+ * @classdesc Implements a Fenwick Tree (or Binary Indexed Tree).
+ * This data structure efficiently calculates prefix sums and performs updates in logarithmic time.
+ * It is particularly useful for virtual scrolling, where it can manage the offsets of variably sized items.
+ *
+ * @classdesc Fenwick Tree (バイナリインデックスツリー) の実装。
+ * このデータ構造は、接頭辞和の計算と更新を対数時間で効率的に実行。
+ * 可変サイズのアイテムのオフセットを管理できるため、特に仮想スクロールで有用。
+ *
+ * @remarks Memory: exact offsets are the design priority, so every materialized/updated row keeps
+ * an entry in `tree` and `deltas`. Memory therefore grows with the number of materialized elements,
+ * not with `size`. Rows equal to `baseValue` are pruned (zero-delta), but there is no eviction of
+ * measured deltas — evicting one would silently snap that row back to the estimated `baseValue` and
+ * corrupt `total`, which is incompatible with the exact-offset guarantee. If a hard memory ceiling
+ * is required, discard off-screen measured heights in the consumer layer (e.g. an LRU height cache)
+ * and let those rows fall back to the estimate there, rather than inside this tree.
+ * @remarks メモリ: 厳密オフセットを設計上の最優先とするため、具現化/更新された行はすべて `tree` と
+ * `deltas` にエントリを保持する。よってメモリは `size` ではなく具現化済み要素数に比例して増える。
+ * `baseValue` と一致する行は zero-delta 枝刈りされるが、計測済み delta の evict は行わない。evict すると
+ * その行が黙って推定値 `baseValue` へ戻り `total` が破損し、厳密オフセット保証と両立しないためである。
+ * ハードなメモリ上限が必要な場合は、この木の内部ではなく消費側 (LRU 高さキャッシュ等) で可視域外の
+ * 実測値を破棄し、そこで既定推定へ委ねる設計とすること。
+ */
+export declare class FenwickMapTree {
+    /**
+     * @private
+     * @property {Map<number, number>} tree - The Map storing the Fenwick tree structure, specifically the sums of deltas. It is 1-indexed.
+     * @property {Map<number, number>} tree - Fenwick Tree 構造を格納する Map。特に差分の合計を保持する。1-indexed。
+     */
+    private tree;
+    /**
+     * @private
+     * @property {Map<number, number>} deltas - The Map storing the differences (deltas) from the base value at each index.
+     * @property {Map<number, number>} deltas - 各インデックスにおける基準値との差分 (delta) を格納する Map。
+     */
+    private deltas;
+    /**
+     * @private
+     * @property {number} size - The number of elements the tree manages.
+     * @property {number} size - ツリーが管理する要素数。
+     */
+    private size;
+    /**
+     * @private
+     * @property {number} baseValue - The uniform base value for all elements, used to optimize memory.
+     * @property {number} baseValue - 全要素の均一な基準値。メモリ最適化のために使用。
+     */
+    private baseValue;
+    /**
+     * @private
+     * @property {((index: number) => number) | undefined} valueFn - A function to generate values, stored for lazy initialization.
+     * @property {((index: number) => number) | undefined} valueFn - 値を生成するための関数。遅延初期化のために保存される。
+     */
+    private valueFn?;
+    private total?;
+    /**
+     * @constructor
+     * @description Initializes the Fenwick Tree.
+     * @description Fenwick Tree の初期化。
+     * @param {number} size - The total number of items.
+     * @param {number | ((index: number) => number)} valueOrFn - The value for all elements, or a function to generate values.
+     * @param {{ sampleRange?: { from: number; to: number }, materialize?: boolean }} [options] - Optional settings for initialization.
+     */
+    constructor(size: number, valueOrFn: number | ((index: number) => number), options?: {
+        sampleRange?: {
+            from: number;
+            to: number;
+        };
+        materialize?: boolean;
+    });
+    /**
+     * @method reset
+     * @description Resets the Fenwick Tree with a new size and initial values. The size is
+     * normalized on entry (non-finite/negative sizes collapse to 0, fractions are truncated).
+     * When `valueOrFn` is a function, all sampling/materialization values are computed and
+     * validated (finite-only) before the tree state is mutated, so a `valueFn` returning
+     * NaN/Infinity throws while leaving the previous tree state intact instead of a half-built one.
+     * @description Fenwick Tree を新しいサイズと初期値でリセット。size は入口で正規化する
+     * (非有限/負は 0 に縮退、小数は切り捨て)。`valueOrFn` が関数の場合、サンプリング/具現化の値は
+     * 木の状態を変異させる前に計算・検証 (有限数のみ) するため、NaN/Infinity を返す `valueFn` は
+     * throw しつつ木を半構築で残さず直前の状態を無傷に保つ方針。
+     * @param {number} size - The total number of items.
+     * @param {number | ((index: number) => number)} valueOrFn - The value for all elements, or a function to generate values.
+     * @param {{ sampleRange?: { from: number; to: number }, materialize?: boolean }} [options] - Optional settings for initialization.
+     */
+    reset(size: number, valueOrFn: number | ((index: number) => number), options?: {
+        sampleRange?: {
+            from: number;
+            to: number;
+        };
+        materialize?: boolean;
+    }): void;
+    /**
+     * @method setValueFn
+     * @description Updates the value function and re-initializes the tree.
+     * @description 値関数を更新し、ツリーを再初期化する。
+     * @param {number | ((index: number) => number)} valueOrFn - The new value for all elements, or a function to generate values.
+     * @param {{ reset?: boolean }} [options] - Optional settings. If reset is true, the tree is reset with the new value function.
+     */
+    setValueFn(valueOrFn: number | ((index: number) => number), options?: {
+        reset?: boolean;
+    }): void;
+    /**
+     * @private
+     * @method _collectValidatedValues
+     * @description Evaluates `valueFn` over the inclusive `[from, to]` range and returns the values, throwing on any non-finite result. Validation happens here, before any tree mutation, so a poisoned `valueFn` can never leave the tree half-built.
+     * @description `valueFn` を閉区間 `[from, to]` で評価して値配列を返す。非有限値は throw で拒否。検証を木の変異前 (このメソッド内) で行うことで、汚染された `valueFn` が木を半構築のまま残す事態の防止。
+     * @param {(index: number) => number} valueFn - The value-generating function to evaluate.
+     * @param {number} from - The starting index of the range (inclusive).
+     * @param {number} to - The ending index of the range (inclusive).
+     * @returns {number[]} The validated (finite-only) values in index order.
+     */
+    private static _collectValidatedValues;
+    /**
+     * @private
+     * @method _modeOrMedian
+     * @description Reduces a sample of generated values to a single representative height: the mode when it is frequent enough to be trustworthy, otherwise the median. A value is only accepted as the mode when its frequency exceeds 20% of the sample; this prevents periodic or near-uniform data (where sampling bias can make an arbitrary value momentarily frequent) from picking an unrepresentative base. Multiple co-modes are averaged.
+     * @description サンプル値を 1 つの代表的な高さへ縮約する。信頼できるほど頻出する場合は最頻値を、そうでなければ中央値を返す。最頻値はサンプルの 20% を超える頻度のときのみ採用し、周期的/ほぼ一様なデータ (サンプリング偏りで任意の値が一時的に頻出しうる) が非代表値を選ぶのを防ぐ。同率最頻値が複数ある場合は平均する。
+     * @param {number[]} values - The sampled values (mutated in place by sorting).
+     * @returns {number} The representative base value.
+     */
+    private static _modeOrMedian;
+    /**
+     * @private
+     * @method _sampleBaseValueStrided
+     * @description Estimates `baseValue` by evaluating `valueFn` at up to `sampleCount` points spread across the entire `[0, size-1]` range, then reducing them via `_modeOrMedian`. Spanning the whole list (rather than a fixed head window) makes the majority height win even when the first items are atypical (hero/heading rows). The stride uses `ceil(size / sampleCount)` so the samples always span the whole range — `floor` would collapse to stride 1 for `sampleCount < size < 2 * sampleCount` and only ever look at the head. The stride is also forced odd to avoid aliasing against common even-period layouts (e.g. alternating or 20-row cycles), which a stride that shares a factor with the period would otherwise collapse into a single residue. For a uniform list every sample is identical, so the estimate is unchanged. Non-finite sample values throw before any state is touched.
+     * @description `valueFn` を `[0, size-1]` 全域に散らした最大 `sampleCount` 点で評価し、`_modeOrMedian` で縮約して `baseValue` を推定する。先頭固定ウィンドウではなくリスト全体を跨ぐことで、先頭が非典型 (ヒーロー/見出し行) でも多数派の高さが選ばれる。ストライドは `ceil(size / sampleCount)` を用いて常に全域を跨がせる (`floor` だと `sampleCount < size < 2 * sampleCount` で stride=1 に潰れ先頭しか見ない盲点が生じる)。さらに奇数へ強制し、周期と公約数を持つストライドがサンプルを 1 剰余類へ潰してしまう周期レイアウト (交互・20行周期など) とのエイリアシングを避ける。一様リストでは全サンプルが同一なので推定値は不変。非有限のサンプル値は状態を変異させる前に throw で拒否。
+     * @param {(index: number) => number} valueFn - The value-generating function to sample.
+     * @param {number} size - The total number of items the tree will manage.
+     * @param {number} sampleCount - Maximum number of points to evaluate.
+     * @returns {number} The estimated base value.
+     */
+    private static _sampleBaseValueStrided;
+    /**
+     * @method update
+     * @description Updates the value at a given index.
+     * @description 指定されたインデックスの値を更新。
+     * @param {number} index - The 0-based index to update.
+     * @param {number} value - The new value.
+     */
+    update(index: number, value: number): number | undefined;
+    /**
+     * @method updates
+     * @description Updates the values at given indices.
+     * @description 指定されたインデックスの値を更新。
+     * @param {ValueUpdate[]} updates - An array of updates, each with an index and the new value.
+     */
+    updates(updates: ValueUpdate[]): number | undefined;
+    /**
+     * @method updateDelta
+     * @description Updates the delta at a given index and propagates the change through the tree. A change that would make the effective value (`baseValue` + delta) negative is rejected with an error, mirroring the negative-value rejection of `update`/`updates`.
+     * @description 指定されたインデックスのデルタを更新し、変更をツリーに伝播させる。適用後の実効値 (`baseValue` + delta) が負になる変更は `update`/`updates` の負値拒否と対称に throw で拒否する方針。
+     * @param {number} index - The 0-based index to update.
+     * @param {number} change - The value to add to the delta at the given index.
+     */
+    updateDelta(index: number, change: number): number | undefined;
+    /**
+     * @method updateDeltas
+     * @description Updates the deltas at given indices and propagates the changes through the tree. All entries are validated up front (atomicity): out-of-range or non-integer indices, non-finite changes, and changes whose resulting effective value (`baseValue` + delta) would turn negative are rejected with an error before anything is applied. Negative effective values would break the monotonic prefix sums that `_descend`/`_findIndexLarge` rely on.
+     * @description 指定されたインデックスのデルタを更新し、変更をツリーに伝播させる。全件を先に検証してから適用する (アトミック性): 範囲外/非整数の index、非有限の change、適用後の実効値 (`baseValue` + delta) が負になる変更はいずれも適用前に throw で拒否。負の実効値は `_descend`/`_findIndexLarge` が前提とする累積和の単調性を破壊するため。
+     * @param {DeltaUpdate[]} updates - An array of updates, each with an index and the change to apply.
+     */
+    updateDeltas(updates: DeltaUpdate[]): number | undefined;
+    /**
+     * @private
+     * @method _updateTree
+     * @description Updates the Fenwick tree and the total sum with a given change.
+     * @description Fenwick Tree と合計値を指定された変更で更新する。
+     * @param {number} index - The 0-based index that changed.
+     * @param {number} change - The change in value.
+     */
+    private _updateTree;
+    /**
+     * @private
+     * @method _buildDeltaUpdates
+     * @description Converts value updates into delta updates while preserving validation logic.
+     * @description 値更新入力を検証しつつデルタ更新へ変換する。
+     * @param {ValueUpdate[]} updates - Requested value updates.
+     * @returns {DeltaUpdate[]} Sanitized delta updates ready to apply.
+     */
+    private _buildDeltaUpdates;
+    /**
+     * @private
+     * @method _computeTreeTotal
+     * @description Calculates the total height represented by the current Fenwick tree structure, reproducing the same traversal used by `prefixSum` at the last index to avoid floating-point drift.
+     * @description Fenwick 木が保持する合計値を算出する。末尾インデックスでの `prefixSum` と同一の走査手順を再現し、浮動小数点の誤差を防ぐ。
+     * @returns {number} The total height encoded in the Fenwick tree.
+     */
+    private _computeTreeTotal;
+    /**
+     * @private
+     * @method _materialize
+     * @description Materializes the value at a specific index if it hasn't been already. A non-finite `valueFn` result throws before any mutation, symmetric with the update-path validation, so the tree is never poisoned.
+     * @description 特定のインデックスの値がまだ具現化されていない場合に具現化する。`valueFn` の非有限な返値は変異前に throw で拒否 (update 系の検証と対称) し、木を汚染させない方針。
+     * @param {number} index - The 0-based index to materialize.
+     * @param {boolean} [updateTree=true] - Whether to update the Fenwick tree after materialization.
+     */
+    private _materialize;
+    /**
+     * @private
+     * @method _materializeRanges
+     * @description Materializes values for provided ranges and optionally a target index, keeping existing semantics for each caller.
+     * @description 指定された範囲とターゲットインデックスを既存仕様通りに具現化する。
+     * @param {MaterializeOption | undefined} option - Materialization option wrapper.
+     * @param {number | undefined} index - Target index for materialization.
+     * @param {boolean} [forceIndex=false] - When true, materializes the index even if it is outside the provided ranges.
+     */
+    private _materializeRanges;
+    /**
+     * @private
+     * @method _findIndex
+     * @description Executes a binary search over prefix sums to find the first index satisfying a boundary condition.
+     * @description 累積和に対する二分探索を行い、境界条件を満たす最初のインデックスを求める。
+     * @param {number} target - Target cumulative value.
+     * @param {MaterializeConfig} options - Materialization setting wrapper.
+     * @param {boolean} chooseLowerBound - When true, finds the smallest index meeting or exceeding the target; otherwise finds the largest index not exceeding it.
+     * @returns {{ index: number; total: number | undefined; cumulative: number | undefined; currentValue: number | undefined; safeIndex: number | undefined }} Binary search result.
+     */
+    private _findIndex;
+    /**
+     * @private
+     * @method _descend
+     * @description Performs a single bitwise descent over the current tree state, returning the candidate index for the boundary condition without mutating the tree.
+     * @description 現在の木の状態に対してビット降下を 1 回実行し、木を変異させずに境界条件の候補インデックスを返す。
+     * @param {number} target - Target cumulative value.
+     * @param {boolean} chooseLowerBound - When true, finds the smallest index meeting or exceeding the target; otherwise finds the largest index not exceeding it.
+     * @returns {number} The candidate index (may be out of range when no index satisfies the condition).
+     */
+    private _descend;
+    /**
+     * Executes a binary search using bigint arithmetic for extremely large sizes.
+     *
+     * 非常に大きなサイズに対して bigint 演算を用いた二分探索を実施。
+     */
+    private _findIndexLarge;
+    /**
+     * @method prefixSum
+     * @description Calculates the cumulative sum up to a given index (inclusive) in O(log n) time.
+     * @description 指定されたインデックスまでの累積和を O(log n) で計算。
+     * @param {number} index - The 0-based index to prefixSum up to.
+     * @param {MaterializeConfig} [options] - Optional settings for materializing values.
+     * @returns {{ cumulative: number; total: number | undefined; currentValue: number; safeIndex: number }} The cumulative sum of values from index 0 to the given index, the total sum, and the value at the given index.
+     */
+    prefixSum(index: number, options?: MaterializeConfig): {
+        cumulative: number;
+        total: number | undefined;
+        currentValue: number;
+        safeIndex: number;
+    };
+    /**
+     * @method get
+     * @description Gets the value at a specific index.
+     * @description 特定のインデックスの値を取得。
+     * @param {number} index - The 0-based index to get.
+     * @param {MaterializeConfig} [options] - Optional settings for materializing values.
+     * @returns {number} The value at the given index.
+     */
+    get(index: number, options?: MaterializeConfig): number;
+    /**
+     * @method getTotal
+     * @description Gets the total sum of all values in the tree.
+     * @description ツリー内のすべての値の合計を取得。
+     * @param {MaterializeConfig} [options] - Optional settings for materializing values.
+     * @returns {number} The total sum of all values.
+     */
+    getTotal(options?: MaterializeConfig): number;
+    /**
+     * @method rebuildTree
+     * @description Rebuilds the Fenwick Tree from the existing `baseValue` and `deltas`. This corrects any discrepancies in the tree's internal state, such as those caused by floating-point errors, by recalculating the tree structure and the total sum from the source `deltas`. This method does not re-materialize values from `valueFn`.
+     * @description 既存の `baseValue` と `deltas` から Fenwick Tree を再構築します。これにより、`deltas` からツリー構造と合計値を再計算することで、浮動小数点誤差などによって生じた内部状態の不一致を修正します。このメソッドは `valueFn` から値を再具現化しません。
+     * @param {object} [options] - Optional settings for rebuilding.
+     * @param {boolean} [options.materialize=false] - If true and `valueFn` is provided, re-materializes all values, recalculating `deltas` and `baseValue`.
+     */
+    rebuildTree(options?: {
+        materialize?: boolean;
+    }): void;
+    /**
+     * @method calculateAccumulatedError
+     * @description Compares the cached total sum with a theoretical total calculated directly from the source values (`deltas` and `baseValue`, or `valueFn`). This helps detect any discrepancy in the tree's cached state, which might be caused by floating-point errors or other inconsistencies.
+     * @description キャッシュされている合計値と、元の値 (`deltas` と `baseValue`、または `valueFn`) から直接計算した理論上の合計値とを比較します。これにより、浮動小数点数の累積誤差やその他の不整合によって生じる可能性のある、ツリーのキャッシュ状態の不一致を検出できます。
+     * @returns {number} The difference between the cached total and the theoretical total.
+     */
+    calculateAccumulatedError(): number;
+    /**
+     * @method changeSize
+     * @description Changes the size of the Fenwick Tree. Only tail growth/shrink is modelled: this
+     * method receives a size delta, not an index mapping, so it assumes items are appended to or
+     * removed from the tail. Existing rows keep their index-to-height association. It therefore
+     * cannot represent a middle insertion/deletion — after such a structural change the index↔height
+     * mapping is no longer preserved and the tree's deltas would apply to the wrong rows. Consumers
+     * that insert or remove items in the middle must instead reset the tree (see
+     * `useFenwickMapTree`'s `resetOnValueFnChange`, surfaced as `resetOnGetItemHeightChange` in
+     * VirtualScroll) or remount the component with a new `key`.
+     * @description Fenwick Tree のサイズを変更する。モデル化するのは末尾の伸長/縮小のみ: 本メソッドは
+     * サイズ差分のみを受け取りインデックスの対応表は受け取らないため、要素は末尾に追加/末尾から削除
+     * されると仮定する。既存行は index↔高さ の対応を保つ。したがって中間挿入/削除は表現できず、その
+     * ような構造変更の後は index↔高さ の対応が保存されず、木の delta が誤った行へ適用されてしまう。
+     * 中間で要素を挿入/削除する消費側は、代わりに木をリセットするか (`useFenwickMapTree` の
+     * `resetOnValueFnChange`。VirtualScroll では `resetOnGetItemHeightChange` として公開) 、新しい
+     * `key` でコンポーネントを再マウントすること。
+     * @remarks Validation: a non-finite `newSize` (NaN/Infinity) throws because it would poison
+     * `size`/`total` irrecoverably. Fractional sizes are truncated and negative sizes collapse to 0,
+     * matching the normalization rule of `reset`.
+     * @remarks 検証: 非有限の `newSize` (NaN/Infinity) は `size`/`total` を復旧不能に汚染するため
+     * throw。小数は切り捨て、負値は 0 に縮退 (`reset` の正規化規則と同一)。
+     * @param {number} newSize - The new size of the tree.
+     */
+    changeSize(newSize: number): void;
+    /**
+     * @private
+     * @method _minCoveredLowBound
+     * @description Computes `min(t - lowestSetBit(t))` over the newly-activated node range `t in (oldSize, newSize]`. Any delta whose 1-based tree index is at or below this bound cannot be covered by any newly-activated node and can be skipped during an incremental grow.
+     * @description 新規有効化ノード範囲 `t in (oldSize, newSize]` にわたる `min(t - lowestSetBit(t))` を算出する。1 始まりの木インデックスがこの下限以下の delta はどの新規ノードにも覆われないため、増分伸長時にスキップできる。
+     * @param {number} oldSize - The previous size (exclusive lower bound of the new node range).
+     * @param {number} newSize - The new size (inclusive upper bound of the new node range).
+     * @returns {number} The minimum left boundary `t - lowestSetBit(t)` of the newly-activated nodes.
+     */
+    private static _minCoveredLowBound;
+    /**
+     * @private
+     * @method _propagateDeltaToGrownNodes
+     * @description Propagates a single delta into the tree nodes newly activated by a tail growth, i.e. parent-chain nodes in `(oldSize, newSize]`.
+     * @description 末尾伸長で新規有効化されたノード ((oldSize, newSize] にある親チェーンノード) へ単一 delta を伝播する。
+     * @param {number} index - The 0-based delta index.
+     * @param {number} delta - The delta value to propagate.
+     * @param {number} oldSize - The previous size.
+     * @param {number} newSize - The new (larger) size.
+     */
+    private _propagateDeltaToGrownNodes;
+    /**
+     * @private
+     * @method _growSize
+     * @description Extends the tree to a larger size incrementally, propagating existing deltas into newly-activated higher-order tree nodes only. Candidate deltas are narrowed via `_minCoveredLowBound`, so a typical `+1` tail append costs amortized O(log n) instead of O(D log n) (D = number of materialized deltas).
+     * @description ツリーを末尾方向に増分的に拡張する。既存 delta を新たに有効化された上位ノードにのみ伝播する。候補 delta は `_minCoveredLowBound` で絞り込むため、通常の +1 末尾追記は O(D log n) (D = 具現化済み delta 数) ではなく償却 O(log n) で済む。
+     * @param {number} oldSize - The previous size.
+     * @param {number} newSize - The new (larger) size.
+     */
+    private _growSize;
+    /**
+     * @method getSize
+     * @description Gets the size of the tree.
+     * @description ツリーのサイズを取得。
+     * @returns {number} The total number of items.
+     */
+    getSize(): number;
+    /**
+     * @method findIndexAtOrAfter
+     * @description Finds the first index where the cumulative sum is greater than or equal to a target value.
+     * @description 累積和がターゲット値以上になる最初のインデックスを検索。
+     * @param {number} target - The target cumulative sum.
+     * @param {MaterializeConfig} [options] - Optional settings for materializing values.
+     * @param {MaterializeOption} [options.materializeOption] - Options to control materialization.
+     * @param {boolean} [options.materializeOption.materialize=false] - Whether to materialize values.
+     * @param {MaterializeRange[]} [options.materializeOption.ranges] - Optional ranges for eager materialization.
+     * @returns {{ index: number, total: number | undefined, cumulative: number | undefined, currentValue: number | undefined, safeIndex: number | undefined }} The 0-based index and the total sum, or -1 if not found.
+     */
+    findIndexAtOrAfter(target: number, options?: MaterializeConfig): {
+        index: number;
+        total: number | undefined;
+        cumulative: number | undefined;
+        currentValue: number | undefined;
+        safeIndex: number | undefined;
+    };
+    /**
+     * @method findIndexAtOrBefore
+     * @description Finds the last index where the cumulative sum is less than or equal to a target value.
+     * @description 累積和がターゲット値以下になる最後のインデックスを検索。
+     * @param {number} target - The target cumulative sum.
+     * @param {MaterializeConfig} [options] - Optional settings for materializing values.
+     * @param {MaterializeOption} [options.materializeOption] - Options to control materialization。
+     * @param {boolean} [options.materializeOption.materialize=false] - Whether to materialize values。
+     * @param {MaterializeRange[]} [options.materializeOption.ranges] - Optional ranges for eager materialization。
+     * @returns {{ index: number, total: number | undefined, cumulative: number | undefined, currentValue: number | undefined, safeIndex: number | undefined }} The 0-based index and the total sum, or -1 if not found.
+     */
+    findIndexAtOrBefore(target: number, options?: MaterializeConfig): {
+        index: number;
+        total: number | undefined;
+        cumulative: number | undefined;
+        currentValue: number | undefined;
+        safeIndex: number | undefined;
+    };
+}
+/**
+ * @hook useFenwickMapTree
+ * @description A React hook that creates and manages a `FenwickMapTree` instance.
+ * The tree instance is stable across re-renders. A new tree instance is created
+ * if `size` or `valueOrFn` changes.
+ * @description `FenwickMapTree` インスタンスを作成・管理する React フック。
+ * ツリーインスタンスは再レンダリングされても同一性を維持する。`size` または `valueOrFn` が
+ * 変更された場合に新しいインスタンスが作成される。
+ *
+ * @remarks Structural changes: `size` changes are treated as tail append/remove (see
+ * `FenwickMapTree.changeSize`). If a `size`/`itemCount` change actually reflects a middle
+ * insertion or deletion, the `valueOrFn` index↔height association is not preserved by an
+ * incremental resize; set `resetOnValueFnChange` to `true` (so the tree fully re-samples on
+ * every `valueOrFn` change) or remount with a new `key` when the list structure changes.
+ * @remarks 構造変更: `size` 変更は末尾追加/削除として扱う (`FenwickMapTree.changeSize` 参照)。
+ * `size`/`itemCount` の変更が実は中間挿入/削除を表す場合、増分リサイズでは `valueOrFn` の
+ * index↔高さ 対応が保存されないため、`resetOnValueFnChange` を `true` にする (毎回の `valueOrFn`
+ * 変更で木を全面再サンプリング) か、リスト構造変更時に新しい `key` で再マウントすること。
+ *
+ * @remarks Render-phase design constraint: this hook applies tree changes synchronously during
+ * render (not in an effect) because VirtualScroll reads `getTotal()` synchronously right after a
+ * size change. A consequence is that React concurrent's discarded renders are not undone — a
+ * shrink (deltas deletion) is irreversible if the render is thrown away. To stay safe, always pass
+ * a memoized `options`/`sampleRange` (e.g. `useMemo`) and a memoized `valueOrFn` (e.g. `useCallback`)
+ * so an unstable reference does not trigger a destructive reset every render.
+ * @remarks render フェーズの設計上の制約: 本フックはツリー変更を effect ではなく render 中に同期的に
+ * 適用する。VirtualScroll がサイズ変更直後に `getTotal()` を同期的に読む契約に依存するためである。
+ * 結果として React concurrent の破棄されたレンダーは巻き戻されず、縮小 (deltas 削除) はレンダーが
+ * 破棄されると不可逆になる。安全のため `options`/`sampleRange` は必ずメモ化して渡し (`useMemo`)、
+ * `valueOrFn` もメモ化する (`useCallback`) こと。不安定な参照は毎レンダーの破壊的 reset を招く。
+ *
+ * @param {number} size - The total number of items.
+ * @param {number | ((index: number) => number)} valueOrFn - The value for all elements, or a function to generate values.
+ * @param {number | ((index: number) => number)} valueOrFn - 全要素の均一な値、または値を生成する関数。不要なツリーの再作成を防ぐため、この関数は `useCallback` でメモ化すること。
+ * @param {{ sampleRange?: { from: number; to: number }, resetOnValueFnChange?: boolean, debug?: boolean }} [options] - Optional settings.
+ * @param {{ sampleRange?: { from: number; to: number } }} [options] - 初期化時のオプション設定。不要なツリーの再作成を防ぐため、このオブジェクトは `useMemo` でメモ化すること。
+ * @returns {FenwickMapTree} The FenwickMapTree instance.
+ * @returns {FenwickMapTree} FenwickMapTree インスタンス。
+ */
+export declare const useFenwickMapTree: (size: number, valueOrFn: number | ((index: number) => number), options?: {
+    sampleRange?: {
+        from: number;
+        to: number;
+    };
+    debug?: boolean;
+    resetOnValueFnChange?: boolean;
+}) => FenwickMapTree;
+export {};
+//# sourceMappingURL=useFenwickMapTree.d.ts.map

package/dist/useFenwickMapTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useFenwickMapTree.d.ts","sourceRoot":"","sources":["../src/useFenwickMapTree.ts"],"names":[],"mappings":"AA4BA,KAAK,gBAAgB,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAA;AACpD,KAAK,iBAAiB,GAAG;IAAE,WAAW,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,gBAAgB,EAAE,CAAA;CAAE,CAAA;AAC9E,KAAK,iBAAiB,GAAG;IAAE,iBAAiB,CAAC,EAAE,iBAAiB,CAAA;CAAE,CAAA;AAClE,KAAK,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AACpD,KAAK,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAA;AA+DnD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,cAAc;IACvB;;;;OAIG;IACH,OAAO,CAAC,IAAI,CAAsB;IAElC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAsB;IAEpC;;;;OAIG;IACH,OAAO,CAAC,IAAI,CAAS;IAErB;;;;OAIG;IACH,OAAO,CAAC,SAAS,CAAS;IAE1B;;;;OAIG;IACH,OAAO,CAAC,OAAO,CAAC,CAA2B;IAC3C,OAAO,CAAC,KAAK,CAAC,CAAQ;IAEtB;;;;;;;OAOG;gBACS,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC;QAAC,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE;IAI1J;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC;QAAC,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE;IA6FpJ;;;;;;OAMG;IACH,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE;IAoBzF;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAQtC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;IA4C5B;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAqBtC;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIxD;;;;;OAKG;IACH,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,MAAM,GAAG,SAAS;IAQnD;;;;;;OAMG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAI9D;;;;;OAKG;IACH,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,MAAM,GAAG,SAAS;IAkDxD;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;IAqBnB;;;;;;;OAOG;IACH,OAAO,CAAC,kBAAkB;IAoC1B;;;;;;OAMG;IACH,OAAO,CAAC,iBAAiB;IAmBzB;;;;;;;OAOG;IACH,OAAO,CAAC,YAAY;IA4BpB;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IAwC1B;;;;;;;;;OASG;IACH,OAAO,CAAC,UAAU;IA0DlB;;;;;;;;OAQG;IACH,OAAO,CAAC,QAAQ;IA+BhB;;;;OAIG;IACH,OAAO,CAAC,eAAe;IA4EvB;;;;;;;OAOG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;IAoCjJ;;;;;;;OAOG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,MAAM;IAiBvD;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,iBAAiB,GAAG,MAAM;IAmB7C;;;;;;OAMG;IACH,WAAW,CAAC,OAAO,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE;IAiC/C;;;;;OAKG;IACH,yBAAyB,IAAI,MAAM;IAgBnC;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM;IAoC1B;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAmBlC;;;;;;;;;OASG;IACH,OAAO,CAAC,2BAA2B;IAsBnC;;;;;;;OAOG;IACH,OAAO,CAAC,SAAS;IAqCjB;;;;;OAKG;IACH,OAAO,IAAI,MAAM;IAIjB;;;;;;;;;;OAUG;IACH,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE;IAI9M;;;;;;;;;;OAUG;IACH,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE;CAGlN;AAwBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,MAAM,EAAE,WAAW,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,UAAU;IAAE,WAAW,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;IAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;CAAE,KAAG,cA0E5M,CAAA"}

package/dist/useHeightCache.d.cts

@@ -0,0 +1,15 @@
+/**
+ * A custom hook that provides a cache for storing the heights of items, backed by an LRU cache.
+ * This helps in optimizing virtual scrolling by avoiding re-computation of item heights.
+ * The key is the item's index (number), and the value is its height (number).
+ *
+ * LRU キャッシュを利用して、アイテムの高さを保存するためのキャッシュを提供するカスタムフック。
+ * これにより、アイテムの高さの再計算を回避し、仮想スクロールを最適化します。
+ * キーはアイテムのインデックス (number)、値はその高さ (number) です。
+ */
+export declare const useHeightCache: () => {
+    get: (key: number) => number | undefined;
+    set: (key: number, value: number) => void;
+    has: (key: number) => boolean;
+    clear: () => void;
+};

package/dist/useHeightCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useHeightCache.d.ts","sourceRoot":"","sources":["../src/useHeightCache.ts"],"names":[],"mappings":"AAcA;;;;;;;;GAQG;AACH,eAAO,MAAM,cAAc;;;;;CAQ1B,CAAA"}

package/dist/{src/useLruCache.d.ts → useLruCache.d.cts}

@@ -2,9 +2,16 @@
  * @hook useLruCache
  * @description A custom hook that provides a Least Recently Used (LRU) cache of a specified capacity.
  * It returns an object with methods to interact with the cache (`get`, `set`, `has`, `remove`, `clear`).
+ * `Infinity` is treated as an unbounded cache (entries are stored and never evicted),
+ * while `NaN` or a negative capacity is invalid (nothing is stored, existing entries are cleared, and a warning is logged).
+ * A fractional capacity is normalized with `Math.floor` so that both the set path and the pruning
+ * effect share the same effective capacity.
  * @description 指定された容量の LRU (Least Recently Used) キャッシュを提供するカスタムフック。
  * キャッシュを操作するためのメソッド (`get`, `set`, `has`, `remove`, `clear`) を持つオブジェクトを返します。
- * @param {number} capacity - The maximum capacity of the cache.
+ * `Infinity` は無制限キャッシュ (格納し、evict しない)、`NaN` / 負値は無効容量
+ * (格納せず、既存エントリも全消去し、警告をログ) として扱う仕様。
+ * 小数の capacity は `Math.floor` で正規化し、set 経路と刈り込み effect が同じ実効容量を共有する。
+ * @param {number} capacity - The maximum capacity of the cache. `Infinity` means unbounded; `NaN` / negative values are invalid; fractional values are floored.
  * @returns {{ get: (key: K) => V | undefined, set: (key: K, value: V) => void, has: (key: K) => boolean, remove: (key: K) => void, clear: () => void }} An object with methods to interact with the cache.
  */
 export declare function useLruCache<K, V>(capacity: number): {
@@ -14,4 +21,3 @@ export declare function useLruCache<K, V>(capacity: number): {
     remove: (key: K) => void;
     clear: () => void;
 };
-//# sourceMappingURL=useLruCache.d.ts.map

package/dist/useLruCache.d.ts

@@ -0,0 +1,24 @@
+/**
+ * @hook useLruCache
+ * @description A custom hook that provides a Least Recently Used (LRU) cache of a specified capacity.
+ * It returns an object with methods to interact with the cache (`get`, `set`, `has`, `remove`, `clear`).
+ * `Infinity` is treated as an unbounded cache (entries are stored and never evicted),
+ * while `NaN` or a negative capacity is invalid (nothing is stored, existing entries are cleared, and a warning is logged).
+ * A fractional capacity is normalized with `Math.floor` so that both the set path and the pruning
+ * effect share the same effective capacity.
+ * @description 指定された容量の LRU (Least Recently Used) キャッシュを提供するカスタムフック。
+ * キャッシュを操作するためのメソッド (`get`, `set`, `has`, `remove`, `clear`) を持つオブジェクトを返します。
+ * `Infinity` は無制限キャッシュ (格納し、evict しない)、`NaN` / 負値は無効容量
+ * (格納せず、既存エントリも全消去し、警告をログ) として扱う仕様。
+ * 小数の capacity は `Math.floor` で正規化し、set 経路と刈り込み effect が同じ実効容量を共有する。
+ * @param {number} capacity - The maximum capacity of the cache. `Infinity` means unbounded; `NaN` / negative values are invalid; fractional values are floored.
+ * @returns {{ get: (key: K) => V | undefined, set: (key: K, value: V) => void, has: (key: K) => boolean, remove: (key: K) => void, clear: () => void }} An object with methods to interact with the cache.
+ */
+export declare function useLruCache<K, V>(capacity: number): {
+    get: (key: K) => V | undefined;
+    set: (key: K, value: V) => void;
+    has: (key: K) => boolean;
+    remove: (key: K) => void;
+    clear: () => void;
+};
+//# sourceMappingURL=useLruCache.d.ts.map

package/dist/useLruCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useLruCache.d.ts","sourceRoot":"","sources":["../src/useLruCache.ts"],"names":[],"mappings":"AA4HA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM;eAwDhB,CAAC,KAAG,CAAC,GAAG,SAAS;eAqBjB,CAAC,SAAS,CAAC;eA6CX,CAAC,KAAG,OAAO;kBAWR,CAAC;;EA2BrC"}

package/dist/{src/utils.d.ts → utils.d.cts}

@@ -3,10 +3,12 @@
  *
  * 指定された値が最小値と最大値の範囲内に収まるように調整。
  *
+ * min > max のような退化した入力でも、下限 (min) を下回る値を返さない。
+ * (Math.min を内側に置くことで、min > max のときは常に min を返す。)
+ *
  * @param value The value to clamp. / クランプする値。
  * @param min The minimum value. / 最小値。
  * @param max The maximum value. / 最大値。
  * @returns The clamped value. / クランプされた値。
  */
 export declare const minmax: (value: number, min: number, max: number) => number;
-//# sourceMappingURL=utils.d.ts.map

package/dist/utils.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Clamps a value between a minimum and maximum value.
+ *
+ * 指定された値が最小値と最大値の範囲内に収まるように調整。
+ *
+ * min > max のような退化した入力でも、下限 (min) を下回る値を返さない。
+ * (Math.min を内側に置くことで、min > max のときは常に min を返す。)
+ *
+ * @param value The value to clamp. / クランプする値。
+ * @param min The minimum value. / 最小値。
+ * @param max The maximum value. / 最大値。
+ * @returns The clamped value. / クランプされた値。
+ */
+export declare const minmax: (value: number, min: number, max: number) => number;
+//# sourceMappingURL=utils.d.ts.map

package/dist/{src/utils.d.ts.map → utils.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,KAAG,MAEhE,CAAA"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,KAAG,MAEhE,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aiquants/virtualscroll",
-  "version": "1.18.0",
+  "version": "1.18.3",
   "description": "High-performance virtual scrolling component for React with variable item heights",
   "sideEffects": [
     "**/*.css"
@@ -11,9 +11,14 @@
   "types": "./dist/index.d.ts",
   "exports": {
     ".": {
-      "types": "./dist/index.d.ts",
-      "import": "./dist/index.js",
-      "require": "./dist/index.cjs",
+      "import": {
+        "types": "./dist/index.d.ts",
+        "default": "./dist/index.js"
+      },
+      "require": {
+        "types": "./dist/index.d.cts",
+        "default": "./dist/index.cjs"
+      },
       "default": "./dist/index.js"
     },
     "./styles/virtualscroll.css": "./dist/styles/virtualscroll.css"
@@ -31,7 +36,7 @@
     "react-dom": "^19.2.7"
   },
   "dependencies": {
-    "tailwind-merge": "^2.6.0"
+    "tailwind-merge": "^3.4.0"
   },
   "devDependencies": {
     "@playwright/test": "^1.59.1",
@@ -75,8 +80,9 @@
     "access": "public"
   },
   "scripts": {
-    "build": "vite build && vite build --config vite.config.cli.ts && pnpm build:css",
+    "build": "vite build && vite build --config vite.config.cli.ts && pnpm build:css && pnpm build:cts",
     "build:css": "tailwindcss -i src/styles/tailwind.css -o dist/styles/virtualscroll.css --minify",
+    "build:cts": "node -e \"const fs=require('node:fs');const re=/(from\\s+')(\\.{1,2}\\/[^']+)\\.(?:tsx|ts)(')/g;for(const f of fs.readdirSync('dist')){if(!f.endsWith('.d.ts'))continue;const s=fs.readFileSync('dist/'+f,'utf8').replace(re,(_m,p,spec,q)=>p+spec+'.cjs'+q).replace(/^\\/\\/# sourceMappingURL=.*(\\r?\\n)?/gm,'');fs.writeFileSync('dist/'+f.slice(0,-5)+'.d.cts',s)}\"",
     "dev": "vite build --watch",
     "watch": "vite build --watch",
     "watch:css": "pnpm build:css --watch",

package/dist/src/ScrollBar.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ScrollBar.d.ts","sourceRoot":"","sources":["../../src/ScrollBar.tsx"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAiB,SAAS,EAAE,MAAM,OAAO,CAAA;AAIrD,OAAO,EAA8E,KAAK,0BAA0B,EAAE,MAAM,uBAAuB,CAAA;AAiEnJ;;;;GAIG;AACH,MAAM,MAAM,yBAAyB,GAAG;IACpC,oEAAoE;IACpE,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,uDAAuD;IACvD,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,qDAAqD;IACrD,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,mFAAmF;IACnF,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,iFAAiF;IACjF,kBAAkB,CAAC,EAAE,MAAM,CAAA;IAC3B,iFAAiF;IACjF,kBAAkB,CAAC,EAAE,MAAM,CAAA;IAC3B,wEAAwE;IACxE,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,4EAA4E;IAC5E,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,0BAA0B,KAAK,SAAS,CAAA;IAC/D,4FAA4F;IAC5F,aAAa,CAAC,EAAE;QACZ,qEAAqE;QACrE,oBAAoB,EAAE,MAAM,CAAA;QAC5B,gEAAgE;QAChE,gBAAgB,CAAC,EAAE,MAAM,CAAA;QACzB,4EAA4E;QAC5E,WAAW,CAAC,EAAE,MAAM,CAAA;KACvB,CAAA;CACJ,CAAA;AAaD,qIAAqI;AACrI,eAAO,MAAM,uBAAuB,oCAAoC,CAAA;AAExE;;;;GAIG;AACH,MAAM,MAAM,gCAAgC,GAAG;IAC3C,WAAW,EAAE,UAAU,GAAG,YAAY,CAAA;IACtC,cAAc,EAAE,MAAM,CAAA;IACtB,iBAAiB,EAAE,MAAM,CAAA;IACzB,WAAW,EAAE,MAAM,CAAA;IACnB,YAAY,EAAE,MAAM,CAAA;IACpB,SAAS,EAAE,MAAM,CAAA;IACjB,aAAa,EAAE,MAAM,CAAA;IACrB,WAAW,EAAE,MAAM,CAAA;IACnB,SAAS,EAAE,MAAM,CAAA;IACjB,UAAU,EAAE,OAAO,CAAA;IACnB,iBAAiB,EAAE,OAAO,CAAA;IAC1B,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,eAAe,CAAC,EAAE,MAAM,CAAA;CAC3B,CAAA;AAED,MAAM,MAAM,cAAc,GAAG;IACzB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAA;IACnB,gDAAgD;IAChD,YAAY,EAAE,MAAM,CAAA;IACpB,iDAAiD;IACjD,cAAc,EAAE,MAAM,CAAA;IACtB,wIAAwI;IACxI,QAAQ,CAAC,EAAE,CAAC,cAAc,EAAE,MAAM,GAAG,CAAC,CAAC,YAAY,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,CAAA;IACrH,iFAAiF;IACjF,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB,wFAAwF;IACxF,gBAAgB,CAAC,EAAE,OAAO,CAAA;IAC1B,qFAAqF;IACrF,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAC5B,6DAA6D;IAC7D,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,+CAA+C;IAC/C,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,mEAAmE;IACnE,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,+EAA+E;IAC/E,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,6DAA6D;IAC7D,sBAAsB,CAAC,EAAE,yBAAyB,CAAA;IAClD,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,6EAA6E;IAC7E,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,gCAAgC,KAAK,SAAS,CAAA;IAC3E,+DAA+D;IAC/D,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,8DAA8D;IAC9D,eAAe,CAAC,EAAE,MAAM,CAAA;CAC3B,CAAA;AA8LD;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,iQAiBvB,cAAc,gCAqwBhB,CAAA"}

package/dist/src/ScrollPane.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ScrollPane.d.ts","sourceRoot":"","sources":["../../src/ScrollPane.tsx"],"names":[],"mappings":"AAGA,OAAO,EAAa,KAAK,yBAAyB,EAAE,KAAK,gCAAgC,EAA2B,MAAM,iBAAiB,CAAA;AAG3I;;;;GAIG;AACH,MAAM,MAAM,uBAAuB,GAAG;IAClC,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,MAAM,CAAC,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,eAAe,GAAG;IAC1B;;;;;;OAMG;IACH,QAAQ,EAAE,CAAC,cAAc,EAAE,MAAM,KAAK,KAAK,CAAC,SAAS,CAAA;IACrD,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAA;IACnB,gDAAgD;IAChD,YAAY,EAAE,MAAM,CAAA;IACpB,+CAA+C;IAC/C,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,iFAAiF;IACjF,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB,6GAA6G;IAC7G,QAAQ,CAAC,EAAE,CAAC,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,KAAK,IAAI,CAAA;IACjE,mEAAmE;IACnE,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,2DAA2D;IAC3D,KAAK,CAAC,EAAE,KAAK,CAAC,aAAa,CAAA;IAC3B,wFAAwF;IACxF,UAAU,CAAC,EAAE,KAAK,CAAC,SAAS,CAAA;IAC5B,6DAA6D;IAC7D,sBAAsB,CAAC,EAAE,yBAAyB,CAAA;IAClD,+DAA+D;IAC/D,cAAc,CAAC,EAAE,wBAAwB,CAAA;IACzC,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,2FAA2F;IAC3F,gBAAgB,CAAC,EAAE,OAAO,CAAA;IAC1B,mFAAmF;IACnF,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAC5B,uFAAuF;IACvF,iBAAiB,CAAC,EAAE,OAAO,CAAA;IAC3B,qEAAqE;IACrE,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,gCAAgC,KAAK,KAAK,CAAC,SAAS,CAAA;IACjF,qGAAqG;IACrG,oBAAoB,CAAC,EAAE,MAAM,CAAA;IAC7B;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAA;IAC5C,4EAA4E;IAC5E,aAAa,CAAC,EAAE,uBAAuB,CAAA;IACvC,+DAA+D;IAC/D,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,8DAA8D;IAC9D,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,iGAAiG;IACjG,aAAa,CAAC,EAAE,MAAM,KAAK,CAAC,SAAS,CAAA;IACrC,6CAA6C;IAC7C,qBAAqB,CAAC,EAAE,MAAM,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACnC,sEAAsE;IACtE,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,4EAA4E;IAC5E,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,6DAA6D;IAC7D,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,uGAAuG;IACvG,oBAAoB,CAAC,EAAE,MAAM,CAAA;IAC7B,uEAAuE;IACvE,sBAAsB,CAAC,EAAE,MAAM,CAAA;CAClC,CAAA;AA4CD,MAAM,MAAM,gBAAgB,GAAG;IAC3B,QAAQ,EAAE,CAAC,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAC,KAAK,MAAM,CAAA;IACtE,iBAAiB,EAAE,MAAM,MAAM,CAAA;IAC/B,cAAc,EAAE,MAAM,MAAM,CAAA;IAC5B,eAAe,EAAE,MAAM,MAAM,CAAA;CAChC,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,UAAU,8GA+oBtB,CAAA"}