handsontable 18.0.0 → 18.1.0-rc7

package/dataMap/metaManager/lazyFactoryMap.js

@@ -9,7 +9,169 @@ Object.defineProperty(exports, "default", {
     }
 });
 const _utils = require("./utils");
+const _errors = require("../../helpers/errors");
 const _number = require("../../helpers/number");
+function _check_private_redeclaration(obj, privateCollection) {
+    if (privateCollection.has(obj)) {
+        throw new TypeError("Cannot initialize the same private elements twice on an object");
+    }
+}
+function _class_apply_descriptor_get(receiver, descriptor) {
+    if (descriptor.get) {
+        return descriptor.get.call(receiver);
+    }
+    return descriptor.value;
+}
+function _class_apply_descriptor_set(receiver, descriptor, value) {
+    if (descriptor.set) {
+        descriptor.set.call(receiver, value);
+    } else {
+        if (!descriptor.writable) {
+            throw new TypeError("attempted to set read only private field");
+        }
+        descriptor.value = value;
+    }
+}
+function _class_extract_field_descriptor(receiver, privateMap, action) {
+    if (!privateMap.has(receiver)) {
+        throw new TypeError("attempted to " + action + " private field on non-instance");
+    }
+    return privateMap.get(receiver);
+}
+function _class_private_field_get(receiver, privateMap) {
+    var descriptor = _class_extract_field_descriptor(receiver, privateMap, "get");
+    return _class_apply_descriptor_get(receiver, descriptor);
+}
+function _class_private_field_init(obj, privateMap, value) {
+    _check_private_redeclaration(obj, privateMap);
+    privateMap.set(obj, value);
+}
+function _class_private_field_set(receiver, privateMap, value) {
+    var descriptor = _class_extract_field_descriptor(receiver, privateMap, "set");
+    _class_apply_descriptor_set(receiver, descriptor, value);
+    return value;
+}
+function _class_private_method_get(receiver, privateSet, fn) {
+    if (!privateSet.has(receiver)) {
+        throw new TypeError("attempted to get private field on non-instance");
+    }
+    return fn;
+}
+function _class_private_method_init(obj, privateSet) {
+    _check_private_redeclaration(obj, privateSet);
+    privateSet.add(obj);
+}
+/**
+ * The maximum number of key-shift operations (from `insert`/`remove`) buffered before they are
+ * force-applied. Shifts are normally applied lazily, once, on the next full-view read
+ * (`size`/`values`/`entries`), so a caller that loops single-row inserts/removes (for example,
+ * `DataMap.removeRow` calls the meta layer once per removed physical row) pays one re-key pass
+ * per batch instead of one per call. Contiguous runs of same-type shifts merge into a single
+ * buffered entry, so the cap only bounds the buffer for scattered, non-mergeable loops.
+ */ const MAX_PENDING_SHIFTS = 1024;
+/**
+ * Throws when the key is not an unsigned integer. A plain function call instead of `assert()` -
+ * `assert` takes a condition closure, and allocating one per `obtain` call is measurable on the
+ * render path (the method runs twice per cell per draw).
+ *
+ * @param {*} key The key to validate.
+ */ function assertUnsignedKey(key) {
+    if (!(0, _number.isUnsignedNumber)(key)) {
+        (0, _errors.throwWithCause)('Assertion failed: Expecting an unsigned number.');
+    }
+}
+/**
+ * Throws when the key is neither an unsigned integer nor null/undefined.
+ *
+ * @param {*} key The key to validate.
+ */ function assertUnsignedKeyOrNullish(key) {
+    if (!(0, _number.isUnsignedNumber)(key) && !(0, _utils.isNullish)(key)) {
+        (0, _errors.throwWithCause)('Assertion failed: Expecting an unsigned number or null/undefined argument.');
+    }
+}
+var /**
+   * Materialized values keyed by the CURRENT volatile key (with any buffered shifts from
+   * `#pendingShifts` not yet applied). Native Map iteration order is insertion order; the
+   * shift-apply pass rebuilds the map preserving that relative order, so iteration stays in
+   * order of value initialization.
+   */ _data = /*#__PURE__*/ new WeakMap(), /**
+   * The logical length of the collection: slots created by `insert` plus slots implied by
+   * obtaining a key at or past the current end. It only backs the "append"/"remove at end"
+   * semantics of nullish `insert`/`remove` keys - it does not bound `obtain`. Every key
+   * stored in the map is smaller than this value. Maintained eagerly (shifts do not defer it).
+   */ _length = /*#__PURE__*/ new WeakMap(), /**
+   * Key-shift operations buffered by `insert`/`remove` and not yet applied to `#data`.
+   * Applied in call order by `#applyPendingShifts` on the next read.
+   */ _pendingShifts = /*#__PURE__*/ new WeakMap(), /**
+   * An exclusive upper bound of the keys currently stored in `#data` (kept valid across
+   * buffered shifts). It lets `insert`/`remove` skip buffering entirely when the operation
+   * starts at or above every stored key - the common case of appending or altering far
+   * beyond the materialized band - without scanning the keys.
+   */ _keyUpperBound = /*#__PURE__*/ new WeakMap(), /**
+   * The highest key currently stored in `#data`, or `-1` when empty. May go stale-high after
+   * `evict` of the highest key (conservative - only disables the fast flush path).
+   */ _maxStoredKey = /*#__PURE__*/ new WeakMap(), /**
+   * True while the map's iteration order provably equals ascending key order (every
+   * materialization so far appended a new maximum key). Enables the in-place flush fast path.
+   */ _isAscending = /*#__PURE__*/ new WeakMap(), /**
+   * True when an iterator over `#data` may still be live (handed out by `values`/`entries` and
+   * possibly not yet exhausted). The in-place flush fast path mutates `#data` directly, which a
+   * live iterator would observe - so the fast path is skipped; the rebuild path (which swaps the
+   * map, detaching any live iterator) clears the flag.
+   */ _mayHaveLiveIterator = /*#__PURE__*/ new WeakMap(), /**
+   * Buffers a key-shift operation, first trying to merge it into the previous one (a loop of
+   * contiguous single-slot calls - such as the descending per-row removes made by
+   * `DataMap.removeRow` - collapses into a single buffered shift). When the buffer still grows
+   * past `MAX_PENDING_SHIFTS`, it is force-applied as a backstop for scattered, non-mergeable
+   * loops that never read between mutations.
+   *
+   * @param {object} shift The shift operation to buffer.
+   */ _bufferShift = /*#__PURE__*/ new WeakSet(), /**
+   * Merges the incoming shift into the last buffered one when the two are provably equivalent
+   * to a single wider shift, and reports whether the merge happened. Two inserts merge when the
+   * new insertion point falls inside (or at either edge of) the still-pending inserted gap. Two
+   * removes merge when they start at the same key (an ascending loop - each call removes the
+   * next value that slid down into the same spot) or when the new range ends exactly where the
+   * previous one starts (a descending loop). Both callers must operate on the same shift type.
+   *
+   * @param {object} last The shift the buffer currently ends with, mutated on merge.
+   * @param {object} shift The incoming shift.
+   * @returns {boolean}
+   */ _tryMergeShift = /*#__PURE__*/ new WeakSet(), /**
+   * Maps a key from the current (post-shift) coordinate space back to the stored key it
+   * corresponds to in `#data`, by undoing the buffered shifts in reverse call order. Returns
+   * `-1` when the key falls inside a still-pending inserted gap - no stored key maps there.
+   * This lets single-key reads resolve through the buffer in O(buffered shifts) instead of
+   * forcing the O(materialized) re-key pass.
+   *
+   * @param {number} key The key in the current coordinate space.
+   * @returns {number}
+   */ _toStoredKey = /*#__PURE__*/ new WeakSet(), /**
+   * Applies every buffered key-shift operation in call order with a single pass over the
+   * stored entries. When no stored key is affected (every key sits below the lowest shift
+   * point), the map is left untouched with no allocation. Otherwise the map is rebuilt in its
+   * original iteration order, which preserves the initialization-order contract of `values()`.
+   */ _applyPendingShifts = /*#__PURE__*/ new WeakSet(), /**
+   * Applies a single buffered remove in place on a dense, ascending-ordered map: the value
+   * stored under each key at or above the removal point is overwritten with the value
+   * `amount` slots above it, and the now-duplicated top `amount` keys are deleted. Keys are
+   * only updated or deleted (never inserted), so the Map's iteration order stays ascending
+   * and the result is identical to the full rebuild - at the cost of only the affected
+   * suffix, with no allocation and no hash-table churn.
+   *
+   * @param {number} start The first removed key.
+   * @param {number} amount The number of removed keys.
+   */ _applySingleRemoveInPlace = /*#__PURE__*/ new WeakSet(), /**
+   * Runs a stored key through the buffered shift operations in call order and returns the
+   * resulting key, or `-1` when one of the remove operations drops it. Stops early once the
+   * key sits below every remaining shift point (`minStartFrom` suffix minima), where it can
+   * no longer change.
+   *
+   * @param {number} key The stored key to transform.
+   * @param {object[]} shifts The buffered shift operations, in call order.
+   * @param {number[]} minStartFrom For each position, the lowest shift start from there on.
+   * @returns {number}
+   */ _transformKey = /*#__PURE__*/ new WeakSet();
 class LazyFactoryMap {
     /**
    * Gets or if data not exist creates and returns new data.
@@ -17,139 +179,201 @@ class LazyFactoryMap {
    * @param {number} key The item key as zero-based index.
    * @returns {*}
    */ obtain(key) {
-        (0, _utils.assert)(()=>(0, _number.isUnsignedNumber)(key), 'Expecting an unsigned number.');
-        const dataIndex = this._getStorageIndexByKey(key);
-        let result;
-        if (dataIndex >= 0) {
-            result = this.data[dataIndex];
-            if (result === undefined) {
-                result = this.valueFactory(key);
-                this.data[dataIndex] = result;
+        assertUnsignedKey(key);
+        let storedKey = key;
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            storedKey = _class_private_method_get(this, _toStoredKey, toStoredKey).call(this, key);
+            // The key sits inside a pending inserted gap - no stored key can map to it, so a new
+            // value has no stored coordinate to live under until the buffer is applied.
+            if (storedKey === -1) {
+                _class_private_method_get(this, _applyPendingShifts, applyPendingShifts).call(this);
+                storedKey = key;
             }
-        } else {
-            result = this.valueFactory(key);
-            const reuseIndex = this.holes.size > 0 ? this.holes.values().next().value : undefined;
-            if (reuseIndex !== undefined) {
-                this.holes.delete(reuseIndex);
-                this.data[reuseIndex] = result;
-                this.index[key] = reuseIndex;
+        }
+        let value = _class_private_field_get(this, _data).get(storedKey);
+        if (value === undefined) {
+            value = this.valueFactory(key);
+            _class_private_field_get(this, _data).set(storedKey, value);
+            if (key >= _class_private_field_get(this, _length)) {
+                _class_private_field_set(this, _length, key + 1);
+            }
+            // The bound must stay valid in both coordinate spaces: `storedKey` covers the map as
+            // stored now, `key` covers it after the buffered shifts move `storedKey` to `key`.
+            const boundKey = storedKey > key ? storedKey : key;
+            if (boundKey >= _class_private_field_get(this, _keyUpperBound)) {
+                _class_private_field_set(this, _keyUpperBound, boundKey + 1);
+            }
+            // Ascending-order bookkeeping for the in-place flush fast path: a miss that does not
+            // append a new maximum key breaks "iteration order == ascending key order".
+            if (storedKey > _class_private_field_get(this, _maxStoredKey)) {
+                _class_private_field_set(this, _maxStoredKey, storedKey);
             } else {
-                this.data.push(result);
-                this.index[key] = this.data.length - 1;
+                _class_private_field_set(this, _isAscending, false);
             }
         }
-        return result;
+        return value;
+    }
+    /**
+   * Checks whether a value for the given key has already been created, without creating one.
+   * Unlike `obtain`, this never triggers the value factory.
+   *
+   * @param {number} key The item key as zero-based index.
+   * @returns {boolean}
+   */ has(key) {
+        return this.getIfExists(key) !== undefined;
     }
     /**
-   * Inserts an empty data to the map. This method creates an empty space for obtaining
-   * new data.
+   * Inserts an empty space for new data. Materialized values stored under keys at or after
+   * the insertion point are re-keyed upwards by `amount`; the inserted keys themselves stay
+   * unmaterialized until the first `obtain` call. The re-keying is buffered (a contiguous run
+   * of inserts merges into one buffered shift) and applied once on the next full-view read, so
+   * a loop of inserts costs one re-key pass, not one per call. When the insertion point sits
+   * at or above every stored key (the common case on a large grid, where only the viewport
+   * band is materialized), nothing is buffered at all.
    *
    * @param {number} key The key as volatile zero-based index at which to begin inserting space for new data.
    * @param {number} [amount=1] Amount of data to insert.
    */ insert(key, amount = 1) {
-        (0, _utils.assert)(()=>(0, _number.isUnsignedNumber)(key) || (0, _utils.isNullish)(key), 'Expecting an unsigned number or null/undefined argument.');
-        const newIndexes = [];
-        const dataLength = this.data.length;
-        for(let i = 0; i < amount; i++){
-            newIndexes.push(dataLength + i);
-            this.data.push(undefined);
-        }
-        const insertionIndex = (0, _utils.isNullish)(key) ? this.index.length : key;
-        this.index = [
-            ...this.index.slice(0, insertionIndex),
-            ...newIndexes,
-            ...this.index.slice(insertionIndex)
-        ];
+        assertUnsignedKeyOrNullish(key);
+        const insertionIndex = (0, _utils.isNullish)(key) ? _class_private_field_get(this, _length) : key;
+        _class_private_field_set(this, _length, _class_private_field_get(this, _length) + amount);
+        if (insertionIndex >= _class_private_field_get(this, _keyUpperBound)) {
+            return;
+        }
+        _class_private_field_set(this, _keyUpperBound, _class_private_field_get(this, _keyUpperBound) + amount);
+        _class_private_method_get(this, _bufferShift, bufferShift).call(this, {
+            start: insertionIndex,
+            amount,
+            isInsert: true
+        });
     }
     /**
-   * Removes (soft remove) data from "index" and according to the amount of data.
+   * Removes (soft remove) data from the map. Materialized values stored under the removed keys
+   * are dropped (freed for garbage collection) and values under higher keys are re-keyed
+   * downwards by `amount`. The re-keying is buffered (a contiguous run of removes - ascending
+   * or descending - merges into one buffered shift) and applied once on the next full-view
+   * read, so a loop of single-row removes (for example, the per-physical-row calls made by the
+   * data layer when removing many rows at once) costs one re-key pass, not one per call. When
+   * the removal point sits at or above every stored key, nothing is buffered at all.
    *
    * @param {number} key The key as volatile zero-based index at which to begin removing the data.
    * @param {number} [amount=1] Amount data to remove.
    */ remove(key, amount = 1) {
-        (0, _utils.assert)(()=>(0, _number.isUnsignedNumber)(key) || (0, _utils.isNullish)(key), 'Expecting an unsigned number or null/undefined argument.');
-        const removed = this.index.splice((0, _utils.isNullish)(key) ? this.index.length - amount : key, amount);
-        for(let i = 0; i < removed.length; i++){
-            const removedIndex = removed[i];
-            if (typeof removedIndex === 'number') {
-                this.holes.add(removedIndex);
-            }
+        assertUnsignedKeyOrNullish(key);
+        let start;
+        if ((0, _utils.isNullish)(key)) {
+            // Reproduces `index.splice(length - amount, amount)`: a negative start counts back from
+            // the end (never below zero), exactly like `Array.prototype.splice`.
+            const rawStart = _class_private_field_get(this, _length) - amount;
+            start = rawStart < 0 ? Math.max(_class_private_field_get(this, _length) + rawStart, 0) : rawStart;
+        } else {
+            start = key;
+        }
+        const removedCount = Math.max(Math.min(_class_private_field_get(this, _length) - start, amount), 0);
+        const isBeyondStoredKeys = start >= _class_private_field_get(this, _keyUpperBound);
+        _class_private_field_set(this, _length, _class_private_field_get(this, _length) - removedCount);
+        // Every stored key is smaller than `#length` both before and after a remove, so the upper
+        // bound can be tightened to the new length. Without this, a remove would leave the bound
+        // stale-high and a later append-at-end `insert(null)` (for example, the `minSpareRows`
+        // spare-row top-up on every keystroke in the last row) would buffer a shift that can never
+        // affect a stored key.
+        if (_class_private_field_get(this, _keyUpperBound) > _class_private_field_get(this, _length)) {
+            _class_private_field_set(this, _keyUpperBound, _class_private_field_get(this, _length));
+        }
+        if (isBeyondStoredKeys) {
+            return;
         }
+        _class_private_method_get(this, _bufferShift, bufferShift).call(this, {
+            start,
+            amount,
+            isInsert: false
+        });
     }
     /**
-   * Returns the size of the data which this map holds.
+   * Returns the number of materialized values this map currently holds. Keys reserved through
+   * `insert` but never obtained, and keys released through `evict` or `remove`, are not counted.
    *
    * @returns {number}
    */ size() {
-        return this.data.length - this.holes.size;
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            _class_private_method_get(this, _applyPendingShifts, applyPendingShifts).call(this);
+        }
+        return _class_private_field_get(this, _data).size;
     }
     /**
-   * Returns a new Iterator object that contains the values for each item in the LazyMap object.
+   * Returns a new Iterator object that contains the values for each item in the LazyMap object,
+   * in order of value initialization.
    *
    * @returns {Iterator}
    */ values() {
-        return this.data.filter((meta, index)=>meta !== undefined && !this.holes.has(index))[Symbol.iterator]();
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            _class_private_method_get(this, _applyPendingShifts, applyPendingShifts).call(this);
+        }
+        _class_private_field_set(this, _mayHaveLiveIterator, true);
+        return _class_private_field_get(this, _data).values();
     }
     /**
-   * Returns a new Iterator object that contains an array of `[index, value]` for each item in the LazyMap object.
+   * Returns a new Iterator object that contains an array of `[index, value]` for each item in
+   * the LazyMap object, in order of value initialization.
+   *
+   * Mutation-during-iteration contract (also applies to `values()`): the iterator follows
+   * native Map semantics. Releasing the currently visited key through `evict` (as
+   * `CellMeta.evictRow` does) is safe; a value materialized mid-loop through `obtain` of a new
+   * key WILL be visited. Calling `insert`/`remove` mid-loop only buffers the key shift, so the
+   * walk continues undisturbed over the pre-shift view; if another read flushes the buffered
+   * shifts mid-loop, the walk still completes over the pre-shift map it started on.
    *
    * @returns {Iterator}
    */ entries() {
-        const validEntries = [];
-        for(let i = 0; i < this.data.length; i++){
-            const keyIndex = this._getKeyByStorageIndex(i);
-            const item = this.data[i];
-            if (keyIndex !== -1 && item !== undefined) {
-                validEntries.push([
-                    keyIndex,
-                    item
-                ]);
-            }
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            _class_private_method_get(this, _applyPendingShifts, applyPendingShifts).call(this);
         }
-        let dataIndex = 0;
-        const iterator = {
-            next () {
-                if (dataIndex < validEntries.length) {
-                    const value = validEntries[dataIndex];
-                    dataIndex += 1;
-                    return {
-                        value,
-                        done: false
-                    };
-                }
-                return {
-                    done: true,
-                    value: undefined
-                };
-            },
-            [Symbol.iterator] () {
-                return iterator;
-            }
-        };
-        return iterator;
+        _class_private_field_set(this, _mayHaveLiveIterator, true);
+        return _class_private_field_get(this, _data).entries();
     }
     /**
-   * Clears the map.
-   */ clear() {
-        this.data = [];
-        this.index = [];
-        this.holes.clear();
+   * Releases the value stored under the given key. The next `obtain` call for that key
+   * re-creates the value through the factory (with a new identity). Unlike `remove`, the
+   * surrounding keys do not shift, so this is safe for values that can be reconstructed
+   * deterministically - for example render-derived cell meta for rows scrolled out of the
+   * viewport. The entry is genuinely deleted, so its memory is freed - there is no leftover
+   * slot. Does nothing when the key has no materialized value.
+   *
+   * @param {number} key The item key as zero-based index.
+   */ evict(key) {
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            const storedKey = _class_private_method_get(this, _toStoredKey, toStoredKey).call(this, key);
+            if (storedKey !== -1) {
+                _class_private_field_get(this, _data).delete(storedKey);
+            }
+            return;
+        }
+        _class_private_field_get(this, _data).delete(key);
     }
     /**
-   * Gets storage index calculated from the key associated with the specified value.
+   * Returns the value stored under the given key, or `undefined` when the key has no materialized
+   * value. Unlike `obtain`, it never creates a value through the factory, so it is safe for
+   * read-only existence checks against the current contents.
    *
-   * @param {number} key Volatile zero-based index.
-   * @returns {number} Returns index 0-N or -1 if no storage index found.
-   */ _getStorageIndexByKey(key) {
-        return this.index.length > key ? this.index[key] : -1;
+   * @param {number} key The item key as zero-based index.
+   * @returns {*}
+   */ getIfExists(key) {
+        if (_class_private_field_get(this, _pendingShifts).length > 0) {
+            const storedKey = _class_private_method_get(this, _toStoredKey, toStoredKey).call(this, key);
+            return storedKey === -1 ? undefined : _class_private_field_get(this, _data).get(storedKey);
+        }
+        return _class_private_field_get(this, _data).get(key);
     }
     /**
-   * Gets the key associated with the specified value calculated from storage index.
-   *
-   * @param {number} dataIndex Zero-based storage index.
-   * @returns {number} Returns index 0-N or -1 if no key found.
-   */ _getKeyByStorageIndex(dataIndex) {
-        return this.index.indexOf(dataIndex);
+   * Clears the map.
+   */ clear() {
+        _class_private_field_get(this, _data).clear();
+        _class_private_field_set(this, _pendingShifts, []);
+        _class_private_field_set(this, _length, 0);
+        _class_private_field_set(this, _keyUpperBound, 0);
+        _class_private_field_set(this, _maxStoredKey, -1);
+        _class_private_field_set(this, _isAscending, true);
+        _class_private_field_set(this, _mayHaveLiveIterator, false);
     }
     /**
    * Makes this object iterable.
@@ -161,23 +385,186 @@ class LazyFactoryMap {
     /**
    * Initializes the map with the given factory function used to create values for new keys on first access.
    */ constructor(valueFactory){
-        /**
-   * An array which contains data.
-   *
-   * @type {Array}
-   */ this.data = [];
-        /**
-   * An array of indexes where the key of the array is mapped to the value which points to the
-   * specific position of the data array.
-   *
-   * @type {number[]}
-   */ this.index = [];
-        /**
-   * The collection of indexes that points to the data items which can be replaced by obtaining new
-   * ones. The "holes" are an intended effect of deleting entries.
-   *
-   * @type {Set<number>}
-   */ this.holes = new Set();
+        _class_private_method_init(this, _bufferShift);
+        _class_private_method_init(this, _tryMergeShift);
+        _class_private_method_init(this, _toStoredKey);
+        _class_private_method_init(this, _applyPendingShifts);
+        _class_private_method_init(this, _applySingleRemoveInPlace);
+        _class_private_method_init(this, _transformKey);
+        _class_private_field_init(this, _data, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _length, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _pendingShifts, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _keyUpperBound, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _maxStoredKey, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _isAscending, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_init(this, _mayHaveLiveIterator, {
+            writable: true,
+            value: void 0
+        });
+        _class_private_field_set(this, _data, new Map());
+        _class_private_field_set(this, _length, 0);
+        _class_private_field_set(this, _pendingShifts, []);
+        _class_private_field_set(this, _keyUpperBound, 0);
+        _class_private_field_set(this, _maxStoredKey, -1);
+        _class_private_field_set(this, _isAscending, true);
+        _class_private_field_set(this, _mayHaveLiveIterator, false);
         this.valueFactory = valueFactory;
     }
 }
+function bufferShift(shift) {
+    const shifts = _class_private_field_get(this, _pendingShifts);
+    const last = shifts.length > 0 ? shifts[shifts.length - 1] : undefined;
+    if (last !== undefined && last.isInsert === shift.isInsert && _class_private_method_get(this, _tryMergeShift, tryMergeShift).call(this, last, shift)) {
+        return;
+    }
+    shifts.push(shift);
+    if (shifts.length >= MAX_PENDING_SHIFTS) {
+        _class_private_method_get(this, _applyPendingShifts, applyPendingShifts).call(this);
+    }
+}
+function tryMergeShift(last, shift) {
+    if (shift.isInsert) {
+        if (shift.start >= last.start && shift.start <= last.start + last.amount) {
+            last.amount += shift.amount;
+            return true;
+        }
+        return false;
+    }
+    if (shift.start === last.start) {
+        last.amount += shift.amount;
+        return true;
+    }
+    if (shift.start + shift.amount === last.start) {
+        last.start = shift.start;
+        last.amount += shift.amount;
+        return true;
+    }
+    return false;
+}
+function toStoredKey(key) {
+    const shifts = _class_private_field_get(this, _pendingShifts);
+    let storedKey = key;
+    for(let i = shifts.length - 1; i >= 0; i--){
+        const { start, amount, isInsert } = shifts[i];
+        if (isInsert) {
+            if (storedKey >= start + amount) {
+                storedKey -= amount;
+            } else if (storedKey >= start) {
+                return -1;
+            }
+        } else if (storedKey >= start) {
+            storedKey += amount;
+        }
+    }
+    return storedKey;
+}
+function applyPendingShifts() {
+    const shifts = _class_private_field_get(this, _pendingShifts);
+    _class_private_field_set(this, _pendingShifts, []);
+    // Fast path: a single contiguous remove on a map whose keys are provably dense
+    // (0..size-1, by pigeonhole from maxKey == size-1) and iterated in ascending key
+    // order. Values slide down in place - keys never move, so the Map's structure and
+    // iteration order stay untouched, at a fraction of the full-rebuild cost.
+    if (shifts.length === 1 && !shifts[0].isInsert && !_class_private_field_get(this, _mayHaveLiveIterator) && _class_private_field_get(this, _isAscending) && _class_private_field_get(this, _maxStoredKey) === _class_private_field_get(this, _data).size - 1) {
+        _class_private_method_get(this, _applySingleRemoveInPlace, applySingleRemoveInPlace).call(this, shifts[0].start, shifts[0].amount);
+        return;
+    }
+    // Suffix minima of the shift starts: `minStartFrom[i]` is the lowest start among
+    // `shifts[i..]`. A key smaller than it cannot be touched by any remaining shift, so the
+    // per-key transform loop can stop early - which matters for scattered non-mergeable
+    // batches, where most keys sit below most shift points.
+    const minStartFrom = new Array(shifts.length);
+    let lowestStart = Infinity;
+    for(let i = shifts.length - 1; i >= 0; i--){
+        if (shifts[i].start < lowestStart) {
+            lowestStart = shifts[i].start;
+        }
+        minStartFrom[i] = lowestStart;
+    }
+    let isAffected = false;
+    for (const itemKey of _class_private_field_get(this, _data).keys()){
+        if (itemKey >= lowestStart) {
+            isAffected = true;
+            break;
+        }
+    }
+    if (!isAffected) {
+        return;
+    }
+    const shifted = new Map();
+    let highestKey = -1;
+    let isAscending = true;
+    let previousKey = -1;
+    for (const [itemKey, value] of _class_private_field_get(this, _data)){
+        const newKey = _class_private_method_get(this, _transformKey, transformKey).call(this, itemKey, shifts, minStartFrom);
+        if (newKey !== -1) {
+            shifted.set(newKey, value);
+            if (newKey > highestKey) {
+                highestKey = newKey;
+            }
+            if (newKey <= previousKey) {
+                isAscending = false;
+            }
+            previousKey = newKey;
+        }
+    }
+    _class_private_field_set(this, _data, shifted);
+    // The old map (with any live iterators on it) is detached - in-place flushes of the NEW map
+    // can no longer be observed through iterators created before this rebuild.
+    _class_private_field_set(this, _mayHaveLiveIterator, false);
+    // The rebuild visits every entry anyway, so the key upper bound can be made exact for
+    // free, and the ascending-order flag re-derived (a map can recover the fast flush path).
+    _class_private_field_set(this, _keyUpperBound, highestKey + 1);
+    _class_private_field_set(this, _maxStoredKey, highestKey);
+    _class_private_field_set(this, _isAscending, isAscending);
+}
+function applySingleRemoveInPlace(start, amount) {
+    const data = _class_private_field_get(this, _data);
+    const size = data.size;
+    const survivorsTop = Math.max(size - amount, start);
+    for(let key = start; key < survivorsTop; key++){
+        data.set(key, data.get(key + amount));
+    }
+    for(let key = survivorsTop; key < size; key++){
+        data.delete(key);
+    }
+    _class_private_field_set(this, _maxStoredKey, survivorsTop - 1);
+    _class_private_field_set(this, _keyUpperBound, survivorsTop);
+}
+function transformKey(key, shifts, minStartFrom) {
+    let currentKey = key;
+    for(let i = 0; i < shifts.length; i++){
+        if (currentKey < minStartFrom[i]) {
+            return currentKey;
+        }
+        const { start, amount, isInsert } = shifts[i];
+        if (isInsert) {
+            if (currentKey >= start) {
+                currentKey += amount;
+            }
+        } else if (currentKey >= start + amount) {
+            currentKey -= amount;
+        } else if (currentKey >= start) {
+            return -1;
+        }
+    }
+    return currentKey;
+}