@x-oasis/integer-buffer-set 0.1.19 → 0.1.23

package/dist/integer-buffer-set.esm.js

@@ -1,4 +1,7 @@
 import Heap from '@x-oasis/heap';
+import isClamped from '@x-oasis/is-clamped';
+import invariant from '@x-oasis/invariant';
+import returnHook from '@x-oasis/return-hook';
 
 function _defineProperties(target, props) {
   for (var i = 0; i < props.length; i++) {
@@ -32,45 +35,102 @@ function _toPropertyKey(arg) {
   return typeof key === "symbol" ? key : String(key);
 }
 
-var defaultUseMinValueFn = function defaultUseMinValueFn(options) {
-  var safeRange = options.safeRange,
-    bufferSetRange = options.bufferSetRange;
-  var lowValue = safeRange.lowValue,
-    highValue = safeRange.highValue;
-  var maxValue = bufferSetRange.maxValue,
-    minValue = bufferSetRange.minValue;
-  return lowValue - minValue > maxValue - highValue;
+var defaultMetaExtractor = function defaultMetaExtractor(value) {
+  return value;
 };
+var defaultBufferSize = 10;
 var IntegerBufferSet = /*#__PURE__*/function () {
-  function IntegerBufferSet() {
-    this._valueToPositionMap = {};
-    this._size = 0;
+  function IntegerBufferSet(props) {
+    if (props === void 0) {
+      props = {};
+    }
+    var _props = props,
+      _props$name = _props.name,
+      name = _props$name === void 0 ? 'default_buffer' : _props$name,
+      indexExtractor = _props.indexExtractor,
+      _props$bufferSize = _props.bufferSize,
+      bufferSize = _props$bufferSize === void 0 ? defaultBufferSize : _props$bufferSize,
+      _props$metaExtractor = _props.metaExtractor,
+      metaExtractor = _props$metaExtractor === void 0 ? defaultMetaExtractor : _props$metaExtractor;
+    this._metaExtractor = metaExtractor;
+    this._indexExtractor = indexExtractor;
+    this._name = name;
+    this._indexToMetaMap = new Map();
+    this._metaToPositionMap = new Map();
+    this._positionToMetaList = [];
+    this._metaToIndexMap = new Map();
+    this._onTheFlyIndices = [];
+    this._bufferSize = bufferSize;
     this._smallValues = new Heap([], this._smallerComparator);
     this._largeValues = new Heap([], this._greaterComparator);
-    this.getNewPositionForValue = this.getNewPositionForValue.bind(this);
-    this.getValuePosition = this.getValuePosition.bind(this);
-    this.getSize = this.getSize.bind(this);
-    this.replaceFurthestValuePosition = this.replaceFurthestValuePosition.bind(this);
-    this._vacantPositions = [];
+    this.getNewPositionForIndex = this.getNewPositionForIndex.bind(this);
+    this.getIndexPosition = this.getIndexPosition.bind(this);
+    this.replacePositionInFliedIndices = this.replacePositionInFliedIndices.bind(this);
+    this.replaceFurthestIndexPosition = this.replaceFurthestIndexPosition.bind(this);
+    this._isOnTheFlyFullReturnHook = returnHook(this.setIsOnTheFlyFull.bind(this));
+    this._loopMS = Date.now();
+    this._lastUpdatedMS = this._loopMS;
   }
   var _proto = IntegerBufferSet.prototype;
-  _proto.getSize = function getSize() {
-    return this._size;
+  _proto.setIsOnTheFlyFull = function setIsOnTheFlyFull(val) {
+    if (val != null) {
+      var data = this._onTheFlyIndices.filter(function (v) {
+        return v;
+      });
+      this._isOnTheFlyFull = data.length === this._bufferSize;
+    }
   };
-  _proto.getValuePosition = function getValuePosition(value) {
-    if (this._valueToPositionMap[value] === undefined) {
-      return null;
+  _proto.getOnTheFlyUncriticalPosition = function getOnTheFlyUncriticalPosition(safeRange) {
+    var startIndex = safeRange.startIndex,
+      endIndex = safeRange.endIndex;
+    for (var idx = 0; idx < this._onTheFlyIndices.length; idx++) {
+      var meta = this._onTheFlyIndices[idx];
+      var metaIndex = this._metaToIndexMap.get(meta);
+      if (!isClamped(startIndex, metaIndex, endIndex)) {
+        return idx;
+      }
+    }
+    return null;
+  };
+  _proto.initialize = function initialize() {
+    return {
+      smallValues: new Heap([], this._smallerComparator),
+      largeValues: new Heap([], this._greaterComparator),
+      valueToPositionObject: {}
+    };
+  };
+  _proto.getIndexMeta = function getIndexMeta(index) {
+    return this._metaExtractor(index);
+  };
+  _proto.getMetaIndex = function getMetaIndex(meta) {
+    if (this._indexExtractor) return this._indexExtractor(meta);
+    return this._metaToIndexMap.get(meta);
+  };
+  _proto.setMetaIndex = function setMetaIndex(meta, index) {
+    if (!this._indexExtractor) {
+      return this._metaToIndexMap.set(meta, index);
     }
-    return this._valueToPositionMap[value];
+    return false;
   };
-  _proto.getNewPositionForValue = function getNewPositionForValue(value) {
-    if (this._valueToPositionMap[value] !== undefined) {
-      console.warn("Shouldn't try to find new position for value already stored in BufferSet");
+  _proto.deleteMetaIndex = function deleteMetaIndex(meta) {
+    return this._metaToIndexMap["delete"](meta);
+  };
+  _proto.replaceMetaToIndexMap = function replaceMetaToIndexMap(newMetaToIndexMap) {
+    if (!this._indexExtractor) {
+      return this._metaToIndexMap = newMetaToIndexMap;
     }
-    var newPosition = this._size;
-    this._size++;
-    this._pushToHeaps(newPosition, value);
-    this._valueToPositionMap[value] = newPosition;
+    return false;
+  };
+  _proto.getIndexPosition = function getIndexPosition(index) {
+    return this.getMetaIndex(this.getIndexMeta(index));
+  };
+  _proto.getNewPositionForIndex = function getNewPositionForIndex(index) {
+    var meta = this.getIndexMeta(index);
+    !(this._metaToPositionMap.get(meta) === undefined) ? process.env.NODE_ENV !== "production" ? invariant(false, "Shouldn't try to find new position for value already stored in BufferSet") : invariant(false) : void 0;
+    var newPosition = this._positionToMetaList.length;
+    this._pushToHeaps(newPosition, index);
+    this._setMetaIndex(meta, index);
+    this._setMetaPosition(meta, newPosition);
     return newPosition;
   };
   _proto.getMinValue = function getMinValue() {
@@ -81,67 +141,228 @@ var IntegerBufferSet = /*#__PURE__*/function () {
     var _this$_largeValues$pe;
     return (_this$_largeValues$pe = this._largeValues.peek()) == null ? void 0 : _this$_largeValues$pe.value;
   };
-  _proto.setPositionValue = function setPositionValue(position, value) {
-    var originalPosition = this._valueToPositionMap[value];
-    if (originalPosition !== undefined) {
-      var index = this._vacantPositions.findIndex(function (v) {
-        return v === originalPosition;
-      });
-      if (index === -1) this._vacantPositions.push(originalPosition);
-      delete this._valueToPositionMap[value];
-      this._valueToPositionMap[value] = position;
+  _proto.replacePositionInFliedIndices = function replacePositionInFliedIndices(newIndex, safeRange) {
+    var startIndex = safeRange.startIndex,
+      endIndex = safeRange.endIndex;
+    if (this._isOnTheFlyFull) {
+      if (!isClamped(startIndex, newIndex, endIndex)) {
+        return null;
+      }
+      var pos = this.getOnTheFlyUncriticalPosition(safeRange);
+      if (pos != null) return pos;
     }
+    return null;
   };
-  _proto.replaceFurthestValuePosition = function replaceFurthestValuePosition(lowValue, highValue, newValue, useMinValueFn) {
-    if (useMinValueFn === void 0) {
-      useMinValueFn = defaultUseMinValueFn;
+  _proto.getFliedPosition = function getFliedPosition(newIndex, safeRange) {
+    var pos = this.replacePositionInFliedIndices(newIndex, safeRange);
+    if (pos != null) {
+      var meta = this.getIndexMeta(newIndex);
+      this._onTheFlyIndices[pos] = meta;
+      this._setMetaIndex(meta, newIndex);
+      return this._isOnTheFlyFullReturnHook(pos);
     }
-    if (this._valueToPositionMap[newValue] !== undefined) {
-      console.warn("Shouldn't try to replace values with value already stored value in " + 'BufferSet');
+    return null;
+  };
+  _proto.getPosition = function getPosition(newIndex, safeRange) {
+    this.prepare();
+    var meta = this.getIndexMeta(newIndex);
+    var prevMetaPosition = this._metaToPositionMap.get(meta);
+    if (prevMetaPosition !== undefined) {
+      var onTheFlyPositionMeta = this._onTheFlyIndices[prevMetaPosition];
+      if (onTheFlyPositionMeta) {
+        if (onTheFlyPositionMeta === meta) {
+          return prevMetaPosition;
+        }
+        var _positionToReplace = this._replaceFurthestIndexPosition(newIndex, safeRange);
+        if (this._isOnTheFlyFull) return this.getFliedPosition(newIndex, safeRange);
+        while (this._onTheFlyIndices[_positionToReplace]) {
+          _positionToReplace = this._replaceFurthestIndexPosition(newIndex, safeRange);
+        }
+        if (_positionToReplace != null) {
+          this._setMetaIndex(meta, newIndex);
+          this._onTheFlyIndices[_positionToReplace] = onTheFlyPositionMeta;
+          return this._isOnTheFlyFullReturnHook(_positionToReplace);
+        }
+      }
+      this._onTheFlyIndices[prevMetaPosition] = meta;
+      return this._isOnTheFlyFullReturnHook(prevMetaPosition);
     }
-    this._cleanHeaps();
-    if (this._smallValues.empty() || this._largeValues.empty()) {
-      return null;
+    if (!this.isBufferFull) return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(newIndex));
+    if (this._isOnTheFlyFull) return this.getFliedPosition(newIndex, safeRange);
+    var positionToReplace;
+    var prevIndexMeta = this._indexToMetaMap.get(newIndex);
+    if (!prevIndexMeta) {
+      this._cleanHeaps();
+      positionToReplace = this._replaceFurthestIndexPosition(newIndex, safeRange);
+    } else {
+      positionToReplace = this._metaToPositionMap.get(prevIndexMeta);
     }
-    if (this._vacantPositions.length) {
-      var _position = this._vacantPositions.pop();
-      this._valueToPositionMap[newValue] = _position;
-      this._pushToHeaps(_position, newValue);
-      return _position;
+    this._onTheFlyIndices[positionToReplace] = meta;
+    this._setMetaIndex(meta, newIndex);
+    this._setMetaPosition(meta, positionToReplace);
+    return this._isOnTheFlyFullReturnHook(positionToReplace);
+  };
+  _proto.replaceFurthestIndexPosition = function replaceFurthestIndexPosition(newIndex, safeRange) {
+    if (!this.isBufferFull) {
+      return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(newIndex));
+    }
+    return this._replaceFurthestIndexPosition(newIndex, safeRange);
+  };
+  _proto._replaceFurthestIndexPosition = function _replaceFurthestIndexPosition(newIndex, safeRange) {
+    if (this._largeValues.empty() || this._smallValues.empty()) {
+      return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(newIndex));
     }
     var minValue = this._smallValues.peek().value;
     var maxValue = this._largeValues.peek().value;
-    if (minValue >= lowValue && maxValue <= highValue) {
-      return null;
+    var indexToReplace;
+    if (!safeRange) {
+      if (Math.abs(newIndex - minValue) > Math.abs(newIndex - maxValue)) {
+        indexToReplace = minValue;
+        this._smallValues.pop();
+      } else {
+        indexToReplace = maxValue;
+        this._largeValues.pop();
+      }
+      var _replacedMeta = this._indexToMetaMap.get(indexToReplace);
+      var _position = this._metaToPositionMap.get(_replacedMeta);
+      return _position;
     }
-    var valueToReplace;
-    if (useMinValueFn({
-      safeRange: {
-        lowValue: lowValue,
-        highValue: highValue
-      },
-      bufferSetRange: {
-        minValue: minValue,
-        maxValue: maxValue
-      },
-      currentIndex: newValue
-    })) {
-      valueToReplace = minValue;
+    var lowValue = safeRange.startIndex,
+      highValue = safeRange.endIndex;
+    if (isClamped(lowValue, minValue, highValue) && isClamped(lowValue, maxValue, highValue)) {
+      return null;
+    } else if (isClamped(lowValue, minValue, highValue) && !isClamped(lowValue, maxValue, highValue)) {
+      indexToReplace = maxValue;
+      this._largeValues.pop();
+    } else if (!isClamped(lowValue, minValue, highValue) && isClamped(lowValue, maxValue, highValue)) {
+      indexToReplace = minValue;
+      this._smallValues.pop();
+    } else if (lowValue - minValue > maxValue - highValue) {
+      indexToReplace = minValue;
       this._smallValues.pop();
     } else {
-      valueToReplace = maxValue;
+      indexToReplace = maxValue;
       this._largeValues.pop();
     }
-    var position = this._valueToPositionMap[valueToReplace];
-    delete this._valueToPositionMap[valueToReplace];
-    this._valueToPositionMap[newValue] = position;
-    this._pushToHeaps(position, newValue);
-    var _i = this._vacantPositions.findIndex(function (v) {
-      return v === position;
-    });
-    if (_i !== -1) this._vacantPositions.splice(_i, 1);
+    var replacedMeta = this._indexToMetaMap.get(indexToReplace);
+    var position = this._metaToPositionMap.get(replacedMeta);
     return position;
   };
+  _proto.shuffle = function shuffle() {
+    var _this = this;
+    var indices = new Array(this.bufferSize);
+    for (var idx = 0; idx < indices.length; idx++) {
+      var meta = this._onTheFlyIndices[idx] || this._positionToMetaList[idx];
+      var targetIndex = this.getMetaIndex(meta);
+      indices[idx] = targetIndex;
+    }
+    var _arr = new Array(indices.length);
+    var _available = [];
+    var indexToMetaMap = new Map();
+    var metaToIndexMap = new Map();
+    var metaToPositionMap = new Map();
+    var _loop = function _loop() {
+      var currentIndex = indices[_idx];
+      var currentMeta = _this._metaExtractor(currentIndex);
+      if (currentMeta == null) return "continue";
+      indexToMetaMap.set(currentIndex, currentMeta);
+      metaToIndexMap.set(currentMeta, currentIndex);
+      if (currentMeta === _this._positionToMetaList[_idx]) {
+        _arr[_idx] = currentMeta;
+        return "continue";
+      }
+      var _i = _this._positionToMetaList.findIndex(function (v) {
+        return v === currentMeta;
+      });
+      if (_i !== -1) {
+        _arr[_i] = currentMeta;
+        return "continue";
+      }
+      _available.push(currentMeta);
+    };
+    for (var _idx = 0; _idx < indices.length; _idx++) {
+      var _ret = _loop();
+      if (_ret === "continue") continue;
+    }
+    var _this$initialize = this.initialize(),
+      smallValues = _this$initialize.smallValues,
+      largeValues = _this$initialize.largeValues;
+    var positionToMetaList = [];
+    for (var position = 0; position < indices.length; position++) {
+      var value = indices[position];
+      if (_arr[position] != null) {
+        positionToMetaList[position] = _arr[position];
+        metaToPositionMap.set(_arr[position], position);
+        var element = {
+          position: position,
+          value: value
+        };
+        smallValues.push(element);
+        largeValues.push(element);
+        continue;
+      }
+      var _meta = _available.shift();
+      if (_meta != null) {
+        positionToMetaList[position] = _meta;
+        metaToPositionMap.set(_meta, position);
+        var _element = {
+          position: position,
+          value: value
+        };
+        smallValues.push(_element);
+        largeValues.push(_element);
+      }
+    }
+    this._positionToMetaList = positionToMetaList;
+    this._smallValues = smallValues;
+    this._largeValues = largeValues;
+    this._indexToMetaMap = indexToMetaMap;
+    this.replaceMetaToIndexMap(metaToIndexMap);
+    this._metaToPositionMap = metaToPositionMap;
+    this._onTheFlyIndices = [];
+    try {
+      var _indices = new Array(this.bufferSize);
+      for (var _idx2 = 0; _idx2 < _indices.length; _idx2++) {
+        var _meta2 = this._onTheFlyIndices[_idx2] || this._positionToMetaList[_idx2];
+        var _targetIndex = this.getMetaIndex(_meta2);
+        if (_meta2 != null) {
+          _indices[_idx2] = {
+            meta: _meta2,
+            targetIndex: _targetIndex,
+            recyclerKey: this._name + "_" + _idx2
+          };
+        }
+      }
+      return _indices;
+    } catch (err) {
+      this.readyToStartNextLoop();
+      return this._positionToMetaList;
+    }
+  };
+  _proto.getIndices = function getIndices() {
+    try {
+      var indices = new Array(this.bufferSize);
+      for (var idx = 0; idx < indices.length; idx++) {
+        var meta = this._onTheFlyIndices[idx] || this._positionToMetaList[idx];
+        var targetIndex = this.getMetaIndex(meta);
+        if (meta !== this.getIndexMeta(targetIndex)) {
+          return this.shuffle();
+        }
+        if (meta != null) {
+          indices[idx] = {
+            meta: meta,
+            targetIndex: targetIndex,
+            recyclerKey: this._name + "_" + idx
+          };
+        }
+      }
+      this._onTheFlyIndices = [];
+      return indices;
+    } catch (err) {
+      this.readyToStartNextLoop();
+      return this._positionToMetaList;
+    }
+  };
   _proto._pushToHeaps = function _pushToHeaps(position, value) {
     var element = {
       position: position,
@@ -150,6 +371,30 @@ var IntegerBufferSet = /*#__PURE__*/function () {
     this._smallValues.push(element);
     this._largeValues.push(element);
   };
+  _proto._setMetaPosition = function _setMetaPosition(meta, position) {
+    var prevMetaOnPosition = this._positionToMetaList[position];
+    if (prevMetaOnPosition) this._metaToPositionMap["delete"](prevMetaOnPosition);
+    this._positionToMetaList[position] = meta;
+    this._metaToPositionMap.set(meta, position);
+  };
+  _proto._setMetaIndex = function _setMetaIndex(meta, index) {
+    var prevMetaIndex = this.getMetaIndex(meta);
+    if (prevMetaIndex !== undefined) {
+      this._indexToMetaMap["delete"](prevMetaIndex);
+    }
+    this.setMetaIndex(meta, index);
+    this._indexToMetaMap.set(index, meta);
+    return false;
+  };
+  _proto.readyToStartNextLoop = function readyToStartNextLoop() {
+    this._lastUpdatedMS = Date.now();
+  };
+  _proto.prepare = function prepare() {
+    if (this._loopMS === this._lastUpdatedMS) return;
+    this._loopMS = this._lastUpdatedMS;
+    this._onTheFlyIndices = [];
+    this._isOnTheFlyFull = false;
+  };
   _proto._cleanHeaps = function _cleanHeaps() {
     this._cleanHeap(this._smallValues);
     this._cleanHeap(this._largeValues);
@@ -165,7 +410,7 @@ var IntegerBufferSet = /*#__PURE__*/function () {
     var newLargeValues = new Heap([], this._greaterComparator);
     while (!sourceHeap.empty()) {
       var element = sourceHeap.pop();
-      if (this._valueToPositionMap[element.value] !== undefined) {
+      if (this._metaToPositionMap.get(this._indexToMetaMap.get(element.value)) != null) {
         newSmallValues.push(element);
         newLargeValues.push(element);
       }
@@ -174,7 +419,7 @@ var IntegerBufferSet = /*#__PURE__*/function () {
     this._largeValues = newLargeValues;
   };
   _proto._cleanHeap = function _cleanHeap(heap) {
-    while (!heap.empty() && this._valueToPositionMap[heap.peek().value] === undefined) {
+    while (!heap.empty() && this._metaToPositionMap.get(this._indexToMetaMap.get(heap.peek().value)) == null) {
       heap.pop();
     }
   };
@@ -185,18 +430,19 @@ var IntegerBufferSet = /*#__PURE__*/function () {
     return lhs.value > rhs.value;
   };
   _createClass(IntegerBufferSet, [{
-    key: "indices",
+    key: "bufferSize",
     get: function get() {
-      var indices = [];
-      for (var key in this._valueToPositionMap) {
-        var value = this._valueToPositionMap[key];
-        indices[value] = key;
-      }
-      return indices;
+      return this._bufferSize;
+    }
+  }, {
+    key: "isBufferFull",
+    get: function get() {
+      return this._positionToMetaList.length >= this._bufferSize;
     }
   }]);
   return IntegerBufferSet;
 }();
 
 export default IntegerBufferSet;
+export { defaultBufferSize };
 //# sourceMappingURL=integer-buffer-set.esm.js.map

package/dist/integer-buffer-set.esm.js.map

@@ -1 +1 @@
-{"version":3,"file":"integer-buffer-set.esm.js","sources":["../src/index.ts"],"sourcesContent":["// import invariant from 'invariant';\nimport Heap from '@x-oasis/heap';\n\ntype HeapItem = {\n  position: number;\n  value: number;\n};\n\nconst defaultUseMinValueFn = (options: {\n  safeRange: {\n    lowValue: number;\n    highValue: number;\n  };\n  bufferSetRange: {\n    maxValue: number;\n    minValue: number;\n  };\n  currentIndex: number;\n}) => {\n  const { safeRange, bufferSetRange } = options;\n  const { lowValue, highValue } = safeRange;\n  const { maxValue, minValue } = bufferSetRange;\n  return lowValue - minValue > maxValue - highValue;\n};\n\n// Data structure that allows to store values and assign positions to them\n// in a way to minimize changing positions of stored values when new ones are\n// added or when some values are replaced. Stored elements are alwasy assigned\n// a consecutive set of positoins startin from 0 up to count of elements less 1\n// Following actions can be executed\n// * get position assigned to given value (null if value is not stored)\n// * create new entry for new value and get assigned position back\n// * replace value that is furthest from specified value range with new value\n//   and get it's position back\n// All operations take amortized log(n) time where n is number of elements in\n// the set.\nclass IntegerBufferSet {\n  private _size: number;\n  private _valueToPositionMap: {\n    [key: string]: number;\n  };\n  private _smallValues: Heap<HeapItem>;\n  private _largeValues: Heap<HeapItem>;\n  private _vacantPositions: Array<number>;\n\n  constructor() {\n    this._valueToPositionMap = {};\n    this._size = 0;\n    this._smallValues = new Heap([], this._smallerComparator);\n    this._largeValues = new Heap([], this._greaterComparator);\n\n    this.getNewPositionForValue = this.getNewPositionForValue.bind(this);\n    this.getValuePosition = this.getValuePosition.bind(this);\n    this.getSize = this.getSize.bind(this);\n    this.replaceFurthestValuePosition =\n      this.replaceFurthestValuePosition.bind(this);\n\n    this._vacantPositions = [];\n  }\n\n  getSize() {\n    return this._size;\n  }\n\n  get indices() {\n    const indices = [];\n    for (const key in this._valueToPositionMap) {\n      const value = this._valueToPositionMap[key];\n      indices[value] = key;\n    }\n    return indices;\n  }\n\n  getValuePosition(value: number): null | number {\n    if (this._valueToPositionMap[value] === undefined) {\n      return null;\n    }\n    return this._valueToPositionMap[value];\n  }\n\n  getNewPositionForValue(value: number) {\n    if (this._valueToPositionMap[value] !== undefined) {\n      console.warn(\n        \"Shouldn't try to find new position for value already stored in BufferSet\"\n      );\n    }\n    // invariant(\n    //   this._valueToPositionMap[value] === undefined,\n    //   \"Shouldn't try to find new position for value already stored in BufferSet\"\n    // );\n    const newPosition = this._size;\n    this._size++;\n    this._pushToHeaps(newPosition, value);\n    this._valueToPositionMap[value] = newPosition;\n    return newPosition;\n  }\n\n  getMinValue() {\n    return this._smallValues.peek()?.value;\n  }\n\n  getMaxValue() {\n    return this._largeValues.peek()?.value;\n  }\n\n  setPositionValue(position: number, value: number) {\n    const originalPosition = this._valueToPositionMap[value];\n    if (originalPosition !== undefined) {\n      const index = this._vacantPositions.findIndex(\n        (v) => v === originalPosition\n      );\n      if (index === -1) this._vacantPositions.push(originalPosition);\n      delete this._valueToPositionMap[value];\n      this._valueToPositionMap[value] = position;\n    }\n  }\n\n  replaceFurthestValuePosition(\n    lowValue: number,\n    highValue: number,\n    newValue: number,\n    useMinValueFn: (options: {\n      safeRange: {\n        lowValue: number;\n        highValue: number;\n      };\n      bufferSetRange: {\n        maxValue: number;\n        minValue: number;\n      };\n      currentIndex: number;\n    }) => boolean = defaultUseMinValueFn\n  ): null | number {\n    if (this._valueToPositionMap[newValue] !== undefined) {\n      console.warn(\n        \"Shouldn't try to replace values with value already stored value in \" +\n          'BufferSet'\n      );\n    }\n    // invariant(\n    //   this._valueToPositionMap[newValue] === undefined,\n    //   \"Shouldn't try to replace values with value already stored value in \" +\n    //     'BufferSet'\n    // );\n\n    this._cleanHeaps();\n    if (this._smallValues.empty() || this._largeValues.empty()) {\n      // Threre are currently no values stored. We will have to create new\n      // position for this value.\n      return null;\n    }\n\n    if (this._vacantPositions.length) {\n      const position = this._vacantPositions.pop();\n      this._valueToPositionMap[newValue] = position;\n      this._pushToHeaps(position, newValue);\n      return position;\n    }\n\n    const minValue = this._smallValues.peek()!.value;\n    const maxValue = this._largeValues.peek()!.value;\n    if (minValue >= lowValue && maxValue <= highValue) {\n      // All values currently stored are necessary, we can't reuse any of them.\n      return null;\n    }\n\n    let valueToReplace;\n    if (\n      useMinValueFn({\n        safeRange: {\n          lowValue,\n          highValue,\n        },\n        bufferSetRange: {\n          minValue,\n          maxValue,\n        },\n        currentIndex: newValue,\n      })\n    ) {\n      // if (lowValue - minValue > maxValue - highValue) {\n      // minValue is further from provided range. We will reuse it's position.\n      valueToReplace = minValue;\n      this._smallValues.pop();\n    } else {\n      valueToReplace = maxValue;\n      this._largeValues.pop();\n    }\n    const position = this._valueToPositionMap[valueToReplace];\n    delete this._valueToPositionMap[valueToReplace];\n    this._valueToPositionMap[newValue] = position;\n    this._pushToHeaps(position, newValue);\n\n    const _i = this._vacantPositions.findIndex((v) => v === position);\n    if (_i !== -1) this._vacantPositions.splice(_i, 1);\n\n    return position;\n  }\n\n  _pushToHeaps(position: number, value: number) {\n    const element = {\n      position,\n      value,\n    };\n    // We can reuse the same object in both heaps, because we don't mutate them\n    this._smallValues.push(element);\n    this._largeValues.push(element);\n  }\n\n  _cleanHeaps() {\n    // We not usually only remove object from one heap while moving value.\n    // Here we make sure that there is no stale data on top of heaps.\n    this._cleanHeap(this._smallValues);\n    this._cleanHeap(this._largeValues);\n    const minHeapSize = Math.min(\n      this._smallValues.size(),\n      this._largeValues.size()\n    );\n    const maxHeapSize = Math.max(\n      this._smallValues.size(),\n      this._largeValues.size()\n    );\n    if (maxHeapSize > 10 * minHeapSize) {\n      // There are many old values in one of heaps. We need to get rid of them\n      // to not use too avoid memory leaks\n      this._recreateHeaps();\n    }\n  }\n\n  _recreateHeaps() {\n    const sourceHeap =\n      this._smallValues.size() < this._largeValues.size()\n        ? this._smallValues\n        : this._largeValues;\n    const newSmallValues = new Heap<HeapItem>(\n      [], // Initial data in the heap\n      this._smallerComparator\n    );\n    const newLargeValues = new Heap<HeapItem>(\n      [], // Initial datat in the heap\n      this._greaterComparator\n    );\n    while (!sourceHeap.empty()) {\n      const element = sourceHeap.pop()!;\n      // Push all stil valid elements to new heaps\n      if (this._valueToPositionMap[element.value] !== undefined) {\n        newSmallValues.push(element);\n        newLargeValues.push(element);\n      }\n    }\n    this._smallValues = newSmallValues;\n    this._largeValues = newLargeValues;\n  }\n\n  _cleanHeap(heap: Heap<HeapItem>) {\n    while (\n      !heap.empty() &&\n      this._valueToPositionMap[heap.peek()!.value] === undefined\n    ) {\n      heap.pop();\n    }\n  }\n\n  _smallerComparator(lhs: HeapItem, rhs: HeapItem) {\n    return lhs.value < rhs.value;\n  }\n\n  _greaterComparator(lhs: HeapItem, rhs: HeapItem) {\n    return lhs.value > rhs.value;\n  }\n}\n\nexport default IntegerBufferSet;\n"],"names":["defaultUseMinValueFn","options","safeRange","bufferSetRange","lowValue","highValue","maxValue","minValue","IntegerBufferSet","_valueToPositionMap","_size","_smallValues","Heap","_smallerComparator","_largeValues","_greaterComparator","getNewPositionForValue","bind","getValuePosition","getSize","replaceFurthestValuePosition","_vacantPositions","_proto","prototype","value","undefined","console","warn","newPosition","_pushToHeaps","getMinValue","_this$_smallValues$pe","peek","getMaxValue","_this$_largeValues$pe","setPositionValue","position","originalPosition","index","findIndex","v","push","newValue","useMinValueFn","_cleanHeaps","empty","length","pop","valueToReplace","currentIndex","_i","splice","element","_cleanHeap","minHeapSize","Math","min","size","maxHeapSize","max","_recreateHeaps","sourceHeap","newSmallValues","newLargeValues","heap","lhs","rhs","_createClass","key","get","indices"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAQA,IAAMA,oBAAoB,GAAG,SAAvBA,oBAAoBA,CAAIC,OAU7B;EACC,IAAQC,SAAS,GAAqBD,OAAO,CAArCC,SAAS;IAAEC,cAAc,GAAKF,OAAO,CAA1BE,cAAc;EACjC,IAAQC,QAAQ,GAAgBF,SAAS,CAAjCE,QAAQ;IAAEC,SAAS,GAAKH,SAAS,CAAvBG,SAAS;EAC3B,IAAQC,QAAQ,GAAeH,cAAc,CAArCG,QAAQ;IAAEC,QAAQ,GAAKJ,cAAc,CAA3BI,QAAQ;EAC1B,OAAOH,QAAQ,GAAGG,QAAQ,GAAGD,QAAQ,GAAGD,SAAS;AACnD,CAAC;AAAC,IAaIG,gBAAgB;EASpB,SAAAA;IACE,IAAI,CAACC,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,KAAK,GAAG,CAAC;IACd,IAAI,CAACC,YAAY,GAAG,IAAIC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACC,kBAAkB,CAAC;IACzD,IAAI,CAACC,YAAY,GAAG,IAAIF,IAAI,CAAC,EAAE,EAAE,IAAI,CAACG,kBAAkB,CAAC;IAEzD,IAAI,CAACC,sBAAsB,GAAG,IAAI,CAACA,sBAAsB,CAACC,IAAI,CAAC,IAAI,CAAC;IACpE,IAAI,CAACC,gBAAgB,GAAG,IAAI,CAACA,gBAAgB,CAACD,IAAI,CAAC,IAAI,CAAC;IACxD,IAAI,CAACE,OAAO,GAAG,IAAI,CAACA,OAAO,CAACF,IAAI,CAAC,IAAI,CAAC;IACtC,IAAI,CAACG,4BAA4B,GAC/B,IAAI,CAACA,4BAA4B,CAACH,IAAI,CAAC,IAAI,CAAC;IAE9C,IAAI,CAACI,gBAAgB,GAAG,EAAE;;EAC3B,IAAAC,MAAA,GAAAd,gBAAA,CAAAe,SAAA;EAAAD,MAAA,CAEDH,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACT,KAAK;GAClB;EAAAY,MAAA,CAWDJ,gBAAgB,GAAhB,SAAAA,iBAAiBM,KAAa;IAC5B,IAAI,IAAI,CAACf,mBAAmB,CAACe,KAAK,CAAC,KAAKC,SAAS,EAAE;MACjD,OAAO,IAAI;;IAEb,OAAO,IAAI,CAAChB,mBAAmB,CAACe,KAAK,CAAC;GACvC;EAAAF,MAAA,CAEDN,sBAAsB,GAAtB,SAAAA,uBAAuBQ,KAAa;IAClC,IAAI,IAAI,CAACf,mBAAmB,CAACe,KAAK,CAAC,KAAKC,SAAS,EAAE;MACjDC,OAAO,CAACC,IAAI,CACV,0EAA0E,CAC3E;;IAMH,IAAMC,WAAW,GAAG,IAAI,CAAClB,KAAK;IAC9B,IAAI,CAACA,KAAK,EAAE;IACZ,IAAI,CAACmB,YAAY,CAACD,WAAW,EAAEJ,KAAK,CAAC;IACrC,IAAI,CAACf,mBAAmB,CAACe,KAAK,CAAC,GAAGI,WAAW;IAC7C,OAAOA,WAAW;GACnB;EAAAN,MAAA,CAEDQ,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACpB,YAAY,CAACqB,IAAI,EAAE,qBAAxBD,qBAAA,CAA0BP,KAAK;GACvC;EAAAF,MAAA,CAEDW,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACpB,YAAY,CAACkB,IAAI,EAAE,qBAAxBE,qBAAA,CAA0BV,KAAK;GACvC;EAAAF,MAAA,CAEDa,gBAAgB,GAAhB,SAAAA,iBAAiBC,QAAgB,EAAEZ,KAAa;IAC9C,IAAMa,gBAAgB,GAAG,IAAI,CAAC5B,mBAAmB,CAACe,KAAK,CAAC;IACxD,IAAIa,gBAAgB,KAAKZ,SAAS,EAAE;MAClC,IAAMa,KAAK,GAAG,IAAI,CAACjB,gBAAgB,CAACkB,SAAS,CAC3C,UAACC,CAAC;QAAA,OAAKA,CAAC,KAAKH,gBAAgB;QAC9B;MACD,IAAIC,KAAK,KAAK,CAAC,CAAC,EAAE,IAAI,CAACjB,gBAAgB,CAACoB,IAAI,CAACJ,gBAAgB,CAAC;MAC9D,OAAO,IAAI,CAAC5B,mBAAmB,CAACe,KAAK,CAAC;MACtC,IAAI,CAACf,mBAAmB,CAACe,KAAK,CAAC,GAAGY,QAAQ;;GAE7C;EAAAd,MAAA,CAEDF,4BAA4B,GAA5B,SAAAA,6BACEhB,QAAgB,EAChBC,SAAiB,EACjBqC,QAAgB,EAChBC;QAAAA;MAAAA,gBAUgB3C,oBAAoB;;IAEpC,IAAI,IAAI,CAACS,mBAAmB,CAACiC,QAAQ,CAAC,KAAKjB,SAAS,EAAE;MACpDC,OAAO,CAACC,IAAI,CACV,qEAAqE,GACnE,WAAW,CACd;;IAQH,IAAI,CAACiB,WAAW,EAAE;IAClB,IAAI,IAAI,CAACjC,YAAY,CAACkC,KAAK,EAAE,IAAI,IAAI,CAAC/B,YAAY,CAAC+B,KAAK,EAAE,EAAE;MAG1D,OAAO,IAAI;;IAGb,IAAI,IAAI,CAACxB,gBAAgB,CAACyB,MAAM,EAAE;MAChC,IAAMV,SAAQ,GAAG,IAAI,CAACf,gBAAgB,CAAC0B,GAAG,EAAE;MAC5C,IAAI,CAACtC,mBAAmB,CAACiC,QAAQ,CAAC,GAAGN,SAAQ;MAC7C,IAAI,CAACP,YAAY,CAACO,SAAQ,EAAEM,QAAQ,CAAC;MACrC,OAAON,SAAQ;;IAGjB,IAAM7B,QAAQ,GAAG,IAAI,CAACI,YAAY,CAACqB,IAAI,EAAG,CAACR,KAAK;IAChD,IAAMlB,QAAQ,GAAG,IAAI,CAACQ,YAAY,CAACkB,IAAI,EAAG,CAACR,KAAK;IAChD,IAAIjB,QAAQ,IAAIH,QAAQ,IAAIE,QAAQ,IAAID,SAAS,EAAE;MAEjD,OAAO,IAAI;;IAGb,IAAI2C,cAAc;IAClB,IACEL,aAAa,CAAC;MACZzC,SAAS,EAAE;QACTE,QAAQ,EAARA,QAAQ;QACRC,SAAS,EAATA;OACD;MACDF,cAAc,EAAE;QACdI,QAAQ,EAARA,QAAQ;QACRD,QAAQ,EAARA;OACD;MACD2C,YAAY,EAAEP;KACf,CAAC,EACF;MAGAM,cAAc,GAAGzC,QAAQ;MACzB,IAAI,CAACI,YAAY,CAACoC,GAAG,EAAE;KACxB,MAAM;MACLC,cAAc,GAAG1C,QAAQ;MACzB,IAAI,CAACQ,YAAY,CAACiC,GAAG,EAAE;;IAEzB,IAAMX,QAAQ,GAAG,IAAI,CAAC3B,mBAAmB,CAACuC,cAAc,CAAC;IACzD,OAAO,IAAI,CAACvC,mBAAmB,CAACuC,cAAc,CAAC;IAC/C,IAAI,CAACvC,mBAAmB,CAACiC,QAAQ,CAAC,GAAGN,QAAQ;IAC7C,IAAI,CAACP,YAAY,CAACO,QAAQ,EAAEM,QAAQ,CAAC;IAErC,IAAMQ,EAAE,GAAG,IAAI,CAAC7B,gBAAgB,CAACkB,SAAS,CAAC,UAACC,CAAC;MAAA,OAAKA,CAAC,KAAKJ,QAAQ;MAAC;IACjE,IAAIc,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC7B,gBAAgB,CAAC8B,MAAM,CAACD,EAAE,EAAE,CAAC,CAAC;IAElD,OAAOd,QAAQ;GAChB;EAAAd,MAAA,CAEDO,YAAY,GAAZ,SAAAA,aAAaO,QAAgB,EAAEZ,KAAa;IAC1C,IAAM4B,OAAO,GAAG;MACdhB,QAAQ,EAARA,QAAQ;MACRZ,KAAK,EAALA;KACD;IAED,IAAI,CAACb,YAAY,CAAC8B,IAAI,CAACW,OAAO,CAAC;IAC/B,IAAI,CAACtC,YAAY,CAAC2B,IAAI,CAACW,OAAO,CAAC;GAChC;EAAA9B,MAAA,CAEDsB,WAAW,GAAX,SAAAA;IAGE,IAAI,CAACS,UAAU,CAAC,IAAI,CAAC1C,YAAY,CAAC;IAClC,IAAI,CAAC0C,UAAU,CAAC,IAAI,CAACvC,YAAY,CAAC;IAClC,IAAMwC,WAAW,GAAGC,IAAI,CAACC,GAAG,CAC1B,IAAI,CAAC7C,YAAY,CAAC8C,IAAI,EAAE,EACxB,IAAI,CAAC3C,YAAY,CAAC2C,IAAI,EAAE,CACzB;IACD,IAAMC,WAAW,GAAGH,IAAI,CAACI,GAAG,CAC1B,IAAI,CAAChD,YAAY,CAAC8C,IAAI,EAAE,EACxB,IAAI,CAAC3C,YAAY,CAAC2C,IAAI,EAAE,CACzB;IACD,IAAIC,WAAW,GAAG,EAAE,GAAGJ,WAAW,EAAE;MAGlC,IAAI,CAACM,cAAc,EAAE;;GAExB;EAAAtC,MAAA,CAEDsC,cAAc,GAAd,SAAAA;IACE,IAAMC,UAAU,GACd,IAAI,CAAClD,YAAY,CAAC8C,IAAI,EAAE,GAAG,IAAI,CAAC3C,YAAY,CAAC2C,IAAI,EAAE,GAC/C,IAAI,CAAC9C,YAAY,GACjB,IAAI,CAACG,YAAY;IACvB,IAAMgD,cAAc,GAAG,IAAIlD,IAAI,CAC7B,EAAE,EACF,IAAI,CAACC,kBAAkB,CACxB;IACD,IAAMkD,cAAc,GAAG,IAAInD,IAAI,CAC7B,EAAE,EACF,IAAI,CAACG,kBAAkB,CACxB;IACD,OAAO,CAAC8C,UAAU,CAAChB,KAAK,EAAE,EAAE;MAC1B,IAAMO,OAAO,GAAGS,UAAU,CAACd,GAAG,EAAG;MAEjC,IAAI,IAAI,CAACtC,mBAAmB,CAAC2C,OAAO,CAAC5B,KAAK,CAAC,KAAKC,SAAS,EAAE;QACzDqC,cAAc,CAACrB,IAAI,CAACW,OAAO,CAAC;QAC5BW,cAAc,CAACtB,IAAI,CAACW,OAAO,CAAC;;;IAGhC,IAAI,CAACzC,YAAY,GAAGmD,cAAc;IAClC,IAAI,CAAChD,YAAY,GAAGiD,cAAc;GACnC;EAAAzC,MAAA,CAED+B,UAAU,GAAV,SAAAA,WAAWW,IAAoB;IAC7B,OACE,CAACA,IAAI,CAACnB,KAAK,EAAE,IACb,IAAI,CAACpC,mBAAmB,CAACuD,IAAI,CAAChC,IAAI,EAAG,CAACR,KAAK,CAAC,KAAKC,SAAS,EAC1D;MACAuC,IAAI,CAACjB,GAAG,EAAE;;GAEb;EAAAzB,MAAA,CAEDT,kBAAkB,GAAlB,SAAAA,mBAAmBoD,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACzC,KAAK,GAAG0C,GAAG,CAAC1C,KAAK;GAC7B;EAAAF,MAAA,CAEDP,kBAAkB,GAAlB,SAAAA,mBAAmBkD,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACzC,KAAK,GAAG0C,GAAG,CAAC1C,KAAK;GAC7B;EAAA2C,YAAA,CAAA3D,gBAAA;IAAA4D,GAAA;IAAAC,GAAA,EA7MD,SAAAA;MACE,IAAMC,OAAO,GAAG,EAAE;MAClB,KAAK,IAAMF,GAAG,IAAI,IAAI,CAAC3D,mBAAmB,EAAE;QAC1C,IAAMe,KAAK,GAAG,IAAI,CAACf,mBAAmB,CAAC2D,GAAG,CAAC;QAC3CE,OAAO,CAAC9C,KAAK,CAAC,GAAG4C,GAAG;;MAEtB,OAAOE,OAAO;;;EACf,OAAA9D,gBAAA;AAAA;;;;"}
+{"version":3,"file":"integer-buffer-set.esm.js","sources":["../src/index.ts"],"sourcesContent":["import Heap from '@x-oasis/heap';\nimport isClamped from '@x-oasis/is-clamped';\nimport invariant from '@x-oasis/invariant';\nimport returnHook, { ReturnHook } from '@x-oasis/return-hook';\nimport {\n  HeapItem,\n  SafeRange,\n  MetaExtractor,\n  IndexExtractor,\n  IntegerBufferSetProps,\n  MetaToIndexMap,\n  MetaToPositionMap,\n  IndexToMetaMap,\n} from './types';\n\nconst defaultMetaExtractor = (value) => value;\nexport const defaultBufferSize = 10;\n\n// !!!!! should do meta validation...meta should has an index...\n// value: original data `index` value\n// value(index) => meta => position\n// `index to getIndices, meta to find index`\n\n// Data structure that allows to store values and assign positions to them\n// in a way to minimize changing positions of stored values when new ones are\n// added or when some values are replaced. Stored elements are alwasy assigned\n// a consecutive set of positoins startin from 0 up to count of elements less 1\n// Following actions can be executed\n// * get position assigned to given value (null if value is not stored)\n// * create new entry for new value and get assigned position back\n// * replace value that is furthest from specified value range with new value\n//   and get it's position back\n// All operations take amortized log(n) time where n is number of elements in\n// the set.\n// feature: add / delete / update item will also in consider..\nclass IntegerBufferSet<Meta = any> {\n  private _name: string;\n  private _bufferSize: number;\n\n  private _indexToMetaMap: IndexToMetaMap<Meta>;\n  private _metaToPositionMap: MetaToPositionMap<Meta>;\n  private _positionToMetaList: Array<Meta>;\n  private _metaToIndexMap: MetaToIndexMap<Meta>;\n\n  private _smallValues: Heap<HeapItem>;\n  private _largeValues: Heap<HeapItem>;\n  private _metaExtractor: MetaExtractor<Meta>;\n  private _indexExtractor: IndexExtractor<Meta>;\n\n  private _onTheFlyIndices: Array<Meta>;\n\n  private _isOnTheFlyFull: boolean;\n  private _isOnTheFlyFullReturnHook: ReturnHook;\n\n  private _loopMS: number;\n  private _lastUpdatedMS: number;\n\n  constructor(props: IntegerBufferSetProps<Meta> = {}) {\n    const {\n      name = 'default_buffer',\n      indexExtractor,\n      bufferSize = defaultBufferSize,\n      metaExtractor = defaultMetaExtractor,\n    } = props;\n    this._metaExtractor = metaExtractor;\n    this._indexExtractor = indexExtractor;\n\n    this._name = name;\n\n    /**\n     * this._indexToMetaMap is used to find the prev meta when finding a position for index.\n     */\n    this._indexToMetaMap = new Map();\n    this._metaToPositionMap = new Map();\n    this._positionToMetaList = [];\n    this._metaToIndexMap = new Map();\n    this._onTheFlyIndices = [];\n\n    this._bufferSize = bufferSize;\n\n    this._smallValues = new Heap([], this._smallerComparator);\n    this._largeValues = new Heap([], this._greaterComparator);\n\n    this.getNewPositionForIndex = this.getNewPositionForIndex.bind(this);\n    this.getIndexPosition = this.getIndexPosition.bind(this);\n    this.replacePositionInFliedIndices =\n      this.replacePositionInFliedIndices.bind(this);\n    this.replaceFurthestIndexPosition =\n      this.replaceFurthestIndexPosition.bind(this);\n    this._isOnTheFlyFullReturnHook = returnHook(\n      this.setIsOnTheFlyFull.bind(this)\n    );\n\n    this._loopMS = Date.now();\n    this._lastUpdatedMS = this._loopMS;\n  }\n\n  get bufferSize() {\n    return this._bufferSize;\n  }\n\n  setIsOnTheFlyFull(val: any) {\n    if (val != null) {\n      const data = this._onTheFlyIndices.filter((v) => v);\n      this._isOnTheFlyFull = data.length === this._bufferSize;\n    }\n  }\n\n  get isBufferFull() {\n    return this._positionToMetaList.length >= this._bufferSize;\n  }\n\n  getOnTheFlyUncriticalPosition(safeRange: SafeRange) {\n    const { startIndex, endIndex } = safeRange;\n    for (let idx = 0; idx < this._onTheFlyIndices.length; idx++) {\n      const meta = this._onTheFlyIndices[idx];\n      const metaIndex = this._metaToIndexMap.get(meta);\n      if (!isClamped(startIndex, metaIndex, endIndex)) {\n        return idx;\n      }\n    }\n    return null;\n  }\n\n  initialize() {\n    return {\n      smallValues: new Heap([], this._smallerComparator),\n      largeValues: new Heap([], this._greaterComparator),\n      valueToPositionObject: {},\n    };\n  }\n\n  getIndexMeta(index: number) {\n    return this._metaExtractor(index);\n  }\n\n  getMetaIndex(meta: Meta) {\n    if (this._indexExtractor) return this._indexExtractor(meta);\n    return this._metaToIndexMap.get(meta);\n  }\n\n  setMetaIndex(meta: Meta, index: number) {\n    if (!this._indexExtractor) {\n      return this._metaToIndexMap.set(meta, index);\n    }\n    return false;\n  }\n\n  deleteMetaIndex(meta: Meta) {\n    return this._metaToIndexMap.delete(meta);\n  }\n\n  replaceMetaToIndexMap(newMetaToIndexMap: MetaToIndexMap<Meta>) {\n    if (!this._indexExtractor) {\n      return (this._metaToIndexMap = newMetaToIndexMap);\n    }\n    return false;\n  }\n\n  getIndexPosition(index: number): undefined | number {\n    return this.getMetaIndex(this.getIndexMeta(index));\n  }\n\n  getNewPositionForIndex(index: number) {\n    const meta = this.getIndexMeta(index);\n    invariant(\n      this._metaToPositionMap.get(meta) === undefined,\n      \"Shouldn't try to find new position for value already stored in BufferSet\"\n    );\n    const newPosition = this._positionToMetaList.length;\n\n    this._pushToHeaps(newPosition, index);\n    this._setMetaIndex(meta, index);\n    this._setMetaPosition(meta, newPosition);\n\n    return newPosition;\n  }\n\n  getMinValue() {\n    return this._smallValues.peek()?.value;\n  }\n\n  getMaxValue() {\n    return this._largeValues.peek()?.value;\n  }\n\n  replacePositionInFliedIndices(newIndex: number, safeRange: SafeRange) {\n    const { startIndex, endIndex } = safeRange;\n\n    if (this._isOnTheFlyFull) {\n      // newIndex is not critical index, do nothing\n      if (!isClamped(startIndex, newIndex, endIndex)) {\n        return null;\n      }\n      // if `newIndex` is critical index, replace an un-committed\n      // index value from _onTheFlyIndices.\n      const pos = this.getOnTheFlyUncriticalPosition(safeRange);\n      if (pos != null) return pos;\n    }\n    return null;\n  }\n\n  getFliedPosition(newIndex: number, safeRange: SafeRange) {\n    const pos = this.replacePositionInFliedIndices(newIndex, safeRange);\n    if (pos != null) {\n      const meta = this.getIndexMeta(newIndex);\n      this._onTheFlyIndices[pos] = meta;\n      this._setMetaIndex(meta, newIndex);\n      return this._isOnTheFlyFullReturnHook(pos);\n    }\n    return null;\n  }\n\n  /**\n   *\n   * @param newIndex\n   * @param safeRange\n   * @returns\n   *\n   *\n   * _positionToMetaList maybe undefined on next loop\n   */\n  getPosition(newIndex: number, safeRange?: SafeRange) {\n    this.prepare();\n    const meta = this.getIndexMeta(newIndex);\n    const prevMetaPosition = this._metaToPositionMap.get(meta);\n\n    if (prevMetaPosition !== undefined) {\n      const onTheFlyPositionMeta = this._onTheFlyIndices[prevMetaPosition];\n      // the occupied meta should change position\n      if (onTheFlyPositionMeta) {\n        // such as place item 11 twice...\n        if (onTheFlyPositionMeta === meta) {\n          return prevMetaPosition;\n        }\n        let positionToReplace = this._replaceFurthestIndexPosition(\n          newIndex,\n          safeRange\n        );\n        if (this._isOnTheFlyFull)\n          return this.getFliedPosition(newIndex, safeRange);\n\n        while (this._onTheFlyIndices[positionToReplace]) {\n          positionToReplace = this._replaceFurthestIndexPosition(\n            newIndex,\n            safeRange\n          );\n        }\n\n        if (positionToReplace != null) {\n          this._setMetaIndex(meta, newIndex);\n          this._onTheFlyIndices[positionToReplace] = onTheFlyPositionMeta;\n          return this._isOnTheFlyFullReturnHook(positionToReplace);\n        }\n      }\n      this._onTheFlyIndices[prevMetaPosition] = meta;\n      return this._isOnTheFlyFullReturnHook(prevMetaPosition);\n    }\n\n    // placed on new buffered position\n    if (!this.isBufferFull)\n      return this._isOnTheFlyFullReturnHook(\n        this.getNewPositionForIndex(newIndex)\n      );\n\n    if (this._isOnTheFlyFull) return this.getFliedPosition(newIndex, safeRange);\n\n    let positionToReplace;\n    const prevIndexMeta = this._indexToMetaMap.get(newIndex);\n\n    // Index has already been stored, but we cant use its old position directly...\n    // 1：index -> meta, meta may be reused later\n\n    // 2: temp use index -> meta -> position, this issue should exist for follows...\n    if (!prevIndexMeta) {\n      this._cleanHeaps();\n      positionToReplace = this._replaceFurthestIndexPosition(\n        newIndex,\n        safeRange\n      );\n    } else {\n      positionToReplace = this._metaToPositionMap.get(prevIndexMeta);\n    }\n\n    this._onTheFlyIndices[positionToReplace] = meta;\n    this._setMetaIndex(meta, newIndex);\n    this._setMetaPosition(meta, positionToReplace);\n    // should not push to heap, pop only\n    // this._pushToHeaps(positionToReplace, newIndex)\n\n    return this._isOnTheFlyFullReturnHook(positionToReplace);\n  }\n\n  replaceFurthestIndexPosition(\n    newIndex: number,\n    safeRange?: {\n      startIndex: number;\n      endIndex: number;\n    }\n  ) {\n    if (!this.isBufferFull) {\n      return this._isOnTheFlyFullReturnHook(\n        this.getNewPositionForIndex(newIndex)\n      );\n    }\n\n    return this._replaceFurthestIndexPosition(newIndex, safeRange);\n  }\n\n  _replaceFurthestIndexPosition(\n    newIndex: number,\n    safeRange?: {\n      startIndex: number;\n      endIndex: number;\n    }\n  ) {\n    if (this._largeValues.empty() || this._smallValues.empty()) {\n      return this._isOnTheFlyFullReturnHook(\n        this.getNewPositionForIndex(newIndex)\n      );\n    }\n\n    const minValue = this._smallValues.peek()!.value;\n    const maxValue = this._largeValues.peek()!.value;\n\n    let indexToReplace;\n\n    if (!safeRange) {\n      // far from min\n      if (Math.abs(newIndex - minValue) > Math.abs(newIndex - maxValue)) {\n        indexToReplace = minValue;\n        this._smallValues.pop();\n      } else {\n        indexToReplace = maxValue;\n        this._largeValues.pop();\n      }\n      const replacedMeta = this._indexToMetaMap.get(indexToReplace);\n      const position = this._metaToPositionMap.get(replacedMeta);\n\n      return position;\n    }\n\n    const { startIndex: lowValue, endIndex: highValue } = safeRange;\n\n    // All values currently stored are necessary, we can't reuse any of them.\n    if (\n      isClamped(lowValue, minValue, highValue) &&\n      isClamped(lowValue, maxValue, highValue)\n    ) {\n      return null;\n    } else if (\n      isClamped(lowValue, minValue, highValue) &&\n      !isClamped(lowValue, maxValue, highValue)\n    ) {\n      indexToReplace = maxValue;\n      this._largeValues.pop();\n    } else if (\n      !isClamped(lowValue, minValue, highValue) &&\n      isClamped(lowValue, maxValue, highValue)\n    ) {\n      indexToReplace = minValue;\n      this._smallValues.pop();\n    } else if (lowValue - minValue > maxValue - highValue) {\n      // minValue is further from provided range. We will reuse it's position.\n      indexToReplace = minValue;\n      this._smallValues.pop();\n    } else {\n      indexToReplace = maxValue;\n      this._largeValues.pop();\n    }\n\n    const replacedMeta = this._indexToMetaMap.get(indexToReplace);\n    const position = this._metaToPositionMap.get(replacedMeta);\n\n    return position;\n  }\n\n  shuffle() {\n    const indices = new Array(this.bufferSize);\n    for (let idx = 0; idx < indices.length; idx++) {\n      const meta = this._onTheFlyIndices[idx] || this._positionToMetaList[idx];\n      const targetIndex = this.getMetaIndex(meta);\n      indices[idx] = targetIndex;\n    }\n\n    const _arr = new Array(indices.length);\n    const _available = [];\n    const indexToMetaMap = new Map();\n    const metaToIndexMap = new Map();\n    const metaToPositionMap = new Map();\n    for (let idx = 0; idx < indices.length; idx++) {\n      const currentIndex = indices[idx];\n      const currentMeta = this._metaExtractor(currentIndex);\n      if (currentMeta == null) continue;\n\n      indexToMetaMap.set(currentIndex, currentMeta);\n      metaToIndexMap.set(currentMeta, currentIndex);\n\n      if (currentMeta === this._positionToMetaList[idx]) {\n        _arr[idx] = currentMeta;\n        continue;\n      }\n      const _i = this._positionToMetaList.findIndex((v) => v === currentMeta);\n      if (_i !== -1) {\n        _arr[_i] = currentMeta;\n        continue;\n      }\n\n      _available.push(currentMeta);\n    }\n\n    const { smallValues, largeValues } = this.initialize();\n    const positionToMetaList = [];\n\n    for (let position = 0; position < indices.length; position++) {\n      const value = indices[position];\n      if (_arr[position] != null) {\n        positionToMetaList[position] = _arr[position];\n        metaToPositionMap.set(_arr[position], position);\n        const element = { position, value };\n        smallValues.push(element);\n        largeValues.push(element);\n        continue;\n      }\n      const meta = _available.shift();\n      if (meta != null) {\n        positionToMetaList[position] = meta;\n        metaToPositionMap.set(meta, position);\n\n        const element = { position, value };\n        smallValues.push(element);\n        largeValues.push(element);\n      }\n    }\n\n    this._positionToMetaList = positionToMetaList;\n    this._smallValues = smallValues;\n    this._largeValues = largeValues;\n    this._indexToMetaMap = indexToMetaMap;\n    this.replaceMetaToIndexMap(metaToIndexMap);\n    this._metaToPositionMap = metaToPositionMap;\n    this._onTheFlyIndices = [];\n\n    try {\n      const indices = new Array(this.bufferSize);\n      for (let idx = 0; idx < indices.length; idx++) {\n        const meta =\n          this._onTheFlyIndices[idx] || this._positionToMetaList[idx];\n        const targetIndex = this.getMetaIndex(meta);\n        if (meta != null) {\n          indices[idx] = {\n            meta,\n            targetIndex,\n            recyclerKey: `${this._name}_${idx}`,\n          };\n        }\n      }\n      return indices;\n    } catch (err) {\n      this.readyToStartNextLoop();\n      return this._positionToMetaList;\n    }\n  }\n\n  // key point: `meta` should be preserved..\n  getIndices() {\n    try {\n      const indices = new Array(this.bufferSize);\n      for (let idx = 0; idx < indices.length; idx++) {\n        const meta =\n          this._onTheFlyIndices[idx] || this._positionToMetaList[idx];\n        const targetIndex = this.getMetaIndex(meta);\n        // which means source data has changed. such as one element has been deleted\n        if (meta !== this.getIndexMeta(targetIndex)) {\n          return this.shuffle();\n        }\n        if (meta != null) {\n          indices[idx] = {\n            meta,\n            targetIndex,\n            recyclerKey: `${this._name}_${idx}`,\n          };\n        }\n      }\n      // clear on the fly indices after return indices.\n      this._onTheFlyIndices = [];\n\n      return indices;\n    } catch (err) {\n      this.readyToStartNextLoop();\n      return this._positionToMetaList;\n    }\n  }\n\n  _pushToHeaps(position: number, value: number) {\n    const element = { position, value };\n    // We can reuse the same object in both heaps, because we don't mutate them\n    this._smallValues.push(element);\n    this._largeValues.push(element);\n  }\n\n  _setMetaPosition(meta: Meta, position: number) {\n    const prevMetaOnPosition = this._positionToMetaList[position];\n    if (prevMetaOnPosition) this._metaToPositionMap.delete(prevMetaOnPosition);\n    this._positionToMetaList[position] = meta;\n    this._metaToPositionMap.set(meta, position);\n  }\n\n  /**\n   *\n   * @param meta\n   * @param index\n   * @returns true means index not changed\n   */\n  _setMetaIndex(meta: Meta, index: number) {\n    const prevMetaIndex = this.getMetaIndex(meta);\n    if (prevMetaIndex !== undefined) {\n      // no need to set\n      // if (prevMetaIndex === index) return true;\n      this._indexToMetaMap.delete(prevMetaIndex);\n    }\n    this.setMetaIndex(meta, index);\n    this._indexToMetaMap.set(index, meta);\n    return false;\n  }\n\n  readyToStartNextLoop() {\n    this._lastUpdatedMS = Date.now();\n  }\n\n  prepare() {\n    if (this._loopMS === this._lastUpdatedMS) return;\n    this._loopMS = this._lastUpdatedMS;\n\n    this._onTheFlyIndices = [];\n    this._isOnTheFlyFull = false;\n  }\n\n  _cleanHeaps() {\n    // We not usually only remove object from one heap while moving value.\n    // Here we make sure that there is no stale data on top of heaps.\n    this._cleanHeap(this._smallValues);\n    this._cleanHeap(this._largeValues);\n    const minHeapSize = Math.min(\n      this._smallValues.size(),\n      this._largeValues.size()\n    );\n    const maxHeapSize = Math.max(\n      this._smallValues.size(),\n      this._largeValues.size()\n    );\n    if (maxHeapSize > 10 * minHeapSize) {\n      // There are many old values in one of heaps. We need to get rid of them\n      // to not use too avoid memory leaks\n      this._recreateHeaps();\n    }\n  }\n  _recreateHeaps() {\n    const sourceHeap =\n      this._smallValues.size() < this._largeValues.size()\n        ? this._smallValues\n        : this._largeValues;\n    const newSmallValues = new Heap<HeapItem>(\n      [], // Initial data in the heap\n      this._smallerComparator\n    );\n    const newLargeValues = new Heap<HeapItem>(\n      [], // Initial datat in the heap\n      this._greaterComparator\n    );\n    while (!sourceHeap.empty()) {\n      const element = sourceHeap.pop()!;\n      // Push all still valid elements to new heaps\n      if (\n        this._metaToPositionMap.get(this._indexToMetaMap.get(element.value)) !=\n        null\n      ) {\n        newSmallValues.push(element);\n        newLargeValues.push(element);\n      }\n    }\n    this._smallValues = newSmallValues;\n    this._largeValues = newLargeValues;\n  }\n\n  _cleanHeap(heap: Heap<HeapItem>) {\n    while (\n      !heap.empty() &&\n      this._metaToPositionMap.get(\n        this._indexToMetaMap.get(heap.peek()!.value)\n      ) == null\n    ) {\n      heap.pop();\n    }\n  }\n\n  _smallerComparator(lhs: HeapItem, rhs: HeapItem) {\n    return lhs.value < rhs.value;\n  }\n\n  _greaterComparator(lhs: HeapItem, rhs: HeapItem) {\n    return lhs.value > rhs.value;\n  }\n}\n\nexport default IntegerBufferSet;\n"],"names":["defaultMetaExtractor","value","defaultBufferSize","IntegerBufferSet","props","_props","_props$name","name","indexExtractor","_props$bufferSize","bufferSize","_props$metaExtractor","metaExtractor","_metaExtractor","_indexExtractor","_name","_indexToMetaMap","Map","_metaToPositionMap","_positionToMetaList","_metaToIndexMap","_onTheFlyIndices","_bufferSize","_smallValues","Heap","_smallerComparator","_largeValues","_greaterComparator","getNewPositionForIndex","bind","getIndexPosition","replacePositionInFliedIndices","replaceFurthestIndexPosition","_isOnTheFlyFullReturnHook","returnHook","setIsOnTheFlyFull","_loopMS","Date","now","_lastUpdatedMS","_proto","prototype","val","data","filter","v","_isOnTheFlyFull","length","getOnTheFlyUncriticalPosition","safeRange","startIndex","endIndex","idx","meta","metaIndex","get","isClamped","initialize","smallValues","largeValues","valueToPositionObject","getIndexMeta","index","getMetaIndex","setMetaIndex","set","deleteMetaIndex","replaceMetaToIndexMap","newMetaToIndexMap","undefined","process","env","NODE_ENV","invariant","newPosition","_pushToHeaps","_setMetaIndex","_setMetaPosition","getMinValue","_this$_smallValues$pe","peek","getMaxValue","_this$_largeValues$pe","newIndex","pos","getFliedPosition","getPosition","prepare","prevMetaPosition","onTheFlyPositionMeta","positionToReplace","_replaceFurthestIndexPosition","isBufferFull","prevIndexMeta","_cleanHeaps","empty","minValue","maxValue","indexToReplace","Math","abs","pop","replacedMeta","position","lowValue","highValue","shuffle","indices","Array","targetIndex","_arr","_available","indexToMetaMap","metaToIndexMap","metaToPositionMap","_loop","currentIndex","currentMeta","_this","_i","findIndex","push","_ret","_this$initialize","positionToMetaList","element","shift","recyclerKey","err","readyToStartNextLoop","getIndices","prevMetaOnPosition","prevMetaIndex","_cleanHeap","minHeapSize","min","size","maxHeapSize","max","_recreateHeaps","sourceHeap","newSmallValues","newLargeValues","heap","lhs","rhs","_createClass","key"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeA,IAAMA,oBAAoB,GAAG,SAAvBA,oBAAoBA,CAAIC,KAAK;EAAA,OAAKA,KAAK;AAAA;IAChCC,iBAAiB,GAAG;AAAG,IAmB9BC,gBAAgB;EAsBpB,SAAAA,iBAAYC;QAAAA;MAAAA,QAAqC,EAAE;;IACjD,IAAAC,MAAA,GAKID,KAAK;MAAAE,WAAA,GAAAD,MAAA,CAJPE,IAAI;MAAJA,IAAI,GAAAD,WAAA,cAAG,gBAAgB,GAAAA,WAAA;MACvBE,cAAc,GAAAH,MAAA,CAAdG,cAAc;MAAAC,iBAAA,GAAAJ,MAAA,CACdK,UAAU;MAAVA,UAAU,GAAAD,iBAAA,cAAGP,iBAAiB,GAAAO,iBAAA;MAAAE,oBAAA,GAAAN,MAAA,CAC9BO,aAAa;MAAbA,aAAa,GAAAD,oBAAA,cAAGX,oBAAoB,GAAAW,oBAAA;IAEtC,IAAI,CAACE,cAAc,GAAGD,aAAa;IACnC,IAAI,CAACE,eAAe,GAAGN,cAAc;IAErC,IAAI,CAACO,KAAK,GAAGR,IAAI;IAKjB,IAAI,CAACS,eAAe,GAAG,IAAIC,GAAG,EAAE;IAChC,IAAI,CAACC,kBAAkB,GAAG,IAAID,GAAG,EAAE;IACnC,IAAI,CAACE,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,eAAe,GAAG,IAAIH,GAAG,EAAE;IAChC,IAAI,CAACI,gBAAgB,GAAG,EAAE;IAE1B,IAAI,CAACC,WAAW,GAAGZ,UAAU;IAE7B,IAAI,CAACa,YAAY,GAAG,IAAIC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACC,kBAAkB,CAAC;IACzD,IAAI,CAACC,YAAY,GAAG,IAAIF,IAAI,CAAC,EAAE,EAAE,IAAI,CAACG,kBAAkB,CAAC;IAEzD,IAAI,CAACC,sBAAsB,GAAG,IAAI,CAACA,sBAAsB,CAACC,IAAI,CAAC,IAAI,CAAC;IACpE,IAAI,CAACC,gBAAgB,GAAG,IAAI,CAACA,gBAAgB,CAACD,IAAI,CAAC,IAAI,CAAC;IACxD,IAAI,CAACE,6BAA6B,GAChC,IAAI,CAACA,6BAA6B,CAACF,IAAI,CAAC,IAAI,CAAC;IAC/C,IAAI,CAACG,4BAA4B,GAC/B,IAAI,CAACA,4BAA4B,CAACH,IAAI,CAAC,IAAI,CAAC;IAC9C,IAAI,CAACI,yBAAyB,GAAGC,UAAU,CACzC,IAAI,CAACC,iBAAiB,CAACN,IAAI,CAAC,IAAI,CAAC,CAClC;IAED,IAAI,CAACO,OAAO,GAAGC,IAAI,CAACC,GAAG,EAAE;IACzB,IAAI,CAACC,cAAc,GAAG,IAAI,CAACH,OAAO;;EACnC,IAAAI,MAAA,GAAArC,gBAAA,CAAAsC,SAAA;EAAAD,MAAA,CAMDL,iBAAiB,GAAjB,SAAAA,kBAAkBO,GAAQ;IACxB,IAAIA,GAAG,IAAI,IAAI,EAAE;MACf,IAAMC,IAAI,GAAG,IAAI,CAACtB,gBAAgB,CAACuB,MAAM,CAAC,UAACC,CAAC;QAAA,OAAKA,CAAC;QAAC;MACnD,IAAI,CAACC,eAAe,GAAGH,IAAI,CAACI,MAAM,KAAK,IAAI,CAACzB,WAAW;;GAE1D;EAAAkB,MAAA,CAMDQ,6BAA6B,GAA7B,SAAAA,8BAA8BC,SAAoB;IAChD,IAAQC,UAAU,GAAeD,SAAS,CAAlCC,UAAU;MAAEC,QAAQ,GAAKF,SAAS,CAAtBE,QAAQ;IAC5B,KAAK,IAAIC,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAG,IAAI,CAAC/B,gBAAgB,CAAC0B,MAAM,EAAEK,GAAG,EAAE,EAAE;MAC3D,IAAMC,IAAI,GAAG,IAAI,CAAChC,gBAAgB,CAAC+B,GAAG,CAAC;MACvC,IAAME,SAAS,GAAG,IAAI,CAAClC,eAAe,CAACmC,GAAG,CAACF,IAAI,CAAC;MAChD,IAAI,CAACG,SAAS,CAACN,UAAU,EAAEI,SAAS,EAAEH,QAAQ,CAAC,EAAE;QAC/C,OAAOC,GAAG;;;IAGd,OAAO,IAAI;GACZ;EAAAZ,MAAA,CAEDiB,UAAU,GAAV,SAAAA;IACE,OAAO;MACLC,WAAW,EAAE,IAAIlC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACC,kBAAkB,CAAC;MAClDkC,WAAW,EAAE,IAAInC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACG,kBAAkB,CAAC;MAClDiC,qBAAqB,EAAE;KACxB;GACF;EAAApB,MAAA,CAEDqB,YAAY,GAAZ,SAAAA,aAAaC,KAAa;IACxB,OAAO,IAAI,CAACjD,cAAc,CAACiD,KAAK,CAAC;GAClC;EAAAtB,MAAA,CAEDuB,YAAY,GAAZ,SAAAA,aAAaV,IAAU;IACrB,IAAI,IAAI,CAACvC,eAAe,EAAE,OAAO,IAAI,CAACA,eAAe,CAACuC,IAAI,CAAC;IAC3D,OAAO,IAAI,CAACjC,eAAe,CAACmC,GAAG,CAACF,IAAI,CAAC;GACtC;EAAAb,MAAA,CAEDwB,YAAY,GAAZ,SAAAA,aAAaX,IAAU,EAAES,KAAa;IACpC,IAAI,CAAC,IAAI,CAAChD,eAAe,EAAE;MACzB,OAAO,IAAI,CAACM,eAAe,CAAC6C,GAAG,CAACZ,IAAI,EAAES,KAAK,CAAC;;IAE9C,OAAO,KAAK;GACb;EAAAtB,MAAA,CAED0B,eAAe,GAAf,SAAAA,gBAAgBb,IAAU;IACxB,OAAO,IAAI,CAACjC,eAAe,UAAO,CAACiC,IAAI,CAAC;GACzC;EAAAb,MAAA,CAED2B,qBAAqB,GAArB,SAAAA,sBAAsBC,iBAAuC;IAC3D,IAAI,CAAC,IAAI,CAACtD,eAAe,EAAE;MACzB,OAAQ,IAAI,CAACM,eAAe,GAAGgD,iBAAiB;;IAElD,OAAO,KAAK;GACb;EAAA5B,MAAA,CAEDV,gBAAgB,GAAhB,SAAAA,iBAAiBgC,KAAa;IAC5B,OAAO,IAAI,CAACC,YAAY,CAAC,IAAI,CAACF,YAAY,CAACC,KAAK,CAAC,CAAC;GACnD;EAAAtB,MAAA,CAEDZ,sBAAsB,GAAtB,SAAAA,uBAAuBkC,KAAa;IAClC,IAAMT,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACC,KAAK,CAAC;IACrC,EACE,IAAI,CAAC5C,kBAAkB,CAACqC,GAAG,CAACF,IAAI,CAAC,KAAKgB,SAAS,IAAAC,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBADjDC,SAAS,QAEP,0EAA0E,IAF5EA,SAAS;IAIT,IAAMC,WAAW,GAAG,IAAI,CAACvD,mBAAmB,CAAC4B,MAAM;IAEnD,IAAI,CAAC4B,YAAY,CAACD,WAAW,EAAEZ,KAAK,CAAC;IACrC,IAAI,CAACc,aAAa,CAACvB,IAAI,EAAES,KAAK,CAAC;IAC/B,IAAI,CAACe,gBAAgB,CAACxB,IAAI,EAAEqB,WAAW,CAAC;IAExC,OAAOA,WAAW;GACnB;EAAAlC,MAAA,CAEDsC,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACxD,YAAY,CAACyD,IAAI,EAAE,qBAAxBD,qBAAA,CAA0B9E,KAAK;GACvC;EAAAuC,MAAA,CAEDyC,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACxD,YAAY,CAACsD,IAAI,EAAE,qBAAxBE,qBAAA,CAA0BjF,KAAK;GACvC;EAAAuC,MAAA,CAEDT,6BAA6B,GAA7B,SAAAA,8BAA8BoD,QAAgB,EAAElC,SAAoB;IAClE,IAAQC,UAAU,GAAeD,SAAS,CAAlCC,UAAU;MAAEC,QAAQ,GAAKF,SAAS,CAAtBE,QAAQ;IAE5B,IAAI,IAAI,CAACL,eAAe,EAAE;MAExB,IAAI,CAACU,SAAS,CAACN,UAAU,EAAEiC,QAAQ,EAAEhC,QAAQ,CAAC,EAAE;QAC9C,OAAO,IAAI;;MAIb,IAAMiC,GAAG,GAAG,IAAI,CAACpC,6BAA6B,CAACC,SAAS,CAAC;MACzD,IAAImC,GAAG,IAAI,IAAI,EAAE,OAAOA,GAAG;;IAE7B,OAAO,IAAI;GACZ;EAAA5C,MAAA,CAED6C,gBAAgB,GAAhB,SAAAA,iBAAiBF,QAAgB,EAAElC,SAAoB;IACrD,IAAMmC,GAAG,GAAG,IAAI,CAACrD,6BAA6B,CAACoD,QAAQ,EAAElC,SAAS,CAAC;IACnE,IAAImC,GAAG,IAAI,IAAI,EAAE;MACf,IAAM/B,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACsB,QAAQ,CAAC;MACxC,IAAI,CAAC9D,gBAAgB,CAAC+D,GAAG,CAAC,GAAG/B,IAAI;MACjC,IAAI,CAACuB,aAAa,CAACvB,IAAI,EAAE8B,QAAQ,CAAC;MAClC,OAAO,IAAI,CAAClD,yBAAyB,CAACmD,GAAG,CAAC;;IAE5C,OAAO,IAAI;GACZ;EAAA5C,MAAA,CAWD8C,WAAW,GAAX,SAAAA,YAAYH,QAAgB,EAAElC,SAAqB;IACjD,IAAI,CAACsC,OAAO,EAAE;IACd,IAAMlC,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACsB,QAAQ,CAAC;IACxC,IAAMK,gBAAgB,GAAG,IAAI,CAACtE,kBAAkB,CAACqC,GAAG,CAACF,IAAI,CAAC;IAE1D,IAAImC,gBAAgB,KAAKnB,SAAS,EAAE;MAClC,IAAMoB,oBAAoB,GAAG,IAAI,CAACpE,gBAAgB,CAACmE,gBAAgB,CAAC;MAEpE,IAAIC,oBAAoB,EAAE;QAExB,IAAIA,oBAAoB,KAAKpC,IAAI,EAAE;UACjC,OAAOmC,gBAAgB;;QAEzB,IAAIE,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACxDR,QAAQ,EACRlC,SAAS,CACV;QACD,IAAI,IAAI,CAACH,eAAe,EACtB,OAAO,IAAI,CAACuC,gBAAgB,CAACF,QAAQ,EAAElC,SAAS,CAAC;QAEnD,OAAO,IAAI,CAAC5B,gBAAgB,CAACqE,kBAAiB,CAAC,EAAE;UAC/CA,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDR,QAAQ,EACRlC,SAAS,CACV;;QAGH,IAAIyC,kBAAiB,IAAI,IAAI,EAAE;UAC7B,IAAI,CAACd,aAAa,CAACvB,IAAI,EAAE8B,QAAQ,CAAC;UAClC,IAAI,CAAC9D,gBAAgB,CAACqE,kBAAiB,CAAC,GAAGD,oBAAoB;UAC/D,OAAO,IAAI,CAACxD,yBAAyB,CAACyD,kBAAiB,CAAC;;;MAG5D,IAAI,CAACrE,gBAAgB,CAACmE,gBAAgB,CAAC,GAAGnC,IAAI;MAC9C,OAAO,IAAI,CAACpB,yBAAyB,CAACuD,gBAAgB,CAAC;;IAIzD,IAAI,CAAC,IAAI,CAACI,YAAY,EACpB,OAAO,IAAI,CAAC3D,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACuD,QAAQ,CAAC,CACtC;IAEH,IAAI,IAAI,CAACrC,eAAe,EAAE,OAAO,IAAI,CAACuC,gBAAgB,CAACF,QAAQ,EAAElC,SAAS,CAAC;IAE3E,IAAIyC,iBAAiB;IACrB,IAAMG,aAAa,GAAG,IAAI,CAAC7E,eAAe,CAACuC,GAAG,CAAC4B,QAAQ,CAAC;IAMxD,IAAI,CAACU,aAAa,EAAE;MAClB,IAAI,CAACC,WAAW,EAAE;MAClBJ,iBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDR,QAAQ,EACRlC,SAAS,CACV;KACF,MAAM;MACLyC,iBAAiB,GAAG,IAAI,CAACxE,kBAAkB,CAACqC,GAAG,CAACsC,aAAa,CAAC;;IAGhE,IAAI,CAACxE,gBAAgB,CAACqE,iBAAiB,CAAC,GAAGrC,IAAI;IAC/C,IAAI,CAACuB,aAAa,CAACvB,IAAI,EAAE8B,QAAQ,CAAC;IAClC,IAAI,CAACN,gBAAgB,CAACxB,IAAI,EAAEqC,iBAAiB,CAAC;IAI9C,OAAO,IAAI,CAACzD,yBAAyB,CAACyD,iBAAiB,CAAC;GACzD;EAAAlD,MAAA,CAEDR,4BAA4B,GAA5B,SAAAA,6BACEmD,QAAgB,EAChBlC,SAGC;IAED,IAAI,CAAC,IAAI,CAAC2C,YAAY,EAAE;MACtB,OAAO,IAAI,CAAC3D,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACuD,QAAQ,CAAC,CACtC;;IAGH,OAAO,IAAI,CAACQ,6BAA6B,CAACR,QAAQ,EAAElC,SAAS,CAAC;GAC/D;EAAAT,MAAA,CAEDmD,6BAA6B,GAA7B,SAAAA,8BACER,QAAgB,EAChBlC,SAGC;IAED,IAAI,IAAI,CAACvB,YAAY,CAACqE,KAAK,EAAE,IAAI,IAAI,CAACxE,YAAY,CAACwE,KAAK,EAAE,EAAE;MAC1D,OAAO,IAAI,CAAC9D,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACuD,QAAQ,CAAC,CACtC;;IAGH,IAAMa,QAAQ,GAAG,IAAI,CAACzE,YAAY,CAACyD,IAAI,EAAG,CAAC/E,KAAK;IAChD,IAAMgG,QAAQ,GAAG,IAAI,CAACvE,YAAY,CAACsD,IAAI,EAAG,CAAC/E,KAAK;IAEhD,IAAIiG,cAAc;IAElB,IAAI,CAACjD,SAAS,EAAE;MAEd,IAAIkD,IAAI,CAACC,GAAG,CAACjB,QAAQ,GAAGa,QAAQ,CAAC,GAAGG,IAAI,CAACC,GAAG,CAACjB,QAAQ,GAAGc,QAAQ,CAAC,EAAE;QACjEC,cAAc,GAAGF,QAAQ;QACzB,IAAI,CAACzE,YAAY,CAAC8E,GAAG,EAAE;OACxB,MAAM;QACLH,cAAc,GAAGD,QAAQ;QACzB,IAAI,CAACvE,YAAY,CAAC2E,GAAG,EAAE;;MAEzB,IAAMC,aAAY,GAAG,IAAI,CAACtF,eAAe,CAACuC,GAAG,CAAC2C,cAAc,CAAC;MAC7D,IAAMK,SAAQ,GAAG,IAAI,CAACrF,kBAAkB,CAACqC,GAAG,CAAC+C,aAAY,CAAC;MAE1D,OAAOC,SAAQ;;IAGjB,IAAoBC,QAAQ,GAA0BvD,SAAS,CAAvDC,UAAU;MAAsBuD,SAAS,GAAKxD,SAAS,CAAjCE,QAAQ;IAGtC,IACEK,SAAS,CAACgD,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACxCjD,SAAS,CAACgD,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACxC;MACA,OAAO,IAAI;KACZ,MAAM,IACLjD,SAAS,CAACgD,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACxC,CAACjD,SAAS,CAACgD,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACzC;MACAP,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACvE,YAAY,CAAC2E,GAAG,EAAE;KACxB,MAAM,IACL,CAAC7C,SAAS,CAACgD,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACzCjD,SAAS,CAACgD,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACxC;MACAP,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAACzE,YAAY,CAAC8E,GAAG,EAAE;KACxB,MAAM,IAAIG,QAAQ,GAAGR,QAAQ,GAAGC,QAAQ,GAAGQ,SAAS,EAAE;MAErDP,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAACzE,YAAY,CAAC8E,GAAG,EAAE;KACxB,MAAM;MACLH,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACvE,YAAY,CAAC2E,GAAG,EAAE;;IAGzB,IAAMC,YAAY,GAAG,IAAI,CAACtF,eAAe,CAACuC,GAAG,CAAC2C,cAAc,CAAC;IAC7D,IAAMK,QAAQ,GAAG,IAAI,CAACrF,kBAAkB,CAACqC,GAAG,CAAC+C,YAAY,CAAC;IAE1D,OAAOC,QAAQ;GAChB;EAAA/D,MAAA,CAEDkE,OAAO,GAAP,SAAAA;;IACE,IAAMC,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAClG,UAAU,CAAC;IAC1C,KAAK,IAAI0C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGuD,OAAO,CAAC5D,MAAM,EAAEK,GAAG,EAAE,EAAE;MAC7C,IAAMC,IAAI,GAAG,IAAI,CAAChC,gBAAgB,CAAC+B,GAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,GAAG,CAAC;MACxE,IAAMyD,WAAW,GAAG,IAAI,CAAC9C,YAAY,CAACV,IAAI,CAAC;MAC3CsD,OAAO,CAACvD,GAAG,CAAC,GAAGyD,WAAW;;IAG5B,IAAMC,IAAI,GAAG,IAAIF,KAAK,CAACD,OAAO,CAAC5D,MAAM,CAAC;IACtC,IAAMgE,UAAU,GAAG,EAAE;IACrB,IAAMC,cAAc,GAAG,IAAI/F,GAAG,EAAE;IAChC,IAAMgG,cAAc,GAAG,IAAIhG,GAAG,EAAE;IAChC,IAAMiG,iBAAiB,GAAG,IAAIjG,GAAG,EAAE;IAAC,IAAAkG,KAAA,YAAAA,QACW;MAC7C,IAAMC,YAAY,GAAGT,OAAO,CAACvD,IAAG,CAAC;MACjC,IAAMiE,WAAW,GAAGC,KAAI,CAACzG,cAAc,CAACuG,YAAY,CAAC;MACrD,IAAIC,WAAW,IAAI,IAAI;MAEvBL,cAAc,CAAC/C,GAAG,CAACmD,YAAY,EAAEC,WAAW,CAAC;MAC7CJ,cAAc,CAAChD,GAAG,CAACoD,WAAW,EAAED,YAAY,CAAC;MAE7C,IAAIC,WAAW,KAAKC,KAAI,CAACnG,mBAAmB,CAACiC,IAAG,CAAC,EAAE;QACjD0D,IAAI,CAAC1D,IAAG,CAAC,GAAGiE,WAAW;QAAC;;MAG1B,IAAME,EAAE,GAAGD,KAAI,CAACnG,mBAAmB,CAACqG,SAAS,CAAC,UAAC3E,CAAC;QAAA,OAAKA,CAAC,KAAKwE,WAAW;QAAC;MACvE,IAAIE,EAAE,KAAK,CAAC,CAAC,EAAE;QACbT,IAAI,CAACS,EAAE,CAAC,GAAGF,WAAW;QAAC;;MAIzBN,UAAU,CAACU,IAAI,CAACJ,WAAW,CAAC;KAC7B;IAnBD,KAAK,IAAIjE,IAAG,GAAG,CAAC,EAAEA,IAAG,GAAGuD,OAAO,CAAC5D,MAAM,EAAEK,IAAG,EAAE;MAAA,IAAAsE,IAAA,GAAAP,KAAA;MAAA,IAAAO,IAAA,iBAGlB;;IAkB3B,IAAAC,gBAAA,GAAqC,IAAI,CAAClE,UAAU,EAAE;MAA9CC,WAAW,GAAAiE,gBAAA,CAAXjE,WAAW;MAAEC,WAAW,GAAAgE,gBAAA,CAAXhE,WAAW;IAChC,IAAMiE,kBAAkB,GAAG,EAAE;IAE7B,KAAK,IAAIrB,QAAQ,GAAG,CAAC,EAAEA,QAAQ,GAAGI,OAAO,CAAC5D,MAAM,EAAEwD,QAAQ,EAAE,EAAE;MAC5D,IAAMtG,KAAK,GAAG0G,OAAO,CAACJ,QAAQ,CAAC;MAC/B,IAAIO,IAAI,CAACP,QAAQ,CAAC,IAAI,IAAI,EAAE;QAC1BqB,kBAAkB,CAACrB,QAAQ,CAAC,GAAGO,IAAI,CAACP,QAAQ,CAAC;QAC7CW,iBAAiB,CAACjD,GAAG,CAAC6C,IAAI,CAACP,QAAQ,CAAC,EAAEA,QAAQ,CAAC;QAC/C,IAAMsB,OAAO,GAAG;UAAEtB,QAAQ,EAARA,QAAQ;UAAEtG,KAAK,EAALA;SAAO;QACnCyD,WAAW,CAAC+D,IAAI,CAACI,OAAO,CAAC;QACzBlE,WAAW,CAAC8D,IAAI,CAACI,OAAO,CAAC;QACzB;;MAEF,IAAMxE,KAAI,GAAG0D,UAAU,CAACe,KAAK,EAAE;MAC/B,IAAIzE,KAAI,IAAI,IAAI,EAAE;QAChBuE,kBAAkB,CAACrB,QAAQ,CAAC,GAAGlD,KAAI;QACnC6D,iBAAiB,CAACjD,GAAG,CAACZ,KAAI,EAAEkD,QAAQ,CAAC;QAErC,IAAMsB,QAAO,GAAG;UAAEtB,QAAQ,EAARA,QAAQ;UAAEtG,KAAK,EAALA;SAAO;QACnCyD,WAAW,CAAC+D,IAAI,CAACI,QAAO,CAAC;QACzBlE,WAAW,CAAC8D,IAAI,CAACI,QAAO,CAAC;;;IAI7B,IAAI,CAAC1G,mBAAmB,GAAGyG,kBAAkB;IAC7C,IAAI,CAACrG,YAAY,GAAGmC,WAAW;IAC/B,IAAI,CAAChC,YAAY,GAAGiC,WAAW;IAC/B,IAAI,CAAC3C,eAAe,GAAGgG,cAAc;IACrC,IAAI,CAAC7C,qBAAqB,CAAC8C,cAAc,CAAC;IAC1C,IAAI,CAAC/F,kBAAkB,GAAGgG,iBAAiB;IAC3C,IAAI,CAAC7F,gBAAgB,GAAG,EAAE;IAE1B,IAAI;MACF,IAAMsF,QAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAClG,UAAU,CAAC;MAC1C,KAAK,IAAI0C,KAAG,GAAG,CAAC,EAAEA,KAAG,GAAGuD,QAAO,CAAC5D,MAAM,EAAEK,KAAG,EAAE,EAAE;QAC7C,IAAMC,MAAI,GACR,IAAI,CAAChC,gBAAgB,CAAC+B,KAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,KAAG,CAAC;QAC7D,IAAMyD,YAAW,GAAG,IAAI,CAAC9C,YAAY,CAACV,MAAI,CAAC;QAC3C,IAAIA,MAAI,IAAI,IAAI,EAAE;UAChBsD,QAAO,CAACvD,KAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,MAAI;YACJwD,WAAW,EAAXA,YAAW;YACXkB,WAAW,EAAK,IAAI,CAAChH,KAAK,SAAIqC;WAC/B;;;MAGL,OAAOuD,QAAO;KACf,CAAC,OAAOqB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC9G,mBAAmB;;GAElC;EAAAqB,MAAA,CAGD0F,UAAU,GAAV,SAAAA;IACE,IAAI;MACF,IAAMvB,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAClG,UAAU,CAAC;MAC1C,KAAK,IAAI0C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGuD,OAAO,CAAC5D,MAAM,EAAEK,GAAG,EAAE,EAAE;QAC7C,IAAMC,IAAI,GACR,IAAI,CAAChC,gBAAgB,CAAC+B,GAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,GAAG,CAAC;QAC7D,IAAMyD,WAAW,GAAG,IAAI,CAAC9C,YAAY,CAACV,IAAI,CAAC;QAE3C,IAAIA,IAAI,KAAK,IAAI,CAACQ,YAAY,CAACgD,WAAW,CAAC,EAAE;UAC3C,OAAO,IAAI,CAACH,OAAO,EAAE;;QAEvB,IAAIrD,IAAI,IAAI,IAAI,EAAE;UAChBsD,OAAO,CAACvD,GAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,IAAI;YACJwD,WAAW,EAAXA,WAAW;YACXkB,WAAW,EAAK,IAAI,CAAChH,KAAK,SAAIqC;WAC/B;;;MAIL,IAAI,CAAC/B,gBAAgB,GAAG,EAAE;MAE1B,OAAOsF,OAAO;KACf,CAAC,OAAOqB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC9G,mBAAmB;;GAElC;EAAAqB,MAAA,CAEDmC,YAAY,GAAZ,SAAAA,aAAa4B,QAAgB,EAAEtG,KAAa;IAC1C,IAAM4H,OAAO,GAAG;MAAEtB,QAAQ,EAARA,QAAQ;MAAEtG,KAAK,EAALA;KAAO;IAEnC,IAAI,CAACsB,YAAY,CAACkG,IAAI,CAACI,OAAO,CAAC;IAC/B,IAAI,CAACnG,YAAY,CAAC+F,IAAI,CAACI,OAAO,CAAC;GAChC;EAAArF,MAAA,CAEDqC,gBAAgB,GAAhB,SAAAA,iBAAiBxB,IAAU,EAAEkD,QAAgB;IAC3C,IAAM4B,kBAAkB,GAAG,IAAI,CAAChH,mBAAmB,CAACoF,QAAQ,CAAC;IAC7D,IAAI4B,kBAAkB,EAAE,IAAI,CAACjH,kBAAkB,UAAO,CAACiH,kBAAkB,CAAC;IAC1E,IAAI,CAAChH,mBAAmB,CAACoF,QAAQ,CAAC,GAAGlD,IAAI;IACzC,IAAI,CAACnC,kBAAkB,CAAC+C,GAAG,CAACZ,IAAI,EAAEkD,QAAQ,CAAC;GAC5C;EAAA/D,MAAA,CAQDoC,aAAa,GAAb,SAAAA,cAAcvB,IAAU,EAAES,KAAa;IACrC,IAAMsE,aAAa,GAAG,IAAI,CAACrE,YAAY,CAACV,IAAI,CAAC;IAC7C,IAAI+E,aAAa,KAAK/D,SAAS,EAAE;MAG/B,IAAI,CAACrD,eAAe,UAAO,CAACoH,aAAa,CAAC;;IAE5C,IAAI,CAACpE,YAAY,CAACX,IAAI,EAAES,KAAK,CAAC;IAC9B,IAAI,CAAC9C,eAAe,CAACiD,GAAG,CAACH,KAAK,EAAET,IAAI,CAAC;IACrC,OAAO,KAAK;GACb;EAAAb,MAAA,CAEDyF,oBAAoB,GAApB,SAAAA;IACE,IAAI,CAAC1F,cAAc,GAAGF,IAAI,CAACC,GAAG,EAAE;GACjC;EAAAE,MAAA,CAED+C,OAAO,GAAP,SAAAA;IACE,IAAI,IAAI,CAACnD,OAAO,KAAK,IAAI,CAACG,cAAc,EAAE;IAC1C,IAAI,CAACH,OAAO,GAAG,IAAI,CAACG,cAAc;IAElC,IAAI,CAAClB,gBAAgB,GAAG,EAAE;IAC1B,IAAI,CAACyB,eAAe,GAAG,KAAK;GAC7B;EAAAN,MAAA,CAEDsD,WAAW,GAAX,SAAAA;IAGE,IAAI,CAACuC,UAAU,CAAC,IAAI,CAAC9G,YAAY,CAAC;IAClC,IAAI,CAAC8G,UAAU,CAAC,IAAI,CAAC3G,YAAY,CAAC;IAClC,IAAM4G,WAAW,GAAGnC,IAAI,CAACoC,GAAG,CAC1B,IAAI,CAAChH,YAAY,CAACiH,IAAI,EAAE,EACxB,IAAI,CAAC9G,YAAY,CAAC8G,IAAI,EAAE,CACzB;IACD,IAAMC,WAAW,GAAGtC,IAAI,CAACuC,GAAG,CAC1B,IAAI,CAACnH,YAAY,CAACiH,IAAI,EAAE,EACxB,IAAI,CAAC9G,YAAY,CAAC8G,IAAI,EAAE,CACzB;IACD,IAAIC,WAAW,GAAG,EAAE,GAAGH,WAAW,EAAE;MAGlC,IAAI,CAACK,cAAc,EAAE;;GAExB;EAAAnG,MAAA,CACDmG,cAAc,GAAd,SAAAA;IACE,IAAMC,UAAU,GACd,IAAI,CAACrH,YAAY,CAACiH,IAAI,EAAE,GAAG,IAAI,CAAC9G,YAAY,CAAC8G,IAAI,EAAE,GAC/C,IAAI,CAACjH,YAAY,GACjB,IAAI,CAACG,YAAY;IACvB,IAAMmH,cAAc,GAAG,IAAIrH,IAAI,CAC7B,EAAE,EACF,IAAI,CAACC,kBAAkB,CACxB;IACD,IAAMqH,cAAc,GAAG,IAAItH,IAAI,CAC7B,EAAE,EACF,IAAI,CAACG,kBAAkB,CACxB;IACD,OAAO,CAACiH,UAAU,CAAC7C,KAAK,EAAE,EAAE;MAC1B,IAAM8B,OAAO,GAAGe,UAAU,CAACvC,GAAG,EAAG;MAEjC,IACE,IAAI,CAACnF,kBAAkB,CAACqC,GAAG,CAAC,IAAI,CAACvC,eAAe,CAACuC,GAAG,CAACsE,OAAO,CAAC5H,KAAK,CAAC,CAAC,IACpE,IAAI,EACJ;QACA4I,cAAc,CAACpB,IAAI,CAACI,OAAO,CAAC;QAC5BiB,cAAc,CAACrB,IAAI,CAACI,OAAO,CAAC;;;IAGhC,IAAI,CAACtG,YAAY,GAAGsH,cAAc;IAClC,IAAI,CAACnH,YAAY,GAAGoH,cAAc;GACnC;EAAAtG,MAAA,CAED6F,UAAU,GAAV,SAAAA,WAAWU,IAAoB;IAC7B,OACE,CAACA,IAAI,CAAChD,KAAK,EAAE,IACb,IAAI,CAAC7E,kBAAkB,CAACqC,GAAG,CACzB,IAAI,CAACvC,eAAe,CAACuC,GAAG,CAACwF,IAAI,CAAC/D,IAAI,EAAG,CAAC/E,KAAK,CAAC,CAC7C,IAAI,IAAI,EACT;MACA8I,IAAI,CAAC1C,GAAG,EAAE;;GAEb;EAAA7D,MAAA,CAEDf,kBAAkB,GAAlB,SAAAA,mBAAmBuH,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAAC/I,KAAK,GAAGgJ,GAAG,CAAChJ,KAAK;GAC7B;EAAAuC,MAAA,CAEDb,kBAAkB,GAAlB,SAAAA,mBAAmBqH,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAAC/I,KAAK,GAAGgJ,GAAG,CAAChJ,KAAK;GAC7B;EAAAiJ,YAAA,CAAA/I,gBAAA;IAAAgJ,GAAA;IAAA5F,GAAA,EAzfD,SAAAA;MACE,OAAO,IAAI,CAACjC,WAAW;;;IACxB6H,GAAA;IAAA5F,GAAA,EASD,SAAAA;MACE,OAAO,IAAI,CAACpC,mBAAmB,CAAC4B,MAAM,IAAI,IAAI,CAACzB,WAAW;;;EAC3D,OAAAnB,gBAAA;AAAA;;;;;"}

package/dist/types.d.ts

@@ -0,0 +1,24 @@
+export declare type MetaToIndexMap<T> = Map<T, number>;
+export declare type MetaToPositionMap<T> = Map<T, number>;
+export declare type IndexToMetaMap<T> = Map<number, T>;
+export declare type MetaExtractor<T> = (index: number) => T;
+export declare type IndexExtractor<T> = (meta: T) => number;
+export declare type IntegerBufferSetProps<T> = {
+    name?: string;
+    bufferSize?: number;
+    metaExtractor?: MetaExtractor<T>;
+    indexExtractor?: IndexExtractor<T>;
+};
+export declare type HeapItem = {
+    position: number;
+    value: number;
+};
+export declare type SafeRange = {
+    startIndex: number;
+    endIndex: number;
+};
+export declare type BufferResultToken = {
+    meta: any;
+    targetIndex: number;
+    recyclerKey: string;
+};