mirror of
https://github.com/ckaczor/azuredatastudio.git
synced 2026-02-10 18:22:34 -05:00
260 lines
6.7 KiB
TypeScript
260 lines
6.7 KiB
TypeScript
/*---------------------------------------------------------------------------------------------
|
|
* Copyright (c) Microsoft Corporation. All rights reserved.
|
|
* Licensed under the Source EULA. See License.txt in the project root for license information.
|
|
*--------------------------------------------------------------------------------------------*/
|
|
|
|
import { toUint32 } from 'vs/editor/common/core/uint';
|
|
|
|
export class PrefixSumIndexOfResult {
|
|
_prefixSumIndexOfResultBrand: void;
|
|
|
|
index: number;
|
|
remainder: number;
|
|
|
|
constructor(index: number, remainder: number) {
|
|
this.index = index;
|
|
this.remainder = remainder;
|
|
}
|
|
}
|
|
|
|
export class PrefixSumComputer {
|
|
|
|
/**
|
|
* values[i] is the value at index i
|
|
*/
|
|
private values: Uint32Array;
|
|
|
|
/**
|
|
* prefixSum[i] = SUM(heights[j]), 0 <= j <= i
|
|
*/
|
|
private prefixSum: Uint32Array;
|
|
|
|
/**
|
|
* prefixSum[i], 0 <= i <= prefixSumValidIndex can be trusted
|
|
*/
|
|
private prefixSumValidIndex: Int32Array;
|
|
|
|
constructor(values: Uint32Array) {
|
|
this.values = values;
|
|
this.prefixSum = new Uint32Array(values.length);
|
|
this.prefixSumValidIndex = new Int32Array(1);
|
|
this.prefixSumValidIndex[0] = -1;
|
|
}
|
|
|
|
public getCount(): number {
|
|
return this.values.length;
|
|
}
|
|
|
|
public insertValues(insertIndex: number, insertValues: Uint32Array): boolean {
|
|
insertIndex = toUint32(insertIndex);
|
|
const oldValues = this.values;
|
|
const oldPrefixSum = this.prefixSum;
|
|
const insertValuesLen = insertValues.length;
|
|
|
|
if (insertValuesLen === 0) {
|
|
return false;
|
|
}
|
|
|
|
this.values = new Uint32Array(oldValues.length + insertValuesLen);
|
|
this.values.set(oldValues.subarray(0, insertIndex), 0);
|
|
this.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen);
|
|
this.values.set(insertValues, insertIndex);
|
|
|
|
if (insertIndex - 1 < this.prefixSumValidIndex[0]) {
|
|
this.prefixSumValidIndex[0] = insertIndex - 1;
|
|
}
|
|
|
|
this.prefixSum = new Uint32Array(this.values.length);
|
|
if (this.prefixSumValidIndex[0] >= 0) {
|
|
this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public changeValue(index: number, value: number): boolean {
|
|
index = toUint32(index);
|
|
value = toUint32(value);
|
|
|
|
if (this.values[index] === value) {
|
|
return false;
|
|
}
|
|
this.values[index] = value;
|
|
if (index - 1 < this.prefixSumValidIndex[0]) {
|
|
this.prefixSumValidIndex[0] = index - 1;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public removeValues(startIndex: number, cnt: number): boolean {
|
|
startIndex = toUint32(startIndex);
|
|
cnt = toUint32(cnt);
|
|
|
|
const oldValues = this.values;
|
|
const oldPrefixSum = this.prefixSum;
|
|
|
|
if (startIndex >= oldValues.length) {
|
|
return false;
|
|
}
|
|
|
|
let maxCnt = oldValues.length - startIndex;
|
|
if (cnt >= maxCnt) {
|
|
cnt = maxCnt;
|
|
}
|
|
|
|
if (cnt === 0) {
|
|
return false;
|
|
}
|
|
|
|
this.values = new Uint32Array(oldValues.length - cnt);
|
|
this.values.set(oldValues.subarray(0, startIndex), 0);
|
|
this.values.set(oldValues.subarray(startIndex + cnt), startIndex);
|
|
|
|
this.prefixSum = new Uint32Array(this.values.length);
|
|
if (startIndex - 1 < this.prefixSumValidIndex[0]) {
|
|
this.prefixSumValidIndex[0] = startIndex - 1;
|
|
}
|
|
if (this.prefixSumValidIndex[0] >= 0) {
|
|
this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public getTotalValue(): number {
|
|
if (this.values.length === 0) {
|
|
return 0;
|
|
}
|
|
return this._getAccumulatedValue(this.values.length - 1);
|
|
}
|
|
|
|
public getAccumulatedValue(index: number): number {
|
|
if (index < 0) {
|
|
return 0;
|
|
}
|
|
|
|
index = toUint32(index);
|
|
return this._getAccumulatedValue(index);
|
|
}
|
|
|
|
private _getAccumulatedValue(index: number): number {
|
|
if (index <= this.prefixSumValidIndex[0]) {
|
|
return this.prefixSum[index];
|
|
}
|
|
|
|
let startIndex = this.prefixSumValidIndex[0] + 1;
|
|
if (startIndex === 0) {
|
|
this.prefixSum[0] = this.values[0];
|
|
startIndex++;
|
|
}
|
|
|
|
if (index >= this.values.length) {
|
|
index = this.values.length - 1;
|
|
}
|
|
|
|
for (let i = startIndex; i <= index; i++) {
|
|
this.prefixSum[i] = this.prefixSum[i - 1] + this.values[i];
|
|
}
|
|
this.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index);
|
|
return this.prefixSum[index];
|
|
}
|
|
|
|
public getIndexOf(accumulatedValue: number): PrefixSumIndexOfResult {
|
|
accumulatedValue = Math.floor(accumulatedValue); //@perf
|
|
|
|
// Compute all sums (to get a fully valid prefixSum)
|
|
this.getTotalValue();
|
|
|
|
let low = 0;
|
|
let high = this.values.length - 1;
|
|
let mid = 0;
|
|
let midStop = 0;
|
|
let midStart = 0;
|
|
|
|
while (low <= high) {
|
|
mid = low + ((high - low) / 2) | 0;
|
|
|
|
midStop = this.prefixSum[mid];
|
|
midStart = midStop - this.values[mid];
|
|
|
|
if (accumulatedValue < midStart) {
|
|
high = mid - 1;
|
|
} else if (accumulatedValue >= midStop) {
|
|
low = mid + 1;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
return new PrefixSumIndexOfResult(mid, accumulatedValue - midStart);
|
|
}
|
|
}
|
|
|
|
export class PrefixSumComputerWithCache {
|
|
|
|
private readonly _actual: PrefixSumComputer;
|
|
private _cacheAccumulatedValueStart: number = 0;
|
|
private _cache: PrefixSumIndexOfResult[] | null = null;
|
|
|
|
constructor(values: Uint32Array) {
|
|
this._actual = new PrefixSumComputer(values);
|
|
this._bustCache();
|
|
}
|
|
|
|
private _bustCache(): void {
|
|
this._cacheAccumulatedValueStart = 0;
|
|
this._cache = null;
|
|
}
|
|
|
|
public insertValues(insertIndex: number, insertValues: Uint32Array): void {
|
|
if (this._actual.insertValues(insertIndex, insertValues)) {
|
|
this._bustCache();
|
|
}
|
|
}
|
|
|
|
public changeValue(index: number, value: number): void {
|
|
if (this._actual.changeValue(index, value)) {
|
|
this._bustCache();
|
|
}
|
|
}
|
|
|
|
public removeValues(startIndex: number, cnt: number): void {
|
|
if (this._actual.removeValues(startIndex, cnt)) {
|
|
this._bustCache();
|
|
}
|
|
}
|
|
|
|
public getTotalValue(): number {
|
|
return this._actual.getTotalValue();
|
|
}
|
|
|
|
public getAccumulatedValue(index: number): number {
|
|
return this._actual.getAccumulatedValue(index);
|
|
}
|
|
|
|
public getIndexOf(accumulatedValue: number): PrefixSumIndexOfResult {
|
|
accumulatedValue = Math.floor(accumulatedValue); //@perf
|
|
|
|
if (this._cache !== null) {
|
|
let cacheIndex = accumulatedValue - this._cacheAccumulatedValueStart;
|
|
if (cacheIndex >= 0 && cacheIndex < this._cache.length) {
|
|
// Cache hit!
|
|
return this._cache[cacheIndex];
|
|
}
|
|
}
|
|
|
|
// Cache miss!
|
|
return this._actual.getIndexOf(accumulatedValue);
|
|
}
|
|
|
|
/**
|
|
* Gives a hint that a lot of requests are about to come in for these accumulated values.
|
|
*/
|
|
public warmUpCache(accumulatedValueStart: number, accumulatedValueEnd: number): void {
|
|
let newCache: PrefixSumIndexOfResult[] = [];
|
|
for (let accumulatedValue = accumulatedValueStart; accumulatedValue <= accumulatedValueEnd; accumulatedValue++) {
|
|
newCache[accumulatedValue - accumulatedValueStart] = this.getIndexOf(accumulatedValue);
|
|
}
|
|
this._cache = newCache;
|
|
this._cacheAccumulatedValueStart = accumulatedValueStart;
|
|
}
|
|
}
|