npm - @x-oasis/integer-buffer-set - Versions diffs - 0.1.18 → 0.1.20 - Mend

@x-oasis/integer-buffer-set 0.1.18 → 0.1.20

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (12) hide show

package/README.md +23 -1
package/dist/index.d.ts +59 -21
package/dist/integer-buffer-set.cjs.development.js +446 -61
package/dist/integer-buffer-set.cjs.development.js.map +1 -1
package/dist/integer-buffer-set.cjs.production.min.js +1 -1
package/dist/integer-buffer-set.cjs.production.min.js.map +1 -1
package/dist/integer-buffer-set.esm.js +446 -61
package/dist/integer-buffer-set.esm.js.map +1 -1
package/dist/types.d.ts +24 -0
package/package.json +6 -2
package/src/index.ts +673 -114
package/src/types.ts +36 -0

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

	@@ -1 +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\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\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 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 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 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","_proto","prototype","value","undefined","console","warn","newPosition","_pushToHeaps","getMinValue","_this$_smallValues$pe","peek","getMaxValue","_this$_largeValues$pe","newValue","useMinValueFn","_cleanHeaps","empty","valueToReplace","currentIndex","pop","position","element","push","_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;EAQpB,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;;EAC/C,IAAAI,MAAA,GAAAb,gBAAA,CAAAc,SAAA;EAAAD,MAAA,CAEDF,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACT,KAAK;GAClB;EAAAW,MAAA,CAWDH,gBAAgB,GAAhB,SAAAA,iBAAiBK,KAAa;IAC5B,IAAI,IAAI,CAACd,mBAAmB,CAACc,KAAK,CAAC,KAAKC,SAAS,EAAE;MACjD,OAAO,IAAI;;IAEb,OAAO,IAAI,CAACf,mBAAmB,CAACc,KAAK,CAAC;GACvC;EAAAF,MAAA,CAEDL,sBAAsB,GAAtB,SAAAA,uBAAuBO,KAAa;IAClC,IAAI,IAAI,CAACd,mBAAmB,CAACc,KAAK,CAAC,KAAKC,SAAS,EAAE;MACjDC,OAAO,CAACC,IAAI,CACV,0EAA0E,CAC3E;;IAMH,IAAMC,WAAW,GAAG,IAAI,CAACjB,KAAK;IAC9B,IAAI,CAACA,KAAK,EAAE;IACZ,IAAI,CAACkB,YAAY,CAACD,WAAW,EAAEJ,KAAK,CAAC;IACrC,IAAI,CAACd,mBAAmB,CAACc,KAAK,CAAC,GAAGI,WAAW;IAC7C,OAAOA,WAAW;GACnB;EAAAN,MAAA,CAEDQ,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACnB,YAAY,CAACoB,IAAI,EAAE,qBAAxBD,qBAAA,CAA0BP,KAAK;GACvC;EAAAF,MAAA,CAEDW,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACnB,YAAY,CAACiB,IAAI,EAAE,qBAAxBE,qBAAA,CAA0BV,KAAK;GACvC;EAAAF,MAAA,CAEDD,4BAA4B,GAA5B,SAAAA,6BACEhB,QAAgB,EAChBC,SAAiB,EACjB6B,QAAgB,EAChBC;QAAAA;MAAAA,gBAUgBnC,oBAAoB;;IAEpC,IAAI,IAAI,CAACS,mBAAmB,CAACyB,QAAQ,CAAC,KAAKV,SAAS,EAAE;MACpDC,OAAO,CAACC,IAAI,CACV,qEAAqE,GACnE,WAAW,CACd;;IAQH,IAAI,CAACU,WAAW,EAAE;IAClB,IAAI,IAAI,CAACzB,YAAY,CAAC0B,KAAK,EAAE,IAAI,IAAI,CAACvB,YAAY,CAACuB,KAAK,EAAE,EAAE;MAG1D,OAAO,IAAI;;IAGb,IAAM9B,QAAQ,GAAG,IAAI,CAACI,YAAY,CAACoB,IAAI,EAAG,CAACR,KAAK;IAChD,IAAMjB,QAAQ,GAAG,IAAI,CAACQ,YAAY,CAACiB,IAAI,EAAG,CAACR,KAAK;IAChD,IAAIhB,QAAQ,IAAIH,QAAQ,IAAIE,QAAQ,IAAID,SAAS,EAAE;MAEjD,OAAO,IAAI;;IAGb,IAAIiC,cAAc;IAClB,IACEH,aAAa,CAAC;MACZjC,SAAS,EAAE;QACTE,QAAQ,EAARA,QAAQ;QACRC,SAAS,EAATA;OACD;MACDF,cAAc,EAAE;QACdI,QAAQ,EAARA,QAAQ;QACRD,QAAQ,EAARA;OACD;MACDiC,YAAY,EAAEL;KACf,CAAC,EACF;MAGAI,cAAc,GAAG/B,QAAQ;MACzB,IAAI,CAACI,YAAY,CAAC6B,GAAG,EAAE;KACxB,MAAM;MACLF,cAAc,GAAGhC,QAAQ;MACzB,IAAI,CAACQ,YAAY,CAAC0B,GAAG,EAAE;;IAEzB,IAAMC,QAAQ,GAAG,IAAI,CAAChC,mBAAmB,CAAC6B,cAAc,CAAC;IACzD,OAAO,IAAI,CAAC7B,mBAAmB,CAAC6B,cAAc,CAAC;IAC/C,IAAI,CAAC7B,mBAAmB,CAACyB,QAAQ,CAAC,GAAGO,QAAQ;IAC7C,IAAI,CAACb,YAAY,CAACa,QAAQ,EAAEP,QAAQ,CAAC;IAErC,OAAOO,QAAQ;GAChB;EAAApB,MAAA,CAEDO,YAAY,GAAZ,SAAAA,aAAaa,QAAgB,EAAElB,KAAa;IAC1C,IAAMmB,OAAO,GAAG;MACdD,QAAQ,EAARA,QAAQ;MACRlB,KAAK,EAALA;KACD;IAED,IAAI,CAACZ,YAAY,CAACgC,IAAI,CAACD,OAAO,CAAC;IAC/B,IAAI,CAAC5B,YAAY,CAAC6B,IAAI,CAACD,OAAO,CAAC;GAChC;EAAArB,MAAA,CAEDe,WAAW,GAAX,SAAAA;IAGE,IAAI,CAACQ,UAAU,CAAC,IAAI,CAACjC,YAAY,CAAC;IAClC,IAAI,CAACiC,UAAU,CAAC,IAAI,CAAC9B,YAAY,CAAC;IAClC,IAAM+B,WAAW,GAAGC,IAAI,CAACC,GAAG,CAC1B,IAAI,CAACpC,YAAY,CAACqC,IAAI,EAAE,EACxB,IAAI,CAAClC,YAAY,CAACkC,IAAI,EAAE,CACzB;IACD,IAAMC,WAAW,GAAGH,IAAI,CAACI,GAAG,CAC1B,IAAI,CAACvC,YAAY,CAACqC,IAAI,EAAE,EACxB,IAAI,CAAClC,YAAY,CAACkC,IAAI,EAAE,CACzB;IACD,IAAIC,WAAW,GAAG,EAAE,GAAGJ,WAAW,EAAE;MAGlC,IAAI,CAACM,cAAc,EAAE;;GAExB;EAAA9B,MAAA,CAED8B,cAAc,GAAd,SAAAA;IACE,IAAMC,UAAU,GACd,IAAI,CAACzC,YAAY,CAACqC,IAAI,EAAE,GAAG,IAAI,CAAClC,YAAY,CAACkC,IAAI,EAAE,GAC/C,IAAI,CAACrC,YAAY,GACjB,IAAI,CAACG,YAAY;IACvB,IAAMuC,cAAc,GAAG,IAAIzC,IAAI,CAC7B,EAAE,EACF,IAAI,CAACC,kBAAkB,CACxB;IACD,IAAMyC,cAAc,GAAG,IAAI1C,IAAI,CAC7B,EAAE,EACF,IAAI,CAACG,kBAAkB,CACxB;IACD,OAAO,CAACqC,UAAU,CAACf,KAAK,EAAE,EAAE;MAC1B,IAAMK,OAAO,GAAGU,UAAU,CAACZ,GAAG,EAAG;MAEjC,IAAI,IAAI,CAAC/B,mBAAmB,CAACiC,OAAO,CAACnB,KAAK,CAAC,KAAKC,SAAS,EAAE;QACzD6B,cAAc,CAACV,IAAI,CAACD,OAAO,CAAC;QAC5BY,cAAc,CAACX,IAAI,CAACD,OAAO,CAAC;;;IAGhC,IAAI,CAAC/B,YAAY,GAAG0C,cAAc;IAClC,IAAI,CAACvC,YAAY,GAAGwC,cAAc;GACnC;EAAAjC,MAAA,CAEDuB,UAAU,GAAV,SAAAA,WAAWW,IAAoB;IAC7B,OACE,CAACA,IAAI,CAAClB,KAAK,EAAE,IACb,IAAI,CAAC5B,mBAAmB,CAAC8C,IAAI,CAACxB,IAAI,EAAG,CAACR,KAAK,CAAC,KAAKC,SAAS,EAC1D;MACA+B,IAAI,CAACf,GAAG,EAAE;;GAEb;EAAAnB,MAAA,CAEDR,kBAAkB,GAAlB,SAAAA,mBAAmB2C,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACjC,KAAK,GAAGkC,GAAG,CAAClC,KAAK;GAC7B;EAAAF,MAAA,CAEDN,kBAAkB,GAAlB,SAAAA,mBAAmByC,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACjC,KAAK,GAAGkC,GAAG,CAAClC,KAAK;GAC7B;EAAAmC,YAAA,CAAAlD,gBAAA;IAAAmD,GAAA;IAAAC,GAAA,EAvLD,SAAAA;MACE,IAAMC,OAAO,GAAG,EAAE;MAClB,KAAK,IAAMF,GAAG,IAAI,IAAI,CAAClD,mBAAmB,EAAE;QAC1C,IAAMc,KAAK,GAAG,IAAI,CAACd,mBAAmB,CAACkD,GAAG,CAAC;QAC3CE,OAAO,CAACtC,KAAK,CAAC,GAAGoC,GAAG;;MAEtB,OAAOE,OAAO;;;EACf,OAAArD,gBAAA;AAAA;;;;"}
1	+ {"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 _size: number;\n private _name: string;\n private _bufferSize: number;\n // private _positionToValueObject: ValueToPositionObject;\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 // this._positionToValueObject = {};\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._size = 0;\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.getSize = this.getSize.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 getSize() {\n return this._size;\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 /\n values actually is the position of original data.\n /\n setValuePosition(value: number, position: number) {}\n\n findPositionMeta(position: number) {\n for (const [meta, pos] of this._metaToPositionMap) {\n if (pos === position) return meta;\n }\n return null;\n }\n\n rebuildHeapsWithMeta(metaToPositionMap: MetaToPositionMap<Meta>) {\n const { smallValues, largeValues } = this.initialize();\n\n for (const [meta, position] of metaToPositionMap) {\n const index = this.getMetaIndex(meta);\n const token = { index, position };\n smallValues.push(token);\n largeValues.push(token);\n }\n\n this._smallValues = smallValues;\n this._largeValues = largeValues;\n }\n\n /\n \n * @param position\n * @param value\n \n \n /\n setPositionIndex(position: number, index: number) {\n const meta = this._metaExtractor(index);\n const originalPosition = this._metaToPositionMap.get(meta);\n\n // current index has a position\n if (originalPosition !== undefined) {\n if (originalPosition === position) return true;\n this.deleteMetaIndex(meta);\n }\n\n const metaToReplace = this.findPositionMeta(position);\n if (metaToReplace) this._metaToPositionMap.delete(metaToReplace);\n this._metaToPositionMap.set(meta, position);\n\n this.rebuildHeapsWithMeta(this._metaToPositionMap);\n return true;\n }\n\n getMetaPosition(meta: Meta) {\n return this._metaToPositionMap.get(meta);\n }\n\n // performRangeUpdate(\n // startIndex: number,\n // endIndex: number,\n // safeRange: {\n // startIndex: number;\n // endIndex: number;\n // }\n // ) {\n // const _start = Math.max(startIndex, safeRange.startIndex);\n // const _end = Math.min(endIndex, safeRange.endIndex);\n // const primaryMetaList = [];\n // const secondaryMetaList = [];\n // const locationStartIndex = startIndex;\n // const targetIndices = new Array(this._bufferSize);\n\n // const _valueToPositionObject = {};\n // const _positionToValueObject = {};\n\n // const _valueToMetaObject = {};\n // const _metaToIndexMap = new Map();\n\n // for (let value = startIndex; value <= endIndex; value++) {\n // const meta = this._metaExtractor(value);\n // if (meta) {\n // const _i = value - locationStartIndex;\n // if (isClamped(value, safeRange.startIndex, safeRange.endIndex)) {\n // primaryMetaList[_i] = meta;\n // const targetIndex = this.getMetaPosition(meta);\n // if (isNumber(targetIndex)) {\n // targetIndices[targetIndex] = value;\n // _valueToPositionObject[value] = targetIndex;\n // _valueToMetaObject[value] = meta;\n // _metaToIndexMap.set(meta, value);\n // _positionToValueObject[targetIndex] = value;\n // }\n // } else {\n // secondaryMetaList[_i] = meta;\n // }\n // }\n // }\n\n // for (let idx = _start; idx <= _end; idx++) {\n // const meta = this._metaExtractor(idx);\n // if (_metaToIndexMap.get(meta) !== undefined) continue;\n // let p;\n // while (\n // (p =\n // targetIndices[\n // this.resolvePosition(safeRange.startIndex, safeRange.endIndex, idx)\n // ]) === undefined\n // ) {\n // targetIndices[p] = idx;\n // }\n // }\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 // console.log('this. fly ', this._isOnTheFlyFull)\n if (this._isOnTheFlyFull) return this.getFliedPosition(newIndex, safeRange);\n\n let positionToReplace;\n const prevIndexMeta = this._indexToMetaMap.get(newIndex);\n // console.log('this. is ', this.isBufferFull, prevIndexMeta);\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 // console.log('mxa ', maxValue, minValue);\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 // console.log(\n // 'position xxx ',\n // this._positionToMetaList,\n // this._onTheFlyIndices\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 // console.log('position ', positionToMetaList, largeValues.peek().value);\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 const len = this._positionToMetaList.length;\n\n for (let index = 0; index < len; index++) {}\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 rebuildHeapsWithValues(\n arr: Array<{\n position: number;\n value: number;\n }>\n ) {\n const valueToPositionObject = {};\n const newSmallValues = new Heap<HeapItem>([], this._smallerComparator);\n const newLargeValues = new Heap<HeapItem>([], this._greaterComparator);\n\n arr.forEach((element) => {\n const { position, value } = element;\n if (value !== undefined) {\n const element = {\n position,\n value,\n };\n newSmallValues.push(element);\n newLargeValues.push(element);\n valueToPositionObject[value] = position;\n }\n });\n const _arr = new Array(this._bufferSize).fill(2);\n Object.keys(valueToPositionObject).map(\n (key) => (_arr[valueToPositionObject[key]] = 1)\n );\n _arr.forEach((_i, position) => {\n if (_i === 2) {\n const value = Number.MAX_SAFE_INTEGER - position;\n const element = {\n position,\n value,\n };\n\n newSmallValues.push(element);\n newLargeValues.push(element);\n valueToPositionObject[value] = position;\n }\n });\n this._smallValues = newSmallValues;\n this._largeValues = newLargeValues;\n }\n\n // rebuildHeaps() {\n // const valueToPositionObject = {};\n // const newSmallValues = new Heap<HeapItem>([], this._smallerComparator);\n // const newLargeValues = new Heap<HeapItem>([], this._greaterComparator);\n\n // const keys = Object.keys(this._positionToValueObject);\n // for (let position = 0; position < keys.length; position++) {\n // const value = this._positionToValueObject[position];\n // if (value !== undefined) {\n // const element = {\n // position,\n // value,\n // };\n // valueToPositionObject[value] = position;\n // newSmallValues.push(element);\n // newLargeValues.push(element);\n // }\n // }\n\n // this._smallValues = newSmallValues;\n // this._largeValues = newLargeValues;\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","_size","_bufferSize","_smallValues","Heap","_smallerComparator","_largeValues","_greaterComparator","getNewPositionForIndex","bind","getIndexPosition","getSize","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","setValuePosition","position","findPositionMeta","_iterator","_createForOfIteratorHelperLoose","_step","done","_step$value","pos","rebuildHeapsWithMeta","metaToPositionMap","_this$initialize","_iterator2","_step2","_step2$value","token","push","setPositionIndex","originalPosition","metaToReplace","getMetaPosition","newIndex","getFliedPosition","getPosition","prepare","prevMetaPosition","onTheFlyPositionMeta","positionToReplace","_replaceFurthestIndexPosition","isBufferFull","prevIndexMeta","_cleanHeaps","empty","minValue","maxValue","indexToReplace","Math","abs","pop","replacedMeta","lowValue","highValue","shuffle","indices","Array","targetIndex","_arr","_available","indexToMetaMap","metaToIndexMap","_loop","currentIndex","currentMeta","_this","_i","findIndex","_ret","_this$initialize2","positionToMetaList","element","shift","recyclerKey","err","readyToStartNextLoop","getIndices","prevMetaOnPosition","prevMetaIndex","_cleanHeap","minHeapSize","min","size","maxHeapSize","max","_recreateHeaps","rebuildHeapsWithValues","arr","newSmallValues","newLargeValues","forEach","fill","Object","keys","map","key","Number","MAX_SAFE_INTEGER","sourceHeap","heap","lhs","rhs","_createClass"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeA,IAAMA,oBAAoB,GAAG,SAAvBA,oBAAoBA,CAAIC,KAAK;EAAA,OAAKA,KAAK;AAAA;IAChCC,iBAAiB,GAAG;AAAG,IAmB9BC,gBAAgB;EAwBpB,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;IAMjB,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,KAAK,GAAG,CAAC;IACd,IAAI,CAACC,WAAW,GAAGb,UAAU;IAE7B,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,6BAA6B,GAChC,IAAI,CAACA,6BAA6B,CAACH,IAAI,CAAC,IAAI,CAAC;IAC/C,IAAI,CAACI,4BAA4B,GAC/B,IAAI,CAACA,4BAA4B,CAACJ,IAAI,CAAC,IAAI,CAAC;IAC9C,IAAI,CAACK,yBAAyB,GAAGC,UAAU,CACzC,IAAI,CAACC,iBAAiB,CAACP,IAAI,CAAC,IAAI,CAAC,CAClC;IAED,IAAI,CAACQ,OAAO,GAAGC,IAAI,CAACC,GAAG,EAAE;IACzB,IAAI,CAACC,cAAc,GAAG,IAAI,CAACH,OAAO;;EACnC,IAAAI,MAAA,GAAAvC,gBAAA,CAAAwC,SAAA;EAAAD,MAAA,CAEDV,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACV,KAAK;GAClB;EAAAoB,MAAA,CAMDL,iBAAiB,GAAjB,SAAAA,kBAAkBO,GAAQ;IACxB,IAAIA,GAAG,IAAI,IAAI,EAAE;MACf,IAAMC,IAAI,GAAG,IAAI,CAACxB,gBAAgB,CAACyB,MAAM,CAAC,UAACC,CAAC;QAAA,OAAKA,CAAC;QAAC;MACnD,IAAI,CAACC,eAAe,GAAGH,IAAI,CAACI,MAAM,KAAK,IAAI,CAAC1B,WAAW;;GAE1D;EAAAmB,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,CAACjC,gBAAgB,CAAC4B,MAAM,EAAEK,GAAG,EAAE,EAAE;MAC3D,IAAMC,IAAI,GAAG,IAAI,CAAClC,gBAAgB,CAACiC,GAAG,CAAC;MACvC,IAAME,SAAS,GAAG,IAAI,CAACpC,eAAe,CAACqC,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,IAAInC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACC,kBAAkB,CAAC;MAClDmC,WAAW,EAAE,IAAIpC,IAAI,CAAC,EAAE,EAAE,IAAI,CAACG,kBAAkB,CAAC;MAClDkC,qBAAqB,EAAE;KACxB;GACF;EAAApB,MAAA,CAEDqB,YAAY,GAAZ,SAAAA,aAAaC,KAAa;IACxB,OAAO,IAAI,CAACnD,cAAc,CAACmD,KAAK,CAAC;GAClC;EAAAtB,MAAA,CAEDuB,YAAY,GAAZ,SAAAA,aAAaV,IAAU;IACrB,IAAI,IAAI,CAACzC,eAAe,EAAE,OAAO,IAAI,CAACA,eAAe,CAACyC,IAAI,CAAC;IAC3D,OAAO,IAAI,CAACnC,eAAe,CAACqC,GAAG,CAACF,IAAI,CAAC;GACtC;EAAAb,MAAA,CAEDwB,YAAY,GAAZ,SAAAA,aAAaX,IAAU,EAAES,KAAa;IACpC,IAAI,CAAC,IAAI,CAAClD,eAAe,EAAE;MACzB,OAAO,IAAI,CAACM,eAAe,CAAC+C,GAAG,CAACZ,IAAI,EAAES,KAAK,CAAC;;IAE9C,OAAO,KAAK;GACb;EAAAtB,MAAA,CAED0B,eAAe,GAAf,SAAAA,gBAAgBb,IAAU;IACxB,OAAO,IAAI,CAACnC,eAAe,UAAO,CAACmC,IAAI,CAAC;GACzC;EAAAb,MAAA,CAED2B,qBAAqB,GAArB,SAAAA,sBAAsBC,iBAAuC;IAC3D,IAAI,CAAC,IAAI,CAACxD,eAAe,EAAE;MACzB,OAAQ,IAAI,CAACM,eAAe,GAAGkD,iBAAiB;;IAElD,OAAO,KAAK;GACb;EAAA5B,MAAA,CAEDX,gBAAgB,GAAhB,SAAAA,iBAAiBiC,KAAa;IAC5B,OAAO,IAAI,CAACC,YAAY,CAAC,IAAI,CAACF,YAAY,CAACC,KAAK,CAAC,CAAC;GACnD;EAAAtB,MAAA,CAEDb,sBAAsB,GAAtB,SAAAA,uBAAuBmC,KAAa;IAClC,IAAMT,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACC,KAAK,CAAC;IACrC,EACE,IAAI,CAAC9C,kBAAkB,CAACuC,GAAG,CAACF,IAAI,CAAC,KAAKgB,SAAS,KADjDC,SAAS,QAEP,0EAA0E;IAE5E,IAAMC,WAAW,GAAG,IAAI,CAACtD,mBAAmB,CAAC8B,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,CAACtD,YAAY,CAACuD,IAAI,EAAE,qBAAxBD,qBAAA,CAA0B7E,KAAK;GACvC;EAAAyC,MAAA,CAEDsC,WAAW,GAAX,SAAAA;;IACE,QAAAC,qBAAA,GAAO,IAAI,CAACtD,YAAY,CAACoD,IAAI,EAAE,qBAAxBE,qBAAA,CAA0BhF,KAAK;GACvC;EAAAyC,MAAA,CAKDwC,gBAAgB,GAAhB,SAAAA,iBAAiBjF,KAAa,EAAEkF,QAAgB,IAAI;EAAAzC,MAAA,CAEpD0C,gBAAgB,GAAhB,SAAAA,iBAAiBD,QAAgB;IAC/B,SAAAE,SAAA,GAAAC,+BAAA,CAA0B,IAAI,CAACpE,kBAAkB,GAAAqE,KAAA,IAAAA,KAAA,GAAAF,SAAA,IAAAG,IAAA,GAAE;MAAA,IAAAC,WAAA,GAAAF,KAAA,CAAAtF,KAAA;QAAvCsD,IAAI,GAAAkC,WAAA;QAAEC,GAAG,GAAAD,WAAA;MACnB,IAAIC,GAAG,KAAKP,QAAQ,EAAE,OAAO5B,IAAI;;IAEnC,OAAO,IAAI;GACZ;EAAAb,MAAA,CAEDiD,oBAAoB,GAApB,SAAAA,qBAAqBC,iBAA0C;IAC7D,IAAAC,gBAAA,GAAqC,IAAI,CAAClC,UAAU,EAAE;MAA9CC,WAAW,GAAAiC,gBAAA,CAAXjC,WAAW;MAAEC,WAAW,GAAAgC,gBAAA,CAAXhC,WAAW;IAEhC,SAAAiC,UAAA,GAAAR,+BAAA,CAA+BM,iBAAiB,GAAAG,MAAA,IAAAA,MAAA,GAAAD,UAAA,IAAAN,IAAA,GAAE;MAAA,IAAAQ,YAAA,GAAAD,MAAA,CAAA9F,KAAA;QAAtCsD,IAAI,GAAAyC,YAAA;QAAEb,QAAQ,GAAAa,YAAA;MACxB,IAAMhC,KAAK,GAAG,IAAI,CAACC,YAAY,CAACV,IAAI,CAAC;MACrC,IAAM0C,KAAK,GAAG;QAAEjC,KAAK,EAALA,KAAK;QAAEmB,QAAQ,EAARA;OAAU;MACjCvB,WAAW,CAACsC,IAAI,CAACD,KAAK,CAAC;MACvBpC,WAAW,CAACqC,IAAI,CAACD,KAAK,CAAC;;IAGzB,IAAI,CAACzE,YAAY,GAAGoC,WAAW;IAC/B,IAAI,CAACjC,YAAY,GAAGkC,WAAW;GAChC;EAAAnB,MAAA,CASDyD,gBAAgB,GAAhB,SAAAA,iBAAiBhB,QAAgB,EAAEnB,KAAa;IAC9C,IAAMT,IAAI,GAAG,IAAI,CAAC1C,cAAc,CAACmD,KAAK,CAAC;IACvC,IAAMoC,gBAAgB,GAAG,IAAI,CAAClF,kBAAkB,CAACuC,GAAG,CAACF,IAAI,CAAC;IAG1D,IAAI6C,gBAAgB,KAAK7B,SAAS,EAAE;MAClC,IAAI6B,gBAAgB,KAAKjB,QAAQ,EAAE,OAAO,IAAI;MAC9C,IAAI,CAACf,eAAe,CAACb,IAAI,CAAC;;IAG5B,IAAM8C,aAAa,GAAG,IAAI,CAACjB,gBAAgB,CAACD,QAAQ,CAAC;IACrD,IAAIkB,aAAa,EAAE,IAAI,CAACnF,kBAAkB,UAAO,CAACmF,aAAa,CAAC;IAChE,IAAI,CAACnF,kBAAkB,CAACiD,GAAG,CAACZ,IAAI,EAAE4B,QAAQ,CAAC;IAE3C,IAAI,CAACQ,oBAAoB,CAAC,IAAI,CAACzE,kBAAkB,CAAC;IAClD,OAAO,IAAI;GACZ;EAAAwB,MAAA,CAED4D,eAAe,GAAf,SAAAA,gBAAgB/C,IAAU;IACxB,OAAO,IAAI,CAACrC,kBAAkB,CAACuC,GAAG,CAACF,IAAI,CAAC;GACzC;EAAAb,MAAA,CA0DDT,6BAA6B,GAA7B,SAAAA,8BAA8BsE,QAAgB,EAAEpD,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,EAAEmD,QAAQ,EAAElD,QAAQ,CAAC,EAAE;QAC9C,OAAO,IAAI;;MAIb,IAAMqC,GAAG,GAAG,IAAI,CAACxC,6BAA6B,CAACC,SAAS,CAAC;MACzD,IAAIuC,GAAG,IAAI,IAAI,EAAE,OAAOA,GAAG;;IAE7B,OAAO,IAAI;GACZ;EAAAhD,MAAA,CAED8D,gBAAgB,GAAhB,SAAAA,iBAAiBD,QAAgB,EAAEpD,SAAoB;IACrD,IAAMuC,GAAG,GAAG,IAAI,CAACzD,6BAA6B,CAACsE,QAAQ,EAAEpD,SAAS,CAAC;IACnE,IAAIuC,GAAG,IAAI,IAAI,EAAE;MACf,IAAMnC,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACwC,QAAQ,CAAC;MACxC,IAAI,CAAClF,gBAAgB,CAACqE,GAAG,CAAC,GAAGnC,IAAI;MACjC,IAAI,CAACoB,aAAa,CAACpB,IAAI,EAAEgD,QAAQ,CAAC;MAClC,OAAO,IAAI,CAACpE,yBAAyB,CAACuD,GAAG,CAAC;;IAE5C,OAAO,IAAI;GACZ;EAAAhD,MAAA,CAWD+D,WAAW,GAAX,SAAAA,YAAYF,QAAgB,EAAEpD,SAAqB;IACjD,IAAI,CAACuD,OAAO,EAAE;IACd,IAAMnD,IAAI,GAAG,IAAI,CAACQ,YAAY,CAACwC,QAAQ,CAAC;IACxC,IAAMI,gBAAgB,GAAG,IAAI,CAACzF,kBAAkB,CAACuC,GAAG,CAACF,IAAI,CAAC;IAE1D,IAAIoD,gBAAgB,KAAKpC,SAAS,EAAE;MAClC,IAAMqC,oBAAoB,GAAG,IAAI,CAACvF,gBAAgB,CAACsF,gBAAgB,CAAC;MAEpE,IAAIC,oBAAoB,EAAE;QAExB,IAAIA,oBAAoB,KAAKrD,IAAI,EAAE;UACjC,OAAOoD,gBAAgB;;QAEzB,IAAIE,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACxDP,QAAQ,EACRpD,SAAS,CACV;QACD,IAAI,IAAI,CAACH,eAAe,EACtB,OAAO,IAAI,CAACwD,gBAAgB,CAACD,QAAQ,EAAEpD,SAAS,CAAC;QAEnD,OAAO,IAAI,CAAC9B,gBAAgB,CAACwF,kBAAiB,CAAC,EAAE;UAC/CA,kBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDP,QAAQ,EACRpD,SAAS,CACV;;QAGH,IAAI0D,kBAAiB,IAAI,IAAI,EAAE;UAC7B,IAAI,CAAClC,aAAa,CAACpB,IAAI,EAAEgD,QAAQ,CAAC;UAClC,IAAI,CAAClF,gBAAgB,CAACwF,kBAAiB,CAAC,GAAGD,oBAAoB;UAC/D,OAAO,IAAI,CAACzE,yBAAyB,CAAC0E,kBAAiB,CAAC;;;MAG5D,IAAI,CAACxF,gBAAgB,CAACsF,gBAAgB,CAAC,GAAGpD,IAAI;MAC9C,OAAO,IAAI,CAACpB,yBAAyB,CAACwE,gBAAgB,CAAC;;IAIzD,IAAI,CAAC,IAAI,CAACI,YAAY,EACpB,OAAO,IAAI,CAAC5E,yBAAyB,CACnC,IAAI,CAACN,sBAAsB,CAAC0E,QAAQ,CAAC,CACtC;IAGH,IAAI,IAAI,CAACvD,eAAe,EAAE,OAAO,IAAI,CAACwD,gBAAgB,CAACD,QAAQ,EAAEpD,SAAS,CAAC;IAE3E,IAAI0D,iBAAiB;IACrB,IAAMG,aAAa,GAAG,IAAI,CAAChG,eAAe,CAACyC,GAAG,CAAC8C,QAAQ,CAAC;IAOxD,IAAI,CAACS,aAAa,EAAE;MAClB,IAAI,CAACC,WAAW,EAAE;MAClBJ,iBAAiB,GAAG,IAAI,CAACC,6BAA6B,CACpDP,QAAQ,EACRpD,SAAS,CACV;KACF,MAAM;MACL0D,iBAAiB,GAAG,IAAI,CAAC3F,kBAAkB,CAACuC,GAAG,CAACuD,aAAa,CAAC;;IAGhE,IAAI,CAAC3F,gBAAgB,CAACwF,iBAAiB,CAAC,GAAGtD,IAAI;IAC/C,IAAI,CAACoB,aAAa,CAACpB,IAAI,EAAEgD,QAAQ,CAAC;IAClC,IAAI,CAAC3B,gBAAgB,CAACrB,IAAI,EAAEsD,iBAAiB,CAAC;IAI9C,OAAO,IAAI,CAAC1E,yBAAyB,CAAC0E,iBAAiB,CAAC;GACzD;EAAAnE,MAAA,CAEDR,4BAA4B,GAA5B,SAAAA,6BACEqE,QAAgB,EAChBpD,SAGC;IAED,IAAI,CAAC,IAAI,CAAC4D,YAAY,EAAE;MACtB,OAAO,IAAI,CAAC5E,yBAAyB,CACnC,IAAI,CAACN,sBAAsB,CAAC0E,QAAQ,CAAC,CACtC;;IAGH,OAAO,IAAI,CAACO,6BAA6B,CAACP,QAAQ,EAAEpD,SAAS,CAAC;GAC/D;EAAAT,MAAA,CAEDoE,6BAA6B,GAA7B,SAAAA,8BACEP,QAAgB,EAChBpD,SAGC;IAED,IAAI,IAAI,CAACxB,YAAY,CAACuF,KAAK,EAAE,IAAI,IAAI,CAAC1F,YAAY,CAAC0F,KAAK,EAAE,EAAE;MAC1D,OAAO,IAAI,CAAC/E,yBAAyB,CACnC,IAAI,CAACN,sBAAsB,CAAC0E,QAAQ,CAAC,CACtC;;IAGH,IAAMY,QAAQ,GAAG,IAAI,CAAC3F,YAAY,CAACuD,IAAI,EAAG,CAAC9E,KAAK;IAChD,IAAMmH,QAAQ,GAAG,IAAI,CAACzF,YAAY,CAACoD,IAAI,EAAG,CAAC9E,KAAK;IAGhD,IAAIoH,cAAc;IAElB,IAAI,CAAClE,SAAS,EAAE;MAEd,IAAImE,IAAI,CAACC,GAAG,CAAChB,QAAQ,GAAGY,QAAQ,CAAC,GAAGG,IAAI,CAACC,GAAG,CAAChB,QAAQ,GAAGa,QAAQ,CAAC,EAAE;QACjEC,cAAc,GAAGF,QAAQ;QACzB,IAAI,CAAC3F,YAAY,CAACgG,GAAG,EAAE;OACxB,MAAM;QACLH,cAAc,GAAGD,QAAQ;QACzB,IAAI,CAACzF,YAAY,CAAC6F,GAAG,EAAE;;MAEzB,IAAMC,aAAY,GAAG,IAAI,CAACzG,eAAe,CAACyC,GAAG,CAAC4D,cAAc,CAAC;MAC7D,IAAMlC,SAAQ,GAAG,IAAI,CAACjE,kBAAkB,CAACuC,GAAG,CAACgE,aAAY,CAAC;MAE1D,OAAOtC,SAAQ;;IAGjB,IAAoBuC,QAAQ,GAA0BvE,SAAS,CAAvDC,UAAU;MAAsBuE,SAAS,GAAKxE,SAAS,CAAjCE,QAAQ;IAGtC,IACEK,SAAS,CAACgE,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,IACxCjE,SAAS,CAACgE,QAAQ,EAAEN,QAAQ,EAAEO,SAAS,CAAC,EACxC;MACA,OAAO,IAAI;KACZ,MAAM,IACLjE,SAAS,CAACgE,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,IACxC,CAACjE,SAAS,CAACgE,QAAQ,EAAEN,QAAQ,EAAEO,SAAS,CAAC,EACzC;MACAN,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACzF,YAAY,CAAC6F,GAAG,EAAE;KACxB,MAAM,IACL,CAAC9D,SAAS,CAACgE,QAAQ,EAAEP,QAAQ,EAAEQ,SAAS,CAAC,IACzCjE,SAAS,CAACgE,QAAQ,EAAEN,QAAQ,EAAEO,SAAS,CAAC,EACxC;MACAN,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAAC3F,YAAY,CAACgG,GAAG,EAAE;KACxB,MAAM,IAAIE,QAAQ,GAAGP,QAAQ,GAAGC,QAAQ,GAAGO,SAAS,EAAE;MAErDN,cAAc,GAAGF,QAAQ;MACzB,IAAI,CAAC3F,YAAY,CAACgG,GAAG,EAAE;KACxB,MAAM;MACLH,cAAc,GAAGD,QAAQ;MACzB,IAAI,CAACzF,YAAY,CAAC6F,GAAG,EAAE;;IAGzB,IAAMC,YAAY,GAAG,IAAI,CAACzG,eAAe,CAACyC,GAAG,CAAC4D,cAAc,CAAC;IAC7D,IAAMlC,QAAQ,GAAG,IAAI,CAACjE,kBAAkB,CAACuC,GAAG,CAACgE,YAAY,CAAC;IAE1D,OAAOtC,QAAQ;GAChB;EAAAzC,MAAA,CAEDkF,OAAO,GAAP,SAAAA;;IACE,IAAMC,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAACpH,UAAU,CAAC;IAC1C,KAAK,IAAI4C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGuE,OAAO,CAAC5E,MAAM,EAAEK,GAAG,EAAE,EAAE;MAC7C,IAAMC,IAAI,GAAG,IAAI,CAAClC,gBAAgB,CAACiC,GAAG,CAAC,IAAI,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,CAAC;MACxE,IAAMyE,WAAW,GAAG,IAAI,CAAC9D,YAAY,CAACV,IAAI,CAAC;MAC3CsE,OAAO,CAACvE,GAAG,CAAC,GAAGyE,WAAW;;IAS5B,IAAMC,IAAI,GAAG,IAAIF,KAAK,CAACD,OAAO,CAAC5E,MAAM,CAAC;IACtC,IAAMgF,UAAU,GAAG,EAAE;IACrB,IAAMC,cAAc,GAAG,IAAIjH,GAAG,EAAE;IAChC,IAAMkH,cAAc,GAAG,IAAIlH,GAAG,EAAE;IAChC,IAAM2E,iBAAiB,GAAG,IAAI3E,GAAG,EAAE;IAAC,IAAAmH,KAAA,YAAAA,QACW;MAC7C,IAAMC,YAAY,GAAGR,OAAO,CAACvE,IAAG,CAAC;MACjC,IAAMgF,WAAW,GAAGC,KAAI,CAAC1H,cAAc,CAACwH,YAAY,CAAC;MACrD,IAAIC,WAAW,IAAI,IAAI;MAEvBJ,cAAc,CAAC/D,GAAG,CAACkE,YAAY,EAAEC,WAAW,CAAC;MAC7CH,cAAc,CAAChE,GAAG,CAACmE,WAAW,EAAED,YAAY,CAAC;MAE7C,IAAIC,WAAW,KAAKC,KAAI,CAACpH,mBAAmB,CAACmC,IAAG,CAAC,EAAE;QACjD0E,IAAI,CAAC1E,IAAG,CAAC,GAAGgF,WAAW;QAAC;;MAG1B,IAAME,EAAE,GAAGD,KAAI,CAACpH,mBAAmB,CAACsH,SAAS,CAAC,UAAC1F,CAAC;QAAA,OAAKA,CAAC,KAAKuF,WAAW;QAAC;MACvE,IAAIE,EAAE,KAAK,CAAC,CAAC,EAAE;QACbR,IAAI,CAACQ,EAAE,CAAC,GAAGF,WAAW;QAAC;;MAIzBL,UAAU,CAAC/B,IAAI,CAACoC,WAAW,CAAC;KAC7B;IAnBD,KAAK,IAAIhF,IAAG,GAAG,CAAC,EAAEA,IAAG,GAAGuE,OAAO,CAAC5E,MAAM,EAAEK,IAAG,EAAE;MAAA,IAAAoF,IAAA,GAAAN,KAAA;MAAA,IAAAM,IAAA,iBAGlB;;IAkB3B,IAAAC,iBAAA,GAAqC,IAAI,CAAChF,UAAU,EAAE;MAA9CC,WAAW,GAAA+E,iBAAA,CAAX/E,WAAW;MAAEC,WAAW,GAAA8E,iBAAA,CAAX9E,WAAW;IAChC,IAAM+E,kBAAkB,GAAG,EAAE;IAE7B,KAAK,IAAIzD,QAAQ,GAAG,CAAC,EAAEA,QAAQ,GAAG0C,OAAO,CAAC5E,MAAM,EAAEkC,QAAQ,EAAE,EAAE;MAC5D,IAAMlF,KAAK,GAAG4H,OAAO,CAAC1C,QAAQ,CAAC;MAC/B,IAAI6C,IAAI,CAAC7C,QAAQ,CAAC,IAAI,IAAI,EAAE;QAC1ByD,kBAAkB,CAACzD,QAAQ,CAAC,GAAG6C,IAAI,CAAC7C,QAAQ,CAAC;QAC7CS,iBAAiB,CAACzB,GAAG,CAAC6D,IAAI,CAAC7C,QAAQ,CAAC,EAAEA,QAAQ,CAAC;QAC/C,IAAM0D,OAAO,GAAG;UAAE1D,QAAQ,EAARA,QAAQ;UAAElF,KAAK,EAALA;SAAO;QACnC2D,WAAW,CAACsC,IAAI,CAAC2C,OAAO,CAAC;QACzBhF,WAAW,CAACqC,IAAI,CAAC2C,OAAO,CAAC;QACzB;;MAEF,IAAMtF,KAAI,GAAG0E,UAAU,CAACa,KAAK,EAAE;MAC/B,IAAIvF,KAAI,IAAI,IAAI,EAAE;QAChBqF,kBAAkB,CAACzD,QAAQ,CAAC,GAAG5B,KAAI;QACnCqC,iBAAiB,CAACzB,GAAG,CAACZ,KAAI,EAAE4B,QAAQ,CAAC;QAErC,IAAM0D,QAAO,GAAG;UAAE1D,QAAQ,EAARA,QAAQ;UAAElF,KAAK,EAALA;SAAO;QACnC2D,WAAW,CAACsC,IAAI,CAAC2C,QAAO,CAAC;QACzBhF,WAAW,CAACqC,IAAI,CAAC2C,QAAO,CAAC;;;IAM7B,IAAI,CAAC1H,mBAAmB,GAAGyH,kBAAkB;IAC7C,IAAI,CAACpH,YAAY,GAAGoC,WAAW;IAC/B,IAAI,CAACjC,YAAY,GAAGkC,WAAW;IAC/B,IAAI,CAAC7C,eAAe,GAAGkH,cAAc;IACrC,IAAI,CAAC7D,qBAAqB,CAAC8D,cAAc,CAAC;IAC1C,IAAI,CAACjH,kBAAkB,GAAG0E,iBAAiB;IAC3C,IAAI,CAACvE,gBAAgB,GAAG,EAAE;IAE1B,IAAI;MACF,IAAMwG,QAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAACpH,UAAU,CAAC;MAC1C,KAAK,IAAI4C,KAAG,GAAG,CAAC,EAAEA,KAAG,GAAGuE,QAAO,CAAC5E,MAAM,EAAEK,KAAG,EAAE,EAAE;QAC7C,IAAMC,MAAI,GACR,IAAI,CAAClC,gBAAgB,CAACiC,KAAG,CAAC,IAAI,IAAI,CAACnC,mBAAmB,CAACmC,KAAG,CAAC;QAC7D,IAAMyE,YAAW,GAAG,IAAI,CAAC9D,YAAY,CAACV,MAAI,CAAC;QAC3C,IAAIA,MAAI,IAAI,IAAI,EAAE;UAChBsE,QAAO,CAACvE,KAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,MAAI;YACJwE,WAAW,EAAXA,YAAW;YACXgB,WAAW,EAAK,IAAI,CAAChI,KAAK,SAAIuC;WAC/B;;;MAGL,OAAOuE,QAAO;KACf,CAAC,OAAOmB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC9H,mBAAmB;;GAElC;EAAAuB,MAAA,CAGDwG,UAAU,GAAV,SAAAA;IACE,IAAI;MACF,IAAMrB,OAAO,GAAG,IAAIC,KAAK,CAAC,IAAI,CAACpH,UAAU,CAAC;MAC1C,KAAK,IAAI4C,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAGuE,OAAO,CAAC5E,MAAM,EAAEK,GAAG,EAAE,EAAE;QAC7C,IAAMC,IAAI,GACR,IAAI,CAAClC,gBAAgB,CAACiC,GAAG,CAAC,IAAI,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,CAAC;QAC7D,IAAMyE,WAAW,GAAG,IAAI,CAAC9D,YAAY,CAACV,IAAI,CAAC;QAE3C,IAAIA,IAAI,KAAK,IAAI,CAACQ,YAAY,CAACgE,WAAW,CAAC,EAAE;UAC3C,OAAO,IAAI,CAACH,OAAO,EAAE;;QAEvB,IAAIrE,IAAI,IAAI,IAAI,EAAE;UAChBsE,OAAO,CAACvE,GAAG,CAAC,GAAG;YACbC,IAAI,EAAJA,IAAI;YACJwE,WAAW,EAAXA,WAAW;YACXgB,WAAW,EAAK,IAAI,CAAChI,KAAK,SAAIuC;WAC/B;;;MAIL,IAAI,CAACjC,gBAAgB,GAAG,EAAE;MAE1B,OAAOwG,OAAO;KACf,CAAC,OAAOmB,GAAG,EAAE;MACZ,IAAI,CAACC,oBAAoB,EAAE;MAC3B,OAAO,IAAI,CAAC9H,mBAAmB;;GAElC;EAAAuB,MAAA,CAEDgC,YAAY,GAAZ,SAAAA,aAAaS,QAAgB,EAAElF,KAAa;IAC1C,IAAM4I,OAAO,GAAG;MAAE1D,QAAQ,EAARA,QAAQ;MAAElF,KAAK,EAALA;KAAO;IAEnC,IAAI,CAACuB,YAAY,CAAC0E,IAAI,CAAC2C,OAAO,CAAC;IAC/B,IAAI,CAAClH,YAAY,CAACuE,IAAI,CAAC2C,OAAO,CAAC;GAChC;EAAAnG,MAAA,CAEDkC,gBAAgB,GAAhB,SAAAA,iBAAiBrB,IAAU,EAAE4B,QAAgB;IAC3C,IAAMgE,kBAAkB,GAAG,IAAI,CAAChI,mBAAmB,CAACgE,QAAQ,CAAC;IAC7D,IAAIgE,kBAAkB,EAAE,IAAI,CAACjI,kBAAkB,UAAO,CAACiI,kBAAkB,CAAC;IAC1E,IAAI,CAAChI,mBAAmB,CAACgE,QAAQ,CAAC,GAAG5B,IAAI;IACzC,IAAI,CAACrC,kBAAkB,CAACiD,GAAG,CAACZ,IAAI,EAAE4B,QAAQ,CAAC;GAC5C;EAAAzC,MAAA,CAQDiC,aAAa,GAAb,SAAAA,cAAcpB,IAAU,EAAES,KAAa;IACrC,IAAMoF,aAAa,GAAG,IAAI,CAACnF,YAAY,CAACV,IAAI,CAAC;IAC7C,IAAI6F,aAAa,KAAK7E,SAAS,EAAE;MAG/B,IAAI,CAACvD,eAAe,UAAO,CAACoI,aAAa,CAAC;;IAE5C,IAAI,CAAClF,YAAY,CAACX,IAAI,EAAES,KAAK,CAAC;IAC9B,IAAI,CAAChD,eAAe,CAACmD,GAAG,CAACH,KAAK,EAAET,IAAI,CAAC;IACrC,OAAO,KAAK;GACb;EAAAb,MAAA,CAEDuG,oBAAoB,GAApB,SAAAA;IACE,IAAI,CAACxG,cAAc,GAAGF,IAAI,CAACC,GAAG,EAAE;GACjC;EAAAE,MAAA,CAEDgE,OAAO,GAAP,SAAAA;IACE,IAAI,IAAI,CAACpE,OAAO,KAAK,IAAI,CAACG,cAAc,EAAE;IAC1C,IAAI,CAACH,OAAO,GAAG,IAAI,CAACG,cAAc;IAElC,IAAI,CAACpB,gBAAgB,GAAG,EAAE;IAC1B,IAAI,CAAC2B,eAAe,GAAG,KAAK;GAI7B;EAAAN,MAAA,CAEDuE,WAAW,GAAX,SAAAA;IAGE,IAAI,CAACoC,UAAU,CAAC,IAAI,CAAC7H,YAAY,CAAC;IAClC,IAAI,CAAC6H,UAAU,CAAC,IAAI,CAAC1H,YAAY,CAAC;IAClC,IAAM2H,WAAW,GAAGhC,IAAI,CAACiC,GAAG,CAC1B,IAAI,CAAC/H,YAAY,CAACgI,IAAI,EAAE,EACxB,IAAI,CAAC7H,YAAY,CAAC6H,IAAI,EAAE,CACzB;IACD,IAAMC,WAAW,GAAGnC,IAAI,CAACoC,GAAG,CAC1B,IAAI,CAAClI,YAAY,CAACgI,IAAI,EAAE,EACxB,IAAI,CAAC7H,YAAY,CAAC6H,IAAI,EAAE,CACzB;IACD,IAAIC,WAAW,GAAG,EAAE,GAAGH,WAAW,EAAE;MAGlC,IAAI,CAACK,cAAc,EAAE;;GAExB;EAAAjH,MAAA,CAEDkH,sBAAsB,GAAtB,SAAAA,uBACEC,GAGE;IAEF,IAAM/F,qBAAqB,GAAG,EAAE;IAChC,IAAMgG,cAAc,GAAG,IAAIrI,IAAI,CAAW,EAAE,EAAE,IAAI,CAACC,kBAAkB,CAAC;IACtE,IAAMqI,cAAc,GAAG,IAAItI,IAAI,CAAW,EAAE,EAAE,IAAI,CAACG,kBAAkB,CAAC;IAEtEiI,GAAG,CAACG,OAAO,CAAC,UAACnB,OAAO;MAClB,IAAQ1D,QAAQ,GAAY0D,OAAO,CAA3B1D,QAAQ;QAAElF,KAAK,GAAK4I,OAAO,CAAjB5I,KAAK;MACvB,IAAIA,KAAK,KAAKsE,SAAS,EAAE;QACvB,IAAMsE,SAAO,GAAG;UACd1D,QAAQ,EAARA,QAAQ;UACRlF,KAAK,EAALA;SACD;QACD6J,cAAc,CAAC5D,IAAI,CAAC2C,SAAO,CAAC;QAC5BkB,cAAc,CAAC7D,IAAI,CAAC2C,SAAO,CAAC;QAC5B/E,qBAAqB,CAAC7D,KAAK,CAAC,GAAGkF,QAAQ;;KAE1C,CAAC;IACF,IAAM6C,IAAI,GAAG,IAAIF,KAAK,CAAC,IAAI,CAACvG,WAAW,CAAC,CAAC0I,IAAI,CAAC,CAAC,CAAC;IAChDC,MAAM,CAACC,IAAI,CAACrG,qBAAqB,CAAC,CAACsG,GAAG,CACpC,UAACC,GAAG;MAAA,OAAMrC,IAAI,CAAClE,qBAAqB,CAACuG,GAAG,CAAC,CAAC,GAAG,CAAC;KAAC,CAChD;IACDrC,IAAI,CAACgC,OAAO,CAAC,UAACxB,EAAE,EAAErD,QAAQ;MACxB,IAAIqD,EAAE,KAAK,CAAC,EAAE;QACZ,IAAMvI,KAAK,GAAGqK,MAAM,CAACC,gBAAgB,GAAGpF,QAAQ;QAChD,IAAM0D,OAAO,GAAG;UACd1D,QAAQ,EAARA,QAAQ;UACRlF,KAAK,EAALA;SACD;QAED6J,cAAc,CAAC5D,IAAI,CAAC2C,OAAO,CAAC;QAC5BkB,cAAc,CAAC7D,IAAI,CAAC2C,OAAO,CAAC;QAC5B/E,qBAAqB,CAAC7D,KAAK,CAAC,GAAGkF,QAAQ;;KAE1C,CAAC;IACF,IAAI,CAAC3D,YAAY,GAAGsI,cAAc;IAClC,IAAI,CAACnI,YAAY,GAAGoI,cAAc;GACnC;EAAArH,MAAA,CAyBDiH,cAAc,GAAd,SAAAA;IACE,IAAMa,UAAU,GACd,IAAI,CAAChJ,YAAY,CAACgI,IAAI,EAAE,GAAG,IAAI,CAAC7H,YAAY,CAAC6H,IAAI,EAAE,GAC/C,IAAI,CAAChI,YAAY,GACjB,IAAI,CAACG,YAAY;IACvB,IAAMmI,cAAc,GAAG,IAAIrI,IAAI,CAC7B,EAAE,EACF,IAAI,CAACC,kBAAkB,CACxB;IACD,IAAMqI,cAAc,GAAG,IAAItI,IAAI,CAC7B,EAAE,EACF,IAAI,CAACG,kBAAkB,CACxB;IACD,OAAO,CAAC4I,UAAU,CAACtD,KAAK,EAAE,EAAE;MAC1B,IAAM2B,OAAO,GAAG2B,UAAU,CAAChD,GAAG,EAAG;MAEjC,IACE,IAAI,CAACtG,kBAAkB,CAACuC,GAAG,CAAC,IAAI,CAACzC,eAAe,CAACyC,GAAG,CAACoF,OAAO,CAAC5I,KAAK,CAAC,CAAC,IACpE,IAAI,EACJ;QACA6J,cAAc,CAAC5D,IAAI,CAAC2C,OAAO,CAAC;QAC5BkB,cAAc,CAAC7D,IAAI,CAAC2C,OAAO,CAAC;;;IAGhC,IAAI,CAACrH,YAAY,GAAGsI,cAAc;IAClC,IAAI,CAACnI,YAAY,GAAGoI,cAAc;GACnC;EAAArH,MAAA,CAED2G,UAAU,GAAV,SAAAA,WAAWoB,IAAoB;IAC7B,OACE,CAACA,IAAI,CAACvD,KAAK,EAAE,IACb,IAAI,CAAChG,kBAAkB,CAACuC,GAAG,CACzB,IAAI,CAACzC,eAAe,CAACyC,GAAG,CAACgH,IAAI,CAAC1F,IAAI,EAAG,CAAC9E,KAAK,CAAC,CAC7C,IAAI,IAAI,EACT;MACAwK,IAAI,CAACjD,GAAG,EAAE;;GAEb;EAAA9E,MAAA,CAEDhB,kBAAkB,GAAlB,SAAAA,mBAAmBgJ,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACzK,KAAK,GAAG0K,GAAG,CAAC1K,KAAK;GAC7B;EAAAyC,MAAA,CAEDd,kBAAkB,GAAlB,SAAAA,mBAAmB8I,GAAa,EAAEC,GAAa;IAC7C,OAAOD,GAAG,CAACzK,KAAK,GAAG0K,GAAG,CAAC1K,KAAK;GAC7B;EAAA2K,YAAA,CAAAzK,gBAAA;IAAAkK,GAAA;IAAA5G,GAAA,EAzrBD,SAAAA;MACE,OAAO,IAAI,CAAClC,WAAW;;;IACxB8I,GAAA;IAAA5G,GAAA,EASD,SAAAA;MACE,OAAO,IAAI,CAACtC,mBAAmB,CAAC8B,MAAM,IAAI,IAAI,CAAC1B,WAAW;;;EAC3D,OAAApB,gBAAA;AAAA;;;;;"}

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

@@ -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,a=function(e){var t=e.safeRange,a=e.bufferSetRange;return t.lowValue-a.minValue>a.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)}var i,s,l=e.prototype;return l.getSize=function(){return this._size},l.getValuePosition=function(e){return void 0===this._valueToPositionMap[e]?null:this._valueToPositionMap[e]},l.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},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.replaceFurthestValuePosition=function(e,t,i,s){if(void 0===s&&(s=a),void 0!==this._valueToPositionMap[i]&&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;var l,o=this._smallValues.peek().value,r=this._largeValues.peek().value;if(o>=e&&r<=t)return null;s({safeRange:{lowValue:e,highValue:t},bufferSetRange:{minValue:o,maxValue:r},currentIndex:i})?(l=o,this._smallValues.pop()):(l=r,this._largeValues.pop());var u=this._valueToPositionMap[l];return delete this._valueToPositionMap[l],this._valueToPositionMap[i]=u,this._pushToHeaps(u,i),u},l._pushToHeaps=function(e,t){var a={position:e,value:t};this._smallValues.push(a),this._largeValues.push(a)},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,a=new t([],this._smallerComparator),i=new t([],this._greaterComparator);!e.empty();){var s=e.pop();void 0!==this._valueToPositionMap[s.value]&&(a.push(s),i.push(s))}this._smallValues=a,this._largeValues=i},l._cleanHeap=function(e){for(;!e.empty()&&void 0===this._valueToPositionMap[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},i=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 a=0;a<t.length;a++){var i=t[a];i.enumerable=i.enumerable||!1,i.configurable=!0,"value"in i&&(i.writable=!0),Object.defineProperty(e,"symbol"==typeof(s=function(e,t){if("object"!=typeof e||null===e)return e;var a=e[Symbol.toPrimitive];if(void 0!==a){var i=a.call(e,"string");if("object"!=typeof i)return i;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(i.key))?s:String(s),i)}var s}(i.prototype,s),Object.defineProperty(i,"prototype",{writable:!1}),e}();
+"use strict";function t(t){return t&&"object"==typeof t&&"default"in t?t.default:t}Object.defineProperty(exports,"__esModule",{value:!0});var e=t(require("@x-oasis/heap")),i=t(require("@x-oasis/is-clamped")),n=t(require("@x-oasis/invariant")),s=t(require("@x-oasis/return-hook"));function a(t,e){(null==e||e>t.length)&&(e=t.length);for(var i=0,n=new Array(e);i<e;i++)n[i]=t[i];return n}function r(t,e){var i="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(i)return(i=i.call(t)).next.bind(i);if(Array.isArray(t)||(i=function(t,e){if(t){if("string"==typeof t)return a(t,void 0);var i=Object.prototype.toString.call(t).slice(8,-1);return"Object"===i&&t.constructor&&(i=t.constructor.name),"Map"===i||"Set"===i?Array.from(t):"Arguments"===i||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(i)?a(t,void 0):void 0}}(t))||e&&t&&"number"==typeof t.length){i&&(t=i);var n=0;return function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var o=function(t){return t};exports.default=function(){function t(t){void 0===t&&(t={});var i=t.name,n=void 0===i?"default_buffer":i,a=t.indexExtractor,r=t.bufferSize,l=void 0===r?10:r,u=t.metaExtractor;this._metaExtractor=void 0===u?o:u,this._indexExtractor=a,this._name=n,this._indexToMetaMap=new Map,this._metaToPositionMap=new Map,this._positionToMetaList=[],this._metaToIndexMap=new Map,this._onTheFlyIndices=[],this._size=0,this._bufferSize=l,this._smallValues=new e([],this._smallerComparator),this._largeValues=new e([],this._greaterComparator),this.getNewPositionForIndex=this.getNewPositionForIndex.bind(this),this.getIndexPosition=this.getIndexPosition.bind(this),this.getSize=this.getSize.bind(this),this.replacePositionInFliedIndices=this.replacePositionInFliedIndices.bind(this),this.replaceFurthestIndexPosition=this.replaceFurthestIndexPosition.bind(this),this._isOnTheFlyFullReturnHook=s(this.setIsOnTheFlyFull.bind(this)),this._loopMS=Date.now(),this._lastUpdatedMS=this._loopMS}var a,l,u=t.prototype;return u.getSize=function(){return this._size},u.setIsOnTheFlyFull=function(t){if(null!=t){var e=this._onTheFlyIndices.filter((function(t){return t}));this._isOnTheFlyFull=e.length===this._bufferSize}},u.getOnTheFlyUncriticalPosition=function(t){for(var e=t.startIndex,n=t.endIndex,s=0;s<this._onTheFlyIndices.length;s++){var a=this._metaToIndexMap.get(this._onTheFlyIndices[s]);if(!i(e,a,n))return s}return null},u.initialize=function(){return{smallValues:new e([],this._smallerComparator),largeValues:new e([],this._greaterComparator),valueToPositionObject:{}}},u.getIndexMeta=function(t){return this._metaExtractor(t)},u.getMetaIndex=function(t){return this._indexExtractor?this._indexExtractor(t):this._metaToIndexMap.get(t)},u.setMetaIndex=function(t,e){return!this._indexExtractor&&this._metaToIndexMap.set(t,e)},u.deleteMetaIndex=function(t){return this._metaToIndexMap.delete(t)},u.replaceMetaToIndexMap=function(t){return!this._indexExtractor&&(this._metaToIndexMap=t)},u.getIndexPosition=function(t){return this.getMetaIndex(this.getIndexMeta(t))},u.getNewPositionForIndex=function(t){var e=this.getIndexMeta(t);void 0!==this._metaToPositionMap.get(e)&&n(!1);var i=this._positionToMetaList.length;return this._pushToHeaps(i,t),this._setMetaIndex(e,t),this._setMetaPosition(e,i),i},u.getMinValue=function(){var t;return null==(t=this._smallValues.peek())?void 0:t.value},u.getMaxValue=function(){var t;return null==(t=this._largeValues.peek())?void 0:t.value},u.setValuePosition=function(t,e){},u.findPositionMeta=function(t){for(var e,i=r(this._metaToPositionMap);!(e=i()).done;){var n=e.value;if(n[1]===t)return n[0]}return null},u.rebuildHeapsWithMeta=function(t){for(var e,i=this.initialize(),n=i.smallValues,s=i.largeValues,a=r(t);!(e=a()).done;){var o=e.value,l=o[1],u={index:this.getMetaIndex(o[0]),position:l};n.push(u),s.push(u)}this._smallValues=n,this._largeValues=s},u.setPositionIndex=function(t,e){var i=this._metaExtractor(e),n=this._metaToPositionMap.get(i);if(void 0!==n){if(n===t)return!0;this.deleteMetaIndex(i)}var s=this.findPositionMeta(t);return s&&this._metaToPositionMap.delete(s),this._metaToPositionMap.set(i,t),this.rebuildHeapsWithMeta(this._metaToPositionMap),!0},u.getMetaPosition=function(t){return this._metaToPositionMap.get(t)},u.replacePositionInFliedIndices=function(t,e){if(this._isOnTheFlyFull){if(!i(e.startIndex,t,e.endIndex))return null;var n=this.getOnTheFlyUncriticalPosition(e);if(null!=n)return n}return null},u.getFliedPosition=function(t,e){var i=this.replacePositionInFliedIndices(t,e);if(null!=i){var n=this.getIndexMeta(t);return this._onTheFlyIndices[i]=n,this._setMetaIndex(n,t),this._isOnTheFlyFullReturnHook(i)}return null},u.getPosition=function(t,e){this.prepare();var i,n=this.getIndexMeta(t),s=this._metaToPositionMap.get(n);if(void 0!==s){var a=this._onTheFlyIndices[s];if(a){if(a===n)return s;var r=this._replaceFurthestIndexPosition(t,e);if(this._isOnTheFlyFull)return this.getFliedPosition(t,e);for(;this._onTheFlyIndices[r];)r=this._replaceFurthestIndexPosition(t,e);if(null!=r)return this._setMetaIndex(n,t),this._onTheFlyIndices[r]=a,this._isOnTheFlyFullReturnHook(r)}return this._onTheFlyIndices[s]=n,this._isOnTheFlyFullReturnHook(s)}if(!this.isBufferFull)return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(t));if(this._isOnTheFlyFull)return this.getFliedPosition(t,e);var o=this._indexToMetaMap.get(t);return o?i=this._metaToPositionMap.get(o):(this._cleanHeaps(),i=this._replaceFurthestIndexPosition(t,e)),this._onTheFlyIndices[i]=n,this._setMetaIndex(n,t),this._setMetaPosition(n,i),this._isOnTheFlyFullReturnHook(i)},u.replaceFurthestIndexPosition=function(t,e){return this.isBufferFull?this._replaceFurthestIndexPosition(t,e):this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(t))},u._replaceFurthestIndexPosition=function(t,e){if(this._largeValues.empty()||this._smallValues.empty())return this._isOnTheFlyFullReturnHook(this.getNewPositionForIndex(t));var n,s=this._smallValues.peek().value,a=this._largeValues.peek().value;if(!e){Math.abs(t-s)>Math.abs(t-a)?(n=s,this._smallValues.pop()):(n=a,this._largeValues.pop());var r=this._indexToMetaMap.get(n);return this._metaToPositionMap.get(r)}var o=e.startIndex,l=e.endIndex;if(i(o,s,l)&&i(o,a,l))return null;i(o,s,l)&&!i(o,a,l)?(n=a,this._largeValues.pop()):!i(o,s,l)&&i(o,a,l)||o-s>a-l?(n=s,this._smallValues.pop()):(n=a,this._largeValues.pop());var u=this._indexToMetaMap.get(n);return this._metaToPositionMap.get(u)},u.shuffle=function(){for(var t=this,e=new Array(this.bufferSize),i=0;i<e.length;i++){var n=this.getMetaIndex(this._onTheFlyIndices[i]||this._positionToMetaList[i]);e[i]=n}for(var s=new Array(e.length),a=[],r=new Map,o=new Map,l=new Map,u=function(){var i=e[h],n=t._metaExtractor(i);if(null==n)return"continue";if(r.set(i,n),o.set(n,i),n===t._positionToMetaList[h])return s[h]=n,"continue";var l=t._positionToMetaList.findIndex((function(t){return t===n}));if(-1!==l)return s[l]=n,"continue";a.push(n)},h=0;h<e.length;h++)u();for(var p=this.initialize(),_=p.smallValues,d=p.largeValues,f=[],c=0;c<e.length;c++){var M=e[c];if(null==s[c]){var v=a.shift();if(null!=v){f[c]=v,l.set(v,c);var g={position:c,value:M};_.push(g),d.push(g)}}else{f[c]=s[c],l.set(s[c],c);var x={position:c,value:M};_.push(x),d.push(x)}}this._positionToMetaList=f,this._smallValues=_,this._largeValues=d,this._indexToMetaMap=r,this.replaceMetaToIndexMap(o),this._metaToPositionMap=l,this._onTheFlyIndices=[];try{for(var m=new Array(this.bufferSize),T=0;T<m.length;T++){var I=this._onTheFlyIndices[T]||this._positionToMetaList[T],y=this.getMetaIndex(I);null!=I&&(m[T]={meta:I,targetIndex:y,recyclerKey:this._name+"_"+T})}return m}catch(t){return this.readyToStartNextLoop(),this._positionToMetaList}},u.getIndices=function(){try{for(var t=new Array(this.bufferSize),e=0;e<t.length;e++){var i=this._onTheFlyIndices[e]||this._positionToMetaList[e],n=this.getMetaIndex(i);if(i!==this.getIndexMeta(n))return this.shuffle();null!=i&&(t[e]={meta:i,targetIndex:n,recyclerKey:this._name+"_"+e})}return this._onTheFlyIndices=[],t}catch(t){return this.readyToStartNextLoop(),this._positionToMetaList}},u._pushToHeaps=function(t,e){var i={position:t,value:e};this._smallValues.push(i),this._largeValues.push(i)},u._setMetaPosition=function(t,e){var i=this._positionToMetaList[e];i&&this._metaToPositionMap.delete(i),this._positionToMetaList[e]=t,this._metaToPositionMap.set(t,e)},u._setMetaIndex=function(t,e){var i=this.getMetaIndex(t);return void 0!==i&&this._indexToMetaMap.delete(i),this.setMetaIndex(t,e),this._indexToMetaMap.set(e,t),!1},u.readyToStartNextLoop=function(){this._lastUpdatedMS=Date.now()},u.prepare=function(){this._loopMS!==this._lastUpdatedMS&&(this._loopMS=this._lastUpdatedMS,this._onTheFlyIndices=[],this._isOnTheFlyFull=!1)},u._cleanHeaps=function(){this._cleanHeap(this._smallValues),this._cleanHeap(this._largeValues);var t=Math.min(this._smallValues.size(),this._largeValues.size());Math.max(this._smallValues.size(),this._largeValues.size())>10*t&&this._recreateHeaps()},u.rebuildHeapsWithValues=function(t){var i={},n=new e([],this._smallerComparator),s=new e([],this._greaterComparator);t.forEach((function(t){var e=t.position,a=t.value;if(void 0!==a){var r={position:e,value:a};n.push(r),s.push(r),i[a]=e}}));var a=new Array(this._bufferSize).fill(2);Object.keys(i).map((function(t){return a[i[t]]=1})),a.forEach((function(t,e){if(2===t){var a=Number.MAX_SAFE_INTEGER-e,r={position:e,value:a};n.push(r),s.push(r),i[a]=e}})),this._smallValues=n,this._largeValues=s},u._recreateHeaps=function(){for(var t=this._smallValues.size()<this._largeValues.size()?this._smallValues:this._largeValues,i=new e([],this._smallerComparator),n=new e([],this._greaterComparator);!t.empty();){var s=t.pop();null!=this._metaToPositionMap.get(this._indexToMetaMap.get(s.value))&&(i.push(s),n.push(s))}this._smallValues=i,this._largeValues=n},u._cleanHeap=function(t){for(;!t.empty()&&null==this._metaToPositionMap.get(this._indexToMetaMap.get(t.peek().value));)t.pop()},u._smallerComparator=function(t,e){return t.value<e.value},u._greaterComparator=function(t,e){return t.value>e.value},a=t,(l=[{key:"bufferSize",get:function(){return this._bufferSize}},{key:"isBufferFull",get:function(){return this._positionToMetaList.length>=this._bufferSize}}])&&function(t,e){for(var i=0;i<e.length;i++){var n=e[i];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,"symbol"==typeof(s=function(t,e){if("object"!=typeof t||null===t)return t;var i=t[Symbol.toPrimitive];if(void 0!==i){var n=i.call(t,"string");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(t)}(n.key))?s:String(s),n)}var s}(a.prototype,l),Object.defineProperty(a,"prototype",{writable:!1}),t}(),exports.defaultBufferSize=10;
 //# sourceMappingURL=integer-buffer-set.cjs.production.min.js.map

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

	@@ -1 +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\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\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 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 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 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","_proto","prototype","value","undefined","console","warn","newPosition","_pushToHeaps","getMinValue","_this$_smallValues$pe","peek","getMaxValue","_this$_largeValues$pe","newValue","useMinValueFn","_cleanHeaps","empty","valueToReplace","currentIndex","pop","position","element","push","_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,sCAwBlB,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,MAC1C,QAAAa,EAAAd,EAAAe,UAaA,OAbAD,EAEDF,QAAA,WACE,OAAOX,KAAKE,OACbW,EAWDH,iBAAA,SAAiBK,GACf,YAAwCC,IAApChB,KAAKC,oBAAoBc,GACpB,KAEFf,KAAKC,oBAAoBc,IACjCF,EAEDL,uBAAA,SAAuBO,QACmBC,IAApChB,KAAKC,oBAAoBc,IAC3BE,QAAQC,KACN,4EAOJ,IAAMC,EAAcnB,KAAKE,MAIzB,OAHAF,KAAKE,QACLF,KAAKoB,aAAaD,EAAaJ,GAC/Bf,KAAKC,oBAAoBc,GAASI,EAC3BA,GACRN,EAEDQ,YAAA,iBACE,cAAAC,EAAOtB,KAAKG,aAAaoB,eAAlBD,EAA0BP,OAClCF,EAEDW,YAAA,iBACE,cAAAC,EAAOzB,KAAKM,aAAaiB,eAAlBE,EAA0BV,OAClCF,EAEDD,6BAAA,SACEjB,EACAG,EACA4B,EACAC,GAyBA,YAzBAA,IAAAA,EAUgBpC,QAE2ByB,IAAvChB,KAAKC,oBAAoByB,IAC3BT,QAAQC,KACN,gFAUJlB,KAAK4B,cACD5B,KAAKG,aAAa0B,SAAW7B,KAAKM,aAAauB,QAGjD,OAAO,KAGT,IAOIC,EAPElC,EAAWI,KAAKG,aAAaoB,OAAQR,MACrClB,EAAWG,KAAKM,aAAaiB,OAAQR,MAC3C,GAAInB,GAAYD,GAAYE,GAAYC,EAEtC,OAAO,KAKP6B,EAAc,CACZlC,UAAW,CACTE,SAAAA,EACAG,UAAAA,GAEFJ,eAAgB,CACdE,SAAAA,EACAC,SAAAA,GAEFkC,aAAcL,KAKhBI,EAAiBlC,EACjBI,KAAKG,aAAa6B,QAElBF,EAAiBjC,EACjBG,KAAKM,aAAa0B,OAEpB,IAAMC,EAAWjC,KAAKC,oBAAoB6B,GAK1C,cAJO9B,KAAKC,oBAAoB6B,GAChC9B,KAAKC,oBAAoByB,GAAYO,EACrCjC,KAAKoB,aAAaa,EAAUP,GAErBO,GACRpB,EAEDO,aAAA,SAAaa,EAAkBlB,GAC7B,IAAMmB,EAAU,CACdD,SAAAA,EACAlB,MAAAA,GAGFf,KAAKG,aAAagC,KAAKD,GACvBlC,KAAKM,aAAa6B,KAAKD,IACxBrB,EAEDe,YAAA,WAGE5B,KAAKoC,WAAWpC,KAAKG,cACrBH,KAAKoC,WAAWpC,KAAKM,cACrB,IAAM+B,EAAcC,KAAKC,IACvBvC,KAAKG,aAAaqC,OAClBxC,KAAKM,aAAakC,QAEAF,KAAKG,IACvBzC,KAAKG,aAAaqC,OAClBxC,KAAKM,aAAakC,QAEF,GAAKH,GAGrBrC,KAAK0C,kBAER7B,EAED6B,eAAA,WAaE,IAZA,IAAMC,EACJ3C,KAAKG,aAAaqC,OAASxC,KAAKM,aAAakC,OACzCxC,KAAKG,aACLH,KAAKM,aACLsC,EAAiB,IAAIxC,EACzB,GACAJ,KAAKK,oBAEDwC,EAAiB,IAAIzC,EACzB,GACAJ,KAAKO,qBAECoC,EAAWd,SAAS,CAC1B,IAAMK,EAAUS,EAAWX,WAEqBhB,IAA5ChB,KAAKC,oBAAoBiC,EAAQnB,SACnC6B,EAAeT,KAAKD,GACpBW,EAAeV,KAAKD,IAGxBlC,KAAKG,aAAeyC,EACpB5C,KAAKM,aAAeuC,GACrBhC,EAEDuB,WAAA,SAAWU,GACT,MACGA,EAAKjB,cAC2Cb,IAAjDhB,KAAKC,oBAAoB6C,EAAKvB,OAAQR,QAEtC+B,EAAKd,OAERnB,EAEDR,mBAAA,SAAmB0C,EAAeC,GAChC,OAAOD,EAAIhC,MAAQiC,EAAIjC,OACxBF,EAEDN,mBAAA,SAAmBwC,EAAeC,GAChC,OAAOD,EAAIhC,MAAQiC,EAAIjC,SACxBhB,OAAAkD,cAAAC,IAvLD,WACE,IAAMC,EAAU,GAChB,IAAK,IAAMF,KAAOjD,KAAKC,oBAErBkD,EADcnD,KAAKC,oBAAoBgD,IACtBA,EAEnB,OAAOE,ogBACRpD"}
1	+ {"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 _size: number;\n private _name: string;\n private _bufferSize: number;\n // private _positionToValueObject: ValueToPositionObject;\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 // this._positionToValueObject = {};\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._size = 0;\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.getSize = this.getSize.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 getSize() {\n return this._size;\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 /\n values actually is the position of original data.\n /\n setValuePosition(value: number, position: number) {}\n\n findPositionMeta(position: number) {\n for (const [meta, pos] of this._metaToPositionMap) {\n if (pos === position) return meta;\n }\n return null;\n }\n\n rebuildHeapsWithMeta(metaToPositionMap: MetaToPositionMap<Meta>) {\n const { smallValues, largeValues } = this.initialize();\n\n for (const [meta, position] of metaToPositionMap) {\n const index = this.getMetaIndex(meta);\n const token = { index, position };\n smallValues.push(token);\n largeValues.push(token);\n }\n\n this._smallValues = smallValues;\n this._largeValues = largeValues;\n }\n\n /\n \n * @param position\n * @param value\n \n \n /\n setPositionIndex(position: number, index: number) {\n const meta = this._metaExtractor(index);\n const originalPosition = this._metaToPositionMap.get(meta);\n\n // current index has a position\n if (originalPosition !== undefined) {\n if (originalPosition === position) return true;\n this.deleteMetaIndex(meta);\n }\n\n const metaToReplace = this.findPositionMeta(position);\n if (metaToReplace) this._metaToPositionMap.delete(metaToReplace);\n this._metaToPositionMap.set(meta, position);\n\n this.rebuildHeapsWithMeta(this._metaToPositionMap);\n return true;\n }\n\n getMetaPosition(meta: Meta) {\n return this._metaToPositionMap.get(meta);\n }\n\n // performRangeUpdate(\n // startIndex: number,\n // endIndex: number,\n // safeRange: {\n // startIndex: number;\n // endIndex: number;\n // }\n // ) {\n // const _start = Math.max(startIndex, safeRange.startIndex);\n // const _end = Math.min(endIndex, safeRange.endIndex);\n // const primaryMetaList = [];\n // const secondaryMetaList = [];\n // const locationStartIndex = startIndex;\n // const targetIndices = new Array(this._bufferSize);\n\n // const _valueToPositionObject = {};\n // const _positionToValueObject = {};\n\n // const _valueToMetaObject = {};\n // const _metaToIndexMap = new Map();\n\n // for (let value = startIndex; value <= endIndex; value++) {\n // const meta = this._metaExtractor(value);\n // if (meta) {\n // const _i = value - locationStartIndex;\n // if (isClamped(value, safeRange.startIndex, safeRange.endIndex)) {\n // primaryMetaList[_i] = meta;\n // const targetIndex = this.getMetaPosition(meta);\n // if (isNumber(targetIndex)) {\n // targetIndices[targetIndex] = value;\n // _valueToPositionObject[value] = targetIndex;\n // _valueToMetaObject[value] = meta;\n // _metaToIndexMap.set(meta, value);\n // _positionToValueObject[targetIndex] = value;\n // }\n // } else {\n // secondaryMetaList[_i] = meta;\n // }\n // }\n // }\n\n // for (let idx = _start; idx <= _end; idx++) {\n // const meta = this._metaExtractor(idx);\n // if (_metaToIndexMap.get(meta) !== undefined) continue;\n // let p;\n // while (\n // (p =\n // targetIndices[\n // this.resolvePosition(safeRange.startIndex, safeRange.endIndex, idx)\n // ]) === undefined\n // ) {\n // targetIndices[p] = idx;\n // }\n // }\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 // console.log('this. fly ', this._isOnTheFlyFull)\n if (this._isOnTheFlyFull) return this.getFliedPosition(newIndex, safeRange);\n\n let positionToReplace;\n const prevIndexMeta = this._indexToMetaMap.get(newIndex);\n // console.log('this. is ', this.isBufferFull, prevIndexMeta);\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 // console.log('mxa ', maxValue, minValue);\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 // console.log(\n // 'position xxx ',\n // this._positionToMetaList,\n // this._onTheFlyIndices\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 // console.log('position ', positionToMetaList, largeValues.peek().value);\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 const len = this._positionToMetaList.length;\n\n for (let index = 0; index < len; index++) {}\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 rebuildHeapsWithValues(\n arr: Array<{\n position: number;\n value: number;\n }>\n ) {\n const valueToPositionObject = {};\n const newSmallValues = new Heap<HeapItem>([], this._smallerComparator);\n const newLargeValues = new Heap<HeapItem>([], this._greaterComparator);\n\n arr.forEach((element) => {\n const { position, value } = element;\n if (value !== undefined) {\n const element = {\n position,\n value,\n };\n newSmallValues.push(element);\n newLargeValues.push(element);\n valueToPositionObject[value] = position;\n }\n });\n const _arr = new Array(this._bufferSize).fill(2);\n Object.keys(valueToPositionObject).map(\n (key) => (_arr[valueToPositionObject[key]] = 1)\n );\n _arr.forEach((_i, position) => {\n if (_i === 2) {\n const value = Number.MAX_SAFE_INTEGER - position;\n const element = {\n position,\n value,\n };\n\n newSmallValues.push(element);\n newLargeValues.push(element);\n valueToPositionObject[value] = position;\n }\n });\n this._smallValues = newSmallValues;\n this._largeValues = newLargeValues;\n }\n\n // rebuildHeaps() {\n // const valueToPositionObject = {};\n // const newSmallValues = new Heap<HeapItem>([], this._smallerComparator);\n // const newLargeValues = new Heap<HeapItem>([], this._greaterComparator);\n\n // const keys = Object.keys(this._positionToValueObject);\n // for (let position = 0; position < keys.length; position++) {\n // const value = this._positionToValueObject[position];\n // if (value !== undefined) {\n // const element = {\n // position,\n // value,\n // };\n // valueToPositionObject[value] = position;\n // newSmallValues.push(element);\n // newLargeValues.push(element);\n // }\n // }\n\n // this._smallValues = newSmallValues;\n // this._largeValues = newLargeValues;\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","_size","_bufferSize","_smallValues","Heap","_smallerComparator","_largeValues","_greaterComparator","getNewPositionForIndex","bind","getIndexPosition","getSize","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","setValuePosition","position","findPositionMeta","_step","_iterator","_createForOfIteratorHelperLoose","done","_step$value","rebuildHeapsWithMeta","metaToPositionMap","_step2","_this$initialize","_iterator2","_step2$value","token","push","setPositionIndex","originalPosition","metaToReplace","getMetaPosition","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","_loop","currentIndex","currentMeta","_this","_i","findIndex","_this$initialize2","positionToMetaList","shift","element","recyclerKey","err","readyToStartNextLoop","getIndices","prevMetaOnPosition","prevMetaIndex","_cleanHeap","minHeapSize","min","size","max","_recreateHeaps","rebuildHeapsWithValues","arr","newSmallValues","newLargeValues","forEach","fill","Object","keys","map","key","Number","MAX_SAFE_INTEGER","sourceHeap","heap","lhs","rhs"],"mappings":"wlCAeA,IAAMA,EAAuB,SAACC,GAAK,OAAKA,8BA4CtC,SAAAC,EAAYC,YAAAA,IAAAA,EAAqC,IAC/C,IAKSC,EAALD,EAJFE,KAAAA,WAAID,EAAG,iBAAgBA,EACvBE,EAGEH,EAHFG,eAAcC,EAGZJ,EAFFK,WAAAA,WAAUD,EA/CiB,GA+CGA,EAAAE,EAE5BN,EADFO,cAEFC,KAAKC,wBAFUH,EAAGT,EAAoBS,EAGtCE,KAAKE,gBAAkBP,EAEvBK,KAAKG,MAAQT,EAMbM,KAAKI,gBAAkB,IAAIC,IAC3BL,KAAKM,mBAAqB,IAAID,IAC9BL,KAAKO,oBAAsB,GAC3BP,KAAKQ,gBAAkB,IAAIH,IAC3BL,KAAKS,iBAAmB,GAExBT,KAAKU,MAAQ,EACbV,KAAKW,YAAcd,EAEnBG,KAAKY,aAAe,IAAIC,EAAK,GAAIb,KAAKc,oBACtCd,KAAKe,aAAe,IAAIF,EAAK,GAAIb,KAAKgB,oBAEtChB,KAAKiB,uBAAyBjB,KAAKiB,uBAAuBC,KAAKlB,MAC/DA,KAAKmB,iBAAmBnB,KAAKmB,iBAAiBD,KAAKlB,MACnDA,KAAKoB,QAAUpB,KAAKoB,QAAQF,KAAKlB,MACjCA,KAAKqB,8BACHrB,KAAKqB,8BAA8BH,KAAKlB,MAC1CA,KAAKsB,6BACHtB,KAAKsB,6BAA6BJ,KAAKlB,MACzCA,KAAKuB,0BAA4BC,EAC/BxB,KAAKyB,kBAAkBP,KAAKlB,OAG9BA,KAAK0B,QAAUC,KAAKC,MACpB5B,KAAK6B,eAAiB7B,KAAK0B,QAC5B,QAAAI,EAAAvC,EAAAwC,UAmBA,OAnBAD,EAEDV,QAAA,WACE,OAAOpB,KAAKU,OACboB,EAMDL,kBAAA,SAAkBO,GAChB,GAAW,MAAPA,EAAa,CACf,IAAMC,EAAOjC,KAAKS,iBAAiByB,QAAO,SAACC,GAAC,OAAKA,KACjDnC,KAAKoC,gBAAkBH,EAAKI,SAAWrC,KAAKW,cAE/CmB,EAMDQ,8BAAA,SAA8BC,GAE5B,IADA,IAAQC,EAAyBD,EAAzBC,WAAYC,EAAaF,EAAbE,SACXC,EAAM,EAAGA,EAAM1C,KAAKS,iBAAiB4B,OAAQK,IAAO,CAC3D,IACMC,EAAY3C,KAAKQ,gBAAgBoC,IAD1B5C,KAAKS,iBAAiBiC,IAEnC,IAAKG,EAAUL,EAAYG,EAAWF,GACpC,OAAOC,EAGX,OAAO,MACRZ,EAEDgB,WAAA,WACE,MAAO,CACLC,YAAa,IAAIlC,EAAK,GAAIb,KAAKc,oBAC/BkC,YAAa,IAAInC,EAAK,GAAIb,KAAKgB,oBAC/BiC,sBAAuB,KAE1BnB,EAEDoB,aAAA,SAAaC,GACX,OAAOnD,KAAKC,eAAekD,IAC5BrB,EAEDsB,aAAA,SAAaC,GACX,OAAIrD,KAAKE,gBAAwBF,KAAKE,gBAAgBmD,GAC/CrD,KAAKQ,gBAAgBoC,IAAIS,IACjCvB,EAEDwB,aAAA,SAAaD,EAAYF,GACvB,OAAKnD,KAAKE,iBACDF,KAAKQ,gBAAgB+C,IAAIF,EAAMF,IAGzCrB,EAED0B,gBAAA,SAAgBH,GACd,OAAOrD,KAAKQ,uBAAuB6C,IACpCvB,EAED2B,sBAAA,SAAsBC,GACpB,OAAK1D,KAAKE,kBACAF,KAAKQ,gBAAkBkD,IAGlC5B,EAEDX,iBAAA,SAAiBgC,GACf,OAAOnD,KAAKoD,aAAapD,KAAKkD,aAAaC,KAC5CrB,EAEDb,uBAAA,SAAuBkC,GACrB,IAAME,EAAOrD,KAAKkD,aAAaC,QAESQ,IAAtC3D,KAAKM,mBAAmBsC,IAAIS,IAD9BO,MAIA,IAAMC,EAAc7D,KAAKO,oBAAoB8B,OAM7C,OAJArC,KAAK8D,aAAaD,EAAaV,GAC/BnD,KAAK+D,cAAcV,EAAMF,GACzBnD,KAAKgE,iBAAiBX,EAAMQ,GAErBA,GACR/B,EAEDmC,YAAA,iBACE,cAAAC,EAAOlE,KAAKY,aAAauD,eAAlBD,EAA0B5E,OAClCwC,EAEDsC,YAAA,iBACE,cAAAC,EAAOrE,KAAKe,aAAaoD,eAAlBE,EAA0B/E,OAClCwC,EAKDwC,iBAAA,SAAiBhF,EAAeiF,KAAoBzC,EAEpD0C,iBAAA,SAAiBD,GACf,QAAiDE,EAAjDC,EAAAC,EAA0B3E,KAAKM,sBAAkBmE,EAAAC,KAAAE,MAAE,CAAA,IAAAC,EAAAJ,EAAAnF,MACjD,GADmBuF,OACPN,EAAU,OADRM,KAGhB,OAAO,MACR/C,EAEDgD,qBAAA,SAAqBC,GAGnB,IAFA,IAEgDC,EAFhDC,EAAqCjF,KAAK8C,aAAlCC,EAAWkC,EAAXlC,YAAaC,EAAWiC,EAAXjC,YAErBkC,EAAAP,EAA+BI,KAAiBC,EAAAE,KAAAN,MAAE,CAAA,IAAAO,EAAAH,EAAA1F,MAAhCiF,EAAQY,KAElBC,EAAQ,CAAEjC,MADFnD,KAAKoD,aADL+B,MAESZ,SAAAA,GACvBxB,EAAYsC,KAAKD,GACjBpC,EAAYqC,KAAKD,GAGnBpF,KAAKY,aAAemC,EACpB/C,KAAKe,aAAeiC,GACrBlB,EASDwD,iBAAA,SAAiBf,EAAkBpB,GACjC,IAAME,EAAOrD,KAAKC,eAAekD,GAC3BoC,EAAmBvF,KAAKM,mBAAmBsC,IAAIS,GAGrD,QAAyBM,IAArB4B,EAAgC,CAClC,GAAIA,IAAqBhB,EAAU,OAAO,EAC1CvE,KAAKwD,gBAAgBH,GAGvB,IAAMmC,EAAgBxF,KAAKwE,iBAAiBD,GAK5C,OAJIiB,GAAexF,KAAKM,0BAA0BkF,GAClDxF,KAAKM,mBAAmBiD,IAAIF,EAAMkB,GAElCvE,KAAK8E,qBAAqB9E,KAAKM,qBACxB,GACRwB,EAED2D,gBAAA,SAAgBpC,GACd,OAAOrD,KAAKM,mBAAmBsC,IAAIS,IACpCvB,EA0DDT,8BAAA,SAA8BqE,EAAkBnD,GAG9C,GAAIvC,KAAKoC,gBAAiB,CAExB,IAAKS,EAJ0BN,EAAzBC,WAIqBkD,EAJInD,EAAbE,UAKhB,OAAO,KAIT,IAAMkD,EAAM3F,KAAKsC,8BAA8BC,GAC/C,GAAW,MAAPoD,EAAa,OAAOA,EAE1B,OAAO,MACR7D,EAED8D,iBAAA,SAAiBF,EAAkBnD,GACjC,IAAMoD,EAAM3F,KAAKqB,8BAA8BqE,EAAUnD,GACzD,GAAW,MAAPoD,EAAa,CACf,IAAMtC,EAAOrD,KAAKkD,aAAawC,GAG/B,OAFA1F,KAAKS,iBAAiBkF,GAAOtC,EAC7BrD,KAAK+D,cAAcV,EAAMqC,GAClB1F,KAAKuB,0BAA0BoE,GAExC,OAAO,MACR7D,EAWD+D,YAAA,SAAYH,EAAkBnD,GAC5BvC,KAAK8F,UACL,IA4CIC,EA5CE1C,EAAOrD,KAAKkD,aAAawC,GACzBM,EAAmBhG,KAAKM,mBAAmBsC,IAAIS,GAErD,QAAyBM,IAArBqC,EAAgC,CAClC,IAAMC,EAAuBjG,KAAKS,iBAAiBuF,GAEnD,GAAIC,EAAsB,CAExB,GAAIA,IAAyB5C,EAC3B,OAAO2C,EAET,IAAID,EAAoB/F,KAAKkG,8BAC3BR,EACAnD,GAEF,GAAIvC,KAAKoC,gBACP,OAAOpC,KAAK4F,iBAAiBF,EAAUnD,GAEzC,KAAOvC,KAAKS,iBAAiBsF,IAC3BA,EAAoB/F,KAAKkG,8BACvBR,EACAnD,GAIJ,GAAyB,MAArBwD,EAGF,OAFA/F,KAAK+D,cAAcV,EAAMqC,GACzB1F,KAAKS,iBAAiBsF,GAAqBE,EACpCjG,KAAKuB,0BAA0BwE,GAI1C,OADA/F,KAAKS,iBAAiBuF,GAAoB3C,EACnCrD,KAAKuB,0BAA0ByE,GAIxC,IAAKhG,KAAKmG,aACR,OAAOnG,KAAKuB,0BACVvB,KAAKiB,uBAAuByE,IAIhC,GAAI1F,KAAKoC,gBAAiB,OAAOpC,KAAK4F,iBAAiBF,EAAUnD,GAGjE,IAAM6D,EAAgBpG,KAAKI,gBAAgBwC,IAAI8C,GAuB/C,OAhBKU,EAOHL,EAAoB/F,KAAKM,mBAAmBsC,IAAIwD,IANhDpG,KAAKqG,cACLN,EAAoB/F,KAAKkG,8BACvBR,EACAnD,IAMJvC,KAAKS,iBAAiBsF,GAAqB1C,EAC3CrD,KAAK+D,cAAcV,EAAMqC,GACzB1F,KAAKgE,iBAAiBX,EAAM0C,GAIrB/F,KAAKuB,0BAA0BwE,IACvCjE,EAEDR,6BAAA,SACEoE,EACAnD,GAKA,OAAKvC,KAAKmG,aAMHnG,KAAKkG,8BAA8BR,EAAUnD,GAL3CvC,KAAKuB,0BACVvB,KAAKiB,uBAAuByE,KAKjC5D,EAEDoE,8BAAA,SACER,EACAnD,GAKA,GAAIvC,KAAKe,aAAauF,SAAWtG,KAAKY,aAAa0F,QACjD,OAAOtG,KAAKuB,0BACVvB,KAAKiB,uBAAuByE,IAIhC,IAIIa,EAJEC,EAAWxG,KAAKY,aAAauD,OAAQ7E,MACrCmH,EAAWzG,KAAKe,aAAaoD,OAAQ7E,MAK3C,IAAKiD,EAAW,CAEVmE,KAAKC,IAAIjB,EAAWc,GAAYE,KAAKC,IAAIjB,EAAWe,IACtDF,EAAiBC,EACjBxG,KAAKY,aAAagG,QAElBL,EAAiBE,EACjBzG,KAAKe,aAAa6F,OAEpB,IAAMC,EAAe7G,KAAKI,gBAAgBwC,IAAI2D,GAG9C,OAFiBvG,KAAKM,mBAAmBsC,IAAIiE,GAK/C,IAAoBC,EAAkCvE,EAA9CC,WAAgCuE,EAAcxE,EAAxBE,SAG9B,GACEI,EAAUiE,EAAUN,EAAUO,IAC9BlE,EAAUiE,EAAUL,EAAUM,GAE9B,OAAO,KAEPlE,EAAUiE,EAAUN,EAAUO,KAC7BlE,EAAUiE,EAAUL,EAAUM,IAE/BR,EAAiBE,EACjBzG,KAAKe,aAAa6F,QAEjB/D,EAAUiE,EAAUN,EAAUO,IAC/BlE,EAAUiE,EAAUL,EAAUM,IAIrBD,EAAWN,EAAWC,EAAWM,GAF1CR,EAAiBC,EACjBxG,KAAKY,aAAagG,QAMlBL,EAAiBE,EACjBzG,KAAKe,aAAa6F,OAGpB,IAAMC,EAAe7G,KAAKI,gBAAgBwC,IAAI2D,GAG9C,OAFiBvG,KAAKM,mBAAmBsC,IAAIiE,IAG9C/E,EAEDkF,QAAA,WAEE,eADMC,EAAU,IAAIC,MAAMlH,KAAKH,YACtB6C,EAAM,EAAGA,EAAMuE,EAAQ5E,OAAQK,IAAO,CAC7C,IACMyE,EAAcnH,KAAKoD,aADZpD,KAAKS,iBAAiBiC,IAAQ1C,KAAKO,oBAAoBmC,IAEpEuE,EAAQvE,GAAOyE,EAcjB,IALA,IAAMC,EAAO,IAAIF,MAAMD,EAAQ5E,QACzBgF,EAAa,GACbC,EAAiB,IAAIjH,IACrBkH,EAAiB,IAAIlH,IACrB0E,EAAoB,IAAI1E,IAAMmH,aAElC,IAAMC,EAAeR,EAAQvE,GACvBgF,EAAcC,EAAK1H,eAAewH,GACxC,GAAmB,MAAfC,mBAKJ,GAHAJ,EAAe/D,IAAIkE,EAAcC,GACjCH,EAAehE,IAAImE,EAAaD,GAE5BC,IAAgBC,EAAKpH,oBAAoBmC,GACnB,OAAxB0E,EAAK1E,GAAOgF,aAGd,IAAME,EAAKD,EAAKpH,oBAAoBsH,WAAU,SAAC1F,GAAC,OAAKA,IAAMuF,KAC3D,IAAY,IAARE,EACqB,OAAvBR,EAAKQ,GAAMF,aAIbL,EAAWhC,KAAKqC,IAlBThF,EAAM,EAAGA,EAAMuE,EAAQ5E,OAAQK,IAAK8E,IAwB7C,IAHA,IAAAM,EAAqC9H,KAAK8C,aAAlCC,EAAW+E,EAAX/E,YAAaC,EAAW8E,EAAX9E,YACf+E,EAAqB,GAElBxD,EAAW,EAAGA,EAAW0C,EAAQ5E,OAAQkC,IAAY,CAC5D,IAAMjF,EAAQ2H,EAAQ1C,GACtB,GAAsB,MAAlB6C,EAAK7C,GAAT,CAQA,IAAMlB,EAAOgE,EAAWW,QACxB,GAAY,MAAR3E,EAAc,CAChB0E,EAAmBxD,GAAYlB,EAC/B0B,EAAkBxB,IAAIF,EAAMkB,GAE5B,IAAM0D,EAAU,CAAE1D,SAAAA,EAAUjF,MAAAA,GAC5ByD,EAAYsC,KAAK4C,GACjBjF,EAAYqC,KAAK4C,QAfnB,CACEF,EAAmBxD,GAAY6C,EAAK7C,GACpCQ,EAAkBxB,IAAI6D,EAAK7C,GAAWA,GACtC,IAAM0D,EAAU,CAAE1D,SAAAA,EAAUjF,MAAAA,GAC5ByD,EAAYsC,KAAK4C,GACjBjF,EAAYqC,KAAK4C,IAgBrBjI,KAAKO,oBAAsBwH,EAC3B/H,KAAKY,aAAemC,EACpB/C,KAAKe,aAAeiC,EACpBhD,KAAKI,gBAAkBkH,EACvBtH,KAAKyD,sBAAsB8D,GAC3BvH,KAAKM,mBAAqByE,EAC1B/E,KAAKS,iBAAmB,GAExB,IAEE,IADA,IAAMwG,EAAU,IAAIC,MAAMlH,KAAKH,YACtB6C,EAAM,EAAGA,EAAMuE,EAAQ5E,OAAQK,IAAO,CAC7C,IAAMW,EACJrD,KAAKS,iBAAiBiC,IAAQ1C,KAAKO,oBAAoBmC,GACnDyE,EAAcnH,KAAKoD,aAAaC,GAC1B,MAARA,IACF4D,EAAQvE,GAAO,CACbW,KAAAA,EACA8D,YAAAA,EACAe,YAAgBlI,KAAKG,UAASuC,IAIpC,OAAOuE,EACP,MAAOkB,GAEP,OADAnI,KAAKoI,uBACEpI,KAAKO,sBAEfuB,EAGDuG,WAAA,WACE,IAEE,IADA,IAAMpB,EAAU,IAAIC,MAAMlH,KAAKH,YACtB6C,EAAM,EAAGA,EAAMuE,EAAQ5E,OAAQK,IAAO,CAC7C,IAAMW,EACJrD,KAAKS,iBAAiBiC,IAAQ1C,KAAKO,oBAAoBmC,GACnDyE,EAAcnH,KAAKoD,aAAaC,GAEtC,GAAIA,IAASrD,KAAKkD,aAAaiE,GAC7B,OAAOnH,KAAKgH,UAEF,MAAR3D,IACF4D,EAAQvE,GAAO,CACbW,KAAAA,EACA8D,YAAAA,EACAe,YAAgBlI,KAAKG,UAASuC,IAOpC,OAFA1C,KAAKS,iBAAmB,GAEjBwG,EACP,MAAOkB,GAEP,OADAnI,KAAKoI,uBACEpI,KAAKO,sBAEfuB,EAEDgC,aAAA,SAAaS,EAAkBjF,GAC7B,IAAM2I,EAAU,CAAE1D,SAAAA,EAAUjF,MAAAA,GAE5BU,KAAKY,aAAayE,KAAK4C,GACvBjI,KAAKe,aAAasE,KAAK4C,IACxBnG,EAEDkC,iBAAA,SAAiBX,EAAYkB,GAC3B,IAAM+D,EAAqBtI,KAAKO,oBAAoBgE,GAChD+D,GAAoBtI,KAAKM,0BAA0BgI,GACvDtI,KAAKO,oBAAoBgE,GAAYlB,EACrCrD,KAAKM,mBAAmBiD,IAAIF,EAAMkB,IACnCzC,EAQDiC,cAAA,SAAcV,EAAYF,GACxB,IAAMoF,EAAgBvI,KAAKoD,aAAaC,GAQxC,YAPsBM,IAAlB4E,GAGFvI,KAAKI,uBAAuBmI,GAE9BvI,KAAKsD,aAAaD,EAAMF,GACxBnD,KAAKI,gBAAgBmD,IAAIJ,EAAOE,IACzB,GACRvB,EAEDsG,qBAAA,WACEpI,KAAK6B,eAAiBF,KAAKC,OAC5BE,EAEDgE,QAAA,WACM9F,KAAK0B,UAAY1B,KAAK6B,iBAC1B7B,KAAK0B,QAAU1B,KAAK6B,eAEpB7B,KAAKS,iBAAmB,GACxBT,KAAKoC,iBAAkB,IAIxBN,EAEDuE,YAAA,WAGErG,KAAKwI,WAAWxI,KAAKY,cACrBZ,KAAKwI,WAAWxI,KAAKe,cACrB,IAAM0H,EAAc/B,KAAKgC,IACvB1I,KAAKY,aAAa+H,OAClB3I,KAAKe,aAAa4H,QAEAjC,KAAKkC,IACvB5I,KAAKY,aAAa+H,OAClB3I,KAAKe,aAAa4H,QAEF,GAAKF,GAGrBzI,KAAK6I,kBAER/G,EAEDgH,uBAAA,SACEC,GAKA,IAAM9F,EAAwB,GACxB+F,EAAiB,IAAInI,EAAe,GAAIb,KAAKc,oBAC7CmI,EAAiB,IAAIpI,EAAe,GAAIb,KAAKgB,oBAEnD+H,EAAIG,SAAQ,SAACjB,GACX,IAAQ1D,EAAoB0D,EAApB1D,SAAUjF,EAAU2I,EAAV3I,MAClB,QAAcqE,IAAVrE,EAAqB,CACvB,IAAM2I,EAAU,CACd1D,SAAAA,EACAjF,MAAAA,GAEF0J,EAAe3D,KAAK4C,GACpBgB,EAAe5D,KAAK4C,GACpBhF,EAAsB3D,GAASiF,MAGnC,IAAM6C,EAAO,IAAIF,MAAMlH,KAAKW,aAAawI,KAAK,GAC9CC,OAAOC,KAAKpG,GAAuBqG,KACjC,SAACC,GAAG,OAAMnC,EAAKnE,EAAsBsG,IAAQ,KAE/CnC,EAAK8B,SAAQ,SAACtB,EAAIrD,GAChB,GAAW,IAAPqD,EAAU,CACZ,IAAMtI,EAAQkK,OAAOC,iBAAmBlF,EAClC0D,EAAU,CACd1D,SAAAA,EACAjF,MAAAA,GAGF0J,EAAe3D,KAAK4C,GACpBgB,EAAe5D,KAAK4C,GACpBhF,EAAsB3D,GAASiF,MAGnCvE,KAAKY,aAAeoI,EACpBhJ,KAAKe,aAAekI,GACrBnH,EAyBD+G,eAAA,WAaE,IAZA,IAAMa,EACJ1J,KAAKY,aAAa+H,OAAS3I,KAAKe,aAAa4H,OACzC3I,KAAKY,aACLZ,KAAKe,aACLiI,EAAiB,IAAInI,EACzB,GACAb,KAAKc,oBAEDmI,EAAiB,IAAIpI,EACzB,GACAb,KAAKgB,qBAEC0I,EAAWpD,SAAS,CAC1B,IAAM2B,EAAUyB,EAAW9C,MAIzB,MADA5G,KAAKM,mBAAmBsC,IAAI5C,KAAKI,gBAAgBwC,IAAIqF,EAAQ3I,UAG7D0J,EAAe3D,KAAK4C,GACpBgB,EAAe5D,KAAK4C,IAGxBjI,KAAKY,aAAeoI,EACpBhJ,KAAKe,aAAekI,GACrBnH,EAED0G,WAAA,SAAWmB,GACT,MACGA,EAAKrD,SAGD,MAFLtG,KAAKM,mBAAmBsC,IACtB5C,KAAKI,gBAAgBwC,IAAI+G,EAAKxF,OAAQ7E,SAGxCqK,EAAK/C,OAER9E,EAEDhB,mBAAA,SAAmB8I,EAAeC,GAChC,OAAOD,EAAItK,MAAQuK,EAAIvK,OACxBwC,EAEDd,mBAAA,SAAmB4I,EAAeC,GAChC,OAAOD,EAAItK,MAAQuK,EAAIvK,SACxBC,OAAAgK,iBAAA3G,IAzrBD,WACE,OAAO5C,KAAKW,eACb4I,mBAAA3G,IASD,WACE,OAAO5C,KAAKO,oBAAoB8B,QAAUrC,KAAKW,8gBAChDpB,+BAvG8B"}