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

package/dist/integer-buffer-set.cjs.development.js.map

@@ -1 +1 @@
-{"version":3,"file":"integer-buffer-set.cjs.development.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.cjs.development.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","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,KADjDC,SAAS,QAEP,0EAA0E;IAE5E,IAAMC,WAAW,GAAG,IAAI,CAACpD,mBAAmB,CAAC4B,MAAM;IAEnD,IAAI,CAACyB,YAAY,CAACD,WAAW,EAAET,KAAK,CAAC;IACrC,IAAI,CAACW,aAAa,CAACpB,IAAI,EAAES,KAAK,CAAC;IAC/B,IAAI,CAACY,gBAAgB,CAACrB,IAAI,EAAEkB,WAAW,CAAC;IAExC,OAAOA,WAAW;GACnB;EAAA/B,MAAA,CAEDmC,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACrD,YAAY,CAACsD,IAAI,EAAE,qBAAxBD,qBAAA,CAA0B3E,KAAK;GACvC;EAAAuC,MAAA,CAEDsC,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACrD,YAAY,CAACmD,IAAI,EAAE,qBAAxBE,qBAAA,CAA0B9E,KAAK;GACvC;EAAAuC,MAAA,CAEDT,6BAA6B,GAA7B,SAAAA,8BAA8BiD,QAAgB,EAAE/B,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,EAAE8B,QAAQ,EAAE7B,QAAQ,CAAC,EAAE;QAC9C,OAAO,IAAI;;MAIb,IAAM8B,GAAG,GAAG,IAAI,CAACjC,6BAA6B,CAACC,SAAS,CAAC;MACzD,IAAIgC,GAAG,IAAI,IAAI,EAAE,OAAOA,GAAG;;IAE7B,OAAO,IAAI;GACZ;EAAAzC,MAAA,CAED0C,gBAAgB,GAAhB,SAAAA,iBAAiBF,QAAgB,EAAE/B,SAAoB;IACrD,IAAMgC,GAAG,GAAG,IAAI,CAAClD,6BAA6B,CAACiD,QAAQ,EAAE/B,SAAS,CAAC;IACnE,IAAIgC,GAAG,IAAI,IAAI,EAAE;MACf,IAAM5B,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACmB,QAAQ,CAAC;MACxC,IAAI,CAAC3D,gBAAgB,CAAC4D,GAAG,CAAC,GAAG5B,IAAI;MACjC,IAAI,CAACoB,aAAa,CAACpB,IAAI,EAAE2B,QAAQ,CAAC;MAClC,OAAO,IAAI,CAAC/C,yBAAyB,CAACgD,GAAG,CAAC;;IAE5C,OAAO,IAAI;GACZ;EAAAzC,MAAA,CAWD2C,WAAW,GAAX,SAAAA,YAAYH,QAAgB,EAAE/B,SAAqB;IACjD,IAAI,CAACmC,OAAO,EAAE;IACd,IAAM/B,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACmB,QAAQ,CAAC;IACxC,IAAMK,gBAAgB,GAAG,IAAI,CAACnE,kBAAkB,CAACqC,GAAG,CAACF,IAAI,CAAC;IAE1D,IAAIgC,gBAAgB,KAAKhB,SAAS,EAAE;MAClC,IAAMiB,oBAAoB,GAAG,IAAI,CAACjE,gBAAgB,CAACgE,gBAAgB,CAAC;MAEpE,IAAIC,oBAAoB,EAAE;QAExB,IAAIA,oBAAoB,KAAKjC,IAAI,EAAE;UACjC,OAAOgC,gBAAgB;;QAEzB,IAAIE,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACxDR,QAAQ,EACR/B,SAAS,CACV;QACD,IAAI,IAAI,CAACH,eAAe,EACtB,OAAO,IAAI,CAACoC,gBAAgB,CAACF,QAAQ,EAAE/B,SAAS,CAAC;QAEnD,OAAO,IAAI,CAAC5B,gBAAgB,CAACkE,kBAAiB,CAAC,EAAE;UAC/CA,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDR,QAAQ,EACR/B,SAAS,CACV;;QAGH,IAAIsC,kBAAiB,IAAI,IAAI,EAAE;UAC7B,IAAI,CAACd,aAAa,CAACpB,IAAI,EAAE2B,QAAQ,CAAC;UAClC,IAAI,CAAC3D,gBAAgB,CAACkE,kBAAiB,CAAC,GAAGD,oBAAoB;UAC/D,OAAO,IAAI,CAACrD,yBAAyB,CAACsD,kBAAiB,CAAC;;;MAG5D,IAAI,CAAClE,gBAAgB,CAACgE,gBAAgB,CAAC,GAAGhC,IAAI;MAC9C,OAAO,IAAI,CAACpB,yBAAyB,CAACoD,gBAAgB,CAAC;;IAIzD,IAAI,CAAC,IAAI,CAACI,YAAY,EACpB,OAAO,IAAI,CAACxD,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACoD,QAAQ,CAAC,CACtC;IAEH,IAAI,IAAI,CAAClC,eAAe,EAAE,OAAO,IAAI,CAACoC,gBAAgB,CAACF,QAAQ,EAAE/B,SAAS,CAAC;IAE3E,IAAIsC,iBAAiB;IACrB,IAAMG,aAAa,GAAG,IAAI,CAAC1E,eAAe,CAACuC,GAAG,CAACyB,QAAQ,CAAC;IAMxD,IAAI,CAACU,aAAa,EAAE;MAClB,IAAI,CAACC,WAAW,EAAE;MAClBJ,iBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDR,QAAQ,EACR/B,SAAS,CACV;KACF,MAAM;MACLsC,iBAAiB,GAAG,IAAI,CAACrE,kBAAkB,CAACqC,GAAG,CAACmC,aAAa,CAAC;;IAGhE,IAAI,CAACrE,gBAAgB,CAACkE,iBAAiB,CAAC,GAAGlC,IAAI;IAC/C,IAAI,CAACoB,aAAa,CAACpB,IAAI,EAAE2B,QAAQ,CAAC;IAClC,IAAI,CAACN,gBAAgB,CAACrB,IAAI,EAAEkC,iBAAiB,CAAC;IAI9C,OAAO,IAAI,CAACtD,yBAAyB,CAACsD,iBAAiB,CAAC;GACzD;EAAA/C,MAAA,CAEDR,4BAA4B,GAA5B,SAAAA,6BACEgD,QAAgB,EAChB/B,SAGC;IAED,IAAI,CAAC,IAAI,CAACwC,YAAY,EAAE;MACtB,OAAO,IAAI,CAACxD,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACoD,QAAQ,CAAC,CACtC;;IAGH,OAAO,IAAI,CAACQ,6BAA6B,CAACR,QAAQ,EAAE/B,SAAS,CAAC;GAC/D;EAAAT,MAAA,CAEDgD,6BAA6B,GAA7B,SAAAA,8BACER,QAAgB,EAChB/B,SAGC;IAED,IAAI,IAAI,CAACvB,YAAY,CAACkE,KAAK,EAAE,IAAI,IAAI,CAACrE,YAAY,CAACqE,KAAK,EAAE,EAAE;MAC1D,OAAO,IAAI,CAAC3D,yBAAyB,CACnC,IAAI,CAACL,sBAAsB,CAACoD,QAAQ,CAAC,CACtC;;IAGH,IAAMa,QAAQ,GAAG,IAAI,CAACtE,YAAY,CAACsD,IAAI,EAAG,CAAC5E,KAAK;IAChD,IAAM6F,QAAQ,GAAG,IAAI,CAACpE,YAAY,CAACmD,IAAI,EAAG,CAAC5E,KAAK;IAEhD,IAAI8F,cAAc;IAElB,IAAI,CAAC9C,SAAS,EAAE;MAEd,IAAI+C,IAAI,CAACC,GAAG,CAACjB,QAAQ,GAAGa,QAAQ,CAAC,GAAGG,IAAI,CAACC,GAAG,CAACjB,QAAQ,GAAGc,QAAQ,CAAC,EAAE;QACjEC,cAAc,GAAGF,QAAQ;QACzB,IAAI,CAACtE,YAAY,CAAC2E,GAAG,EAAE;OACxB,MAAM;QACLH,cAAc,GAAGD,QAAQ;QACzB,IAAI,CAACpE,YAAY,CAACwE,GAAG,EAAE;;MAEzB,IAAMC,aAAY,GAAG,IAAI,CAACnF,eAAe,CAACuC,GAAG,CAACwC,cAAc,CAAC;MAC7D,IAAMK,SAAQ,GAAG,IAAI,CAAClF,kBAAkB,CAACqC,GAAG,CAAC4C,aAAY,CAAC;MAE1D,OAAOC,SAAQ;;IAGjB,IAAoBC,QAAQ,GAA0BpD,SAAS,CAAvDC,UAAU;MAAsBoD,SAAS,GAAKrD,SAAS,CAAjCE,QAAQ;IAGtC,IACEK,SAAS,CAAC6C,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACxC9C,SAAS,CAAC6C,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACxC;MACA,OAAO,IAAI;KACZ,MAAM,IACL9C,SAAS,CAAC6C,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACxC,CAAC9C,SAAS,CAAC6C,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACzC;MACAP,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACpE,YAAY,CAACwE,GAAG,EAAE;KACxB,MAAM,IACL,CAAC1C,SAAS,CAAC6C,QAAQ,EAAER,QAAQ,EAAES,SAAS,CAAC,IACzC9C,SAAS,CAAC6C,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,EACxC;MACAP,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAACtE,YAAY,CAAC2E,GAAG,EAAE;KACxB,MAAM,IAAIG,QAAQ,GAAGR,QAAQ,GAAGC,QAAQ,GAAGQ,SAAS,EAAE;MAErDP,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAACtE,YAAY,CAAC2E,GAAG,EAAE;KACxB,MAAM;MACLH,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACpE,YAAY,CAACwE,GAAG,EAAE;;IAGzB,IAAMC,YAAY,GAAG,IAAI,CAACnF,eAAe,CAACuC,GAAG,CAACwC,cAAc,CAAC;IAC7D,IAAMK,QAAQ,GAAG,IAAI,CAAClF,kBAAkB,CAACqC,GAAG,CAAC4C,YAAY,CAAC;IAE1D,OAAOC,QAAQ;GAChB;EAAA5D,MAAA,CAED+D,OAAO,GAAP,SAAAA;;IACE,IAAMC,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAC/F,UAAU,CAAC;IAC1C,KAAK,IAAI0C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGoD,OAAO,CAACzD,MAAM,EAAEK,GAAG,EAAE,EAAE;MAC7C,IAAMC,IAAI,GAAG,IAAI,CAAChC,gBAAgB,CAAC+B,GAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,GAAG,CAAC;MACxE,IAAMsD,WAAW,GAAG,IAAI,CAAC3C,YAAY,CAACV,IAAI,CAAC;MAC3CmD,OAAO,CAACpD,GAAG,CAAC,GAAGsD,WAAW;;IAG5B,IAAMC,IAAI,GAAG,IAAIF,KAAK,CAACD,OAAO,CAACzD,MAAM,CAAC;IACtC,IAAM6D,UAAU,GAAG,EAAE;IACrB,IAAMC,cAAc,GAAG,IAAI5F,GAAG,EAAE;IAChC,IAAM6F,cAAc,GAAG,IAAI7F,GAAG,EAAE;IAChC,IAAM8F,iBAAiB,GAAG,IAAI9F,GAAG,EAAE;IAAC,IAAA+F,KAAA,YAAAA,QACW;MAC7C,IAAMC,YAAY,GAAGT,OAAO,CAACpD,IAAG,CAAC;MACjC,IAAM8D,WAAW,GAAGC,KAAI,CAACtG,cAAc,CAACoG,YAAY,CAAC;MACrD,IAAIC,WAAW,IAAI,IAAI;MAEvBL,cAAc,CAAC5C,GAAG,CAACgD,YAAY,EAAEC,WAAW,CAAC;MAC7CJ,cAAc,CAAC7C,GAAG,CAACiD,WAAW,EAAED,YAAY,CAAC;MAE7C,IAAIC,WAAW,KAAKC,KAAI,CAAChG,mBAAmB,CAACiC,IAAG,CAAC,EAAE;QACjDuD,IAAI,CAACvD,IAAG,CAAC,GAAG8D,WAAW;QAAC;;MAG1B,IAAME,EAAE,GAAGD,KAAI,CAAChG,mBAAmB,CAACkG,SAAS,CAAC,UAACxE,CAAC;QAAA,OAAKA,CAAC,KAAKqE,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,IAAI9D,IAAG,GAAG,CAAC,EAAEA,IAAG,GAAGoD,OAAO,CAACzD,MAAM,EAAEK,IAAG,EAAE;MAAA,IAAAmE,IAAA,GAAAP,KAAA;MAAA,IAAAO,IAAA,iBAGlB;;IAkB3B,IAAAC,gBAAA,GAAqC,IAAI,CAAC/D,UAAU,EAAE;MAA9CC,WAAW,GAAA8D,gBAAA,CAAX9D,WAAW;MAAEC,WAAW,GAAA6D,gBAAA,CAAX7D,WAAW;IAChC,IAAM8D,kBAAkB,GAAG,EAAE;IAE7B,KAAK,IAAIrB,QAAQ,GAAG,CAAC,EAAEA,QAAQ,GAAGI,OAAO,CAACzD,MAAM,EAAEqD,QAAQ,EAAE,EAAE;MAC5D,IAAMnG,KAAK,GAAGuG,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,CAAC9C,GAAG,CAAC0C,IAAI,CAACP,QAAQ,CAAC,EAAEA,QAAQ,CAAC;QAC/C,IAAMsB,OAAO,GAAG;UAAEtB,QAAQ,EAARA,QAAQ;UAAEnG,KAAK,EAALA;SAAO;QACnCyD,WAAW,CAAC4D,IAAI,CAACI,OAAO,CAAC;QACzB/D,WAAW,CAAC2D,IAAI,CAACI,OAAO,CAAC;QACzB;;MAEF,IAAMrE,KAAI,GAAGuD,UAAU,CAACe,KAAK,EAAE;MAC/B,IAAItE,KAAI,IAAI,IAAI,EAAE;QAChBoE,kBAAkB,CAACrB,QAAQ,CAAC,GAAG/C,KAAI;QACnC0D,iBAAiB,CAAC9C,GAAG,CAACZ,KAAI,EAAE+C,QAAQ,CAAC;QAErC,IAAMsB,QAAO,GAAG;UAAEtB,QAAQ,EAARA,QAAQ;UAAEnG,KAAK,EAALA;SAAO;QACnCyD,WAAW,CAAC4D,IAAI,CAACI,QAAO,CAAC;QACzB/D,WAAW,CAAC2D,IAAI,CAACI,QAAO,CAAC;;;IAI7B,IAAI,CAACvG,mBAAmB,GAAGsG,kBAAkB;IAC7C,IAAI,CAAClG,YAAY,GAAGmC,WAAW;IAC/B,IAAI,CAAChC,YAAY,GAAGiC,WAAW;IAC/B,IAAI,CAAC3C,eAAe,GAAG6F,cAAc;IACrC,IAAI,CAAC1C,qBAAqB,CAAC2C,cAAc,CAAC;IAC1C,IAAI,CAAC5F,kBAAkB,GAAG6F,iBAAiB;IAC3C,IAAI,CAAC1F,gBAAgB,GAAG,EAAE;IAE1B,IAAI;MACF,IAAMmF,QAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAC/F,UAAU,CAAC;MAC1C,KAAK,IAAI0C,KAAG,GAAG,CAAC,EAAEA,KAAG,GAAGoD,QAAO,CAACzD,MAAM,EAAEK,KAAG,EAAE,EAAE;QAC7C,IAAMC,MAAI,GACR,IAAI,CAAChC,gBAAgB,CAAC+B,KAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,KAAG,CAAC;QAC7D,IAAMsD,YAAW,GAAG,IAAI,CAAC3C,YAAY,CAACV,MAAI,CAAC;QAC3C,IAAIA,MAAI,IAAI,IAAI,EAAE;UAChBmD,QAAO,CAACpD,KAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,MAAI;YACJqD,WAAW,EAAXA,YAAW;YACXkB,WAAW,EAAK,IAAI,CAAC7G,KAAK,SAAIqC;WAC/B;;;MAGL,OAAOoD,QAAO;KACf,CAAC,OAAOqB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC3G,mBAAmB;;GAElC;EAAAqB,MAAA,CAGDuF,UAAU,GAAV,SAAAA;IACE,IAAI;MACF,IAAMvB,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAAC/F,UAAU,CAAC;MAC1C,KAAK,IAAI0C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGoD,OAAO,CAACzD,MAAM,EAAEK,GAAG,EAAE,EAAE;QAC7C,IAAMC,IAAI,GACR,IAAI,CAAChC,gBAAgB,CAAC+B,GAAG,CAAC,IAAI,IAAI,CAACjC,mBAAmB,CAACiC,GAAG,CAAC;QAC7D,IAAMsD,WAAW,GAAG,IAAI,CAAC3C,YAAY,CAACV,IAAI,CAAC;QAE3C,IAAIA,IAAI,KAAK,IAAI,CAACQ,YAAY,CAAC6C,WAAW,CAAC,EAAE;UAC3C,OAAO,IAAI,CAACH,OAAO,EAAE;;QAEvB,IAAIlD,IAAI,IAAI,IAAI,EAAE;UAChBmD,OAAO,CAACpD,GAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,IAAI;YACJqD,WAAW,EAAXA,WAAW;YACXkB,WAAW,EAAK,IAAI,CAAC7G,KAAK,SAAIqC;WAC/B;;;MAIL,IAAI,CAAC/B,gBAAgB,GAAG,EAAE;MAE1B,OAAOmF,OAAO;KACf,CAAC,OAAOqB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC3G,mBAAmB;;GAElC;EAAAqB,MAAA,CAEDgC,YAAY,GAAZ,SAAAA,aAAa4B,QAAgB,EAAEnG,KAAa;IAC1C,IAAMyH,OAAO,GAAG;MAAEtB,QAAQ,EAARA,QAAQ;MAAEnG,KAAK,EAALA;KAAO;IAEnC,IAAI,CAACsB,YAAY,CAAC+F,IAAI,CAACI,OAAO,CAAC;IAC/B,IAAI,CAAChG,YAAY,CAAC4F,IAAI,CAACI,OAAO,CAAC;GAChC;EAAAlF,MAAA,CAEDkC,gBAAgB,GAAhB,SAAAA,iBAAiBrB,IAAU,EAAE+C,QAAgB;IAC3C,IAAM4B,kBAAkB,GAAG,IAAI,CAAC7G,mBAAmB,CAACiF,QAAQ,CAAC;IAC7D,IAAI4B,kBAAkB,EAAE,IAAI,CAAC9G,kBAAkB,UAAO,CAAC8G,kBAAkB,CAAC;IAC1E,IAAI,CAAC7G,mBAAmB,CAACiF,QAAQ,CAAC,GAAG/C,IAAI;IACzC,IAAI,CAACnC,kBAAkB,CAAC+C,GAAG,CAACZ,IAAI,EAAE+C,QAAQ,CAAC;GAC5C;EAAA5D,MAAA,CAQDiC,aAAa,GAAb,SAAAA,cAAcpB,IAAU,EAAES,KAAa;IACrC,IAAMmE,aAAa,GAAG,IAAI,CAAClE,YAAY,CAACV,IAAI,CAAC;IAC7C,IAAI4E,aAAa,KAAK5D,SAAS,EAAE;MAG/B,IAAI,CAACrD,eAAe,UAAO,CAACiH,aAAa,CAAC;;IAE5C,IAAI,CAACjE,YAAY,CAACX,IAAI,EAAES,KAAK,CAAC;IAC9B,IAAI,CAAC9C,eAAe,CAACiD,GAAG,CAACH,KAAK,EAAET,IAAI,CAAC;IACrC,OAAO,KAAK;GACb;EAAAb,MAAA,CAEDsF,oBAAoB,GAApB,SAAAA;IACE,IAAI,CAACvF,cAAc,GAAGF,IAAI,CAACC,GAAG,EAAE;GACjC;EAAAE,MAAA,CAED4C,OAAO,GAAP,SAAAA;IACE,IAAI,IAAI,CAAChD,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,CAEDmD,WAAW,GAAX,SAAAA;IAGE,IAAI,CAACuC,UAAU,CAAC,IAAI,CAAC3G,YAAY,CAAC;IAClC,IAAI,CAAC2G,UAAU,CAAC,IAAI,CAACxG,YAAY,CAAC;IAClC,IAAMyG,WAAW,GAAGnC,IAAI,CAACoC,GAAG,CAC1B,IAAI,CAAC7G,YAAY,CAAC8G,IAAI,EAAE,EACxB,IAAI,CAAC3G,YAAY,CAAC2G,IAAI,EAAE,CACzB;IACD,IAAMC,WAAW,GAAGtC,IAAI,CAACuC,GAAG,CAC1B,IAAI,CAAChH,YAAY,CAAC8G,IAAI,EAAE,EACxB,IAAI,CAAC3G,YAAY,CAAC2G,IAAI,EAAE,CACzB;IACD,IAAIC,WAAW,GAAG,EAAE,GAAGH,WAAW,EAAE;MAGlC,IAAI,CAACK,cAAc,EAAE;;GAExB;EAAAhG,MAAA,CACDgG,cAAc,GAAd,SAAAA;IACE,IAAMC,UAAU,GACd,IAAI,CAAClH,YAAY,CAAC8G,IAAI,EAAE,GAAG,IAAI,CAAC3G,YAAY,CAAC2G,IAAI,EAAE,GAC/C,IAAI,CAAC9G,YAAY,GACjB,IAAI,CAACG,YAAY;IACvB,IAAMgH,cAAc,GAAG,IAAIlH,IAAI,CAC7B,EAAE,EACF,IAAI,CAACC,kBAAkB,CACxB;IACD,IAAMkH,cAAc,GAAG,IAAInH,IAAI,CAC7B,EAAE,EACF,IAAI,CAACG,kBAAkB,CACxB;IACD,OAAO,CAAC8G,UAAU,CAAC7C,KAAK,EAAE,EAAE;MAC1B,IAAM8B,OAAO,GAAGe,UAAU,CAACvC,GAAG,EAAG;MAEjC,IACE,IAAI,CAAChF,kBAAkB,CAACqC,GAAG,CAAC,IAAI,CAACvC,eAAe,CAACuC,GAAG,CAACmE,OAAO,CAACzH,KAAK,CAAC,CAAC,IACpE,IAAI,EACJ;QACAyI,cAAc,CAACpB,IAAI,CAACI,OAAO,CAAC;QAC5BiB,cAAc,CAACrB,IAAI,CAACI,OAAO,CAAC;;;IAGhC,IAAI,CAACnG,YAAY,GAAGmH,cAAc;IAClC,IAAI,CAAChH,YAAY,GAAGiH,cAAc;GACnC;EAAAnG,MAAA,CAED0F,UAAU,GAAV,SAAAA,WAAWU,IAAoB;IAC7B,OACE,CAACA,IAAI,CAAChD,KAAK,EAAE,IACb,IAAI,CAAC1E,kBAAkB,CAACqC,GAAG,CACzB,IAAI,CAACvC,eAAe,CAACuC,GAAG,CAACqF,IAAI,CAAC/D,IAAI,EAAG,CAAC5E,KAAK,CAAC,CAC7C,IAAI,IAAI,EACT;MACA2I,IAAI,CAAC1C,GAAG,EAAE;;GAEb;EAAA1D,MAAA,CAEDf,kBAAkB,GAAlB,SAAAA,mBAAmBoH,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAAC5I,KAAK,GAAG6I,GAAG,CAAC7I,KAAK;GAC7B;EAAAuC,MAAA,CAEDb,kBAAkB,GAAlB,SAAAA,mBAAmBkH,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAAC5I,KAAK,GAAG6I,GAAG,CAAC7I,KAAK;GAC7B;EAAA8I,YAAA,CAAA5I,gBAAA;IAAA6I,GAAA;IAAAzF,GAAA,EAzfD,SAAAA;MACE,OAAO,IAAI,CAACjC,WAAW;;;IACxB0H,GAAA;IAAAzF,GAAA,EASD,SAAAA;MACE,OAAO,IAAI,CAACpC,mBAAmB,CAAC4B,MAAM,IAAI,IAAI,CAACzB,WAAW;;;EAC3D,OAAAnB,gBAAA;AAAA;;;;;"}

package/dist/integer-buffer-set.cjs.production.min.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var e,t=(e=require("@x-oasis/heap"))&&"object"==typeof e&&"default"in e?e.default:e,i=function(e){var t=e.safeRange,i=e.bufferSetRange;return t.lowValue-i.minValue>i.maxValue-t.highValue};exports.default=function(){function e(){this._valueToPositionMap={},this._size=0,this._smallValues=new t([],this._smallerComparator),this._largeValues=new t([],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=[]}var a,s,o=e.prototype;return o.getSize=function(){return this._size},o.getValuePosition=function(e){return void 0===this._valueToPositionMap[e]?null:this._valueToPositionMap[e]},o.getNewPositionForValue=function(e){void 0!==this._valueToPositionMap[e]&&console.warn("Shouldn't try to find new position for value already stored in BufferSet");var t=this._size;return this._size++,this._pushToHeaps(t,e),this._valueToPositionMap[e]=t,t},o.getMinValue=function(){var e;return null==(e=this._smallValues.peek())?void 0:e.value},o.getMaxValue=function(){var e;return null==(e=this._largeValues.peek())?void 0:e.value},o.setPositionValue=function(e,t){var i=this._valueToPositionMap[t];void 0!==i&&(-1===this._vacantPositions.findIndex((function(e){return e===i}))&&this._vacantPositions.push(i),delete this._valueToPositionMap[t],this._valueToPositionMap[t]=e)},o.replaceFurthestValuePosition=function(e,t,a,s){if(void 0===s&&(s=i),void 0!==this._valueToPositionMap[a]&&console.warn("Shouldn't try to replace values with value already stored value in BufferSet"),this._cleanHeaps(),this._smallValues.empty()||this._largeValues.empty())return null;if(this._vacantPositions.length){var o=this._vacantPositions.pop();return this._valueToPositionMap[a]=o,this._pushToHeaps(o,a),o}var l,n=this._smallValues.peek().value,r=this._largeValues.peek().value;if(n>=e&&r<=t)return null;s({safeRange:{lowValue:e,highValue:t},bufferSetRange:{minValue:n,maxValue:r},currentIndex:a})?(l=n,this._smallValues.pop()):(l=r,this._largeValues.pop());var u=this._valueToPositionMap[l];delete this._valueToPositionMap[l],this._valueToPositionMap[a]=u,this._pushToHeaps(u,a);var h=this._vacantPositions.findIndex((function(e){return e===u}));return-1!==h&&this._vacantPositions.splice(h,1),u},o._pushToHeaps=function(e,t){var i={position:e,value:t};this._smallValues.push(i),this._largeValues.push(i)},o._cleanHeaps=function(){this._cleanHeap(this._smallValues),this._cleanHeap(this._largeValues);var e=Math.min(this._smallValues.size(),this._largeValues.size());Math.max(this._smallValues.size(),this._largeValues.size())>10*e&&this._recreateHeaps()},o._recreateHeaps=function(){for(var e=this._smallValues.size()<this._largeValues.size()?this._smallValues:this._largeValues,i=new t([],this._smallerComparator),a=new t([],this._greaterComparator);!e.empty();){var s=e.pop();void 0!==this._valueToPositionMap[s.value]&&(i.push(s),a.push(s))}this._smallValues=i,this._largeValues=a},o._cleanHeap=function(e){for(;!e.empty()&&void 0===this._valueToPositionMap[e.peek().value];)e.pop()},o._smallerComparator=function(e,t){return e.value<t.value},o._greaterComparator=function(e,t){return e.value>t.value},a=e,(s=[{key:"indices",get:function(){var e=[];for(var t in this._valueToPositionMap)e[this._valueToPositionMap[t]]=t;return e}}])&&function(e,t){for(var i=0;i<t.length;i++){var a=t[i];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(e,"symbol"==typeof(s=function(e,t){if("object"!=typeof e||null===e)return e;var i=e[Symbol.toPrimitive];if(void 0!==i){var a=i.call(e,"string");if("object"!=typeof a)return a;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(a.key))?s:String(s),a)}var s}(a.prototype,s),Object.defineProperty(a,"prototype",{writable:!1}),e}();
+"use strict";function e(e){return e&&"object"==typeof e&&"default"in e?e.default:e}Object.defineProperty(exports,"__esModule",{value:!0});var t=e(require("@x-oasis/heap")),i=e(require("@x-oasis/is-clamped")),s=e(require("@x-oasis/invariant")),n=e(require("@x-oasis/return-hook")),a=function(e){return e};exports.default=function(){function e(e){void 0===e&&(e={});var i=e.name,s=void 0===i?"default_buffer":i,r=e.indexExtractor,o=e.bufferSize,l=void 0===o?10:o,h=e.metaExtractor;this._metaExtractor=void 0===h?a:h,this._indexExtractor=r,this._name=s,this._indexToMetaMap=new Map,this._metaToPositionMap=new Map,this._positionToMetaList=[],this._metaToIndexMap=new Map,this._onTheFlyIndices=[],this._bufferSize=l,this._smallValues=new t([],this._smallerComparator),this._largeValues=new t([],this._greaterComparator),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=n(this.setIsOnTheFlyFull.bind(this)),this._loopMS=Date.now(),this._lastUpdatedMS=this._loopMS}var r,o,l=e.prototype;return l.setIsOnTheFlyFull=function(e){if(null!=e){var t=this._onTheFlyIndices.filter((function(e){return e}));this._isOnTheFlyFull=t.length===this._bufferSize}},l.getOnTheFlyUncriticalPosition=function(e){for(var t=e.startIndex,s=e.endIndex,n=0;n<this._onTheFlyIndices.length;n++){var a=this._metaToIndexMap.get(this._onTheFlyIndices[n]);if(!i(t,a,s))return n}return null},l.initialize=function(){return{smallValues:new t([],this._smallerComparator),largeValues:new t([],this._greaterComparator),valueToPositionObject:{}}},l.getIndexMeta=function(e){return this._metaExtractor(e)},l.getMetaIndex=function(e){return this._indexExtractor?this._indexExtractor(e):this._metaToIndexMap.get(e)},l.setMetaIndex=function(e,t){return!this._indexExtractor&&this._metaToIndexMap.set(e,t)},l.deleteMetaIndex=function(e){return this._metaToIndexMap.delete(e)},l.replaceMetaToIndexMap=function(e){return!this._indexExtractor&&(this._metaToIndexMap=e)},l.getIndexPosition=function(e){return this.getMetaIndex(this.getIndexMeta(e))},l.getNewPositionForIndex=function(e){var t=this.getIndexMeta(e);void 0!==this._metaToPositionMap.get(t)&&s(!1);var i=this._positionToMetaList.length;return this._pushToHeaps(i,e),this._setMetaIndex(t,e),this._setMetaPosition(t,i),i},l.getMinValue=function(){var e;return null==(e=this._smallValues.peek())?void 0:e.value},l.getMaxValue=function(){var e;return null==(e=this._largeValues.peek())?void 0:e.value},l.replacePositionInFliedIndices=function(e,t){if(this._isOnTheFlyFull){if(!i(t.startIndex,e,t.endIndex))return null;var s=this.getOnTheFlyUncriticalPosition(t);if(null!=s)return s}return null},l.getFliedPosition=function(e,t){var i=this.replacePositionInFliedIndices(e,t);if(null!=i){var s=this.getIndexMeta(e);return this._onTheFlyIndices[i]=s,this._setMetaIndex(s,e),this._isOnTheFlyFullReturnHook(i)}return null},l.getPosition=function(e,t){this.prepare();var i,s=this.getIndexMeta(e),n=this._metaToPositionMap.get(s);if(void 0!==n){var a=this._onTheFlyIndices[n];if(a){if(a===s)return n;var r=this._replaceFurthestIndexPosition(e,t);if(this._isOnTheFlyFull)return this.getFliedPosition(e,t);for(;this._onTheFlyIndices[r];)r=this._replaceFurthestIndexPosition(e,t);if(null!=r)return this._setMetaIndex(s,e),this._onTheFlyIndices[r]=a,this._isOnTheFlyFullReturnHook(r)}return this._onTheFlyIndices[n]=s,this._isOnTheFlyFullReturnHook(n)}if(!this.isBufferFull)return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(e));if(this._isOnTheFlyFull)return this.getFliedPosition(e,t);var o=this._indexToMetaMap.get(e);return o?i=this._metaToPositionMap.get(o):(this._cleanHeaps(),i=this._replaceFurthestIndexPosition(e,t)),this._onTheFlyIndices[i]=s,this._setMetaIndex(s,e),this._setMetaPosition(s,i),this._isOnTheFlyFullReturnHook(i)},l.replaceFurthestIndexPosition=function(e,t){return this.isBufferFull?this._replaceFurthestIndexPosition(e,t):this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(e))},l._replaceFurthestIndexPosition=function(e,t){if(this._largeValues.empty()||this._smallValues.empty())return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(e));var s,n=this._smallValues.peek().value,a=this._largeValues.peek().value;if(!t){Math.abs(e-n)>Math.abs(e-a)?(s=n,this._smallValues.pop()):(s=a,this._largeValues.pop());var r=this._indexToMetaMap.get(s);return this._metaToPositionMap.get(r)}var o=t.startIndex,l=t.endIndex;if(i(o,n,l)&&i(o,a,l))return null;i(o,n,l)&&!i(o,a,l)?(s=a,this._largeValues.pop()):!i(o,n,l)&&i(o,a,l)||o-n>a-l?(s=n,this._smallValues.pop()):(s=a,this._largeValues.pop());var h=this._indexToMetaMap.get(s);return this._metaToPositionMap.get(h)},l.shuffle=function(){for(var e=this,t=new Array(this.bufferSize),i=0;i<t.length;i++){var s=this.getMetaIndex(this._onTheFlyIndices[i]||this._positionToMetaList[i]);t[i]=s}for(var n=new Array(t.length),a=[],r=new Map,o=new Map,l=new Map,h=function(){var i=t[u],s=e._metaExtractor(i);if(null==s)return"continue";if(r.set(i,s),o.set(s,i),s===e._positionToMetaList[u])return n[u]=s,"continue";var l=e._positionToMetaList.findIndex((function(e){return e===s}));if(-1!==l)return n[l]=s,"continue";a.push(s)},u=0;u<t.length;u++)h();for(var _=this.initialize(),p=_.smallValues,d=_.largeValues,f=[],c=0;c<t.length;c++){var M=t[c];if(null==n[c]){var x=a.shift();if(null!=x){f[c]=x,l.set(x,c);var g={position:c,value:M};p.push(g),d.push(g)}}else{f[c]=n[c],l.set(n[c],c);var I={position:c,value:M};p.push(I),d.push(I)}}this._positionToMetaList=f,this._smallValues=p,this._largeValues=d,this._indexToMetaMap=r,this.replaceMetaToIndexMap(o),this._metaToPositionMap=l,this._onTheFlyIndices=[];try{for(var T=new Array(this.bufferSize),v=0;v<T.length;v++){var F=this._onTheFlyIndices[v]||this._positionToMetaList[v],m=this.getMetaIndex(F);null!=F&&(T[v]={meta:F,targetIndex:m,recyclerKey:this._name+"_"+v})}return T}catch(e){return this.readyToStartNextLoop(),this._positionToMetaList}},l.getIndices=function(){try{for(var e=new Array(this.bufferSize),t=0;t<e.length;t++){var i=this._onTheFlyIndices[t]||this._positionToMetaList[t],s=this.getMetaIndex(i);if(i!==this.getIndexMeta(s))return this.shuffle();null!=i&&(e[t]={meta:i,targetIndex:s,recyclerKey:this._name+"_"+t})}return this._onTheFlyIndices=[],e}catch(e){return this.readyToStartNextLoop(),this._positionToMetaList}},l._pushToHeaps=function(e,t){var i={position:e,value:t};this._smallValues.push(i),this._largeValues.push(i)},l._setMetaPosition=function(e,t){var i=this._positionToMetaList[t];i&&this._metaToPositionMap.delete(i),this._positionToMetaList[t]=e,this._metaToPositionMap.set(e,t)},l._setMetaIndex=function(e,t){var i=this.getMetaIndex(e);return void 0!==i&&this._indexToMetaMap.delete(i),this.setMetaIndex(e,t),this._indexToMetaMap.set(t,e),!1},l.readyToStartNextLoop=function(){this._lastUpdatedMS=Date.now()},l.prepare=function(){this._loopMS!==this._lastUpdatedMS&&(this._loopMS=this._lastUpdatedMS,this._onTheFlyIndices=[],this._isOnTheFlyFull=!1)},l._cleanHeaps=function(){this._cleanHeap(this._smallValues),this._cleanHeap(this._largeValues);var e=Math.min(this._smallValues.size(),this._largeValues.size());Math.max(this._smallValues.size(),this._largeValues.size())>10*e&&this._recreateHeaps()},l._recreateHeaps=function(){for(var e=this._smallValues.size()<this._largeValues.size()?this._smallValues:this._largeValues,i=new t([],this._smallerComparator),s=new t([],this._greaterComparator);!e.empty();){var n=e.pop();null!=this._metaToPositionMap.get(this._indexToMetaMap.get(n.value))&&(i.push(n),s.push(n))}this._smallValues=i,this._largeValues=s},l._cleanHeap=function(e){for(;!e.empty()&&null==this._metaToPositionMap.get(this._indexToMetaMap.get(e.peek().value));)e.pop()},l._smallerComparator=function(e,t){return e.value<t.value},l._greaterComparator=function(e,t){return e.value>t.value},r=e,(o=[{key:"bufferSize",get:function(){return this._bufferSize}},{key:"isBufferFull",get:function(){return this._positionToMetaList.length>=this._bufferSize}}])&&function(e,t){for(var i=0;i<t.length;i++){var s=t[i];s.enumerable=s.enumerable||!1,s.configurable=!0,"value"in s&&(s.writable=!0),Object.defineProperty(e,"symbol"==typeof(n=function(e,t){if("object"!=typeof e||null===e)return e;var i=e[Symbol.toPrimitive];if(void 0!==i){var s=i.call(e,"string");if("object"!=typeof s)return s;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(s.key))?n:String(n),s)}var n}(r.prototype,o),Object.defineProperty(r,"prototype",{writable:!1}),e}(),exports.defaultBufferSize=10;
 //# sourceMappingURL=integer-buffer-set.cjs.production.min.js.map

package/dist/integer-buffer-set.cjs.production.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"integer-buffer-set.cjs.production.min.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","minValue","maxValue","highValue","IntegerBufferSet","this","_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","findIndex","v","push","newValue","useMinValueFn","_cleanHeaps","empty","length","pop","valueToReplace","currentIndex","_i","splice","element","_cleanHeap","minHeapSize","Math","min","size","max","_recreateHeaps","sourceHeap","newSmallValues","newLargeValues","heap","lhs","rhs","key","get","indices"],"mappings":"wJAQMA,EAAuB,SAACC,GAW5B,IAAQC,EAA8BD,EAA9BC,UAAWC,EAAmBF,EAAnBE,eAGnB,OAFgCD,EAAxBE,SACuBD,EAAbE,SAAaF,EAAvBG,SADwBJ,EAAdK,sCAyBlB,SAAAC,IACEC,KAAKC,oBAAsB,GAC3BD,KAAKE,MAAQ,EACbF,KAAKG,aAAe,IAAIC,EAAK,GAAIJ,KAAKK,oBACtCL,KAAKM,aAAe,IAAIF,EAAK,GAAIJ,KAAKO,oBAEtCP,KAAKQ,uBAAyBR,KAAKQ,uBAAuBC,KAAKT,MAC/DA,KAAKU,iBAAmBV,KAAKU,iBAAiBD,KAAKT,MACnDA,KAAKW,QAAUX,KAAKW,QAAQF,KAAKT,MACjCA,KAAKY,6BACHZ,KAAKY,6BAA6BH,KAAKT,MAEzCA,KAAKa,iBAAmB,GACzB,QAAAC,EAAAf,EAAAgB,UAaA,OAbAD,EAEDH,QAAA,WACE,OAAOX,KAAKE,OACbY,EAWDJ,iBAAA,SAAiBM,GACf,YAAwCC,IAApCjB,KAAKC,oBAAoBe,GACpB,KAEFhB,KAAKC,oBAAoBe,IACjCF,EAEDN,uBAAA,SAAuBQ,QACmBC,IAApCjB,KAAKC,oBAAoBe,IAC3BE,QAAQC,KACN,4EAOJ,IAAMC,EAAcpB,KAAKE,MAIzB,OAHAF,KAAKE,QACLF,KAAKqB,aAAaD,EAAaJ,GAC/BhB,KAAKC,oBAAoBe,GAASI,EAC3BA,GACRN,EAEDQ,YAAA,iBACE,cAAAC,EAAOvB,KAAKG,aAAaqB,eAAlBD,EAA0BP,OAClCF,EAEDW,YAAA,iBACE,cAAAC,EAAO1B,KAAKM,aAAakB,eAAlBE,EAA0BV,OAClCF,EAEDa,iBAAA,SAAiBC,EAAkBZ,GACjC,IAAMa,EAAmB7B,KAAKC,oBAAoBe,QACzBC,IAArBY,KAIa,IAHD7B,KAAKa,iBAAiBiB,WAClC,SAACC,GAAC,OAAKA,IAAMF,MAEG7B,KAAKa,iBAAiBmB,KAAKH,UACtC7B,KAAKC,oBAAoBe,GAChChB,KAAKC,oBAAoBe,GAASY,IAErCd,EAEDF,6BAAA,SACEjB,EACAG,EACAmC,EACAC,GAyBA,YAzBAA,IAAAA,EAUgB3C,QAE2B0B,IAAvCjB,KAAKC,oBAAoBgC,IAC3Bf,QAAQC,KACN,gFAUJnB,KAAKmC,cACDnC,KAAKG,aAAaiC,SAAWpC,KAAKM,aAAa8B,QAGjD,OAAO,KAGT,GAAIpC,KAAKa,iBAAiBwB,OAAQ,CAChC,IAAMT,EAAW5B,KAAKa,iBAAiByB,MAGvC,OAFAtC,KAAKC,oBAAoBgC,GAAYL,EACrC5B,KAAKqB,aAAaO,EAAUK,GACrBL,EAGT,IAOIW,EAPE3C,EAAWI,KAAKG,aAAaqB,OAAQR,MACrCnB,EAAWG,KAAKM,aAAakB,OAAQR,MAC3C,GAAIpB,GAAYD,GAAYE,GAAYC,EAEtC,OAAO,KAKPoC,EAAc,CACZzC,UAAW,CACTE,SAAAA,EACAG,UAAAA,GAEFJ,eAAgB,CACdE,SAAAA,EACAC,SAAAA,GAEF2C,aAAcP,KAKhBM,EAAiB3C,EACjBI,KAAKG,aAAamC,QAElBC,EAAiB1C,EACjBG,KAAKM,aAAagC,OAEpB,IAAMV,EAAW5B,KAAKC,oBAAoBsC,UACnCvC,KAAKC,oBAAoBsC,GAChCvC,KAAKC,oBAAoBgC,GAAYL,EACrC5B,KAAKqB,aAAaO,EAAUK,GAE5B,IAAMQ,EAAKzC,KAAKa,iBAAiBiB,WAAU,SAACC,GAAC,OAAKA,IAAMH,KAGxD,OAFY,IAARa,GAAWzC,KAAKa,iBAAiB6B,OAAOD,EAAI,GAEzCb,GACRd,EAEDO,aAAA,SAAaO,EAAkBZ,GAC7B,IAAM2B,EAAU,CACdf,SAAAA,EACAZ,MAAAA,GAGFhB,KAAKG,aAAa6B,KAAKW,GACvB3C,KAAKM,aAAa0B,KAAKW,IACxB7B,EAEDqB,YAAA,WAGEnC,KAAK4C,WAAW5C,KAAKG,cACrBH,KAAK4C,WAAW5C,KAAKM,cACrB,IAAMuC,EAAcC,KAAKC,IACvB/C,KAAKG,aAAa6C,OAClBhD,KAAKM,aAAa0C,QAEAF,KAAKG,IACvBjD,KAAKG,aAAa6C,OAClBhD,KAAKM,aAAa0C,QAEF,GAAKH,GAGrB7C,KAAKkD,kBAERpC,EAEDoC,eAAA,WAaE,IAZA,IAAMC,EACJnD,KAAKG,aAAa6C,OAAShD,KAAKM,aAAa0C,OACzChD,KAAKG,aACLH,KAAKM,aACL8C,EAAiB,IAAIhD,EACzB,GACAJ,KAAKK,oBAEDgD,EAAiB,IAAIjD,EACzB,GACAJ,KAAKO,qBAEC4C,EAAWf,SAAS,CAC1B,IAAMO,EAAUQ,EAAWb,WAEqBrB,IAA5CjB,KAAKC,oBAAoB0C,EAAQ3B,SACnCoC,EAAepB,KAAKW,GACpBU,EAAerB,KAAKW,IAGxB3C,KAAKG,aAAeiD,EACpBpD,KAAKM,aAAe+C,GACrBvC,EAED8B,WAAA,SAAWU,GACT,MACGA,EAAKlB,cAC2CnB,IAAjDjB,KAAKC,oBAAoBqD,EAAK9B,OAAQR,QAEtCsC,EAAKhB,OAERxB,EAEDT,mBAAA,SAAmBkD,EAAeC,GAChC,OAAOD,EAAIvC,MAAQwC,EAAIxC,OACxBF,EAEDP,mBAAA,SAAmBgD,EAAeC,GAChC,OAAOD,EAAIvC,MAAQwC,EAAIxC,SACxBjB,OAAA0D,cAAAC,IA7MD,WACE,IAAMC,EAAU,GAChB,IAAK,IAAMF,KAAOzD,KAAKC,oBAErB0D,EADc3D,KAAKC,oBAAoBwD,IACtBA,EAEnB,OAAOE,ogBACR5D"}
+{"version":3,"file":"integer-buffer-set.cjs.production.min.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","IntegerBufferSet","props","_props$name","name","indexExtractor","_props$bufferSize","bufferSize","_props$metaExtractor","metaExtractor","this","_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","metaIndex","get","isClamped","initialize","smallValues","largeValues","valueToPositionObject","getIndexMeta","index","getMetaIndex","meta","setMetaIndex","set","deleteMetaIndex","replaceMetaToIndexMap","newMetaToIndexMap","undefined","invariant","newPosition","_pushToHeaps","_setMetaIndex","_setMetaPosition","getMinValue","_this$_smallValues$pe","peek","getMaxValue","_this$_largeValues$pe","newIndex","pos","getFliedPosition","getPosition","prepare","positionToReplace","prevMetaPosition","onTheFlyPositionMeta","_replaceFurthestIndexPosition","isBufferFull","prevIndexMeta","_cleanHeaps","empty","indexToReplace","minValue","maxValue","Math","abs","pop","replacedMeta","lowValue","highValue","shuffle","indices","Array","targetIndex","_arr","_available","indexToMetaMap","metaToIndexMap","metaToPositionMap","_loop","currentIndex","currentMeta","_this","_i","findIndex","push","_this$initialize","positionToMetaList","position","shift","element","recyclerKey","err","readyToStartNextLoop","getIndices","prevMetaOnPosition","prevMetaIndex","_cleanHeap","minHeapSize","min","size","max","_recreateHeaps","sourceHeap","newSmallValues","newLargeValues","heap","lhs","rhs","key"],"mappings":"wRAeMA,EAAuB,SAACC,GAAK,OAAKA,8BA0CtC,SAAAC,EAAYC,YAAAA,IAAAA,EAAqC,IAC/C,IAKSC,EAALD,EAJFE,KAAAA,WAAID,EAAG,iBAAgBA,EACvBE,EAGEH,EAHFG,eAAcC,EAGZJ,EAFFK,WAAAA,WAAUD,EA7CiB,GA6CGA,EAAAE,EAE5BN,EADFO,cAEFC,KAAKC,wBAFUH,EAAGT,EAAoBS,EAGtCE,KAAKE,gBAAkBP,EAEvBK,KAAKG,MAAQT,EAKbM,KAAKI,gBAAkB,IAAIC,IAC3BL,KAAKM,mBAAqB,IAAID,IAC9BL,KAAKO,oBAAsB,GAC3BP,KAAKQ,gBAAkB,IAAIH,IAC3BL,KAAKS,iBAAmB,GAExBT,KAAKU,YAAcb,EAEnBG,KAAKW,aAAe,IAAIC,EAAK,GAAIZ,KAAKa,oBACtCb,KAAKc,aAAe,IAAIF,EAAK,GAAIZ,KAAKe,oBAEtCf,KAAKgB,uBAAyBhB,KAAKgB,uBAAuBC,KAAKjB,MAC/DA,KAAKkB,iBAAmBlB,KAAKkB,iBAAiBD,KAAKjB,MACnDA,KAAKmB,8BACHnB,KAAKmB,8BAA8BF,KAAKjB,MAC1CA,KAAKoB,6BACHpB,KAAKoB,6BAA6BH,KAAKjB,MACzCA,KAAKqB,0BAA4BC,EAC/BtB,KAAKuB,kBAAkBN,KAAKjB,OAG9BA,KAAKwB,QAAUC,KAAKC,MACpB1B,KAAK2B,eAAiB3B,KAAKwB,QAC5B,QAAAI,EAAArC,EAAAsC,UAeA,OAfAD,EAMDL,kBAAA,SAAkBO,GAChB,GAAW,MAAPA,EAAa,CACf,IAAMC,EAAO/B,KAAKS,iBAAiBuB,QAAO,SAACC,GAAC,OAAKA,KACjDjC,KAAKkC,gBAAkBH,EAAKI,SAAWnC,KAAKU,cAE/CkB,EAMDQ,8BAAA,SAA8BC,GAE5B,IADA,IAAQC,EAAyBD,EAAzBC,WAAYC,EAAaF,EAAbE,SACXC,EAAM,EAAGA,EAAMxC,KAAKS,iBAAiB0B,OAAQK,IAAO,CAC3D,IACMC,EAAYzC,KAAKQ,gBAAgBkC,IAD1B1C,KAAKS,iBAAiB+B,IAEnC,IAAKG,EAAUL,EAAYG,EAAWF,GACpC,OAAOC,EAGX,OAAO,MACRZ,EAEDgB,WAAA,WACE,MAAO,CACLC,YAAa,IAAIjC,EAAK,GAAIZ,KAAKa,oBAC/BiC,YAAa,IAAIlC,EAAK,GAAIZ,KAAKe,oBAC/BgC,sBAAuB,KAE1BnB,EAEDoB,aAAA,SAAaC,GACX,OAAOjD,KAAKC,eAAegD,IAC5BrB,EAEDsB,aAAA,SAAaC,GACX,OAAInD,KAAKE,gBAAwBF,KAAKE,gBAAgBiD,GAC/CnD,KAAKQ,gBAAgBkC,IAAIS,IACjCvB,EAEDwB,aAAA,SAAaD,EAAYF,GACvB,OAAKjD,KAAKE,iBACDF,KAAKQ,gBAAgB6C,IAAIF,EAAMF,IAGzCrB,EAED0B,gBAAA,SAAgBH,GACd,OAAOnD,KAAKQ,uBAAuB2C,IACpCvB,EAED2B,sBAAA,SAAsBC,GACpB,OAAKxD,KAAKE,kBACAF,KAAKQ,gBAAkBgD,IAGlC5B,EAEDV,iBAAA,SAAiB+B,GACf,OAAOjD,KAAKkD,aAAalD,KAAKgD,aAAaC,KAC5CrB,EAEDZ,uBAAA,SAAuBiC,GACrB,IAAME,EAAOnD,KAAKgD,aAAaC,QAESQ,IAAtCzD,KAAKM,mBAAmBoC,IAAIS,IAD9BO,MAIA,IAAMC,EAAc3D,KAAKO,oBAAoB4B,OAM7C,OAJAnC,KAAK4D,aAAaD,EAAaV,GAC/BjD,KAAK6D,cAAcV,EAAMF,GACzBjD,KAAK8D,iBAAiBX,EAAMQ,GAErBA,GACR/B,EAEDmC,YAAA,iBACE,cAAAC,EAAOhE,KAAKW,aAAasD,eAAlBD,EAA0B1E,OAClCsC,EAEDsC,YAAA,iBACE,cAAAC,EAAOnE,KAAKc,aAAamD,eAAlBE,EAA0B7E,OAClCsC,EAEDT,8BAAA,SAA8BiD,EAAkB/B,GAG9C,GAAIrC,KAAKkC,gBAAiB,CAExB,IAAKS,EAJ0BN,EAAzBC,WAIqB8B,EAJI/B,EAAbE,UAKhB,OAAO,KAIT,IAAM8B,EAAMrE,KAAKoC,8BAA8BC,GAC/C,GAAW,MAAPgC,EAAa,OAAOA,EAE1B,OAAO,MACRzC,EAED0C,iBAAA,SAAiBF,EAAkB/B,GACjC,IAAMgC,EAAMrE,KAAKmB,8BAA8BiD,EAAU/B,GACzD,GAAW,MAAPgC,EAAa,CACf,IAAMlB,EAAOnD,KAAKgD,aAAaoB,GAG/B,OAFApE,KAAKS,iBAAiB4D,GAAOlB,EAC7BnD,KAAK6D,cAAcV,EAAMiB,GAClBpE,KAAKqB,0BAA0BgD,GAExC,OAAO,MACRzC,EAWD2C,YAAA,SAAYH,EAAkB/B,GAC5BrC,KAAKwE,UACL,IA2CIC,EA3CEtB,EAAOnD,KAAKgD,aAAaoB,GACzBM,EAAmB1E,KAAKM,mBAAmBoC,IAAIS,GAErD,QAAyBM,IAArBiB,EAAgC,CAClC,IAAMC,EAAuB3E,KAAKS,iBAAiBiE,GAEnD,GAAIC,EAAsB,CAExB,GAAIA,IAAyBxB,EAC3B,OAAOuB,EAET,IAAID,EAAoBzE,KAAK4E,8BAC3BR,EACA/B,GAEF,GAAIrC,KAAKkC,gBACP,OAAOlC,KAAKsE,iBAAiBF,EAAU/B,GAEzC,KAAOrC,KAAKS,iBAAiBgE,IAC3BA,EAAoBzE,KAAK4E,8BACvBR,EACA/B,GAIJ,GAAyB,MAArBoC,EAGF,OAFAzE,KAAK6D,cAAcV,EAAMiB,GACzBpE,KAAKS,iBAAiBgE,GAAqBE,EACpC3E,KAAKqB,0BAA0BoD,GAI1C,OADAzE,KAAKS,iBAAiBiE,GAAoBvB,EACnCnD,KAAKqB,0BAA0BqD,GAIxC,IAAK1E,KAAK6E,aACR,OAAO7E,KAAKqB,0BACVrB,KAAKgB,uBAAuBoD,IAGhC,GAAIpE,KAAKkC,gBAAiB,OAAOlC,KAAKsE,iBAAiBF,EAAU/B,GAGjE,IAAMyC,EAAgB9E,KAAKI,gBAAgBsC,IAAI0B,GAsB/C,OAhBKU,EAOHL,EAAoBzE,KAAKM,mBAAmBoC,IAAIoC,IANhD9E,KAAK+E,cACLN,EAAoBzE,KAAK4E,8BACvBR,EACA/B,IAMJrC,KAAKS,iBAAiBgE,GAAqBtB,EAC3CnD,KAAK6D,cAAcV,EAAMiB,GACzBpE,KAAK8D,iBAAiBX,EAAMsB,GAIrBzE,KAAKqB,0BAA0BoD,IACvC7C,EAEDR,6BAAA,SACEgD,EACA/B,GAKA,OAAKrC,KAAK6E,aAMH7E,KAAK4E,8BAA8BR,EAAU/B,GAL3CrC,KAAKqB,0BACVrB,KAAKgB,uBAAuBoD,KAKjCxC,EAEDgD,8BAAA,SACER,EACA/B,GAKA,GAAIrC,KAAKc,aAAakE,SAAWhF,KAAKW,aAAaqE,QACjD,OAAOhF,KAAKqB,0BACVrB,KAAKgB,uBAAuBoD,IAIhC,IAGIa,EAHEC,EAAWlF,KAAKW,aAAasD,OAAQ3E,MACrC6F,EAAWnF,KAAKc,aAAamD,OAAQ3E,MAI3C,IAAK+C,EAAW,CAEV+C,KAAKC,IAAIjB,EAAWc,GAAYE,KAAKC,IAAIjB,EAAWe,IACtDF,EAAiBC,EACjBlF,KAAKW,aAAa2E,QAElBL,EAAiBE,EACjBnF,KAAKc,aAAawE,OAEpB,IAAMC,EAAevF,KAAKI,gBAAgBsC,IAAIuC,GAG9C,OAFiBjF,KAAKM,mBAAmBoC,IAAI6C,GAK/C,IAAoBC,EAAkCnD,EAA9CC,WAAgCmD,EAAcpD,EAAxBE,SAG9B,GACEI,EAAU6C,EAAUN,EAAUO,IAC9B9C,EAAU6C,EAAUL,EAAUM,GAE9B,OAAO,KAEP9C,EAAU6C,EAAUN,EAAUO,KAC7B9C,EAAU6C,EAAUL,EAAUM,IAE/BR,EAAiBE,EACjBnF,KAAKc,aAAawE,QAEjB3C,EAAU6C,EAAUN,EAAUO,IAC/B9C,EAAU6C,EAAUL,EAAUM,IAIrBD,EAAWN,EAAWC,EAAWM,GAF1CR,EAAiBC,EACjBlF,KAAKW,aAAa2E,QAMlBL,EAAiBE,EACjBnF,KAAKc,aAAawE,OAGpB,IAAMC,EAAevF,KAAKI,gBAAgBsC,IAAIuC,GAG9C,OAFiBjF,KAAKM,mBAAmBoC,IAAI6C,IAG9C3D,EAED8D,QAAA,WAEE,eADMC,EAAU,IAAIC,MAAM5F,KAAKH,YACtB2C,EAAM,EAAGA,EAAMmD,EAAQxD,OAAQK,IAAO,CAC7C,IACMqD,EAAc7F,KAAKkD,aADZlD,KAAKS,iBAAiB+B,IAAQxC,KAAKO,oBAAoBiC,IAEpEmD,EAAQnD,GAAOqD,EAQjB,IALA,IAAMC,EAAO,IAAIF,MAAMD,EAAQxD,QACzB4D,EAAa,GACbC,EAAiB,IAAI3F,IACrB4F,EAAiB,IAAI5F,IACrB6F,EAAoB,IAAI7F,IAAM8F,aAElC,IAAMC,EAAeT,EAAQnD,GACvB6D,EAAcC,EAAKrG,eAAemG,GACxC,GAAmB,MAAfC,mBAKJ,GAHAL,EAAe3C,IAAI+C,EAAcC,GACjCJ,EAAe5C,IAAIgD,EAAaD,GAE5BC,IAAgBC,EAAK/F,oBAAoBiC,GACnB,OAAxBsD,EAAKtD,GAAO6D,aAGd,IAAME,EAAKD,EAAK/F,oBAAoBiG,WAAU,SAACvE,GAAC,OAAKA,IAAMoE,KAC3D,IAAY,IAARE,EACqB,OAAvBT,EAAKS,GAAMF,aAIbN,EAAWU,KAAKJ,IAlBT7D,EAAM,EAAGA,EAAMmD,EAAQxD,OAAQK,IAAK2D,IAwB7C,IAHA,IAAAO,EAAqC1G,KAAK4C,aAAlCC,EAAW6D,EAAX7D,YAAaC,EAAW4D,EAAX5D,YACf6D,EAAqB,GAElBC,EAAW,EAAGA,EAAWjB,EAAQxD,OAAQyE,IAAY,CAC5D,IAAMtH,EAAQqG,EAAQiB,GACtB,GAAsB,MAAlBd,EAAKc,GAAT,CAQA,IAAMzD,EAAO4C,EAAWc,QACxB,GAAY,MAAR1D,EAAc,CAChBwD,EAAmBC,GAAYzD,EAC/B+C,EAAkB7C,IAAIF,EAAMyD,GAE5B,IAAME,EAAU,CAAEF,SAAAA,EAAUtH,MAAAA,GAC5BuD,EAAY4D,KAAKK,GACjBhE,EAAY2D,KAAKK,QAfnB,CACEH,EAAmBC,GAAYd,EAAKc,GACpCV,EAAkB7C,IAAIyC,EAAKc,GAAWA,GACtC,IAAME,EAAU,CAAEF,SAAAA,EAAUtH,MAAAA,GAC5BuD,EAAY4D,KAAKK,GACjBhE,EAAY2D,KAAKK,IAcrB9G,KAAKO,oBAAsBoG,EAC3B3G,KAAKW,aAAekC,EACpB7C,KAAKc,aAAegC,EACpB9C,KAAKI,gBAAkB4F,EACvBhG,KAAKuD,sBAAsB0C,GAC3BjG,KAAKM,mBAAqB4F,EAC1BlG,KAAKS,iBAAmB,GAExB,IAEE,IADA,IAAMkF,EAAU,IAAIC,MAAM5F,KAAKH,YACtB2C,EAAM,EAAGA,EAAMmD,EAAQxD,OAAQK,IAAO,CAC7C,IAAMW,EACJnD,KAAKS,iBAAiB+B,IAAQxC,KAAKO,oBAAoBiC,GACnDqD,EAAc7F,KAAKkD,aAAaC,GAC1B,MAARA,IACFwC,EAAQnD,GAAO,CACbW,KAAAA,EACA0C,YAAAA,EACAkB,YAAgB/G,KAAKG,UAASqC,IAIpC,OAAOmD,EACP,MAAOqB,GAEP,OADAhH,KAAKiH,uBACEjH,KAAKO,sBAEfqB,EAGDsF,WAAA,WACE,IAEE,IADA,IAAMvB,EAAU,IAAIC,MAAM5F,KAAKH,YACtB2C,EAAM,EAAGA,EAAMmD,EAAQxD,OAAQK,IAAO,CAC7C,IAAMW,EACJnD,KAAKS,iBAAiB+B,IAAQxC,KAAKO,oBAAoBiC,GACnDqD,EAAc7F,KAAKkD,aAAaC,GAEtC,GAAIA,IAASnD,KAAKgD,aAAa6C,GAC7B,OAAO7F,KAAK0F,UAEF,MAARvC,IACFwC,EAAQnD,GAAO,CACbW,KAAAA,EACA0C,YAAAA,EACAkB,YAAgB/G,KAAKG,UAASqC,IAOpC,OAFAxC,KAAKS,iBAAmB,GAEjBkF,EACP,MAAOqB,GAEP,OADAhH,KAAKiH,uBACEjH,KAAKO,sBAEfqB,EAEDgC,aAAA,SAAagD,EAAkBtH,GAC7B,IAAMwH,EAAU,CAAEF,SAAAA,EAAUtH,MAAAA,GAE5BU,KAAKW,aAAa8F,KAAKK,GACvB9G,KAAKc,aAAa2F,KAAKK,IACxBlF,EAEDkC,iBAAA,SAAiBX,EAAYyD,GAC3B,IAAMO,EAAqBnH,KAAKO,oBAAoBqG,GAChDO,GAAoBnH,KAAKM,0BAA0B6G,GACvDnH,KAAKO,oBAAoBqG,GAAYzD,EACrCnD,KAAKM,mBAAmB+C,IAAIF,EAAMyD,IACnChF,EAQDiC,cAAA,SAAcV,EAAYF,GACxB,IAAMmE,EAAgBpH,KAAKkD,aAAaC,GAQxC,YAPsBM,IAAlB2D,GAGFpH,KAAKI,uBAAuBgH,GAE9BpH,KAAKoD,aAAaD,EAAMF,GACxBjD,KAAKI,gBAAgBiD,IAAIJ,EAAOE,IACzB,GACRvB,EAEDqF,qBAAA,WACEjH,KAAK2B,eAAiBF,KAAKC,OAC5BE,EAED4C,QAAA,WACMxE,KAAKwB,UAAYxB,KAAK2B,iBAC1B3B,KAAKwB,QAAUxB,KAAK2B,eAEpB3B,KAAKS,iBAAmB,GACxBT,KAAKkC,iBAAkB,IACxBN,EAEDmD,YAAA,WAGE/E,KAAKqH,WAAWrH,KAAKW,cACrBX,KAAKqH,WAAWrH,KAAKc,cACrB,IAAMwG,EAAclC,KAAKmC,IACvBvH,KAAKW,aAAa6G,OAClBxH,KAAKc,aAAa0G,QAEApC,KAAKqC,IACvBzH,KAAKW,aAAa6G,OAClBxH,KAAKc,aAAa0G,QAEF,GAAKF,GAGrBtH,KAAK0H,kBAER9F,EACD8F,eAAA,WAaE,IAZA,IAAMC,EACJ3H,KAAKW,aAAa6G,OAASxH,KAAKc,aAAa0G,OACzCxH,KAAKW,aACLX,KAAKc,aACL8G,EAAiB,IAAIhH,EACzB,GACAZ,KAAKa,oBAEDgH,EAAiB,IAAIjH,EACzB,GACAZ,KAAKe,qBAEC4G,EAAW3C,SAAS,CAC1B,IAAM8B,EAAUa,EAAWrC,MAIzB,MADAtF,KAAKM,mBAAmBoC,IAAI1C,KAAKI,gBAAgBsC,IAAIoE,EAAQxH,UAG7DsI,EAAenB,KAAKK,GACpBe,EAAepB,KAAKK,IAGxB9G,KAAKW,aAAeiH,EACpB5H,KAAKc,aAAe+G,GACrBjG,EAEDyF,WAAA,SAAWS,GACT,MACGA,EAAK9C,SAGD,MAFLhF,KAAKM,mBAAmBoC,IACtB1C,KAAKI,gBAAgBsC,IAAIoF,EAAK7D,OAAQ3E,SAGxCwI,EAAKxC,OAER1D,EAEDf,mBAAA,SAAmBkH,EAAeC,GAChC,OAAOD,EAAIzI,MAAQ0I,EAAI1I,OACxBsC,EAEDb,mBAAA,SAAmBgH,EAAeC,GAChC,OAAOD,EAAIzI,MAAQ0I,EAAI1I,SACxBC,OAAA0I,iBAAAvF,IAzfD,WACE,OAAO1C,KAAKU,eACbuH,mBAAAvF,IASD,WACE,OAAO1C,KAAKO,oBAAoB4B,QAAUnC,KAAKU,8gBAChDnB,+BA9F8B"}