@x-oasis/prefix-interval-tree 0.5.0 → 0.7.0

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 (5) hide show
  1. package/dist/prefix-interval-tree.cjs.development.js.map +1 -1
  2. package/dist/prefix-interval-tree.cjs.production.min.js.map +1 -1
  3. package/dist/prefix-interval-tree.esm.js.map +1 -1
  4. package/package.json +1 -1
  5. package/src/index.ts +2 -6
package/dist/prefix-interval-tree.cjs.development.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"prefix-interval-tree.cjs.development.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: {\n [key: string]: Operation;\n } = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: {\n [key: string]: number;\n } = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","onUpdateIntervalTree","_onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","hasRemoveItem","some","_this3","itemLength","reflowTimes","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":";;;;AAAA,IAAMA,MAAM,GAAG,SAATA,MAAMA,CAAIC,IAAY;EAAA,OAAKC,IAAI,CAACC,KAAK,CAACF,IAAI,GAAG,CAAC,CAAC;AAAA;AAErD,IAAMG,WAAW,GAAG,SAAdA,WAAWA,CAAaC,IAAY;EACxC,IAAMC,EAAE,GAAG,EAAE;EACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;IAClCD,EAAE,CAACC,CAAC,CAAC,GAAG,CAAC;;EAEX,OAAOD,EAAE;AACX,CAAC;AAKD,SAASE,QAAQA,CAACC,CAAS;EACzB,IAAIC,CAAC,GAAG,CAAC;EACT,OAAOA,CAAC,GAAGD,CAAC,EAAE;IACZC,CAAC,IAAI,CAAC;;EAGR,OAAOA,CAAC;AACV;AAAC,IAuBKC,kBAAkB;EAsBtB,SAAAA,mBACEL,IACAM,IAGC;QAJDN;MAAAA,KAAwB,EAAE;;IATpB,wBAAmB,GAEvB,EAAE;IACE,0BAAqB,GAAWO,SAAS;IACzC,0BAAqB,GAEzB,EAAE;IASJ,IAAI,OAAOP,EAAE,KAAK,QAAQ,EAAE,IAAI,CAACQ,cAAc,CAACR,EAAE,CAAC;IACnD,IAAIS,KAAK,CAACC,OAAO,CAACV,EAAE,CAAC,EAAE,IAAI,CAACW,aAAa,CAACX,EAAE,CAAC;IAE7C,IAAAY,IAAA,GAAqDN,IAAI,IAAI,EAAE;MAAvDO,kBAAkB,GAAAD,IAAA,CAAlBC,kBAAkB;MAAEC,oBAAoB,GAAAF,IAAA,CAApBE,oBAAoB;IAChD,IAAI,CAACC,qBAAqB,GAAGD,oBAAoB;IACjD,IAAI,CAACE,mBAAmB,GAAGH,kBAAkB;;EAC9C,IAAAI,MAAA,GAAAZ,kBAAA,CAAAa,SAAA;EAAAD,MAAA,CAEDT,cAAc,GAAd,SAAAA,eAAeW,MAAc;IAC3B,IAAI,CAACC,KAAK,GAAGlB,QAAQ,CAACiB,MAAM,CAAC;IAC7B,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAI,CAACG,WAAW,GAAG,CAAC;GACrB;EAAAN,MAAA,CAEDN,aAAa,GAAb,SAAAA,cAAca,GAAa;IACzB,IAAI,CAACJ,KAAK,GAAGlB,QAAQ,CAACsB,GAAG,CAACL,MAAM,CAAC;IACjC,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAInB,CAAC;IACL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAE,EAAEpB,CAAC,EAAE;MAC/B,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,GAAGuB,GAAG,CAACvB,CAAC,CAAC;;IAGrC,KAAKA,CAAC,GAAG,IAAI,CAACmB,KAAK,GAAG,CAAC,EAAEnB,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACnC,IAAI,CAACqB,KAAK,CAACrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,GAAG,CAAC,CAAC;;IAE3D,IAAI,CAACsB,WAAW,GAAGC,GAAG,CAACL,MAAM;GAC9B;EAAAd,kBAAA,CAEMoB,OAAO,GAAd,SAAAA,QAAe1B,IAAY,EAAE2B,YAAoB;IAC/C,IAAM1B,EAAE,GAAG,EAAE;IACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;MAClCD,EAAE,CAACC,CAAC,CAAC,GAAGyB,YAAY;;IAGtB,OAAO,IAAIrB,kBAAkB,CAACL,EAAE,CAAC;GAClC;EAAAK,kBAAA,CAEMsB,KAAK,GAAZ,SAAAA,MAAa5B,IAAY;IACvB,OAAOM,kBAAkB,CAACoB,OAAO,CAAC1B,IAAI,EAAE,CAAC,CAAC;GAC3C;EAAAkB,MAAA,CAMDW,OAAO,GAAP,SAAAA;IACE,IAAMC,QAAQ,GAAG/B,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAChD,IAAMU,YAAY,GAAG,IAAI,CAACV,KAAK,GAAG,CAAC;IAGnC,KAAK,IAAInB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAEpB,CAAC,EAAE,EAAE;MACnC4B,QAAQ,CAACC,YAAY,GAAG7B,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,IAAI,CAAC;;IAI9D,KAAK,IAAIA,EAAC,GAAG6B,YAAY,GAAG,CAAC,EAAE7B,EAAC,GAAG,CAAC,EAAEA,EAAC,EAAE,EAAE;MACzC4B,QAAQ,CAAC5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,GAAG,CAAC,CAAC;;IAGrD,IAAI,CAACmB,KAAK,GAAGU,YAAY;IACzB,IAAI,CAACT,KAAK,GAAGS,YAAY;IACzB,IAAI,CAACR,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDc,QAAQ,GAAR,SAAAA,SAASC,KAAa;IACpB,YAAUA,KAAK;GAChB;EAAAf,MAAA,CAEDgB,eAAe,GAAf,SAAAA,gBAAgBC,GAAW;IACzB,OAAOC,QAAQ,CAACD,GAAG,EAAE,EAAE,CAAC;GACzB;EAAAjB,MAAA,CAEDmB,YAAY,GAAZ,SAAAA,aAAaJ,KAAa;IACxB,OAAO,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,IAAI,CAAC,IAAIA,KAAK,GAAG,IAAI,CAACT,WAAW;GAC3E;EAAAN,MAAA,CAEDoB,kBAAkB,GAAlB,SAAAA,mBAAmBL,KAAa;IAC9B,IAAI,CAACM,aAAa,EAAE;IACpB,IAAI3C,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAE7BrC,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC;IACnB,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,GAAG,CAAC,CAAC;;GAErE;EAAAsB,MAAA,CAGDsB,UAAU,GAAV,SAAAA,WAAWC,WAAmB,EAAEC,QAAQ;;QAARA,QAAQ;MAARA,QAAQ,GAAG,IAAI,CAACrB,KAAK,GAAG,CAAC,GAAG,CAAC;;IAC3D,IAAI,CAACkB,aAAa,EAAE;IACpB,IAAMI,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;IACnC,IAAMuB,UAAU,GAAGJ,WAAW,GAAG,IAAI,CAACpB,KAAK;IAE3CX,KAAK,CAACoC,IAAI,CAAC;MAAE1B,MAAM,EAAEuB;KAAO,EAAE,UAACI,CAAC,EAAE7C,CAAC;MAAA,OAAKA,CAAC;MAAC,CAAC8C,MAAM,CAC/C,UAACC,GAAG;MACF,IAAQJ,UAAU,GAAeI,GAAG,CAA5BJ,UAAU;QAAEH,QAAQ,GAAKO,GAAG,CAAhBP,QAAQ;MAC5B,IAAMQ,UAAU,GAAGvD,MAAM,CAACkD,UAAU,CAAC;MACrC,IAAMM,QAAQ,GAAGxD,MAAM,CAAC+C,QAAQ,CAAC;MAEjC,KAAK,IAAIU,GAAG,GAAGF,UAAU,EAAEE,GAAG,IAAID,QAAQ,EAAEC,GAAG,EAAE,EAAE;QACjDC,KAAI,CAAC9B,KAAK,CAAC6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,GAAG,CAAC,CAAC;;MAGjE,OAAO;QACLP,UAAU,EAAEK,UAAU;QACtBR,QAAQ,EAAES;OACX;KACF,EACD;MACEN,UAAU,EAAVA,UAAU;MACVH,QAAQ,EAARA;KACD,CACF;GACF;EAAAxB,MAAA,CASDoC,SAAS,GAAT,SAAAA,UAAUrB,KAAa;IACrB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAI,CAAClC,KAAK,CAACmC,MAAM,CAAC,IAAI,CAACrC,KAAK,GAAGY,KAAK,EAAE,CAAC,CAAC;IACxC,IAAI,CAACV,KAAK,CAACoC,IAAI,CAAC,CAAC,CAAC;IAClB,IAAI,CAACnC,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IAEvC,IAAI,CAACoC,qBAAqB,CAAC3B,KAAK,EAAE,QAAQ,CAAC;GAC5C;EAAAf,MAAA,CAED2C,MAAM,GAAN,SAAAA,OAAO5B,KAAa;IAGlB,IAAI,CAAC6B,aAAa,CAAC,CAAC7B,KAAK,CAAC,CAAC;GAC5B;EAAAf,MAAA,CAED4C,aAAa,GAAb,SAAAA,cAAcC,OAAiB;;IAC7BA,OAAO,CAACC,IAAI,CAAC,UAACC,CAAC,EAAEC,CAAC;MAAA,OAAKD,CAAC,GAAGC,CAAC;MAAC;IAE7BH,OAAO,CAACI,OAAO,CAAC,UAAClC,KAAK;MAAA,OAAKmC,MAAI,CAACd,SAAS,CAACrB,KAAK,CAAC;MAAC;IAEjD,IAAI,CAACO,UAAU,CAACuB,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAChD,oBAAoB,EAAE;IAE3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,KAAK,IAAImC,GAAG,GAAGW,OAAO,CAAC,CAAC,CAAC,EAAEX,GAAG,GAAG,IAAI,CAAC/B,KAAK,EAAE+B,GAAG,EAAE,EAAE;QAClD,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,EAAE,IAAI,CAACiB,GAAG,CAACjB,GAAG,CAAC,CAAC;;;GAGjD;EAAAlC,MAAA,CAEDoD,QAAQ,GAAR,SAAAA,SAASrC,KAAa;IAEpB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAM3B,QAAQ,GAAG/B,WAAW,CAAC,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAC5C,IAAMkD,IAAI,GAAG,IAAI,CAAChD,KAAK,CAACiD,KAAK,CAAC,IAAI,CAACnD,KAAK,CAAC;IACzCkD,IAAI,CAACb,MAAM,CAACzB,KAAK,EAAE,CAAC,CAAC;IAErB,KAAK,IAAIA,MAAK,GAAG,IAAI,CAACZ,KAAK,EAAEY,MAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,MAAK,EAAE,EAAE;MAC5DH,QAAQ,CAACG,MAAK,CAAC,GAAGsC,IAAI,CAACtC,MAAK,GAAG,IAAI,CAACZ,KAAK,CAAC,IAAI,CAAC;;IAGjD,KAAK,IAAIY,OAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,OAAK,GAAG,CAAC,EAAEA,OAAK,EAAE,EAAE;MACnDH,QAAQ,CAACG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,GAAG,CAAC,CAAC;;IAGjE,IAAI,CAACT,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IACvC,IAAI,CAACD,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDqB,aAAa,GAAb,SAAAA;IACE,IAAI,CAACkC,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,qBAAqB,GAAGlE,SAAS;GACvC;EAAAU,MAAA,CAED0C,qBAAqB,GAArB,SAAAA,sBAAsB3B,KAAa,EAAE0C,IAAmB,EAAEC,KAAc;IACtE,IAAI,OAAO3C,KAAK,KAAK,QAAQ,EAAE;MAC7B,IAAI,CAACyC,qBAAqB,GACxB,OAAO,IAAI,CAACA,qBAAqB,KAAK,QAAQ,GAC1C7E,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACH,qBAAqB,EAAEzC,KAAK,CAAC,GAC3CA,KAAK;MACX,IAAI,CAACwC,mBAAmB,CAAC,IAAI,CAACzC,QAAQ,CAACC,KAAK,CAAC,CAAC,GAAG;QAC/C2C,KAAK,EAALA,KAAK;QACLD,IAAI,EAAJA;OACD;;GAEJ;EAAAzD,MAAA,CAEDH,oBAAoB,GAApB,SAAAA;IAEE,IAAI,CAAC+D,qBAAqB,GAAG,EAAE;IAE/B,IAAI,OAAO,IAAI,CAAC9D,qBAAqB,KAAK,UAAU,EAAE;MACpD,IAAI,CAACA,qBAAqB,CAAC,IAAI,CAACO,KAAK,CAAC;;GAEzC;EAAAL,MAAA,CAED6D,MAAM,GAAN,SAAAA,OAAO9C,KAAa,EAAE2C,KAAa;IACjC,IAAI,OAAO3C,KAAK,KAAK,QAAQ,IAAIA,KAAK,GAAG,CAAC,EAAE,OAAO,KAAK;IACxD,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D,OAAO,KAAK;;IAGd,OAAOxB,KAAK,IAAI,IAAI,CAACZ,KAAK,EAAE;MAC1B,IAAI,CAACQ,OAAO,EAAE;;IAGhB,IAAMjC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC,GAAGgF,KAAK;IAExB,IAAI,CAAChB,qBAAqB,CAAC3B,KAAK,EAAE,KAAK,EAAE2C,KAAK,CAAC;IAE/C,IAAI3C,KAAK,GAAG,CAAC,GAAG,IAAI,CAACT,WAAW,EAAE;MAChC,IAAI,CAACA,WAAW,GAAGS,KAAK,GAAG,CAAC;;IAE9B,OAAO,IAAI;GACZ;EAAAf,MAAA,CAED8D,GAAG,GAAH,SAAAA,IAAI/C,KAAa,EAAE2C,KAAa;IAC9B,IAAI,CAACG,MAAM,CAAC9C,KAAK,EAAE2C,KAAK,CAAC;IACzB,IAAI,CAACtC,kBAAkB,CAACL,KAAK,CAAC;IAC9B,IAAI,CAAClB,oBAAoB,EAAE;IAC3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,IAAI,CAACA,mBAAmB,CAACgB,KAAK,EAAE2C,KAAK,CAAC;;IAExC,OAAO,IAAI;GACZ;EAAA1D,MAAA,CAED+D,WAAW,GAAX,SAAAA;;IACE,IAAI,OAAO,IAAI,CAACP,qBAAqB,KAAK,QAAQ,EAAE;MAClD,IAAMzC,KAAK,GAAG,IAAI,CAACyC,qBAAqB;MAExC,IAAMQ,IAAI,GAAGC,MAAM,CAACD,IAAI,CAAC,IAAI,CAACT,mBAAmB,CAAC;MAClD,IAAMW,aAAa,GAAGF,IAAI,CAACG,IAAI,CAC7B,UAAClD,GAAG;QAAA,OAAKmD,MAAI,CAACb,mBAAmB,CAACtC,GAAG,CAAC,CAACwC,IAAI,KAAK,QAAQ;QACzD;MAED,IAAIS,aAAa,EAAE;QACjB,OAAO,IAAI,CAAC5C,UAAU,CAACP,KAAK,CAAC;;MAG/B,IAAMU,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;MACnC,IAAMiE,UAAU,GAAGL,IAAI,CAAC9D,MAAM;MAE9B,IAAMoE,WAAW,GAAG,IAAI,CAACnE,KAAK,GAAGY,KAAK,GAAG,CAAC;MAE1C,IAAIU,KAAK,GAAG4C,UAAU,GAAGC,WAAW,EAAE;QACpC,OAAO,IAAI,CAAChD,UAAU,CAACP,KAAK,CAAC;;MAG/BiD,IAAI,CAACf,OAAO,CAAC,UAAChC,GAAG;QAAA,OAAKmD,MAAI,CAAChD,kBAAkB,CAACgD,MAAI,CAACpD,eAAe,CAACC,GAAG,CAAC,CAAC;QAAC;MAEzE,IAAI,CAACpB,oBAAoB,EAAE;MAE3B,IAAI,CAACwB,aAAa,EAAE;;GAEvB;EAAArB,MAAA,CAEDuE,kBAAkB,GAAlB,SAAAA;IACE,OAAO,IAAI,CAACC,aAAa,EAAE;GAC5B;EAAAxE,MAAA,CAEDwE,aAAa,GAAb,SAAAA;IACE,OAAO,IAAI,CAAClE,WAAW;GACxB;EAAAN,MAAA,CAEDmD,GAAG,GAAH,SAAAA,IAAIpC,KAAa;IAEf,IAAMrC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,OAAO,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC;GACxB;EAAAsB,MAAA,CAEDyE,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACrE,KAAK;GAClB;EAAAJ,MAAA,CAED0E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK;GAClB;EAAAH,MAAA,CAED2E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACtE,KAAK;GAClB;EAAAL,MAAA,CAED4E,WAAW,GAAX,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK,CAAC,CAAC,CAAC;GACrB;EAAAL,MAAA,CAMD6E,QAAQ,GAAR,SAAAA,SAASC,GAAW;IAGlB,IAAI,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG,IAAI,IAAI,EAC9C,OAAO,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG;IAC7C,IAAIA,GAAG,IAAI,CAAC,EAAE;MACZ,OAAO,CAAC;;IAGV,IAAIpG,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAG2E,GAAG,GAAG,CAAC;IAC/B,IAAIC,GAAG,GAAG,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,CAAC;IAE1B,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAIA,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;QAClBqG,GAAG,IAAI,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,GAAG,CAAC,CAAC;;;IAI/B,OAAOqG,GAAG;GACX;EAAA/E,MAAA,CAKDgF,KAAK,GAAL,SAAAA,MAAMC,YAAoB;IAMxB,OAAO,IAAI,CAACJ,QAAQ,CAACI,YAAY,GAAG,CAAC,CAAC;GACvC;EAAAjF,MAAA,CAMD+E,GAAG,GAAH,SAAAA,IAAIG,KAAa,EAAEJ,GAAW;IAE5B,OAAO,IAAI,CAACD,QAAQ,CAACC,GAAG,CAAC,GAAG,IAAI,CAACD,QAAQ,CAACK,KAAK,CAAC;GACjD;EAAAlF,MAAA,CAMDmF,kBAAkB,GAAlB,SAAAA,mBAAmBC,CAAS;IAC1B,IAAIA,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC9B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MAExB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,GAAGC,OAAO,EAAE;QACf3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAMDsF,wBAAwB,GAAxB,SAAAA,yBAAyBF,CAAS;IAChC,IAAIA,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC/B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MACxB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,IAAIC,OAAO,EAAE;QAChB3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAgBDuF,YAAY,GAAZ,SAAAA,aAAaC,SAAiB,EAAEC,SAAiB;IAC/C,IAAI,IAAI,CAACd,OAAO,EAAE,CAAC,CAAC,CAAC,GAAGa,SAAS,EAAE;MACjC,OAAO;QACL7D,UAAU,EAAE,IAAI,CAACrB,WAAW;QAC5BkB,QAAQ,EAAE,IAAI,CAAClB;OAChB;;IAGH,OAAO;MAELqB,UAAU,EAAE,IAAI,CAACwD,kBAAkB,CAACK,SAAS,CAAC;MAG9ChE,QAAQ,EAAE,IAAI,CAACkE,qBAAqB,CAACD,SAAS;KAC/C;GACF;EAAAzF,MAAA,CAMD2F,eAAe,GAAf,SAAAA,gBAAgBP,CAAS;IACvB,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAAC2B,wBAAwB,CAACF,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GACxE;EAAAN,MAAA,CAMD0F,qBAAqB,GAArB,SAAAA,sBAAsBN,CAAS;IAC7B,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACwB,kBAAkB,CAACC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GAClE;EAAA,OAAAlB,kBAAA;AAAA;;;;"}
1
+ {"version":3,"file":"prefix-interval-tree.cjs.development.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: Record<string, Operation> = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: Record<string, number> = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","onUpdateIntervalTree","_onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","hasRemoveItem","some","_this3","itemLength","reflowTimes","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":";;;;AAAA,IAAMA,MAAM,GAAG,SAATA,MAAMA,CAAIC,IAAY;EAAA,OAAKC,IAAI,CAACC,KAAK,CAACF,IAAI,GAAG,CAAC,CAAC;AAAA;AAErD,IAAMG,WAAW,GAAG,SAAdA,WAAWA,CAAaC,IAAY;EACxC,IAAMC,EAAE,GAAG,EAAE;EACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;IAClCD,EAAE,CAACC,CAAC,CAAC,GAAG,CAAC;;EAEX,OAAOD,EAAE;AACX,CAAC;AAKD,SAASE,QAAQA,CAACC,CAAS;EACzB,IAAIC,CAAC,GAAG,CAAC;EACT,OAAOA,CAAC,GAAGD,CAAC,EAAE;IACZC,CAAC,IAAI,CAAC;;EAGR,OAAOA,CAAC;AACV;AAAC,IAuBKC,kBAAkB;EAkBtB,SAAAA,mBACEL,IACAM,IAGC;QAJDN;MAAAA,KAAwB,EAAE;;IALpB,wBAAmB,GAA8B,EAAE;IACnD,0BAAqB,GAAWO,SAAS;IACzC,0BAAqB,GAA2B,EAAE;IASxD,IAAI,OAAOP,EAAE,KAAK,QAAQ,EAAE,IAAI,CAACQ,cAAc,CAACR,EAAE,CAAC;IACnD,IAAIS,KAAK,CAACC,OAAO,CAACV,EAAE,CAAC,EAAE,IAAI,CAACW,aAAa,CAACX,EAAE,CAAC;IAE7C,IAAAY,IAAA,GAAqDN,IAAI,IAAI,EAAE;MAAvDO,kBAAkB,GAAAD,IAAA,CAAlBC,kBAAkB;MAAEC,oBAAoB,GAAAF,IAAA,CAApBE,oBAAoB;IAChD,IAAI,CAACC,qBAAqB,GAAGD,oBAAoB;IACjD,IAAI,CAACE,mBAAmB,GAAGH,kBAAkB;;EAC9C,IAAAI,MAAA,GAAAZ,kBAAA,CAAAa,SAAA;EAAAD,MAAA,CAEDT,cAAc,GAAd,SAAAA,eAAeW,MAAc;IAC3B,IAAI,CAACC,KAAK,GAAGlB,QAAQ,CAACiB,MAAM,CAAC;IAC7B,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAI,CAACG,WAAW,GAAG,CAAC;GACrB;EAAAN,MAAA,CAEDN,aAAa,GAAb,SAAAA,cAAca,GAAa;IACzB,IAAI,CAACJ,KAAK,GAAGlB,QAAQ,CAACsB,GAAG,CAACL,MAAM,CAAC;IACjC,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAInB,CAAC;IACL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAE,EAAEpB,CAAC,EAAE;MAC/B,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,GAAGuB,GAAG,CAACvB,CAAC,CAAC;;IAGrC,KAAKA,CAAC,GAAG,IAAI,CAACmB,KAAK,GAAG,CAAC,EAAEnB,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACnC,IAAI,CAACqB,KAAK,CAACrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,GAAG,CAAC,CAAC;;IAE3D,IAAI,CAACsB,WAAW,GAAGC,GAAG,CAACL,MAAM;GAC9B;EAAAd,kBAAA,CAEMoB,OAAO,GAAd,SAAAA,QAAe1B,IAAY,EAAE2B,YAAoB;IAC/C,IAAM1B,EAAE,GAAG,EAAE;IACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;MAClCD,EAAE,CAACC,CAAC,CAAC,GAAGyB,YAAY;;IAGtB,OAAO,IAAIrB,kBAAkB,CAACL,EAAE,CAAC;GAClC;EAAAK,kBAAA,CAEMsB,KAAK,GAAZ,SAAAA,MAAa5B,IAAY;IACvB,OAAOM,kBAAkB,CAACoB,OAAO,CAAC1B,IAAI,EAAE,CAAC,CAAC;GAC3C;EAAAkB,MAAA,CAMDW,OAAO,GAAP,SAAAA;IACE,IAAMC,QAAQ,GAAG/B,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAChD,IAAMU,YAAY,GAAG,IAAI,CAACV,KAAK,GAAG,CAAC;IAGnC,KAAK,IAAInB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAEpB,CAAC,EAAE,EAAE;MACnC4B,QAAQ,CAACC,YAAY,GAAG7B,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,IAAI,CAAC;;IAI9D,KAAK,IAAIA,EAAC,GAAG6B,YAAY,GAAG,CAAC,EAAE7B,EAAC,GAAG,CAAC,EAAEA,EAAC,EAAE,EAAE;MACzC4B,QAAQ,CAAC5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,GAAG,CAAC,CAAC;;IAGrD,IAAI,CAACmB,KAAK,GAAGU,YAAY;IACzB,IAAI,CAACT,KAAK,GAAGS,YAAY;IACzB,IAAI,CAACR,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDc,QAAQ,GAAR,SAAAA,SAASC,KAAa;IACpB,YAAUA,KAAK;GAChB;EAAAf,MAAA,CAEDgB,eAAe,GAAf,SAAAA,gBAAgBC,GAAW;IACzB,OAAOC,QAAQ,CAACD,GAAG,EAAE,EAAE,CAAC;GACzB;EAAAjB,MAAA,CAEDmB,YAAY,GAAZ,SAAAA,aAAaJ,KAAa;IACxB,OAAO,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,IAAI,CAAC,IAAIA,KAAK,GAAG,IAAI,CAACT,WAAW;GAC3E;EAAAN,MAAA,CAEDoB,kBAAkB,GAAlB,SAAAA,mBAAmBL,KAAa;IAC9B,IAAI,CAACM,aAAa,EAAE;IACpB,IAAI3C,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAE7BrC,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC;IACnB,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,GAAG,CAAC,CAAC;;GAErE;EAAAsB,MAAA,CAGDsB,UAAU,GAAV,SAAAA,WAAWC,WAAmB,EAAEC,QAAQ;;QAARA,QAAQ;MAARA,QAAQ,GAAG,IAAI,CAACrB,KAAK,GAAG,CAAC,GAAG,CAAC;;IAC3D,IAAI,CAACkB,aAAa,EAAE;IACpB,IAAMI,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;IACnC,IAAMuB,UAAU,GAAGJ,WAAW,GAAG,IAAI,CAACpB,KAAK;IAE3CX,KAAK,CAACoC,IAAI,CAAC;MAAE1B,MAAM,EAAEuB;KAAO,EAAE,UAACI,CAAC,EAAE7C,CAAC;MAAA,OAAKA,CAAC;MAAC,CAAC8C,MAAM,CAC/C,UAACC,GAAG;MACF,IAAQJ,UAAU,GAAeI,GAAG,CAA5BJ,UAAU;QAAEH,QAAQ,GAAKO,GAAG,CAAhBP,QAAQ;MAC5B,IAAMQ,UAAU,GAAGvD,MAAM,CAACkD,UAAU,CAAC;MACrC,IAAMM,QAAQ,GAAGxD,MAAM,CAAC+C,QAAQ,CAAC;MAEjC,KAAK,IAAIU,GAAG,GAAGF,UAAU,EAAEE,GAAG,IAAID,QAAQ,EAAEC,GAAG,EAAE,EAAE;QACjDC,KAAI,CAAC9B,KAAK,CAAC6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,GAAG,CAAC,CAAC;;MAGjE,OAAO;QACLP,UAAU,EAAEK,UAAU;QACtBR,QAAQ,EAAES;OACX;KACF,EACD;MACEN,UAAU,EAAVA,UAAU;MACVH,QAAQ,EAARA;KACD,CACF;GACF;EAAAxB,MAAA,CASDoC,SAAS,GAAT,SAAAA,UAAUrB,KAAa;IACrB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAI,CAAClC,KAAK,CAACmC,MAAM,CAAC,IAAI,CAACrC,KAAK,GAAGY,KAAK,EAAE,CAAC,CAAC;IACxC,IAAI,CAACV,KAAK,CAACoC,IAAI,CAAC,CAAC,CAAC;IAClB,IAAI,CAACnC,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IAEvC,IAAI,CAACoC,qBAAqB,CAAC3B,KAAK,EAAE,QAAQ,CAAC;GAC5C;EAAAf,MAAA,CAED2C,MAAM,GAAN,SAAAA,OAAO5B,KAAa;IAGlB,IAAI,CAAC6B,aAAa,CAAC,CAAC7B,KAAK,CAAC,CAAC;GAC5B;EAAAf,MAAA,CAED4C,aAAa,GAAb,SAAAA,cAAcC,OAAiB;;IAC7BA,OAAO,CAACC,IAAI,CAAC,UAACC,CAAC,EAAEC,CAAC;MAAA,OAAKD,CAAC,GAAGC,CAAC;MAAC;IAE7BH,OAAO,CAACI,OAAO,CAAC,UAAClC,KAAK;MAAA,OAAKmC,MAAI,CAACd,SAAS,CAACrB,KAAK,CAAC;MAAC;IAEjD,IAAI,CAACO,UAAU,CAACuB,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAChD,oBAAoB,EAAE;IAE3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,KAAK,IAAImC,GAAG,GAAGW,OAAO,CAAC,CAAC,CAAC,EAAEX,GAAG,GAAG,IAAI,CAAC/B,KAAK,EAAE+B,GAAG,EAAE,EAAE;QAClD,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,EAAE,IAAI,CAACiB,GAAG,CAACjB,GAAG,CAAC,CAAC;;;GAGjD;EAAAlC,MAAA,CAEDoD,QAAQ,GAAR,SAAAA,SAASrC,KAAa;IAEpB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAM3B,QAAQ,GAAG/B,WAAW,CAAC,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAC5C,IAAMkD,IAAI,GAAG,IAAI,CAAChD,KAAK,CAACiD,KAAK,CAAC,IAAI,CAACnD,KAAK,CAAC;IACzCkD,IAAI,CAACb,MAAM,CAACzB,KAAK,EAAE,CAAC,CAAC;IAErB,KAAK,IAAIA,MAAK,GAAG,IAAI,CAACZ,KAAK,EAAEY,MAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,MAAK,EAAE,EAAE;MAC5DH,QAAQ,CAACG,MAAK,CAAC,GAAGsC,IAAI,CAACtC,MAAK,GAAG,IAAI,CAACZ,KAAK,CAAC,IAAI,CAAC;;IAGjD,KAAK,IAAIY,OAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,OAAK,GAAG,CAAC,EAAEA,OAAK,EAAE,EAAE;MACnDH,QAAQ,CAACG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,GAAG,CAAC,CAAC;;IAGjE,IAAI,CAACT,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IACvC,IAAI,CAACD,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDqB,aAAa,GAAb,SAAAA;IACE,IAAI,CAACkC,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,qBAAqB,GAAGlE,SAAS;GACvC;EAAAU,MAAA,CAED0C,qBAAqB,GAArB,SAAAA,sBAAsB3B,KAAa,EAAE0C,IAAmB,EAAEC,KAAc;IACtE,IAAI,OAAO3C,KAAK,KAAK,QAAQ,EAAE;MAC7B,IAAI,CAACyC,qBAAqB,GACxB,OAAO,IAAI,CAACA,qBAAqB,KAAK,QAAQ,GAC1C7E,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACH,qBAAqB,EAAEzC,KAAK,CAAC,GAC3CA,KAAK;MACX,IAAI,CAACwC,mBAAmB,CAAC,IAAI,CAACzC,QAAQ,CAACC,KAAK,CAAC,CAAC,GAAG;QAC/C2C,KAAK,EAALA,KAAK;QACLD,IAAI,EAAJA;OACD;;GAEJ;EAAAzD,MAAA,CAEDH,oBAAoB,GAApB,SAAAA;IAEE,IAAI,CAAC+D,qBAAqB,GAAG,EAAE;IAE/B,IAAI,OAAO,IAAI,CAAC9D,qBAAqB,KAAK,UAAU,EAAE;MACpD,IAAI,CAACA,qBAAqB,CAAC,IAAI,CAACO,KAAK,CAAC;;GAEzC;EAAAL,MAAA,CAED6D,MAAM,GAAN,SAAAA,OAAO9C,KAAa,EAAE2C,KAAa;IACjC,IAAI,OAAO3C,KAAK,KAAK,QAAQ,IAAIA,KAAK,GAAG,CAAC,EAAE,OAAO,KAAK;IACxD,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D,OAAO,KAAK;;IAGd,OAAOxB,KAAK,IAAI,IAAI,CAACZ,KAAK,EAAE;MAC1B,IAAI,CAACQ,OAAO,EAAE;;IAGhB,IAAMjC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC,GAAGgF,KAAK;IAExB,IAAI,CAAChB,qBAAqB,CAAC3B,KAAK,EAAE,KAAK,EAAE2C,KAAK,CAAC;IAE/C,IAAI3C,KAAK,GAAG,CAAC,GAAG,IAAI,CAACT,WAAW,EAAE;MAChC,IAAI,CAACA,WAAW,GAAGS,KAAK,GAAG,CAAC;;IAE9B,OAAO,IAAI;GACZ;EAAAf,MAAA,CAED8D,GAAG,GAAH,SAAAA,IAAI/C,KAAa,EAAE2C,KAAa;IAC9B,IAAI,CAACG,MAAM,CAAC9C,KAAK,EAAE2C,KAAK,CAAC;IACzB,IAAI,CAACtC,kBAAkB,CAACL,KAAK,CAAC;IAC9B,IAAI,CAAClB,oBAAoB,EAAE;IAC3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,IAAI,CAACA,mBAAmB,CAACgB,KAAK,EAAE2C,KAAK,CAAC;;IAExC,OAAO,IAAI;GACZ;EAAA1D,MAAA,CAED+D,WAAW,GAAX,SAAAA;;IACE,IAAI,OAAO,IAAI,CAACP,qBAAqB,KAAK,QAAQ,EAAE;MAClD,IAAMzC,KAAK,GAAG,IAAI,CAACyC,qBAAqB;MAExC,IAAMQ,IAAI,GAAGC,MAAM,CAACD,IAAI,CAAC,IAAI,CAACT,mBAAmB,CAAC;MAClD,IAAMW,aAAa,GAAGF,IAAI,CAACG,IAAI,CAC7B,UAAClD,GAAG;QAAA,OAAKmD,MAAI,CAACb,mBAAmB,CAACtC,GAAG,CAAC,CAACwC,IAAI,KAAK,QAAQ;QACzD;MAED,IAAIS,aAAa,EAAE;QACjB,OAAO,IAAI,CAAC5C,UAAU,CAACP,KAAK,CAAC;;MAG/B,IAAMU,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;MACnC,IAAMiE,UAAU,GAAGL,IAAI,CAAC9D,MAAM;MAE9B,IAAMoE,WAAW,GAAG,IAAI,CAACnE,KAAK,GAAGY,KAAK,GAAG,CAAC;MAE1C,IAAIU,KAAK,GAAG4C,UAAU,GAAGC,WAAW,EAAE;QACpC,OAAO,IAAI,CAAChD,UAAU,CAACP,KAAK,CAAC;;MAG/BiD,IAAI,CAACf,OAAO,CAAC,UAAChC,GAAG;QAAA,OAAKmD,MAAI,CAAChD,kBAAkB,CAACgD,MAAI,CAACpD,eAAe,CAACC,GAAG,CAAC,CAAC;QAAC;MAEzE,IAAI,CAACpB,oBAAoB,EAAE;MAE3B,IAAI,CAACwB,aAAa,EAAE;;GAEvB;EAAArB,MAAA,CAEDuE,kBAAkB,GAAlB,SAAAA;IACE,OAAO,IAAI,CAACC,aAAa,EAAE;GAC5B;EAAAxE,MAAA,CAEDwE,aAAa,GAAb,SAAAA;IACE,OAAO,IAAI,CAAClE,WAAW;GACxB;EAAAN,MAAA,CAEDmD,GAAG,GAAH,SAAAA,IAAIpC,KAAa;IAEf,IAAMrC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,OAAO,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC;GACxB;EAAAsB,MAAA,CAEDyE,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACrE,KAAK;GAClB;EAAAJ,MAAA,CAED0E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK;GAClB;EAAAH,MAAA,CAED2E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACtE,KAAK;GAClB;EAAAL,MAAA,CAED4E,WAAW,GAAX,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK,CAAC,CAAC,CAAC;GACrB;EAAAL,MAAA,CAMD6E,QAAQ,GAAR,SAAAA,SAASC,GAAW;IAGlB,IAAI,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG,IAAI,IAAI,EAC9C,OAAO,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG;IAC7C,IAAIA,GAAG,IAAI,CAAC,EAAE;MACZ,OAAO,CAAC;;IAGV,IAAIpG,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAG2E,GAAG,GAAG,CAAC;IAC/B,IAAIC,GAAG,GAAG,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,CAAC;IAE1B,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAIA,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;QAClBqG,GAAG,IAAI,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,GAAG,CAAC,CAAC;;;IAI/B,OAAOqG,GAAG;GACX;EAAA/E,MAAA,CAKDgF,KAAK,GAAL,SAAAA,MAAMC,YAAoB;IAMxB,OAAO,IAAI,CAACJ,QAAQ,CAACI,YAAY,GAAG,CAAC,CAAC;GACvC;EAAAjF,MAAA,CAMD+E,GAAG,GAAH,SAAAA,IAAIG,KAAa,EAAEJ,GAAW;IAE5B,OAAO,IAAI,CAACD,QAAQ,CAACC,GAAG,CAAC,GAAG,IAAI,CAACD,QAAQ,CAACK,KAAK,CAAC;GACjD;EAAAlF,MAAA,CAMDmF,kBAAkB,GAAlB,SAAAA,mBAAmBC,CAAS;IAC1B,IAAIA,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC9B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MAExB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,GAAGC,OAAO,EAAE;QACf3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAMDsF,wBAAwB,GAAxB,SAAAA,yBAAyBF,CAAS;IAChC,IAAIA,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC/B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MACxB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,IAAIC,OAAO,EAAE;QAChB3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAgBDuF,YAAY,GAAZ,SAAAA,aAAaC,SAAiB,EAAEC,SAAiB;IAC/C,IAAI,IAAI,CAACd,OAAO,EAAE,CAAC,CAAC,CAAC,GAAGa,SAAS,EAAE;MACjC,OAAO;QACL7D,UAAU,EAAE,IAAI,CAACrB,WAAW;QAC5BkB,QAAQ,EAAE,IAAI,CAAClB;OAChB;;IAGH,OAAO;MAELqB,UAAU,EAAE,IAAI,CAACwD,kBAAkB,CAACK,SAAS,CAAC;MAG9ChE,QAAQ,EAAE,IAAI,CAACkE,qBAAqB,CAACD,SAAS;KAC/C;GACF;EAAAzF,MAAA,CAMD2F,eAAe,GAAf,SAAAA,gBAAgBP,CAAS;IACvB,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAAC2B,wBAAwB,CAACF,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GACxE;EAAAN,MAAA,CAMD0F,qBAAqB,GAArB,SAAAA,sBAAsBN,CAAS;IAC7B,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACwB,kBAAkB,CAACC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GAClE;EAAA,OAAAlB,kBAAA;AAAA;;;;"}
package/dist/prefix-interval-tree.cjs.production.min.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"prefix-interval-tree.cjs.production.min.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: {\n [key: string]: Operation;\n } = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: {\n [key: string]: number;\n } = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","this","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","_onUpdateIntervalTree","onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","some","_this3","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":"oEAAA,IAAMA,EAAS,SAACC,GAAY,OAAKC,KAAKC,MAAMF,EAAO,IAE7CG,EAAc,SAAUC,GAE5B,IADA,IAAMC,EAAK,GACFC,EAAIF,EAAO,EAAGE,GAAK,IAAKA,EAC/BD,EAAGC,GAAK,EAEV,OAAOD,GAMT,SAASE,EAASC,GAEhB,IADA,IAAIC,EAAI,EACDA,EAAID,GACTC,GAAK,EAGP,OAAOA,6BA8CP,SAAAC,EACEL,EACAM,YADAN,IAAAA,EAAwB,IATlBO,yBAEJ,GACIA,gCAAgCC,EAChCD,2BAEJ,GASgB,iBAAPP,GAAiBO,KAAKE,eAAeT,GAC5CU,MAAMC,QAAQX,IAAKO,KAAKK,cAAcZ,GAE1C,IAAAa,EAAqDP,GAAQ,GAArDQ,EAAkBD,EAAlBC,mBACRP,KAAKQ,sBAD2CF,EAApBG,qBAE5BT,KAAKU,oBAAsBH,EAC5B,IAAAI,EAAAb,EAAAc,UAybA,OAzbAD,EAEDT,eAAA,SAAeW,GACbb,KAAKc,MAAQnB,EAASkB,GACtBb,KAAKe,MAAQf,KAAKc,MAClBd,KAAKgB,MAAQzB,EAAY,EAAIS,KAAKc,OAClCd,KAAKiB,YAAc,GACpBN,EAEDN,cAAA,SAAca,GAIZ,IAAIxB,EACJ,IAJAM,KAAKc,MAAQnB,EAASuB,EAAIL,QAC1Bb,KAAKe,MAAQf,KAAKc,MAClBd,KAAKgB,MAAQzB,EAAY,EAAIS,KAAKc,OAE7BpB,EAAI,EAAGA,EAAIM,KAAKe,QAASrB,EAC5BM,KAAKgB,MAAMhB,KAAKc,MAAQpB,GAAKwB,EAAIxB,GAGnC,IAAKA,EAAIM,KAAKc,MAAQ,EAAGpB,EAAI,IAAKA,EAChCM,KAAKgB,MAAMtB,GAAKM,KAAKgB,MAAM,EAAItB,GAAKM,KAAKgB,MAAM,EAAItB,EAAI,GAEzDM,KAAKiB,YAAcC,EAAIL,QACxBf,EAEMqB,QAAP,SAAe3B,EAAc4B,GAE3B,IADA,IAAM3B,EAAK,GACFC,EAAIF,EAAO,EAAGE,GAAK,IAAKA,EAC/BD,EAAGC,GAAK0B,EAGV,OAAO,IAAItB,EAAmBL,IAC/BK,EAEMuB,MAAP,SAAa7B,GACX,OAAOM,EAAmBqB,QAAQ3B,EAAM,IACzCmB,EAMDW,QAAA,WAKE,IAJA,IAAMC,EAAWhC,EAAY,EAAIS,KAAKc,MAAQ,GACxCU,EAA4B,EAAbxB,KAAKc,MAGjBpB,EAAI,EAAGA,EAAIM,KAAKe,MAAOrB,IAC9B6B,EAASC,EAAe9B,GAAKM,KAAKgB,MAAMhB,KAAKc,MAAQpB,IAAM,EAI7D,IAAK,IAAIA,EAAI8B,EAAe,EAAG9B,EAAI,EAAGA,IACpC6B,EAAS7B,GAAK6B,EAAS,EAAI7B,GAAK6B,EAAS,EAAI7B,EAAI,GAGnDM,KAAKc,MAAQU,EACbxB,KAAKe,MAAQS,EACbxB,KAAKgB,MAAQO,GACdZ,EAEDc,SAAA,SAASC,GACP,SAAUA,GACXf,EAEDgB,gBAAA,SAAgBC,GACd,OAAOC,SAASD,EAAK,KACtBjB,EAEDmB,aAAA,SAAaJ,GACX,MAAwB,iBAAVA,GAAsBA,GAAS,GAAKA,EAAQ1B,KAAKiB,aAChEN,EAEDoB,mBAAA,SAAmBL,GACjB1B,KAAKgC,gBACL,IAAI5C,EAAOY,KAAKc,MAAQY,EAGxB,IADAtC,EAAOD,EAAOC,GACE,IAATA,EAAYA,EAAOD,EAAOC,GAC/BY,KAAKgB,MAAM5B,GAAQY,KAAKgB,MAAM,EAAI5B,GAAQY,KAAKgB,MAAM,EAAI5B,EAAO,IAEnEuB,EAGDsB,WAAA,SAAWC,EAAqBC,uBAAAA,IAAAA,EAAwB,EAAbnC,KAAKc,MAAY,GAC1Dd,KAAKgC,gBACL,IAAMI,EAAQ/C,KAAKgD,KAAKrC,KAAKe,OACvBuB,EAAaJ,EAAclC,KAAKc,MAEtCX,MAAMoC,KAAK,CAAE1B,OAAQuB,IAAS,SAACI,EAAG9C,GAAC,OAAKA,KAAG+C,QACzC,SAACC,GAKC,IAJA,IAAoBP,EAAaO,EAAbP,SACdQ,EAAaxD,EADcuD,EAAzBJ,YAEFM,EAAWzD,EAAOgD,GAEfU,EAAMF,EAAYE,GAAOD,EAAUC,IAC1CC,EAAK9B,MAAM6B,GAAOC,EAAK9B,MAAM,EAAI6B,GAAOC,EAAK9B,MAAM,EAAI6B,EAAM,GAG/D,MAAO,CACLP,WAAYK,EACZR,SAAUS,KAGd,CACEN,WAAAA,EACAH,SAAAA,KAGLxB,EASDoC,UAAA,SAAUrB,GACH1B,KAAK8B,aAAaJ,KACnBsB,MAAMtB,GACRuB,QAAQC,KAAK,+CAIflD,KAAKgB,MAAMmC,OAAOnD,KAAKc,MAAQY,EAAO,GACtC1B,KAAKgB,MAAMoC,KAAK,GAChBpD,KAAKiB,YAAcjB,KAAKiB,YAAc,EAEtCjB,KAAKqD,sBAAsB3B,EAAO,aACnCf,EAED2C,OAAA,SAAO5B,GAGL1B,KAAKuD,cAAc,CAAC7B,KACrBf,EAED4C,cAAA,SAAcC,cAQZ,GAPAA,EAAQC,MAAK,SAACC,EAAGC,GAAC,OAAKD,EAAIC,KAE3BH,EAAQI,SAAQ,SAAClC,GAAK,OAAKmC,EAAKd,UAAUrB,MAE1C1B,KAAKiC,WAAWuB,EAAQ,IACxBxD,KAAKS,uBAEmC,mBAA7BT,KAAKU,oBACd,IAAK,IAAImC,EAAMW,EAAQ,GAAIX,EAAM7C,KAAKc,MAAO+B,IAC3C7C,KAAKU,oBAAoBmC,EAAK7C,KAAK8D,IAAIjB,KAG5ClC,EAEDoD,SAAA,SAASrC,GAEP,GAAK1B,KAAK8B,aAAaJ,GACvB,GAAIsB,MAAMtB,GACRuB,QAAQC,KAAK,kDADf,CAKA,IAAM3B,EAAWhC,EAAyB,EAAbS,KAAKc,OAC5BkD,EAAOhE,KAAKgB,MAAMiD,MAAMjE,KAAKc,OACnCkD,EAAKb,OAAOzB,EAAO,GAEnB,IAAK,IAAIA,EAAQ1B,KAAKc,MAAOY,EAAqB,EAAb1B,KAAKc,MAAWY,IACnDH,EAASG,GAASsC,EAAKtC,EAAQ1B,KAAKc,QAAU,EAGhD,IAAK,IAAIY,EAAQ1B,KAAKc,MAAQ,EAAGY,EAAQ,EAAGA,IAC1CH,EAASG,GAASH,EAAS,EAAIG,GAASH,EAAS,EAAIG,EAAQ,GAG/D1B,KAAKiB,YAAcjB,KAAKiB,YAAc,EACtCjB,KAAKgB,MAAQO,IACdZ,EAEDqB,cAAA,WACEhC,KAAKkE,oBAAsB,GAC3BlE,KAAKmE,2BAAwBlE,GAC9BU,EAED0C,sBAAA,SAAsB3B,EAAe0C,EAAqBC,GACnC,iBAAV3C,IACT1B,KAAKmE,sBACmC,iBAA/BnE,KAAKmE,sBACR9E,KAAKiF,IAAItE,KAAKmE,sBAAuBzC,GACrCA,EACN1B,KAAKkE,oBAAoBlE,KAAKyB,SAASC,IAAU,CAC/C2C,MAAAA,EACAD,KAAAA,KAGLzD,EAEDF,qBAAA,WAEET,KAAKuE,sBAAwB,GAEa,mBAA/BvE,KAAKQ,uBACdR,KAAKQ,sBAAsBR,KAAKgB,QAEnCL,EAED6D,OAAA,SAAO9C,EAAe2C,GACpB,GAAqB,iBAAV3C,GAAsBA,EAAQ,EAAG,OAAO,EACnD,GAAIsB,MAAMtB,GAER,OADAuB,QAAQC,KAAK,+CACN,EAGT,KAAOxB,GAAS1B,KAAKc,OACnBd,KAAKsB,UAWP,OAPAtB,KAAKgB,MADQhB,KAAKc,MAAQY,GACP2C,EAEnBrE,KAAKqD,sBAAsB3B,EAAO,MAAO2C,GAErC3C,EAAQ,EAAI1B,KAAKiB,cACnBjB,KAAKiB,YAAcS,EAAQ,IAEtB,GACRf,EAED8D,IAAA,SAAI/C,EAAe2C,GAOjB,OANArE,KAAKwE,OAAO9C,EAAO2C,GACnBrE,KAAK+B,mBAAmBL,GACxB1B,KAAKS,uBACmC,mBAA7BT,KAAKU,qBACdV,KAAKU,oBAAoBgB,EAAO2C,IAE3B,GACR1D,EAED+D,YAAA,sBACE,GAA0C,iBAA/B1E,KAAKmE,sBAAoC,CAClD,IAAMzC,EAAQ1B,KAAKmE,sBAEbQ,EAAOC,OAAOD,KAAK3E,KAAKkE,qBAK9B,GAJsBS,EAAKE,MACzB,SAACjD,GAAG,MAA4C,WAAvCkD,EAAKZ,oBAAoBtC,GAAKwC,QAIvC,OAAOpE,KAAKiC,WAAWP,GAQzB,GALcrC,KAAKgD,KAAKrC,KAAKe,OACV4D,EAAK9D,OAEJb,KAAKc,MAAQY,EAAQ,EAGvC,OAAO1B,KAAKiC,WAAWP,GAGzBiD,EAAKf,SAAQ,SAAChC,GAAG,OAAKkD,EAAK/C,mBAAmB+C,EAAKnD,gBAAgBC,OAEnE5B,KAAKS,uBAELT,KAAKgC,kBAERrB,EAEDoE,mBAAA,WACE,OAAO/E,KAAKgF,iBACbrE,EAEDqE,cAAA,WACE,OAAOhF,KAAKiB,aACbN,EAEDmD,IAAA,SAAIpC,GAGF,OAAO1B,KAAKgB,MADChB,KAAKc,MAAQY,IAE3Bf,EAEDsE,QAAA,WACE,OAAOjF,KAAKe,OACbJ,EAEDuE,QAAA,WACE,OAAOlF,KAAKc,OACbH,EAEDwE,QAAA,WACE,OAAOnF,KAAKgB,OACbL,EAEDyE,YAAA,WACE,OAAOpF,KAAKgB,MAAM,IACnBL,EAMD0E,SAAA,SAASC,GAGP,GAA4C,MAAxCtF,KAAKuE,yBAAyBe,GAChC,OAAOtF,KAAKuE,yBAAyBe,GACvC,GAAIA,GAAO,EACT,OAAO,EAMT,IAHA,IAAIlG,EAAOY,KAAKc,MAAQwE,EAAM,EAC1BC,EAAMvF,KAAKgB,MAAM5B,GAEL,IAATA,EAAYA,EAAOD,EAAOC,GAC3BA,EAAO,GAAM,IACfmG,GAAOvF,KAAKgB,MAAM5B,EAAO,IAI7B,OAAOmG,GACR5E,EAKD6E,MAAA,SAAMC,GAMJ,OAAOzF,KAAKqF,SAASI,EAAe,IACrC9E,EAMD4E,IAAA,SAAIG,EAAeJ,GAEjB,OAAOtF,KAAKqF,SAASC,GAAOtF,KAAKqF,SAASK,IAC3C/E,EAMDgF,mBAAA,SAAmBC,GACjB,GAAIA,EAAI,IAAM5F,KAAKiB,YACjB,OAAQ,EAGV,IAAI7B,EAAO,EACX,GAAIY,KAAKgB,MAAM5B,GAAQwG,EAErB,OAAO5F,KAAKiB,YAGd,KAAO7B,EAAOY,KAAKc,OAAO,CACxB,IAAM+E,EAAU7F,KAAKgB,MAAM,EAAI5B,GAC3BwG,EAAIC,EACNzG,GAAO,GAEPA,EAAO,EAAIA,EAAO,EAClBwG,GAAKC,GAIT,OAAOxG,KAAKiF,IAAIlF,EAAOY,KAAKc,MAAOd,KAAKiB,cACzCN,EAMDmF,yBAAA,SAAyBF,GACvB,GAAIA,GAAK,IAAM5F,KAAKiB,YAClB,OAAQ,EAGV,IAAI7B,EAAO,EACX,GAAIY,KAAKgB,MAAM5B,GAAQwG,EACrB,OAAO5F,KAAKiB,YAGd,KAAO7B,EAAOY,KAAKc,OAAO,CACxB,IAAM+E,EAAU7F,KAAKgB,MAAM,EAAI5B,GAC3BwG,GAAKC,EACPzG,GAAO,GAEPA,EAAO,EAAIA,EAAO,EAClBwG,GAAKC,GAIT,OAAOxG,KAAKiF,IAAIlF,EAAOY,KAAKc,MAAOd,KAAKiB,cACzCN,EAgBDoF,aAAA,SAAaC,EAAmBC,GAC9B,OAAIjG,KAAKmF,UAAU,GAAKa,EACf,CACL1D,WAAYtC,KAAKiB,YACjBkB,SAAUnC,KAAKiB,aAIZ,CAELqB,WAAYtC,KAAK2F,mBAAmBK,GAGpC7D,SAAUnC,KAAKkG,sBAAsBD,KAExCtF,EAMDwF,gBAAA,SAAgBP,GACd,OAAOvG,KAAKiF,IAAItE,KAAK8F,yBAAyBF,GAAK,EAAG5F,KAAKiB,cAC5DN,EAMDuF,sBAAA,SAAsBN,GACpB,OAAOvG,KAAKiF,IAAItE,KAAK2F,mBAAmBC,GAAK,EAAG5F,KAAKiB,cACtDnB"}
1
+ {"version":3,"file":"prefix-interval-tree.cjs.production.min.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: Record<string, Operation> = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: Record<string, number> = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","this","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","_onUpdateIntervalTree","onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","some","_this3","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":"oEAAA,IAAMA,EAAS,SAACC,GAAY,OAAKC,KAAKC,MAAMF,EAAO,IAE7CG,EAAc,SAAUC,GAE5B,IADA,IAAMC,EAAK,GACFC,EAAIF,EAAO,EAAGE,GAAK,IAAKA,EAC/BD,EAAGC,GAAK,EAEV,OAAOD,GAMT,SAASE,EAASC,GAEhB,IADA,IAAIC,EAAI,EACDA,EAAID,GACTC,GAAK,EAGP,OAAOA,6BA0CP,SAAAC,EACEL,EACAM,YADAN,IAAAA,EAAwB,IALlBO,yBAAiD,GACjDA,gCAAgCC,EAChCD,2BAAgD,GASpC,iBAAPP,GAAiBO,KAAKE,eAAeT,GAC5CU,MAAMC,QAAQX,IAAKO,KAAKK,cAAcZ,GAE1C,IAAAa,EAAqDP,GAAQ,GAArDQ,EAAkBD,EAAlBC,mBACRP,KAAKQ,sBAD2CF,EAApBG,qBAE5BT,KAAKU,oBAAsBH,EAC5B,IAAAI,EAAAb,EAAAc,UAybA,OAzbAD,EAEDT,eAAA,SAAeW,GACbb,KAAKc,MAAQnB,EAASkB,GACtBb,KAAKe,MAAQf,KAAKc,MAClBd,KAAKgB,MAAQzB,EAAY,EAAIS,KAAKc,OAClCd,KAAKiB,YAAc,GACpBN,EAEDN,cAAA,SAAca,GAIZ,IAAIxB,EACJ,IAJAM,KAAKc,MAAQnB,EAASuB,EAAIL,QAC1Bb,KAAKe,MAAQf,KAAKc,MAClBd,KAAKgB,MAAQzB,EAAY,EAAIS,KAAKc,OAE7BpB,EAAI,EAAGA,EAAIM,KAAKe,QAASrB,EAC5BM,KAAKgB,MAAMhB,KAAKc,MAAQpB,GAAKwB,EAAIxB,GAGnC,IAAKA,EAAIM,KAAKc,MAAQ,EAAGpB,EAAI,IAAKA,EAChCM,KAAKgB,MAAMtB,GAAKM,KAAKgB,MAAM,EAAItB,GAAKM,KAAKgB,MAAM,EAAItB,EAAI,GAEzDM,KAAKiB,YAAcC,EAAIL,QACxBf,EAEMqB,QAAP,SAAe3B,EAAc4B,GAE3B,IADA,IAAM3B,EAAK,GACFC,EAAIF,EAAO,EAAGE,GAAK,IAAKA,EAC/BD,EAAGC,GAAK0B,EAGV,OAAO,IAAItB,EAAmBL,IAC/BK,EAEMuB,MAAP,SAAa7B,GACX,OAAOM,EAAmBqB,QAAQ3B,EAAM,IACzCmB,EAMDW,QAAA,WAKE,IAJA,IAAMC,EAAWhC,EAAY,EAAIS,KAAKc,MAAQ,GACxCU,EAA4B,EAAbxB,KAAKc,MAGjBpB,EAAI,EAAGA,EAAIM,KAAKe,MAAOrB,IAC9B6B,EAASC,EAAe9B,GAAKM,KAAKgB,MAAMhB,KAAKc,MAAQpB,IAAM,EAI7D,IAAK,IAAIA,EAAI8B,EAAe,EAAG9B,EAAI,EAAGA,IACpC6B,EAAS7B,GAAK6B,EAAS,EAAI7B,GAAK6B,EAAS,EAAI7B,EAAI,GAGnDM,KAAKc,MAAQU,EACbxB,KAAKe,MAAQS,EACbxB,KAAKgB,MAAQO,GACdZ,EAEDc,SAAA,SAASC,GACP,SAAUA,GACXf,EAEDgB,gBAAA,SAAgBC,GACd,OAAOC,SAASD,EAAK,KACtBjB,EAEDmB,aAAA,SAAaJ,GACX,MAAwB,iBAAVA,GAAsBA,GAAS,GAAKA,EAAQ1B,KAAKiB,aAChEN,EAEDoB,mBAAA,SAAmBL,GACjB1B,KAAKgC,gBACL,IAAI5C,EAAOY,KAAKc,MAAQY,EAGxB,IADAtC,EAAOD,EAAOC,GACE,IAATA,EAAYA,EAAOD,EAAOC,GAC/BY,KAAKgB,MAAM5B,GAAQY,KAAKgB,MAAM,EAAI5B,GAAQY,KAAKgB,MAAM,EAAI5B,EAAO,IAEnEuB,EAGDsB,WAAA,SAAWC,EAAqBC,uBAAAA,IAAAA,EAAwB,EAAbnC,KAAKc,MAAY,GAC1Dd,KAAKgC,gBACL,IAAMI,EAAQ/C,KAAKgD,KAAKrC,KAAKe,OACvBuB,EAAaJ,EAAclC,KAAKc,MAEtCX,MAAMoC,KAAK,CAAE1B,OAAQuB,IAAS,SAACI,EAAG9C,GAAC,OAAKA,KAAG+C,QACzC,SAACC,GAKC,IAJA,IAAoBP,EAAaO,EAAbP,SACdQ,EAAaxD,EADcuD,EAAzBJ,YAEFM,EAAWzD,EAAOgD,GAEfU,EAAMF,EAAYE,GAAOD,EAAUC,IAC1CC,EAAK9B,MAAM6B,GAAOC,EAAK9B,MAAM,EAAI6B,GAAOC,EAAK9B,MAAM,EAAI6B,EAAM,GAG/D,MAAO,CACLP,WAAYK,EACZR,SAAUS,KAGd,CACEN,WAAAA,EACAH,SAAAA,KAGLxB,EASDoC,UAAA,SAAUrB,GACH1B,KAAK8B,aAAaJ,KACnBsB,MAAMtB,GACRuB,QAAQC,KAAK,+CAIflD,KAAKgB,MAAMmC,OAAOnD,KAAKc,MAAQY,EAAO,GACtC1B,KAAKgB,MAAMoC,KAAK,GAChBpD,KAAKiB,YAAcjB,KAAKiB,YAAc,EAEtCjB,KAAKqD,sBAAsB3B,EAAO,aACnCf,EAED2C,OAAA,SAAO5B,GAGL1B,KAAKuD,cAAc,CAAC7B,KACrBf,EAED4C,cAAA,SAAcC,cAQZ,GAPAA,EAAQC,MAAK,SAACC,EAAGC,GAAC,OAAKD,EAAIC,KAE3BH,EAAQI,SAAQ,SAAClC,GAAK,OAAKmC,EAAKd,UAAUrB,MAE1C1B,KAAKiC,WAAWuB,EAAQ,IACxBxD,KAAKS,uBAEmC,mBAA7BT,KAAKU,oBACd,IAAK,IAAImC,EAAMW,EAAQ,GAAIX,EAAM7C,KAAKc,MAAO+B,IAC3C7C,KAAKU,oBAAoBmC,EAAK7C,KAAK8D,IAAIjB,KAG5ClC,EAEDoD,SAAA,SAASrC,GAEP,GAAK1B,KAAK8B,aAAaJ,GACvB,GAAIsB,MAAMtB,GACRuB,QAAQC,KAAK,kDADf,CAKA,IAAM3B,EAAWhC,EAAyB,EAAbS,KAAKc,OAC5BkD,EAAOhE,KAAKgB,MAAMiD,MAAMjE,KAAKc,OACnCkD,EAAKb,OAAOzB,EAAO,GAEnB,IAAK,IAAIA,EAAQ1B,KAAKc,MAAOY,EAAqB,EAAb1B,KAAKc,MAAWY,IACnDH,EAASG,GAASsC,EAAKtC,EAAQ1B,KAAKc,QAAU,EAGhD,IAAK,IAAIY,EAAQ1B,KAAKc,MAAQ,EAAGY,EAAQ,EAAGA,IAC1CH,EAASG,GAASH,EAAS,EAAIG,GAASH,EAAS,EAAIG,EAAQ,GAG/D1B,KAAKiB,YAAcjB,KAAKiB,YAAc,EACtCjB,KAAKgB,MAAQO,IACdZ,EAEDqB,cAAA,WACEhC,KAAKkE,oBAAsB,GAC3BlE,KAAKmE,2BAAwBlE,GAC9BU,EAED0C,sBAAA,SAAsB3B,EAAe0C,EAAqBC,GACnC,iBAAV3C,IACT1B,KAAKmE,sBACmC,iBAA/BnE,KAAKmE,sBACR9E,KAAKiF,IAAItE,KAAKmE,sBAAuBzC,GACrCA,EACN1B,KAAKkE,oBAAoBlE,KAAKyB,SAASC,IAAU,CAC/C2C,MAAAA,EACAD,KAAAA,KAGLzD,EAEDF,qBAAA,WAEET,KAAKuE,sBAAwB,GAEa,mBAA/BvE,KAAKQ,uBACdR,KAAKQ,sBAAsBR,KAAKgB,QAEnCL,EAED6D,OAAA,SAAO9C,EAAe2C,GACpB,GAAqB,iBAAV3C,GAAsBA,EAAQ,EAAG,OAAO,EACnD,GAAIsB,MAAMtB,GAER,OADAuB,QAAQC,KAAK,+CACN,EAGT,KAAOxB,GAAS1B,KAAKc,OACnBd,KAAKsB,UAWP,OAPAtB,KAAKgB,MADQhB,KAAKc,MAAQY,GACP2C,EAEnBrE,KAAKqD,sBAAsB3B,EAAO,MAAO2C,GAErC3C,EAAQ,EAAI1B,KAAKiB,cACnBjB,KAAKiB,YAAcS,EAAQ,IAEtB,GACRf,EAED8D,IAAA,SAAI/C,EAAe2C,GAOjB,OANArE,KAAKwE,OAAO9C,EAAO2C,GACnBrE,KAAK+B,mBAAmBL,GACxB1B,KAAKS,uBACmC,mBAA7BT,KAAKU,qBACdV,KAAKU,oBAAoBgB,EAAO2C,IAE3B,GACR1D,EAED+D,YAAA,sBACE,GAA0C,iBAA/B1E,KAAKmE,sBAAoC,CAClD,IAAMzC,EAAQ1B,KAAKmE,sBAEbQ,EAAOC,OAAOD,KAAK3E,KAAKkE,qBAK9B,GAJsBS,EAAKE,MACzB,SAACjD,GAAG,MAA4C,WAAvCkD,EAAKZ,oBAAoBtC,GAAKwC,QAIvC,OAAOpE,KAAKiC,WAAWP,GAQzB,GALcrC,KAAKgD,KAAKrC,KAAKe,OACV4D,EAAK9D,OAEJb,KAAKc,MAAQY,EAAQ,EAGvC,OAAO1B,KAAKiC,WAAWP,GAGzBiD,EAAKf,SAAQ,SAAChC,GAAG,OAAKkD,EAAK/C,mBAAmB+C,EAAKnD,gBAAgBC,OAEnE5B,KAAKS,uBAELT,KAAKgC,kBAERrB,EAEDoE,mBAAA,WACE,OAAO/E,KAAKgF,iBACbrE,EAEDqE,cAAA,WACE,OAAOhF,KAAKiB,aACbN,EAEDmD,IAAA,SAAIpC,GAGF,OAAO1B,KAAKgB,MADChB,KAAKc,MAAQY,IAE3Bf,EAEDsE,QAAA,WACE,OAAOjF,KAAKe,OACbJ,EAEDuE,QAAA,WACE,OAAOlF,KAAKc,OACbH,EAEDwE,QAAA,WACE,OAAOnF,KAAKgB,OACbL,EAEDyE,YAAA,WACE,OAAOpF,KAAKgB,MAAM,IACnBL,EAMD0E,SAAA,SAASC,GAGP,GAA4C,MAAxCtF,KAAKuE,yBAAyBe,GAChC,OAAOtF,KAAKuE,yBAAyBe,GACvC,GAAIA,GAAO,EACT,OAAO,EAMT,IAHA,IAAIlG,EAAOY,KAAKc,MAAQwE,EAAM,EAC1BC,EAAMvF,KAAKgB,MAAM5B,GAEL,IAATA,EAAYA,EAAOD,EAAOC,GAC3BA,EAAO,GAAM,IACfmG,GAAOvF,KAAKgB,MAAM5B,EAAO,IAI7B,OAAOmG,GACR5E,EAKD6E,MAAA,SAAMC,GAMJ,OAAOzF,KAAKqF,SAASI,EAAe,IACrC9E,EAMD4E,IAAA,SAAIG,EAAeJ,GAEjB,OAAOtF,KAAKqF,SAASC,GAAOtF,KAAKqF,SAASK,IAC3C/E,EAMDgF,mBAAA,SAAmBC,GACjB,GAAIA,EAAI,IAAM5F,KAAKiB,YACjB,OAAQ,EAGV,IAAI7B,EAAO,EACX,GAAIY,KAAKgB,MAAM5B,GAAQwG,EAErB,OAAO5F,KAAKiB,YAGd,KAAO7B,EAAOY,KAAKc,OAAO,CACxB,IAAM+E,EAAU7F,KAAKgB,MAAM,EAAI5B,GAC3BwG,EAAIC,EACNzG,GAAO,GAEPA,EAAO,EAAIA,EAAO,EAClBwG,GAAKC,GAIT,OAAOxG,KAAKiF,IAAIlF,EAAOY,KAAKc,MAAOd,KAAKiB,cACzCN,EAMDmF,yBAAA,SAAyBF,GACvB,GAAIA,GAAK,IAAM5F,KAAKiB,YAClB,OAAQ,EAGV,IAAI7B,EAAO,EACX,GAAIY,KAAKgB,MAAM5B,GAAQwG,EACrB,OAAO5F,KAAKiB,YAGd,KAAO7B,EAAOY,KAAKc,OAAO,CACxB,IAAM+E,EAAU7F,KAAKgB,MAAM,EAAI5B,GAC3BwG,GAAKC,EACPzG,GAAO,GAEPA,EAAO,EAAIA,EAAO,EAClBwG,GAAKC,GAIT,OAAOxG,KAAKiF,IAAIlF,EAAOY,KAAKc,MAAOd,KAAKiB,cACzCN,EAgBDoF,aAAA,SAAaC,EAAmBC,GAC9B,OAAIjG,KAAKmF,UAAU,GAAKa,EACf,CACL1D,WAAYtC,KAAKiB,YACjBkB,SAAUnC,KAAKiB,aAIZ,CAELqB,WAAYtC,KAAK2F,mBAAmBK,GAGpC7D,SAAUnC,KAAKkG,sBAAsBD,KAExCtF,EAMDwF,gBAAA,SAAgBP,GACd,OAAOvG,KAAKiF,IAAItE,KAAK8F,yBAAyBF,GAAK,EAAG5F,KAAKiB,cAC5DN,EAMDuF,sBAAA,SAAsBN,GACpB,OAAOvG,KAAKiF,IAAItE,KAAK2F,mBAAmBC,GAAK,EAAG5F,KAAKiB,cACtDnB"}
package/dist/prefix-interval-tree.esm.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"prefix-interval-tree.esm.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: {\n [key: string]: Operation;\n } = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: {\n [key: string]: number;\n } = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","onUpdateIntervalTree","_onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","hasRemoveItem","some","_this3","itemLength","reflowTimes","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":"AAAA,IAAMA,MAAM,GAAG,SAATA,MAAMA,CAAIC,IAAY;EAAA,OAAKC,IAAI,CAACC,KAAK,CAACF,IAAI,GAAG,CAAC,CAAC;AAAA;AAErD,IAAMG,WAAW,GAAG,SAAdA,WAAWA,CAAaC,IAAY;EACxC,IAAMC,EAAE,GAAG,EAAE;EACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;IAClCD,EAAE,CAACC,CAAC,CAAC,GAAG,CAAC;;EAEX,OAAOD,EAAE;AACX,CAAC;AAKD,SAASE,QAAQA,CAACC,CAAS;EACzB,IAAIC,CAAC,GAAG,CAAC;EACT,OAAOA,CAAC,GAAGD,CAAC,EAAE;IACZC,CAAC,IAAI,CAAC;;EAGR,OAAOA,CAAC;AACV;AAAC,IAuBKC,kBAAkB;EAsBtB,SAAAA,mBACEL,IACAM,IAGC;QAJDN;MAAAA,KAAwB,EAAE;;IATpB,wBAAmB,GAEvB,EAAE;IACE,0BAAqB,GAAWO,SAAS;IACzC,0BAAqB,GAEzB,EAAE;IASJ,IAAI,OAAOP,EAAE,KAAK,QAAQ,EAAE,IAAI,CAACQ,cAAc,CAACR,EAAE,CAAC;IACnD,IAAIS,KAAK,CAACC,OAAO,CAACV,EAAE,CAAC,EAAE,IAAI,CAACW,aAAa,CAACX,EAAE,CAAC;IAE7C,IAAAY,IAAA,GAAqDN,IAAI,IAAI,EAAE;MAAvDO,kBAAkB,GAAAD,IAAA,CAAlBC,kBAAkB;MAAEC,oBAAoB,GAAAF,IAAA,CAApBE,oBAAoB;IAChD,IAAI,CAACC,qBAAqB,GAAGD,oBAAoB;IACjD,IAAI,CAACE,mBAAmB,GAAGH,kBAAkB;;EAC9C,IAAAI,MAAA,GAAAZ,kBAAA,CAAAa,SAAA;EAAAD,MAAA,CAEDT,cAAc,GAAd,SAAAA,eAAeW,MAAc;IAC3B,IAAI,CAACC,KAAK,GAAGlB,QAAQ,CAACiB,MAAM,CAAC;IAC7B,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAI,CAACG,WAAW,GAAG,CAAC;GACrB;EAAAN,MAAA,CAEDN,aAAa,GAAb,SAAAA,cAAca,GAAa;IACzB,IAAI,CAACJ,KAAK,GAAGlB,QAAQ,CAACsB,GAAG,CAACL,MAAM,CAAC;IACjC,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAInB,CAAC;IACL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAE,EAAEpB,CAAC,EAAE;MAC/B,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,GAAGuB,GAAG,CAACvB,CAAC,CAAC;;IAGrC,KAAKA,CAAC,GAAG,IAAI,CAACmB,KAAK,GAAG,CAAC,EAAEnB,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACnC,IAAI,CAACqB,KAAK,CAACrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,GAAG,CAAC,CAAC;;IAE3D,IAAI,CAACsB,WAAW,GAAGC,GAAG,CAACL,MAAM;GAC9B;EAAAd,kBAAA,CAEMoB,OAAO,GAAd,SAAAA,QAAe1B,IAAY,EAAE2B,YAAoB;IAC/C,IAAM1B,EAAE,GAAG,EAAE;IACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;MAClCD,EAAE,CAACC,CAAC,CAAC,GAAGyB,YAAY;;IAGtB,OAAO,IAAIrB,kBAAkB,CAACL,EAAE,CAAC;GAClC;EAAAK,kBAAA,CAEMsB,KAAK,GAAZ,SAAAA,MAAa5B,IAAY;IACvB,OAAOM,kBAAkB,CAACoB,OAAO,CAAC1B,IAAI,EAAE,CAAC,CAAC;GAC3C;EAAAkB,MAAA,CAMDW,OAAO,GAAP,SAAAA;IACE,IAAMC,QAAQ,GAAG/B,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAChD,IAAMU,YAAY,GAAG,IAAI,CAACV,KAAK,GAAG,CAAC;IAGnC,KAAK,IAAInB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAEpB,CAAC,EAAE,EAAE;MACnC4B,QAAQ,CAACC,YAAY,GAAG7B,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,IAAI,CAAC;;IAI9D,KAAK,IAAIA,EAAC,GAAG6B,YAAY,GAAG,CAAC,EAAE7B,EAAC,GAAG,CAAC,EAAEA,EAAC,EAAE,EAAE;MACzC4B,QAAQ,CAAC5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,GAAG,CAAC,CAAC;;IAGrD,IAAI,CAACmB,KAAK,GAAGU,YAAY;IACzB,IAAI,CAACT,KAAK,GAAGS,YAAY;IACzB,IAAI,CAACR,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDc,QAAQ,GAAR,SAAAA,SAASC,KAAa;IACpB,YAAUA,KAAK;GAChB;EAAAf,MAAA,CAEDgB,eAAe,GAAf,SAAAA,gBAAgBC,GAAW;IACzB,OAAOC,QAAQ,CAACD,GAAG,EAAE,EAAE,CAAC;GACzB;EAAAjB,MAAA,CAEDmB,YAAY,GAAZ,SAAAA,aAAaJ,KAAa;IACxB,OAAO,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,IAAI,CAAC,IAAIA,KAAK,GAAG,IAAI,CAACT,WAAW;GAC3E;EAAAN,MAAA,CAEDoB,kBAAkB,GAAlB,SAAAA,mBAAmBL,KAAa;IAC9B,IAAI,CAACM,aAAa,EAAE;IACpB,IAAI3C,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAE7BrC,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC;IACnB,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,GAAG,CAAC,CAAC;;GAErE;EAAAsB,MAAA,CAGDsB,UAAU,GAAV,SAAAA,WAAWC,WAAmB,EAAEC,QAAQ;;QAARA,QAAQ;MAARA,QAAQ,GAAG,IAAI,CAACrB,KAAK,GAAG,CAAC,GAAG,CAAC;;IAC3D,IAAI,CAACkB,aAAa,EAAE;IACpB,IAAMI,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;IACnC,IAAMuB,UAAU,GAAGJ,WAAW,GAAG,IAAI,CAACpB,KAAK;IAE3CX,KAAK,CAACoC,IAAI,CAAC;MAAE1B,MAAM,EAAEuB;KAAO,EAAE,UAACI,CAAC,EAAE7C,CAAC;MAAA,OAAKA,CAAC;MAAC,CAAC8C,MAAM,CAC/C,UAACC,GAAG;MACF,IAAQJ,UAAU,GAAeI,GAAG,CAA5BJ,UAAU;QAAEH,QAAQ,GAAKO,GAAG,CAAhBP,QAAQ;MAC5B,IAAMQ,UAAU,GAAGvD,MAAM,CAACkD,UAAU,CAAC;MACrC,IAAMM,QAAQ,GAAGxD,MAAM,CAAC+C,QAAQ,CAAC;MAEjC,KAAK,IAAIU,GAAG,GAAGF,UAAU,EAAEE,GAAG,IAAID,QAAQ,EAAEC,GAAG,EAAE,EAAE;QACjDC,KAAI,CAAC9B,KAAK,CAAC6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,GAAG,CAAC,CAAC;;MAGjE,OAAO;QACLP,UAAU,EAAEK,UAAU;QACtBR,QAAQ,EAAES;OACX;KACF,EACD;MACEN,UAAU,EAAVA,UAAU;MACVH,QAAQ,EAARA;KACD,CACF;GACF;EAAAxB,MAAA,CASDoC,SAAS,GAAT,SAAAA,UAAUrB,KAAa;IACrB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAI,CAAClC,KAAK,CAACmC,MAAM,CAAC,IAAI,CAACrC,KAAK,GAAGY,KAAK,EAAE,CAAC,CAAC;IACxC,IAAI,CAACV,KAAK,CAACoC,IAAI,CAAC,CAAC,CAAC;IAClB,IAAI,CAACnC,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IAEvC,IAAI,CAACoC,qBAAqB,CAAC3B,KAAK,EAAE,QAAQ,CAAC;GAC5C;EAAAf,MAAA,CAED2C,MAAM,GAAN,SAAAA,OAAO5B,KAAa;IAGlB,IAAI,CAAC6B,aAAa,CAAC,CAAC7B,KAAK,CAAC,CAAC;GAC5B;EAAAf,MAAA,CAED4C,aAAa,GAAb,SAAAA,cAAcC,OAAiB;;IAC7BA,OAAO,CAACC,IAAI,CAAC,UAACC,CAAC,EAAEC,CAAC;MAAA,OAAKD,CAAC,GAAGC,CAAC;MAAC;IAE7BH,OAAO,CAACI,OAAO,CAAC,UAAClC,KAAK;MAAA,OAAKmC,MAAI,CAACd,SAAS,CAACrB,KAAK,CAAC;MAAC;IAEjD,IAAI,CAACO,UAAU,CAACuB,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAChD,oBAAoB,EAAE;IAE3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,KAAK,IAAImC,GAAG,GAAGW,OAAO,CAAC,CAAC,CAAC,EAAEX,GAAG,GAAG,IAAI,CAAC/B,KAAK,EAAE+B,GAAG,EAAE,EAAE;QAClD,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,EAAE,IAAI,CAACiB,GAAG,CAACjB,GAAG,CAAC,CAAC;;;GAGjD;EAAAlC,MAAA,CAEDoD,QAAQ,GAAR,SAAAA,SAASrC,KAAa;IAEpB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAM3B,QAAQ,GAAG/B,WAAW,CAAC,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAC5C,IAAMkD,IAAI,GAAG,IAAI,CAAChD,KAAK,CAACiD,KAAK,CAAC,IAAI,CAACnD,KAAK,CAAC;IACzCkD,IAAI,CAACb,MAAM,CAACzB,KAAK,EAAE,CAAC,CAAC;IAErB,KAAK,IAAIA,MAAK,GAAG,IAAI,CAACZ,KAAK,EAAEY,MAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,MAAK,EAAE,EAAE;MAC5DH,QAAQ,CAACG,MAAK,CAAC,GAAGsC,IAAI,CAACtC,MAAK,GAAG,IAAI,CAACZ,KAAK,CAAC,IAAI,CAAC;;IAGjD,KAAK,IAAIY,OAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,OAAK,GAAG,CAAC,EAAEA,OAAK,EAAE,EAAE;MACnDH,QAAQ,CAACG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,GAAG,CAAC,CAAC;;IAGjE,IAAI,CAACT,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IACvC,IAAI,CAACD,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDqB,aAAa,GAAb,SAAAA;IACE,IAAI,CAACkC,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,qBAAqB,GAAGlE,SAAS;GACvC;EAAAU,MAAA,CAED0C,qBAAqB,GAArB,SAAAA,sBAAsB3B,KAAa,EAAE0C,IAAmB,EAAEC,KAAc;IACtE,IAAI,OAAO3C,KAAK,KAAK,QAAQ,EAAE;MAC7B,IAAI,CAACyC,qBAAqB,GACxB,OAAO,IAAI,CAACA,qBAAqB,KAAK,QAAQ,GAC1C7E,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACH,qBAAqB,EAAEzC,KAAK,CAAC,GAC3CA,KAAK;MACX,IAAI,CAACwC,mBAAmB,CAAC,IAAI,CAACzC,QAAQ,CAACC,KAAK,CAAC,CAAC,GAAG;QAC/C2C,KAAK,EAALA,KAAK;QACLD,IAAI,EAAJA;OACD;;GAEJ;EAAAzD,MAAA,CAEDH,oBAAoB,GAApB,SAAAA;IAEE,IAAI,CAAC+D,qBAAqB,GAAG,EAAE;IAE/B,IAAI,OAAO,IAAI,CAAC9D,qBAAqB,KAAK,UAAU,EAAE;MACpD,IAAI,CAACA,qBAAqB,CAAC,IAAI,CAACO,KAAK,CAAC;;GAEzC;EAAAL,MAAA,CAED6D,MAAM,GAAN,SAAAA,OAAO9C,KAAa,EAAE2C,KAAa;IACjC,IAAI,OAAO3C,KAAK,KAAK,QAAQ,IAAIA,KAAK,GAAG,CAAC,EAAE,OAAO,KAAK;IACxD,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D,OAAO,KAAK;;IAGd,OAAOxB,KAAK,IAAI,IAAI,CAACZ,KAAK,EAAE;MAC1B,IAAI,CAACQ,OAAO,EAAE;;IAGhB,IAAMjC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC,GAAGgF,KAAK;IAExB,IAAI,CAAChB,qBAAqB,CAAC3B,KAAK,EAAE,KAAK,EAAE2C,KAAK,CAAC;IAE/C,IAAI3C,KAAK,GAAG,CAAC,GAAG,IAAI,CAACT,WAAW,EAAE;MAChC,IAAI,CAACA,WAAW,GAAGS,KAAK,GAAG,CAAC;;IAE9B,OAAO,IAAI;GACZ;EAAAf,MAAA,CAED8D,GAAG,GAAH,SAAAA,IAAI/C,KAAa,EAAE2C,KAAa;IAC9B,IAAI,CAACG,MAAM,CAAC9C,KAAK,EAAE2C,KAAK,CAAC;IACzB,IAAI,CAACtC,kBAAkB,CAACL,KAAK,CAAC;IAC9B,IAAI,CAAClB,oBAAoB,EAAE;IAC3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,IAAI,CAACA,mBAAmB,CAACgB,KAAK,EAAE2C,KAAK,CAAC;;IAExC,OAAO,IAAI;GACZ;EAAA1D,MAAA,CAED+D,WAAW,GAAX,SAAAA;;IACE,IAAI,OAAO,IAAI,CAACP,qBAAqB,KAAK,QAAQ,EAAE;MAClD,IAAMzC,KAAK,GAAG,IAAI,CAACyC,qBAAqB;MAExC,IAAMQ,IAAI,GAAGC,MAAM,CAACD,IAAI,CAAC,IAAI,CAACT,mBAAmB,CAAC;MAClD,IAAMW,aAAa,GAAGF,IAAI,CAACG,IAAI,CAC7B,UAAClD,GAAG;QAAA,OAAKmD,MAAI,CAACb,mBAAmB,CAACtC,GAAG,CAAC,CAACwC,IAAI,KAAK,QAAQ;QACzD;MAED,IAAIS,aAAa,EAAE;QACjB,OAAO,IAAI,CAAC5C,UAAU,CAACP,KAAK,CAAC;;MAG/B,IAAMU,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;MACnC,IAAMiE,UAAU,GAAGL,IAAI,CAAC9D,MAAM;MAE9B,IAAMoE,WAAW,GAAG,IAAI,CAACnE,KAAK,GAAGY,KAAK,GAAG,CAAC;MAE1C,IAAIU,KAAK,GAAG4C,UAAU,GAAGC,WAAW,EAAE;QACpC,OAAO,IAAI,CAAChD,UAAU,CAACP,KAAK,CAAC;;MAG/BiD,IAAI,CAACf,OAAO,CAAC,UAAChC,GAAG;QAAA,OAAKmD,MAAI,CAAChD,kBAAkB,CAACgD,MAAI,CAACpD,eAAe,CAACC,GAAG,CAAC,CAAC;QAAC;MAEzE,IAAI,CAACpB,oBAAoB,EAAE;MAE3B,IAAI,CAACwB,aAAa,EAAE;;GAEvB;EAAArB,MAAA,CAEDuE,kBAAkB,GAAlB,SAAAA;IACE,OAAO,IAAI,CAACC,aAAa,EAAE;GAC5B;EAAAxE,MAAA,CAEDwE,aAAa,GAAb,SAAAA;IACE,OAAO,IAAI,CAAClE,WAAW;GACxB;EAAAN,MAAA,CAEDmD,GAAG,GAAH,SAAAA,IAAIpC,KAAa;IAEf,IAAMrC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,OAAO,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC;GACxB;EAAAsB,MAAA,CAEDyE,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACrE,KAAK;GAClB;EAAAJ,MAAA,CAED0E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK;GAClB;EAAAH,MAAA,CAED2E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACtE,KAAK;GAClB;EAAAL,MAAA,CAED4E,WAAW,GAAX,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK,CAAC,CAAC,CAAC;GACrB;EAAAL,MAAA,CAMD6E,QAAQ,GAAR,SAAAA,SAASC,GAAW;IAGlB,IAAI,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG,IAAI,IAAI,EAC9C,OAAO,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG;IAC7C,IAAIA,GAAG,IAAI,CAAC,EAAE;MACZ,OAAO,CAAC;;IAGV,IAAIpG,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAG2E,GAAG,GAAG,CAAC;IAC/B,IAAIC,GAAG,GAAG,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,CAAC;IAE1B,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAIA,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;QAClBqG,GAAG,IAAI,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,GAAG,CAAC,CAAC;;;IAI/B,OAAOqG,GAAG;GACX;EAAA/E,MAAA,CAKDgF,KAAK,GAAL,SAAAA,MAAMC,YAAoB;IAMxB,OAAO,IAAI,CAACJ,QAAQ,CAACI,YAAY,GAAG,CAAC,CAAC;GACvC;EAAAjF,MAAA,CAMD+E,GAAG,GAAH,SAAAA,IAAIG,KAAa,EAAEJ,GAAW;IAE5B,OAAO,IAAI,CAACD,QAAQ,CAACC,GAAG,CAAC,GAAG,IAAI,CAACD,QAAQ,CAACK,KAAK,CAAC;GACjD;EAAAlF,MAAA,CAMDmF,kBAAkB,GAAlB,SAAAA,mBAAmBC,CAAS;IAC1B,IAAIA,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC9B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MAExB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,GAAGC,OAAO,EAAE;QACf3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAMDsF,wBAAwB,GAAxB,SAAAA,yBAAyBF,CAAS;IAChC,IAAIA,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC/B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MACxB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,IAAIC,OAAO,EAAE;QAChB3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAgBDuF,YAAY,GAAZ,SAAAA,aAAaC,SAAiB,EAAEC,SAAiB;IAC/C,IAAI,IAAI,CAACd,OAAO,EAAE,CAAC,CAAC,CAAC,GAAGa,SAAS,EAAE;MACjC,OAAO;QACL7D,UAAU,EAAE,IAAI,CAACrB,WAAW;QAC5BkB,QAAQ,EAAE,IAAI,CAAClB;OAChB;;IAGH,OAAO;MAELqB,UAAU,EAAE,IAAI,CAACwD,kBAAkB,CAACK,SAAS,CAAC;MAG9ChE,QAAQ,EAAE,IAAI,CAACkE,qBAAqB,CAACD,SAAS;KAC/C;GACF;EAAAzF,MAAA,CAMD2F,eAAe,GAAf,SAAAA,gBAAgBP,CAAS;IACvB,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAAC2B,wBAAwB,CAACF,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GACxE;EAAAN,MAAA,CAMD0F,qBAAqB,GAArB,SAAAA,sBAAsBN,CAAS;IAC7B,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACwB,kBAAkB,CAACC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GAClE;EAAA,OAAAlB,kBAAA;AAAA;;;;"}
1
+ {"version":3,"file":"prefix-interval-tree.esm.js","sources":["../src/index.ts"],"sourcesContent":["const parent = (node: number) => Math.floor(node / 2);\n\nconst createArray = function (size: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = 0;\n }\n return xs;\n};\n\n/**\n * Computes the next power of 2 after or equal to x.\n */\nfunction ceilLog2(x: number) {\n let y = 1;\n while (y < x) {\n y *= 2;\n }\n\n return y;\n}\n\ntype OperationType = 'set' | 'remove';\n\ntype Operation = {\n type: OperationType;\n value: any;\n};\n\n/**\n * A prefix interval tree stores an numeric array and the partial sums of that\n * array. It is optimized for updating the values of the array without\n * recomputing all of the partial sums.\n *\n * - O(ln n) update\n * - O(1) lookup\n * - O(ln n) compute a partial sum\n * - O(n) space\n *\n * Note that the sequence of partial sums is one longer than the array, so that\n * the first partial sum is always 0, and the last partial sum is the sum of the\n * entire array.\n */\nclass PrefixIntervalTree {\n private _size: number;\n /**\n * Half the size of the heap. It is also the number of non-leaf nodes, and the\n * index of the first element in the heap. Always a power of 2.\n */\n private _half: number;\n private _heap: number[];\n\n private _actualSize: number;\n\n private _onUpdateItemLayout: Function;\n private _onUpdateIntervalTree: Function;\n\n private _affectedIndicesMap: Record<string, Operation> = {};\n private _affectedMinimalIndex: number = undefined;\n private _cachedSumUntilValues: Record<string, number> = {};\n\n constructor(\n xs: number[] | number = 10,\n opts?: {\n onUpdateItemLayout?: Function;\n onUpdateIntervalTree?: Function;\n }\n ) {\n if (typeof xs === 'number') this.initWithNumber(xs);\n if (Array.isArray(xs)) this.initWithArray(xs);\n\n const { onUpdateItemLayout, onUpdateIntervalTree } = opts || {};\n this._onUpdateIntervalTree = onUpdateIntervalTree;\n this._onUpdateItemLayout = onUpdateItemLayout;\n }\n\n initWithNumber(length: number) {\n this._half = ceilLog2(length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n this._actualSize = 0;\n }\n\n initWithArray(arr: number[]) {\n this._half = ceilLog2(arr.length);\n this._size = this._half;\n this._heap = createArray(2 * this._half);\n let i;\n for (i = 0; i < this._size; ++i) {\n this._heap[this._half + i] = arr[i];\n }\n\n for (i = this._half - 1; i > 0; --i) {\n this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1];\n }\n this._actualSize = arr.length;\n }\n\n static uniform(size: number, initialValue: number) {\n const xs = [];\n for (let i = size - 1; i >= 0; --i) {\n xs[i] = initialValue;\n }\n\n return new PrefixIntervalTree(xs);\n }\n\n static empty(size: number) {\n return PrefixIntervalTree.uniform(size, 0);\n }\n\n /**\n * the length should be 2\n * it will cause calculation of\n */\n stretch() {\n const nextHeap = createArray(2 * this._half * 2);\n const nextHeapHalf = this._half * 2;\n\n // copy old value to new one\n for (let i = 0; i < this._size; i++) {\n nextHeap[nextHeapHalf + i] = this._heap[this._half + i] || 0;\n }\n\n // sum old value to create new sum value\n for (let i = nextHeapHalf - 1; i > 0; i--) {\n nextHeap[i] = nextHeap[2 * i] + nextHeap[2 * i + 1];\n }\n\n this._half = nextHeapHalf;\n this._size = nextHeapHalf;\n this._heap = nextHeap;\n }\n\n indexKey(index: number) {\n return `${index}`;\n }\n\n resolveKeyIndex(key: string) {\n return parseInt(key, 10);\n }\n\n isValidIndex(index: number) {\n return typeof index === 'number' && index >= 0 && index < this._actualSize;\n }\n\n reflowDirectParent(index: number) {\n this.resetAffected();\n let node = this._half + index;\n\n node = parent(node);\n for (; node !== 0; node = parent(node)) {\n this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1];\n }\n }\n\n // recalculate parent value from startIndex to endIndex\n reflowHeap(_startIndex: number, endIndex = this._half * 2 - 2) {\n this.resetAffected();\n const depth = Math.log2(this._size);\n const startIndex = _startIndex + this._half;\n\n Array.from({ length: depth }, (v, i) => i).reduce(\n (acc) => {\n const { startIndex, endIndex } = acc;\n const _nextStart = parent(startIndex);\n const _nextEnd = parent(endIndex);\n\n for (let idx = _nextStart; idx <= _nextEnd; idx++) {\n this._heap[idx] = this._heap[2 * idx] + this._heap[2 * idx + 1];\n }\n\n return {\n startIndex: _nextStart,\n endIndex: _nextEnd,\n };\n },\n {\n startIndex,\n endIndex,\n }\n );\n }\n\n /**\n *\n * @param index index to remove\n * @returns\n *\n * update heap only, but not recalculate interval tree value\n */\n dryRemove(index: number) {\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n this._heap.splice(this._half + index, 1);\n this._heap.push(0);\n this._actualSize = this._actualSize - 1;\n\n this.updateAffectedIndices(index, 'remove');\n }\n\n remove(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n\n this.removeIndices([index]);\n }\n\n removeIndices(indices: number[]) {\n indices.sort((a, b) => a - b);\n\n indices.forEach((index) => this.dryRemove(index));\n\n this.reflowHeap(indices[0]);\n this.onUpdateIntervalTree();\n\n if (typeof this._onUpdateItemLayout === 'function') {\n for (let idx = indices[0]; idx < this._half; idx++) {\n this._onUpdateItemLayout(idx, this.get(idx));\n }\n }\n }\n\n removeV0(index: number) {\n // if typeof index === 'undefined', then it will go into looooooooop\n if (!this.isValidIndex(index)) return;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return;\n }\n\n const nextHeap = createArray(this._half * 2);\n const copy = this._heap.slice(this._half);\n copy.splice(index, 1);\n\n for (let index = this._half; index < this._half * 2; index++) {\n nextHeap[index] = copy[index - this._half] || 0;\n }\n\n for (let index = this._half - 1; index > 0; index--) {\n nextHeap[index] = nextHeap[2 * index] + nextHeap[2 * index + 1];\n }\n\n this._actualSize = this._actualSize - 1;\n this._heap = nextHeap;\n }\n\n resetAffected() {\n this._affectedIndicesMap = {};\n this._affectedMinimalIndex = undefined;\n }\n\n updateAffectedIndices(index: number, type: OperationType, value?: number) {\n if (typeof index === 'number') {\n this._affectedMinimalIndex =\n typeof this._affectedMinimalIndex === 'number'\n ? Math.min(this._affectedMinimalIndex, index)\n : index;\n this._affectedIndicesMap[this.indexKey(index)] = {\n value,\n type,\n };\n }\n }\n\n onUpdateIntervalTree() {\n // reset cached value\n this._cachedSumUntilValues = {};\n\n if (typeof this._onUpdateIntervalTree === 'function') {\n this._onUpdateIntervalTree(this._heap);\n }\n }\n\n drySet(index: number, value: number) {\n if (typeof index !== 'number' || index < 0) return false;\n if (isNaN(index)) {\n console.warn('Passing a NaN value as interval tree index');\n return false;\n }\n\n while (index >= this._half) {\n this.stretch();\n }\n\n const node = this._half + index;\n this._heap[node] = value;\n\n this.updateAffectedIndices(index, 'set', value);\n\n if (index + 1 > this._actualSize) {\n this._actualSize = index + 1;\n }\n return true;\n }\n\n set(index: number, value: number) {\n this.drySet(index, value);\n this.reflowDirectParent(index);\n this.onUpdateIntervalTree();\n if (typeof this._onUpdateItemLayout === 'function') {\n this._onUpdateItemLayout(index, value);\n }\n return true;\n }\n\n applyUpdate() {\n if (typeof this._affectedMinimalIndex === 'number') {\n const index = this._affectedMinimalIndex;\n\n const keys = Object.keys(this._affectedIndicesMap);\n const hasRemoveItem = keys.some(\n (key) => this._affectedIndicesMap[key].type === 'remove'\n );\n\n if (hasRemoveItem) {\n return this.reflowHeap(index);\n }\n\n const depth = Math.log2(this._size);\n const itemLength = keys.length;\n\n const reflowTimes = this._half - index - 1;\n\n if (depth * itemLength > reflowTimes) {\n return this.reflowHeap(index);\n }\n\n keys.forEach((key) => this.reflowDirectParent(this.resolveKeyIndex(key)));\n\n this.onUpdateIntervalTree();\n\n this.resetAffected();\n }\n }\n\n getMaxUsefulLength() {\n return this.getActualSize();\n }\n\n getActualSize() {\n return this._actualSize;\n }\n\n get(index: number) {\n // invariant(index >= 0 && index < this._size, 'Index out of range %s', index);\n const node = this._half + index;\n return this._heap[node];\n }\n\n getSize() {\n return this._size;\n }\n\n getHalf() {\n return this._half;\n }\n\n getHeap() {\n return this._heap;\n }\n\n getMaxValue() {\n return this._heap[1];\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(end - 1).\n * End is not included. if end less than 0, then return 0\n */\n sumUntil(end: number) {\n // invariant(end >= 0 && end < this._size + 1, 'Index out of range %s', end);\n\n if (this._cachedSumUntilValues[`${end}`] != null)\n return this._cachedSumUntilValues[`${end}`];\n if (end <= 0) {\n return 0;\n }\n\n let node = this._half + end - 1;\n let sum = this._heap[node];\n\n for (; node !== 1; node = parent(node)) {\n if (node % 2 === 1) {\n sum += this._heap[node - 1];\n }\n }\n\n return sum;\n }\n\n /**\n * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd).\n */\n sumTo(inclusiveEnd: number) {\n // invariant(\n // inclusiveEnd >= 0 && inclusiveEnd < this._size,\n // 'Index out of range %s',\n // inclusiveEnd\n // );\n return this.sumUntil(inclusiveEnd + 1);\n }\n\n /**\n * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1).\n * end length is not included\n */\n sum(begin: number, end: number) {\n // invariant(begin <= end, 'Begin must precede end');\n return this.sumUntil(end) - this.sumUntil(begin);\n }\n\n /**\n * return the biggest i, sumUntil(i) === t\n * return the biggest i, subUntil(i) < t\n */\n greatestLowerBound(t: number) {\n if (t < 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n // not use this._size；this._size always be a big value\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t < leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n * Return the biggest i, subUntil(i) < t\n * or -1 if no such i exists.\n */\n greatestStrictLowerBound(t: number) {\n if (t <= 0 || !this._actualSize) {\n return -1;\n }\n\n let node = 1;\n if (this._heap[node] < t) {\n return this._actualSize;\n }\n\n while (node < this._half) {\n const leftSum = this._heap[2 * node];\n if (t <= leftSum) {\n node = 2 * node;\n } else {\n node = 2 * node + 1;\n t -= leftSum;\n }\n }\n\n return Math.min(node - this._half, this._actualSize);\n }\n\n /**\n *\n * @param minOffset\n * @param maxOffset\n * @returns\n *\n * pending issue:\n * when item with length list [100, 0, 100, 0, 0, 100].\n * then computeRange(100, 200) => { startIndex: 2, endIndex: 6 }\n *\n * item index in viewport will be [2, 3, 4, 5], index 6 is not\n * included just like Array.slice(start, end)\n *\n */\n computeRange(minOffset: number, maxOffset: number) {\n if (this.getHeap()[1] < minOffset) {\n return {\n startIndex: this._actualSize,\n endIndex: this._actualSize,\n };\n }\n\n return {\n // the biggest item, value <= minOffset\n startIndex: this.greatestLowerBound(minOffset),\n\n // the smallest item, value > maxOffset\n endIndex: this.leastStrictUpperBound(maxOffset),\n };\n }\n\n /**\n * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or\n * size + 1 if no such i exists.\n */\n leastUpperBound(t: number) {\n return Math.min(this.greatestStrictLowerBound(t) + 1, this._actualSize);\n }\n\n /**\n * Returns the smallest i, t < sumUntil(i), it should be used as range end\n * size + 1 if no such i exists.\n */\n leastStrictUpperBound(t: number) {\n return Math.min(this.greatestLowerBound(t) + 1, this._actualSize);\n }\n}\n\nexport default PrefixIntervalTree;\n"],"names":["parent","node","Math","floor","createArray","size","xs","i","ceilLog2","x","y","PrefixIntervalTree","opts","undefined","initWithNumber","Array","isArray","initWithArray","_ref","onUpdateItemLayout","onUpdateIntervalTree","_onUpdateIntervalTree","_onUpdateItemLayout","_proto","prototype","length","_half","_size","_heap","_actualSize","arr","uniform","initialValue","empty","stretch","nextHeap","nextHeapHalf","indexKey","index","resolveKeyIndex","key","parseInt","isValidIndex","reflowDirectParent","resetAffected","reflowHeap","_startIndex","endIndex","depth","log2","startIndex","from","v","reduce","acc","_nextStart","_nextEnd","idx","_this","dryRemove","isNaN","console","warn","splice","push","updateAffectedIndices","remove","removeIndices","indices","sort","a","b","forEach","_this2","get","removeV0","copy","slice","_affectedIndicesMap","_affectedMinimalIndex","type","value","min","_cachedSumUntilValues","drySet","set","applyUpdate","keys","Object","hasRemoveItem","some","_this3","itemLength","reflowTimes","getMaxUsefulLength","getActualSize","getSize","getHalf","getHeap","getMaxValue","sumUntil","end","sum","sumTo","inclusiveEnd","begin","greatestLowerBound","t","leftSum","greatestStrictLowerBound","computeRange","minOffset","maxOffset","leastStrictUpperBound","leastUpperBound"],"mappings":"AAAA,IAAMA,MAAM,GAAG,SAATA,MAAMA,CAAIC,IAAY;EAAA,OAAKC,IAAI,CAACC,KAAK,CAACF,IAAI,GAAG,CAAC,CAAC;AAAA;AAErD,IAAMG,WAAW,GAAG,SAAdA,WAAWA,CAAaC,IAAY;EACxC,IAAMC,EAAE,GAAG,EAAE;EACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;IAClCD,EAAE,CAACC,CAAC,CAAC,GAAG,CAAC;;EAEX,OAAOD,EAAE;AACX,CAAC;AAKD,SAASE,QAAQA,CAACC,CAAS;EACzB,IAAIC,CAAC,GAAG,CAAC;EACT,OAAOA,CAAC,GAAGD,CAAC,EAAE;IACZC,CAAC,IAAI,CAAC;;EAGR,OAAOA,CAAC;AACV;AAAC,IAuBKC,kBAAkB;EAkBtB,SAAAA,mBACEL,IACAM,IAGC;QAJDN;MAAAA,KAAwB,EAAE;;IALpB,wBAAmB,GAA8B,EAAE;IACnD,0BAAqB,GAAWO,SAAS;IACzC,0BAAqB,GAA2B,EAAE;IASxD,IAAI,OAAOP,EAAE,KAAK,QAAQ,EAAE,IAAI,CAACQ,cAAc,CAACR,EAAE,CAAC;IACnD,IAAIS,KAAK,CAACC,OAAO,CAACV,EAAE,CAAC,EAAE,IAAI,CAACW,aAAa,CAACX,EAAE,CAAC;IAE7C,IAAAY,IAAA,GAAqDN,IAAI,IAAI,EAAE;MAAvDO,kBAAkB,GAAAD,IAAA,CAAlBC,kBAAkB;MAAEC,oBAAoB,GAAAF,IAAA,CAApBE,oBAAoB;IAChD,IAAI,CAACC,qBAAqB,GAAGD,oBAAoB;IACjD,IAAI,CAACE,mBAAmB,GAAGH,kBAAkB;;EAC9C,IAAAI,MAAA,GAAAZ,kBAAA,CAAAa,SAAA;EAAAD,MAAA,CAEDT,cAAc,GAAd,SAAAA,eAAeW,MAAc;IAC3B,IAAI,CAACC,KAAK,GAAGlB,QAAQ,CAACiB,MAAM,CAAC;IAC7B,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAI,CAACG,WAAW,GAAG,CAAC;GACrB;EAAAN,MAAA,CAEDN,aAAa,GAAb,SAAAA,cAAca,GAAa;IACzB,IAAI,CAACJ,KAAK,GAAGlB,QAAQ,CAACsB,GAAG,CAACL,MAAM,CAAC;IACjC,IAAI,CAACE,KAAK,GAAG,IAAI,CAACD,KAAK;IACvB,IAAI,CAACE,KAAK,GAAGxB,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,CAAC;IACxC,IAAInB,CAAC;IACL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAE,EAAEpB,CAAC,EAAE;MAC/B,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,GAAGuB,GAAG,CAACvB,CAAC,CAAC;;IAGrC,KAAKA,CAAC,GAAG,IAAI,CAACmB,KAAK,GAAG,CAAC,EAAEnB,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACnC,IAAI,CAACqB,KAAK,CAACrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,CAAC,GAAGrB,CAAC,GAAG,CAAC,CAAC;;IAE3D,IAAI,CAACsB,WAAW,GAAGC,GAAG,CAACL,MAAM;GAC9B;EAAAd,kBAAA,CAEMoB,OAAO,GAAd,SAAAA,QAAe1B,IAAY,EAAE2B,YAAoB;IAC/C,IAAM1B,EAAE,GAAG,EAAE;IACb,KAAK,IAAIC,CAAC,GAAGF,IAAI,GAAG,CAAC,EAAEE,CAAC,IAAI,CAAC,EAAE,EAAEA,CAAC,EAAE;MAClCD,EAAE,CAACC,CAAC,CAAC,GAAGyB,YAAY;;IAGtB,OAAO,IAAIrB,kBAAkB,CAACL,EAAE,CAAC;GAClC;EAAAK,kBAAA,CAEMsB,KAAK,GAAZ,SAAAA,MAAa5B,IAAY;IACvB,OAAOM,kBAAkB,CAACoB,OAAO,CAAC1B,IAAI,EAAE,CAAC,CAAC;GAC3C;EAAAkB,MAAA,CAMDW,OAAO,GAAP,SAAAA;IACE,IAAMC,QAAQ,GAAG/B,WAAW,CAAC,CAAC,GAAG,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAChD,IAAMU,YAAY,GAAG,IAAI,CAACV,KAAK,GAAG,CAAC;IAGnC,KAAK,IAAInB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACoB,KAAK,EAAEpB,CAAC,EAAE,EAAE;MACnC4B,QAAQ,CAACC,YAAY,GAAG7B,CAAC,CAAC,GAAG,IAAI,CAACqB,KAAK,CAAC,IAAI,CAACF,KAAK,GAAGnB,CAAC,CAAC,IAAI,CAAC;;IAI9D,KAAK,IAAIA,EAAC,GAAG6B,YAAY,GAAG,CAAC,EAAE7B,EAAC,GAAG,CAAC,EAAEA,EAAC,EAAE,EAAE;MACzC4B,QAAQ,CAAC5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,CAAC,GAAG4B,QAAQ,CAAC,CAAC,GAAG5B,EAAC,GAAG,CAAC,CAAC;;IAGrD,IAAI,CAACmB,KAAK,GAAGU,YAAY;IACzB,IAAI,CAACT,KAAK,GAAGS,YAAY;IACzB,IAAI,CAACR,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDc,QAAQ,GAAR,SAAAA,SAASC,KAAa;IACpB,YAAUA,KAAK;GAChB;EAAAf,MAAA,CAEDgB,eAAe,GAAf,SAAAA,gBAAgBC,GAAW;IACzB,OAAOC,QAAQ,CAACD,GAAG,EAAE,EAAE,CAAC;GACzB;EAAAjB,MAAA,CAEDmB,YAAY,GAAZ,SAAAA,aAAaJ,KAAa;IACxB,OAAO,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,IAAI,CAAC,IAAIA,KAAK,GAAG,IAAI,CAACT,WAAW;GAC3E;EAAAN,MAAA,CAEDoB,kBAAkB,GAAlB,SAAAA,mBAAmBL,KAAa;IAC9B,IAAI,CAACM,aAAa,EAAE;IACpB,IAAI3C,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAE7BrC,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC;IACnB,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC,GAAG,IAAI,CAAC2B,KAAK,CAAC,CAAC,GAAG3B,IAAI,GAAG,CAAC,CAAC;;GAErE;EAAAsB,MAAA,CAGDsB,UAAU,GAAV,SAAAA,WAAWC,WAAmB,EAAEC,QAAQ;;QAARA,QAAQ;MAARA,QAAQ,GAAG,IAAI,CAACrB,KAAK,GAAG,CAAC,GAAG,CAAC;;IAC3D,IAAI,CAACkB,aAAa,EAAE;IACpB,IAAMI,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;IACnC,IAAMuB,UAAU,GAAGJ,WAAW,GAAG,IAAI,CAACpB,KAAK;IAE3CX,KAAK,CAACoC,IAAI,CAAC;MAAE1B,MAAM,EAAEuB;KAAO,EAAE,UAACI,CAAC,EAAE7C,CAAC;MAAA,OAAKA,CAAC;MAAC,CAAC8C,MAAM,CAC/C,UAACC,GAAG;MACF,IAAQJ,UAAU,GAAeI,GAAG,CAA5BJ,UAAU;QAAEH,QAAQ,GAAKO,GAAG,CAAhBP,QAAQ;MAC5B,IAAMQ,UAAU,GAAGvD,MAAM,CAACkD,UAAU,CAAC;MACrC,IAAMM,QAAQ,GAAGxD,MAAM,CAAC+C,QAAQ,CAAC;MAEjC,KAAK,IAAIU,GAAG,GAAGF,UAAU,EAAEE,GAAG,IAAID,QAAQ,EAAEC,GAAG,EAAE,EAAE;QACjDC,KAAI,CAAC9B,KAAK,CAAC6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,CAAC,GAAGC,KAAI,CAAC9B,KAAK,CAAC,CAAC,GAAG6B,GAAG,GAAG,CAAC,CAAC;;MAGjE,OAAO;QACLP,UAAU,EAAEK,UAAU;QACtBR,QAAQ,EAAES;OACX;KACF,EACD;MACEN,UAAU,EAAVA,UAAU;MACVH,QAAQ,EAARA;KACD,CACF;GACF;EAAAxB,MAAA,CASDoC,SAAS,GAAT,SAAAA,UAAUrB,KAAa;IACrB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAI,CAAClC,KAAK,CAACmC,MAAM,CAAC,IAAI,CAACrC,KAAK,GAAGY,KAAK,EAAE,CAAC,CAAC;IACxC,IAAI,CAACV,KAAK,CAACoC,IAAI,CAAC,CAAC,CAAC;IAClB,IAAI,CAACnC,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IAEvC,IAAI,CAACoC,qBAAqB,CAAC3B,KAAK,EAAE,QAAQ,CAAC;GAC5C;EAAAf,MAAA,CAED2C,MAAM,GAAN,SAAAA,OAAO5B,KAAa;IAGlB,IAAI,CAAC6B,aAAa,CAAC,CAAC7B,KAAK,CAAC,CAAC;GAC5B;EAAAf,MAAA,CAED4C,aAAa,GAAb,SAAAA,cAAcC,OAAiB;;IAC7BA,OAAO,CAACC,IAAI,CAAC,UAACC,CAAC,EAAEC,CAAC;MAAA,OAAKD,CAAC,GAAGC,CAAC;MAAC;IAE7BH,OAAO,CAACI,OAAO,CAAC,UAAClC,KAAK;MAAA,OAAKmC,MAAI,CAACd,SAAS,CAACrB,KAAK,CAAC;MAAC;IAEjD,IAAI,CAACO,UAAU,CAACuB,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAChD,oBAAoB,EAAE;IAE3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,KAAK,IAAImC,GAAG,GAAGW,OAAO,CAAC,CAAC,CAAC,EAAEX,GAAG,GAAG,IAAI,CAAC/B,KAAK,EAAE+B,GAAG,EAAE,EAAE;QAClD,IAAI,CAACnC,mBAAmB,CAACmC,GAAG,EAAE,IAAI,CAACiB,GAAG,CAACjB,GAAG,CAAC,CAAC;;;GAGjD;EAAAlC,MAAA,CAEDoD,QAAQ,GAAR,SAAAA,SAASrC,KAAa;IAEpB,IAAI,CAAC,IAAI,CAACI,YAAY,CAACJ,KAAK,CAAC,EAAE;IAC/B,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D;;IAGF,IAAM3B,QAAQ,GAAG/B,WAAW,CAAC,IAAI,CAACsB,KAAK,GAAG,CAAC,CAAC;IAC5C,IAAMkD,IAAI,GAAG,IAAI,CAAChD,KAAK,CAACiD,KAAK,CAAC,IAAI,CAACnD,KAAK,CAAC;IACzCkD,IAAI,CAACb,MAAM,CAACzB,KAAK,EAAE,CAAC,CAAC;IAErB,KAAK,IAAIA,MAAK,GAAG,IAAI,CAACZ,KAAK,EAAEY,MAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,MAAK,EAAE,EAAE;MAC5DH,QAAQ,CAACG,MAAK,CAAC,GAAGsC,IAAI,CAACtC,MAAK,GAAG,IAAI,CAACZ,KAAK,CAAC,IAAI,CAAC;;IAGjD,KAAK,IAAIY,OAAK,GAAG,IAAI,CAACZ,KAAK,GAAG,CAAC,EAAEY,OAAK,GAAG,CAAC,EAAEA,OAAK,EAAE,EAAE;MACnDH,QAAQ,CAACG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,CAAC,GAAGH,QAAQ,CAAC,CAAC,GAAGG,OAAK,GAAG,CAAC,CAAC;;IAGjE,IAAI,CAACT,WAAW,GAAG,IAAI,CAACA,WAAW,GAAG,CAAC;IACvC,IAAI,CAACD,KAAK,GAAGO,QAAQ;GACtB;EAAAZ,MAAA,CAEDqB,aAAa,GAAb,SAAAA;IACE,IAAI,CAACkC,mBAAmB,GAAG,EAAE;IAC7B,IAAI,CAACC,qBAAqB,GAAGlE,SAAS;GACvC;EAAAU,MAAA,CAED0C,qBAAqB,GAArB,SAAAA,sBAAsB3B,KAAa,EAAE0C,IAAmB,EAAEC,KAAc;IACtE,IAAI,OAAO3C,KAAK,KAAK,QAAQ,EAAE;MAC7B,IAAI,CAACyC,qBAAqB,GACxB,OAAO,IAAI,CAACA,qBAAqB,KAAK,QAAQ,GAC1C7E,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACH,qBAAqB,EAAEzC,KAAK,CAAC,GAC3CA,KAAK;MACX,IAAI,CAACwC,mBAAmB,CAAC,IAAI,CAACzC,QAAQ,CAACC,KAAK,CAAC,CAAC,GAAG;QAC/C2C,KAAK,EAALA,KAAK;QACLD,IAAI,EAAJA;OACD;;GAEJ;EAAAzD,MAAA,CAEDH,oBAAoB,GAApB,SAAAA;IAEE,IAAI,CAAC+D,qBAAqB,GAAG,EAAE;IAE/B,IAAI,OAAO,IAAI,CAAC9D,qBAAqB,KAAK,UAAU,EAAE;MACpD,IAAI,CAACA,qBAAqB,CAAC,IAAI,CAACO,KAAK,CAAC;;GAEzC;EAAAL,MAAA,CAED6D,MAAM,GAAN,SAAAA,OAAO9C,KAAa,EAAE2C,KAAa;IACjC,IAAI,OAAO3C,KAAK,KAAK,QAAQ,IAAIA,KAAK,GAAG,CAAC,EAAE,OAAO,KAAK;IACxD,IAAIsB,KAAK,CAACtB,KAAK,CAAC,EAAE;MAChBuB,OAAO,CAACC,IAAI,CAAC,4CAA4C,CAAC;MAC1D,OAAO,KAAK;;IAGd,OAAOxB,KAAK,IAAI,IAAI,CAACZ,KAAK,EAAE;MAC1B,IAAI,CAACQ,OAAO,EAAE;;IAGhB,IAAMjC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC,GAAGgF,KAAK;IAExB,IAAI,CAAChB,qBAAqB,CAAC3B,KAAK,EAAE,KAAK,EAAE2C,KAAK,CAAC;IAE/C,IAAI3C,KAAK,GAAG,CAAC,GAAG,IAAI,CAACT,WAAW,EAAE;MAChC,IAAI,CAACA,WAAW,GAAGS,KAAK,GAAG,CAAC;;IAE9B,OAAO,IAAI;GACZ;EAAAf,MAAA,CAED8D,GAAG,GAAH,SAAAA,IAAI/C,KAAa,EAAE2C,KAAa;IAC9B,IAAI,CAACG,MAAM,CAAC9C,KAAK,EAAE2C,KAAK,CAAC;IACzB,IAAI,CAACtC,kBAAkB,CAACL,KAAK,CAAC;IAC9B,IAAI,CAAClB,oBAAoB,EAAE;IAC3B,IAAI,OAAO,IAAI,CAACE,mBAAmB,KAAK,UAAU,EAAE;MAClD,IAAI,CAACA,mBAAmB,CAACgB,KAAK,EAAE2C,KAAK,CAAC;;IAExC,OAAO,IAAI;GACZ;EAAA1D,MAAA,CAED+D,WAAW,GAAX,SAAAA;;IACE,IAAI,OAAO,IAAI,CAACP,qBAAqB,KAAK,QAAQ,EAAE;MAClD,IAAMzC,KAAK,GAAG,IAAI,CAACyC,qBAAqB;MAExC,IAAMQ,IAAI,GAAGC,MAAM,CAACD,IAAI,CAAC,IAAI,CAACT,mBAAmB,CAAC;MAClD,IAAMW,aAAa,GAAGF,IAAI,CAACG,IAAI,CAC7B,UAAClD,GAAG;QAAA,OAAKmD,MAAI,CAACb,mBAAmB,CAACtC,GAAG,CAAC,CAACwC,IAAI,KAAK,QAAQ;QACzD;MAED,IAAIS,aAAa,EAAE;QACjB,OAAO,IAAI,CAAC5C,UAAU,CAACP,KAAK,CAAC;;MAG/B,IAAMU,KAAK,GAAG9C,IAAI,CAAC+C,IAAI,CAAC,IAAI,CAACtB,KAAK,CAAC;MACnC,IAAMiE,UAAU,GAAGL,IAAI,CAAC9D,MAAM;MAE9B,IAAMoE,WAAW,GAAG,IAAI,CAACnE,KAAK,GAAGY,KAAK,GAAG,CAAC;MAE1C,IAAIU,KAAK,GAAG4C,UAAU,GAAGC,WAAW,EAAE;QACpC,OAAO,IAAI,CAAChD,UAAU,CAACP,KAAK,CAAC;;MAG/BiD,IAAI,CAACf,OAAO,CAAC,UAAChC,GAAG;QAAA,OAAKmD,MAAI,CAAChD,kBAAkB,CAACgD,MAAI,CAACpD,eAAe,CAACC,GAAG,CAAC,CAAC;QAAC;MAEzE,IAAI,CAACpB,oBAAoB,EAAE;MAE3B,IAAI,CAACwB,aAAa,EAAE;;GAEvB;EAAArB,MAAA,CAEDuE,kBAAkB,GAAlB,SAAAA;IACE,OAAO,IAAI,CAACC,aAAa,EAAE;GAC5B;EAAAxE,MAAA,CAEDwE,aAAa,GAAb,SAAAA;IACE,OAAO,IAAI,CAAClE,WAAW;GACxB;EAAAN,MAAA,CAEDmD,GAAG,GAAH,SAAAA,IAAIpC,KAAa;IAEf,IAAMrC,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAGY,KAAK;IAC/B,OAAO,IAAI,CAACV,KAAK,CAAC3B,IAAI,CAAC;GACxB;EAAAsB,MAAA,CAEDyE,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACrE,KAAK;GAClB;EAAAJ,MAAA,CAED0E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK;GAClB;EAAAH,MAAA,CAED2E,OAAO,GAAP,SAAAA;IACE,OAAO,IAAI,CAACtE,KAAK;GAClB;EAAAL,MAAA,CAED4E,WAAW,GAAX,SAAAA;IACE,OAAO,IAAI,CAACvE,KAAK,CAAC,CAAC,CAAC;GACrB;EAAAL,MAAA,CAMD6E,QAAQ,GAAR,SAAAA,SAASC,GAAW;IAGlB,IAAI,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG,IAAI,IAAI,EAC9C,OAAO,IAAI,CAAClB,qBAAqB,MAAIkB,GAAG,CAAG;IAC7C,IAAIA,GAAG,IAAI,CAAC,EAAE;MACZ,OAAO,CAAC;;IAGV,IAAIpG,IAAI,GAAG,IAAI,CAACyB,KAAK,GAAG2E,GAAG,GAAG,CAAC;IAC/B,IAAIC,GAAG,GAAG,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,CAAC;IAE1B,OAAOA,IAAI,KAAK,CAAC,EAAEA,IAAI,GAAGD,MAAM,CAACC,IAAI,CAAC,EAAE;MACtC,IAAIA,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;QAClBqG,GAAG,IAAI,IAAI,CAAC1E,KAAK,CAAC3B,IAAI,GAAG,CAAC,CAAC;;;IAI/B,OAAOqG,GAAG;GACX;EAAA/E,MAAA,CAKDgF,KAAK,GAAL,SAAAA,MAAMC,YAAoB;IAMxB,OAAO,IAAI,CAACJ,QAAQ,CAACI,YAAY,GAAG,CAAC,CAAC;GACvC;EAAAjF,MAAA,CAMD+E,GAAG,GAAH,SAAAA,IAAIG,KAAa,EAAEJ,GAAW;IAE5B,OAAO,IAAI,CAACD,QAAQ,CAACC,GAAG,CAAC,GAAG,IAAI,CAACD,QAAQ,CAACK,KAAK,CAAC;GACjD;EAAAlF,MAAA,CAMDmF,kBAAkB,GAAlB,SAAAA,mBAAmBC,CAAS;IAC1B,IAAIA,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC9B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MAExB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,GAAGC,OAAO,EAAE;QACf3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAMDsF,wBAAwB,GAAxB,SAAAA,yBAAyBF,CAAS;IAChC,IAAIA,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC9E,WAAW,EAAE;MAC/B,OAAO,CAAC,CAAC;;IAGX,IAAI5B,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,CAAC2B,KAAK,CAAC3B,IAAI,CAAC,GAAG0G,CAAC,EAAE;MACxB,OAAO,IAAI,CAAC9E,WAAW;;IAGzB,OAAO5B,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE;MACxB,IAAMkF,OAAO,GAAG,IAAI,CAAChF,KAAK,CAAC,CAAC,GAAG3B,IAAI,CAAC;MACpC,IAAI0G,CAAC,IAAIC,OAAO,EAAE;QAChB3G,IAAI,GAAG,CAAC,GAAGA,IAAI;OAChB,MAAM;QACLA,IAAI,GAAG,CAAC,GAAGA,IAAI,GAAG,CAAC;QACnB0G,CAAC,IAAIC,OAAO;;;IAIhB,OAAO1G,IAAI,CAACgF,GAAG,CAACjF,IAAI,GAAG,IAAI,CAACyB,KAAK,EAAE,IAAI,CAACG,WAAW,CAAC;GACrD;EAAAN,MAAA,CAgBDuF,YAAY,GAAZ,SAAAA,aAAaC,SAAiB,EAAEC,SAAiB;IAC/C,IAAI,IAAI,CAACd,OAAO,EAAE,CAAC,CAAC,CAAC,GAAGa,SAAS,EAAE;MACjC,OAAO;QACL7D,UAAU,EAAE,IAAI,CAACrB,WAAW;QAC5BkB,QAAQ,EAAE,IAAI,CAAClB;OAChB;;IAGH,OAAO;MAELqB,UAAU,EAAE,IAAI,CAACwD,kBAAkB,CAACK,SAAS,CAAC;MAG9ChE,QAAQ,EAAE,IAAI,CAACkE,qBAAqB,CAACD,SAAS;KAC/C;GACF;EAAAzF,MAAA,CAMD2F,eAAe,GAAf,SAAAA,gBAAgBP,CAAS;IACvB,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAAC2B,wBAAwB,CAACF,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GACxE;EAAAN,MAAA,CAMD0F,qBAAqB,GAArB,SAAAA,sBAAsBN,CAAS;IAC7B,OAAOzG,IAAI,CAACgF,GAAG,CAAC,IAAI,CAACwB,kBAAkB,CAACC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC9E,WAAW,CAAC;GAClE;EAAA,OAAAlB,kBAAA;AAAA;;;;"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@x-oasis/prefix-interval-tree",
3
- "version": "0.5.0",
3
+ "version": "0.7.0",
4
4
  "description": "prefix interval tree function",
5
5
  "main": "dist/index.js",
6
6
  "typings": "dist/index.d.ts",
package/src/index.ts CHANGED
@@ -55,13 +55,9 @@ class PrefixIntervalTree {
55
55
  private _onUpdateItemLayout: Function;
56
56
  private _onUpdateIntervalTree: Function;
57
57
 
58
- private _affectedIndicesMap: {
59
- [key: string]: Operation;
60
- } = {};
58
+ private _affectedIndicesMap: Record<string, Operation> = {};
61
59
  private _affectedMinimalIndex: number = undefined;
62
- private _cachedSumUntilValues: {
63
- [key: string]: number;
64
- } = {};
60
+ private _cachedSumUntilValues: Record<string, number> = {};
65
61
 
66
62
  constructor(
67
63
  xs: number[] | number = 10,