mqtt and socket added
This commit is contained in:
Miisa Ekholm
124
WebUI/node_modules/js-sdsl/dist/esm/container/ContainerBase/index.d.ts
generated
vendored
Normal file
124
WebUI/node_modules/js-sdsl/dist/esm/container/ContainerBase/index.d.ts
generated
vendored
Normal file
@@ -0,0 +1,124 @@
|
||||
export declare abstract class ContainerIterator<T> {
|
||||
static readonly NORMAL = false;
|
||||
static readonly REVERSE = true;
|
||||
/**
|
||||
* @description Iterator's type.
|
||||
*/
|
||||
readonly iteratorType: boolean;
|
||||
protected node: unknown;
|
||||
protected constructor(iteratorType?: boolean);
|
||||
/**
|
||||
* @description Pointers to element.
|
||||
* @return The value of the pointer's element.
|
||||
*/
|
||||
abstract get pointer(): T;
|
||||
/**
|
||||
* @description Set pointer's value (some containers are unavailable).
|
||||
* @param newValue The new value you want to set.
|
||||
*/
|
||||
abstract set pointer(newValue: T);
|
||||
/**
|
||||
* @description Move `this` iterator to pre.
|
||||
*/
|
||||
abstract pre(): this;
|
||||
/**
|
||||
* @description Move `this` iterator to next.
|
||||
*/
|
||||
abstract next(): this;
|
||||
/**
|
||||
* @param obj The other iterator you want to compare.
|
||||
* @return Boolean about if this equals to obj.
|
||||
* @example container.find(1).equals(container.end());
|
||||
*/
|
||||
abstract equals(obj: ContainerIterator<T>): boolean;
|
||||
/**
|
||||
* @description Get a copy of itself.<br/>
|
||||
* We do not guarantee the safety of this function.<br/>
|
||||
* Please ensure that the iterator will not fail.
|
||||
* @return The copy of self.
|
||||
*/
|
||||
abstract copy(): ContainerIterator<T>;
|
||||
}
|
||||
export declare abstract class Base {
|
||||
/**
|
||||
* @description Container's size.
|
||||
* @protected
|
||||
*/
|
||||
protected length: number;
|
||||
/**
|
||||
* @return The size of the container.
|
||||
*/
|
||||
size(): number;
|
||||
/**
|
||||
* @return Boolean about if the container is empty.
|
||||
*/
|
||||
empty(): boolean;
|
||||
/**
|
||||
* @description Clear the container.
|
||||
*/
|
||||
abstract clear(): void;
|
||||
}
|
||||
export declare abstract class Container<T> extends Base {
|
||||
/**
|
||||
* @return Iterator pointing to the beginning element.
|
||||
*/
|
||||
abstract begin(): ContainerIterator<T>;
|
||||
/**
|
||||
* @return Iterator pointing to the super end like c++.
|
||||
*/
|
||||
abstract end(): ContainerIterator<T>;
|
||||
/**
|
||||
* @return Iterator pointing to the end element.
|
||||
*/
|
||||
abstract rBegin(): ContainerIterator<T>;
|
||||
/**
|
||||
* @return Iterator pointing to the super begin like c++.
|
||||
*/
|
||||
abstract rEnd(): ContainerIterator<T>;
|
||||
/**
|
||||
* @return The first element of the container.
|
||||
*/
|
||||
abstract front(): T | undefined;
|
||||
/**
|
||||
* @return The last element of the container.
|
||||
*/
|
||||
abstract back(): T | undefined;
|
||||
/**
|
||||
* @description Iterate over all elements in the container.
|
||||
* @param callback Callback function like Array.forEach.
|
||||
*/
|
||||
abstract forEach(callback: (element: T, index: number) => void): void;
|
||||
/**
|
||||
* @param element The element you want to find.
|
||||
* @return An iterator pointing to the element if found, or super end if not found.
|
||||
*/
|
||||
abstract find(element: T): ContainerIterator<T>;
|
||||
/**
|
||||
* @description Gets the value of the element at the specified position.
|
||||
*/
|
||||
abstract getElementByPos(pos: number): T;
|
||||
/**
|
||||
* @description Removes the element at the specified position.
|
||||
* @param pos The element's position you want to remove.
|
||||
*/
|
||||
abstract eraseElementByPos(pos: number): void;
|
||||
/**
|
||||
* @description Removes element by iterator and move `iter` to next.
|
||||
* @param iter The iterator you want to erase.
|
||||
* @example container.eraseElementByIterator(container.begin());
|
||||
*/
|
||||
abstract eraseElementByIterator(iter: ContainerIterator<T>): ContainerIterator<T>;
|
||||
/**
|
||||
* @description Using for 'for...of' syntax like Array.
|
||||
*/
|
||||
abstract [Symbol.iterator](): Generator<T, void, undefined>;
|
||||
}
|
||||
export declare type initContainer<T> = ({
|
||||
size: number;
|
||||
} | {
|
||||
length: number;
|
||||
} | {
|
||||
size(): number;
|
||||
}) & {
|
||||
forEach(callback: (element: T) => void): void;
|
||||
};
|
||||
56
WebUI/node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js
generated
vendored
Normal file
56
WebUI/node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js
generated
vendored
Normal file
@@ -0,0 +1,56 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var ContainerIterator = /** @class */ (function () {
|
||||
function ContainerIterator(iteratorType) {
|
||||
if (iteratorType === void 0) { iteratorType = ContainerIterator.NORMAL; }
|
||||
this.iteratorType = iteratorType;
|
||||
}
|
||||
ContainerIterator.NORMAL = false;
|
||||
ContainerIterator.REVERSE = true;
|
||||
return ContainerIterator;
|
||||
}());
|
||||
export { ContainerIterator };
|
||||
var Base = /** @class */ (function () {
|
||||
function Base() {
|
||||
/**
|
||||
* @description Container's size.
|
||||
* @protected
|
||||
*/
|
||||
this.length = 0;
|
||||
}
|
||||
/**
|
||||
* @return The size of the container.
|
||||
*/
|
||||
Base.prototype.size = function () {
|
||||
return this.length;
|
||||
};
|
||||
/**
|
||||
* @return Boolean about if the container is empty.
|
||||
*/
|
||||
Base.prototype.empty = function () {
|
||||
return this.length === 0;
|
||||
};
|
||||
return Base;
|
||||
}());
|
||||
export { Base };
|
||||
var Container = /** @class */ (function (_super) {
|
||||
__extends(Container, _super);
|
||||
function Container() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
return Container;
|
||||
}(Base));
|
||||
export { Container };
|
||||
32
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.d.ts
generated
vendored
Normal file
32
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.d.ts
generated
vendored
Normal file
@@ -0,0 +1,32 @@
|
||||
import { Base, Container } from "../../ContainerBase/index";
|
||||
declare abstract class HashContainer<K> extends Base {
|
||||
protected static readonly sigma = 0.75;
|
||||
protected static readonly treeifyThreshold = 8;
|
||||
protected static readonly untreeifyThreshold = 6;
|
||||
protected static readonly minTreeifySize = 64;
|
||||
protected static readonly maxBucketNum: number;
|
||||
protected bucketNum: number;
|
||||
protected initBucketNum: number;
|
||||
protected hashFunc: (x: K) => number;
|
||||
protected abstract hashTable: Container<unknown>[];
|
||||
protected constructor(initBucketNum?: number, hashFunc?: (x: K) => number);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Growth the hash table.
|
||||
* @protected
|
||||
*/
|
||||
protected abstract reAllocate(): void;
|
||||
abstract forEach(callback: (element: unknown, index: number) => void): void;
|
||||
/**
|
||||
* @description Remove the elements of the specified value.
|
||||
* @param key The element you want to remove.
|
||||
*/
|
||||
abstract eraseElementByKey(key: K): void;
|
||||
/**
|
||||
* @param key The element you want to find.
|
||||
* @return Boolean about if the specified element in the hash set.
|
||||
*/
|
||||
abstract find(key: K): void;
|
||||
abstract [Symbol.iterator](): Generator<unknown, void, undefined>;
|
||||
}
|
||||
export default HashContainer;
|
||||
57
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js
generated
vendored
Normal file
57
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js
generated
vendored
Normal file
@@ -0,0 +1,57 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import { Base } from "../../ContainerBase/index";
|
||||
var HashContainer = /** @class */ (function (_super) {
|
||||
__extends(HashContainer, _super);
|
||||
function HashContainer(initBucketNum, hashFunc) {
|
||||
if (initBucketNum === void 0) { initBucketNum = 16; }
|
||||
if (hashFunc === void 0) { hashFunc = function (x) {
|
||||
var str;
|
||||
if (typeof x !== 'string') {
|
||||
str = JSON.stringify(x);
|
||||
}
|
||||
else
|
||||
str = x;
|
||||
var hashCode = 0;
|
||||
var strLength = str.length;
|
||||
for (var i = 0; i < strLength; i++) {
|
||||
var ch = str.charCodeAt(i);
|
||||
hashCode = ((hashCode << 5) - hashCode) + ch;
|
||||
hashCode |= 0;
|
||||
}
|
||||
return hashCode >>> 0;
|
||||
}; }
|
||||
var _this = _super.call(this) || this;
|
||||
if (initBucketNum < 16 || (initBucketNum & (initBucketNum - 1)) !== 0) {
|
||||
throw new RangeError('InitBucketNum range error');
|
||||
}
|
||||
_this.bucketNum = _this.initBucketNum = initBucketNum;
|
||||
_this.hashFunc = hashFunc;
|
||||
return _this;
|
||||
}
|
||||
HashContainer.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.bucketNum = this.initBucketNum;
|
||||
this.hashTable = [];
|
||||
};
|
||||
HashContainer.sigma = 0.75;
|
||||
HashContainer.treeifyThreshold = 8;
|
||||
HashContainer.untreeifyThreshold = 6;
|
||||
HashContainer.minTreeifySize = 64;
|
||||
HashContainer.maxBucketNum = (1 << 30);
|
||||
return HashContainer;
|
||||
}(Base));
|
||||
export default HashContainer;
|
||||
26
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.d.ts
generated
vendored
Normal file
26
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.d.ts
generated
vendored
Normal file
@@ -0,0 +1,26 @@
|
||||
import HashContainer from './Base/index';
|
||||
import Vector from '../SequentialContainer/Vector';
|
||||
import OrderedMap from '../TreeContainer/OrderedMap';
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
declare class HashMap<K, V> extends HashContainer<K> {
|
||||
protected hashTable: (Vector<[K, V]> | OrderedMap<K, V>)[];
|
||||
constructor(container?: initContainer<[K, V]>, initBucketNum?: number, hashFunc?: (x: K) => number);
|
||||
protected reAllocate(): void;
|
||||
forEach(callback: (element: [K, V], index: number) => void): void;
|
||||
/**
|
||||
* @description Insert a new key-value pair to hash map or set value by key.
|
||||
* @param key The key you want to insert.
|
||||
* @param value The value you want to insert.
|
||||
* @example HashMap.setElement(1, 2); // insert a key-value pair [1, 2]
|
||||
*/
|
||||
setElement(key: K, value: V): void;
|
||||
/**
|
||||
* @description Get the value of the element which has the specified key.
|
||||
* @param key The key you want to get.
|
||||
*/
|
||||
getElementByKey(key: K): V | undefined;
|
||||
eraseElementByKey(key: K): void;
|
||||
find(key: K): boolean;
|
||||
[Symbol.iterator](): Generator<[K, V], void, unknown>;
|
||||
}
|
||||
export default HashMap;
|
||||
337
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js
generated
vendored
Normal file
337
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js
generated
vendored
Normal file
@@ -0,0 +1,337 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __values = (this && this.__values) || function(o) {
|
||||
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
||||
if (m) return m.call(o);
|
||||
if (o && typeof o.length === "number") return {
|
||||
next: function () {
|
||||
if (o && i >= o.length) o = void 0;
|
||||
return { value: o && o[i++], done: !o };
|
||||
}
|
||||
};
|
||||
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
import HashContainer from './Base/index';
|
||||
import Vector from '../SequentialContainer/Vector';
|
||||
import OrderedMap from '../TreeContainer/OrderedMap';
|
||||
var HashMap = /** @class */ (function (_super) {
|
||||
__extends(HashMap, _super);
|
||||
function HashMap(container, initBucketNum, hashFunc) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this, initBucketNum, hashFunc) || this;
|
||||
_this.hashTable = [];
|
||||
container.forEach(function (element) { return _this.setElement(element[0], element[1]); });
|
||||
return _this;
|
||||
}
|
||||
HashMap.prototype.reAllocate = function () {
|
||||
var _this = this;
|
||||
if (this.bucketNum >= HashContainer.maxBucketNum)
|
||||
return;
|
||||
var newHashTable = [];
|
||||
var originalBucketNum = this.bucketNum;
|
||||
this.bucketNum <<= 1;
|
||||
var keys = Object.keys(this.hashTable);
|
||||
var keyNums = keys.length;
|
||||
var _loop_1 = function (i) {
|
||||
var index = parseInt(keys[i]);
|
||||
var container = this_1.hashTable[index];
|
||||
var size = container.size();
|
||||
if (size === 0)
|
||||
return "continue";
|
||||
if (size === 1) {
|
||||
var element = container.front();
|
||||
newHashTable[this_1.hashFunc(element[0]) & (this_1.bucketNum - 1)] = new Vector([element], false);
|
||||
return "continue";
|
||||
}
|
||||
var lowList = [];
|
||||
var highList = [];
|
||||
container.forEach(function (element) {
|
||||
var hashCode = _this.hashFunc(element[0]);
|
||||
if ((hashCode & originalBucketNum) === 0) {
|
||||
lowList.push(element);
|
||||
}
|
||||
else
|
||||
highList.push(element);
|
||||
});
|
||||
if (container instanceof OrderedMap) {
|
||||
if (lowList.length > HashContainer.untreeifyThreshold) {
|
||||
newHashTable[index] = new OrderedMap(lowList);
|
||||
}
|
||||
else if (lowList.length) {
|
||||
newHashTable[index] = new Vector(lowList, false);
|
||||
}
|
||||
if (highList.length > HashContainer.untreeifyThreshold) {
|
||||
newHashTable[index + originalBucketNum] = new OrderedMap(highList);
|
||||
}
|
||||
else if (highList.length) {
|
||||
newHashTable[index + originalBucketNum] = new Vector(highList, false);
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (lowList.length >= HashContainer.treeifyThreshold) {
|
||||
newHashTable[index] = new OrderedMap(lowList);
|
||||
}
|
||||
else if (lowList.length) {
|
||||
newHashTable[index] = new Vector(lowList, false);
|
||||
}
|
||||
if (highList.length >= HashContainer.treeifyThreshold) {
|
||||
newHashTable[index + originalBucketNum] = new OrderedMap(highList);
|
||||
}
|
||||
else if (highList.length) {
|
||||
newHashTable[index + originalBucketNum] = new Vector(highList, false);
|
||||
}
|
||||
}
|
||||
};
|
||||
var this_1 = this;
|
||||
for (var i = 0; i < keyNums; ++i) {
|
||||
_loop_1(i);
|
||||
}
|
||||
this.hashTable = newHashTable;
|
||||
};
|
||||
HashMap.prototype.forEach = function (callback) {
|
||||
var containers = Object.values(this.hashTable);
|
||||
var containersNum = containers.length;
|
||||
var index = 0;
|
||||
for (var i = 0; i < containersNum; ++i) {
|
||||
containers[i].forEach(function (element) { return callback(element, index++); });
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Insert a new key-value pair to hash map or set value by key.
|
||||
* @param key The key you want to insert.
|
||||
* @param value The value you want to insert.
|
||||
* @example HashMap.setElement(1, 2); // insert a key-value pair [1, 2]
|
||||
*/
|
||||
HashMap.prototype.setElement = function (key, value) {
|
||||
var e_1, _a;
|
||||
var index = this.hashFunc(key) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container) {
|
||||
this.length += 1;
|
||||
this.hashTable[index] = new Vector([[key, value]], false);
|
||||
}
|
||||
else {
|
||||
var preSize = container.size();
|
||||
if (container instanceof Vector) {
|
||||
try {
|
||||
for (var container_1 = __values(container), container_1_1 = container_1.next(); !container_1_1.done; container_1_1 = container_1.next()) {
|
||||
var pair = container_1_1.value;
|
||||
if (pair[0] === key) {
|
||||
pair[1] = value;
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
catch (e_1_1) { e_1 = { error: e_1_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (container_1_1 && !container_1_1.done && (_a = container_1.return)) _a.call(container_1);
|
||||
}
|
||||
finally { if (e_1) throw e_1.error; }
|
||||
}
|
||||
container.pushBack([key, value]);
|
||||
if (preSize + 1 >= HashMap.treeifyThreshold) {
|
||||
if (this.bucketNum <= HashMap.minTreeifySize) {
|
||||
this.length += 1;
|
||||
this.reAllocate();
|
||||
return;
|
||||
}
|
||||
this.hashTable[index] = new OrderedMap(this.hashTable[index]);
|
||||
}
|
||||
this.length += 1;
|
||||
}
|
||||
else {
|
||||
container.setElement(key, value);
|
||||
var curSize = container.size();
|
||||
this.length += curSize - preSize;
|
||||
}
|
||||
}
|
||||
if (this.length > this.bucketNum * HashMap.sigma) {
|
||||
this.reAllocate();
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Get the value of the element which has the specified key.
|
||||
* @param key The key you want to get.
|
||||
*/
|
||||
HashMap.prototype.getElementByKey = function (key) {
|
||||
var e_2, _a;
|
||||
var index = this.hashFunc(key) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container)
|
||||
return undefined;
|
||||
if (container instanceof OrderedMap) {
|
||||
return container.getElementByKey(key);
|
||||
}
|
||||
else {
|
||||
try {
|
||||
for (var container_2 = __values(container), container_2_1 = container_2.next(); !container_2_1.done; container_2_1 = container_2.next()) {
|
||||
var pair = container_2_1.value;
|
||||
if (pair[0] === key)
|
||||
return pair[1];
|
||||
}
|
||||
}
|
||||
catch (e_2_1) { e_2 = { error: e_2_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (container_2_1 && !container_2_1.done && (_a = container_2.return)) _a.call(container_2);
|
||||
}
|
||||
finally { if (e_2) throw e_2.error; }
|
||||
}
|
||||
return undefined;
|
||||
}
|
||||
};
|
||||
HashMap.prototype.eraseElementByKey = function (key) {
|
||||
var e_3, _a;
|
||||
var index = this.hashFunc(key) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container)
|
||||
return;
|
||||
if (container instanceof Vector) {
|
||||
var pos = 0;
|
||||
try {
|
||||
for (var container_3 = __values(container), container_3_1 = container_3.next(); !container_3_1.done; container_3_1 = container_3.next()) {
|
||||
var pair = container_3_1.value;
|
||||
if (pair[0] === key) {
|
||||
container.eraseElementByPos(pos);
|
||||
this.length -= 1;
|
||||
return;
|
||||
}
|
||||
pos += 1;
|
||||
}
|
||||
}
|
||||
catch (e_3_1) { e_3 = { error: e_3_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (container_3_1 && !container_3_1.done && (_a = container_3.return)) _a.call(container_3);
|
||||
}
|
||||
finally { if (e_3) throw e_3.error; }
|
||||
}
|
||||
}
|
||||
else {
|
||||
var preSize = container.size();
|
||||
container.eraseElementByKey(key);
|
||||
var curSize = container.size();
|
||||
this.length += curSize - preSize;
|
||||
if (curSize <= HashContainer.untreeifyThreshold) {
|
||||
this.hashTable[index] = new Vector(container);
|
||||
}
|
||||
}
|
||||
};
|
||||
HashMap.prototype.find = function (key) {
|
||||
var e_4, _a;
|
||||
var index = this.hashFunc(key) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container)
|
||||
return false;
|
||||
if (container instanceof OrderedMap) {
|
||||
return !container.find(key)
|
||||
.equals(container.end());
|
||||
}
|
||||
try {
|
||||
for (var container_4 = __values(container), container_4_1 = container_4.next(); !container_4_1.done; container_4_1 = container_4.next()) {
|
||||
var pair = container_4_1.value;
|
||||
if (pair[0] === key)
|
||||
return true;
|
||||
}
|
||||
}
|
||||
catch (e_4_1) { e_4 = { error: e_4_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (container_4_1 && !container_4_1.done && (_a = container_4.return)) _a.call(container_4);
|
||||
}
|
||||
finally { if (e_4) throw e_4.error; }
|
||||
}
|
||||
return false;
|
||||
};
|
||||
HashMap.prototype[Symbol.iterator] = function () {
|
||||
return function () {
|
||||
var containers, containersNum, i, container, container_5, container_5_1, element, e_5_1;
|
||||
var e_5, _a;
|
||||
return __generator(this, function (_b) {
|
||||
switch (_b.label) {
|
||||
case 0:
|
||||
containers = Object.values(this.hashTable);
|
||||
containersNum = containers.length;
|
||||
i = 0;
|
||||
_b.label = 1;
|
||||
case 1:
|
||||
if (!(i < containersNum)) return [3 /*break*/, 10];
|
||||
container = containers[i];
|
||||
_b.label = 2;
|
||||
case 2:
|
||||
_b.trys.push([2, 7, 8, 9]);
|
||||
container_5 = (e_5 = void 0, __values(container)), container_5_1 = container_5.next();
|
||||
_b.label = 3;
|
||||
case 3:
|
||||
if (!!container_5_1.done) return [3 /*break*/, 6];
|
||||
element = container_5_1.value;
|
||||
return [4 /*yield*/, element];
|
||||
case 4:
|
||||
_b.sent();
|
||||
_b.label = 5;
|
||||
case 5:
|
||||
container_5_1 = container_5.next();
|
||||
return [3 /*break*/, 3];
|
||||
case 6: return [3 /*break*/, 9];
|
||||
case 7:
|
||||
e_5_1 = _b.sent();
|
||||
e_5 = { error: e_5_1 };
|
||||
return [3 /*break*/, 9];
|
||||
case 8:
|
||||
try {
|
||||
if (container_5_1 && !container_5_1.done && (_a = container_5.return)) _a.call(container_5);
|
||||
}
|
||||
finally { if (e_5) throw e_5.error; }
|
||||
return [7 /*endfinally*/];
|
||||
case 9:
|
||||
++i;
|
||||
return [3 /*break*/, 1];
|
||||
case 10: return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
}.bind(this)();
|
||||
};
|
||||
return HashMap;
|
||||
}(HashContainer));
|
||||
export default HashMap;
|
||||
19
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.d.ts
generated
vendored
Normal file
19
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.d.ts
generated
vendored
Normal file
@@ -0,0 +1,19 @@
|
||||
import HashContainer from './Base/index';
|
||||
import Vector from '../SequentialContainer/Vector';
|
||||
import OrderedSet from '../TreeContainer/OrderedSet';
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
declare class HashSet<K> extends HashContainer<K> {
|
||||
protected hashTable: (Vector<K> | OrderedSet<K>)[];
|
||||
constructor(container?: initContainer<K>, initBucketNum?: number, hashFunc?: (x: K) => number);
|
||||
protected reAllocate(): void;
|
||||
forEach(callback: (element: K, index: number) => void): void;
|
||||
/**
|
||||
* @description Insert element to hash set.
|
||||
* @param element The element you want to insert.
|
||||
*/
|
||||
insert(element: K): void;
|
||||
eraseElementByKey(key: K): void;
|
||||
find(element: K): boolean;
|
||||
[Symbol.iterator](): Generator<K, void, unknown>;
|
||||
}
|
||||
export default HashSet;
|
||||
257
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js
generated
vendored
Normal file
257
WebUI/node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js
generated
vendored
Normal file
@@ -0,0 +1,257 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __values = (this && this.__values) || function(o) {
|
||||
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
||||
if (m) return m.call(o);
|
||||
if (o && typeof o.length === "number") return {
|
||||
next: function () {
|
||||
if (o && i >= o.length) o = void 0;
|
||||
return { value: o && o[i++], done: !o };
|
||||
}
|
||||
};
|
||||
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
import HashContainer from './Base/index';
|
||||
import Vector from '../SequentialContainer/Vector';
|
||||
import OrderedSet from '../TreeContainer/OrderedSet';
|
||||
var HashSet = /** @class */ (function (_super) {
|
||||
__extends(HashSet, _super);
|
||||
function HashSet(container, initBucketNum, hashFunc) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this, initBucketNum, hashFunc) || this;
|
||||
_this.hashTable = [];
|
||||
container.forEach(function (element) { return _this.insert(element); });
|
||||
return _this;
|
||||
}
|
||||
HashSet.prototype.reAllocate = function () {
|
||||
var _this = this;
|
||||
if (this.bucketNum >= HashContainer.maxBucketNum)
|
||||
return;
|
||||
var newHashTable = [];
|
||||
var originalBucketNum = this.bucketNum;
|
||||
this.bucketNum <<= 1;
|
||||
var keys = Object.keys(this.hashTable);
|
||||
var keyNums = keys.length;
|
||||
var _loop_1 = function (i) {
|
||||
var index = parseInt(keys[i]);
|
||||
var container = this_1.hashTable[index];
|
||||
var size = container.size();
|
||||
if (size === 0)
|
||||
return "continue";
|
||||
if (size === 1) {
|
||||
var element = container.front();
|
||||
newHashTable[this_1.hashFunc(element) & (this_1.bucketNum - 1)] = new Vector([element], false);
|
||||
return "continue";
|
||||
}
|
||||
var lowList = [];
|
||||
var highList = [];
|
||||
container.forEach(function (element) {
|
||||
var hashCode = _this.hashFunc(element);
|
||||
if ((hashCode & originalBucketNum) === 0) {
|
||||
lowList.push(element);
|
||||
}
|
||||
else
|
||||
highList.push(element);
|
||||
});
|
||||
if (container instanceof OrderedSet) {
|
||||
if (lowList.length > HashContainer.untreeifyThreshold) {
|
||||
newHashTable[index] = new OrderedSet(lowList);
|
||||
}
|
||||
else if (lowList.length) {
|
||||
newHashTable[index] = new Vector(lowList, false);
|
||||
}
|
||||
if (highList.length > HashContainer.untreeifyThreshold) {
|
||||
newHashTable[index + originalBucketNum] = new OrderedSet(highList);
|
||||
}
|
||||
else if (highList.length) {
|
||||
newHashTable[index + originalBucketNum] = new Vector(highList, false);
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (lowList.length >= HashContainer.treeifyThreshold) {
|
||||
newHashTable[index] = new OrderedSet(lowList);
|
||||
}
|
||||
else if (lowList.length) {
|
||||
newHashTable[index] = new Vector(lowList, false);
|
||||
}
|
||||
if (highList.length >= HashContainer.treeifyThreshold) {
|
||||
newHashTable[index + originalBucketNum] = new OrderedSet(highList);
|
||||
}
|
||||
else if (highList.length) {
|
||||
newHashTable[index + originalBucketNum] = new Vector(highList, false);
|
||||
}
|
||||
}
|
||||
};
|
||||
var this_1 = this;
|
||||
for (var i = 0; i < keyNums; ++i) {
|
||||
_loop_1(i);
|
||||
}
|
||||
this.hashTable = newHashTable;
|
||||
};
|
||||
HashSet.prototype.forEach = function (callback) {
|
||||
var containers = Object.values(this.hashTable);
|
||||
var containersNum = containers.length;
|
||||
var index = 0;
|
||||
for (var i = 0; i < containersNum; ++i) {
|
||||
containers[i].forEach(function (element) { return callback(element, index++); });
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Insert element to hash set.
|
||||
* @param element The element you want to insert.
|
||||
*/
|
||||
HashSet.prototype.insert = function (element) {
|
||||
var index = this.hashFunc(element) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container) {
|
||||
this.hashTable[index] = new Vector([element], false);
|
||||
this.length += 1;
|
||||
}
|
||||
else {
|
||||
var preSize = container.size();
|
||||
if (container instanceof Vector) {
|
||||
if (!container.find(element)
|
||||
.equals(container.end()))
|
||||
return;
|
||||
container.pushBack(element);
|
||||
if (preSize + 1 >= HashContainer.treeifyThreshold) {
|
||||
if (this.bucketNum <= HashContainer.minTreeifySize) {
|
||||
this.length += 1;
|
||||
this.reAllocate();
|
||||
return;
|
||||
}
|
||||
this.hashTable[index] = new OrderedSet(container);
|
||||
}
|
||||
this.length += 1;
|
||||
}
|
||||
else {
|
||||
container.insert(element);
|
||||
var curSize = container.size();
|
||||
this.length += curSize - preSize;
|
||||
}
|
||||
}
|
||||
if (this.length > this.bucketNum * HashContainer.sigma) {
|
||||
this.reAllocate();
|
||||
}
|
||||
};
|
||||
HashSet.prototype.eraseElementByKey = function (key) {
|
||||
var index = this.hashFunc(key) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container)
|
||||
return;
|
||||
var preSize = container.size();
|
||||
if (preSize === 0)
|
||||
return;
|
||||
if (container instanceof Vector) {
|
||||
container.eraseElementByValue(key);
|
||||
var curSize = container.size();
|
||||
this.length += curSize - preSize;
|
||||
}
|
||||
else {
|
||||
container.eraseElementByKey(key);
|
||||
var curSize = container.size();
|
||||
this.length += curSize - preSize;
|
||||
if (curSize <= HashContainer.untreeifyThreshold) {
|
||||
this.hashTable[index] = new Vector(container);
|
||||
}
|
||||
}
|
||||
};
|
||||
HashSet.prototype.find = function (element) {
|
||||
var index = this.hashFunc(element) & (this.bucketNum - 1);
|
||||
var container = this.hashTable[index];
|
||||
if (!container)
|
||||
return false;
|
||||
return !container.find(element)
|
||||
.equals(container.end());
|
||||
};
|
||||
HashSet.prototype[Symbol.iterator] = function () {
|
||||
return function () {
|
||||
var containers, containersNum, i, container, container_1, container_1_1, element, e_1_1;
|
||||
var e_1, _a;
|
||||
return __generator(this, function (_b) {
|
||||
switch (_b.label) {
|
||||
case 0:
|
||||
containers = Object.values(this.hashTable);
|
||||
containersNum = containers.length;
|
||||
i = 0;
|
||||
_b.label = 1;
|
||||
case 1:
|
||||
if (!(i < containersNum)) return [3 /*break*/, 10];
|
||||
container = containers[i];
|
||||
_b.label = 2;
|
||||
case 2:
|
||||
_b.trys.push([2, 7, 8, 9]);
|
||||
container_1 = (e_1 = void 0, __values(container)), container_1_1 = container_1.next();
|
||||
_b.label = 3;
|
||||
case 3:
|
||||
if (!!container_1_1.done) return [3 /*break*/, 6];
|
||||
element = container_1_1.value;
|
||||
return [4 /*yield*/, element];
|
||||
case 4:
|
||||
_b.sent();
|
||||
_b.label = 5;
|
||||
case 5:
|
||||
container_1_1 = container_1.next();
|
||||
return [3 /*break*/, 3];
|
||||
case 6: return [3 /*break*/, 9];
|
||||
case 7:
|
||||
e_1_1 = _b.sent();
|
||||
e_1 = { error: e_1_1 };
|
||||
return [3 /*break*/, 9];
|
||||
case 8:
|
||||
try {
|
||||
if (container_1_1 && !container_1_1.done && (_a = container_1.return)) _a.call(container_1);
|
||||
}
|
||||
finally { if (e_1) throw e_1.error; }
|
||||
return [7 /*endfinally*/];
|
||||
case 9:
|
||||
++i;
|
||||
return [3 /*break*/, 1];
|
||||
case 10: return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
}.bind(this)();
|
||||
};
|
||||
return HashSet;
|
||||
}(HashContainer));
|
||||
export default HashSet;
|
||||
34
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.d.ts
generated
vendored
Normal file
34
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.d.ts
generated
vendored
Normal file
@@ -0,0 +1,34 @@
|
||||
import { Base, initContainer } from "../ContainerBase/index";
|
||||
declare class PriorityQueue<T> extends Base {
|
||||
private readonly priorityQueue;
|
||||
private readonly cmp;
|
||||
/**
|
||||
* @description PriorityQueue's constructor.
|
||||
* @param container Initialize container, must have a forEach function.
|
||||
* @param cmp Compare function.
|
||||
* @param copy When the container is an array, you can choose to directly operate on the original object of
|
||||
* the array or perform a shallow copy. The default is shallow copy.
|
||||
*/
|
||||
constructor(container?: initContainer<T>, cmp?: (x: T, y: T) => number, copy?: boolean);
|
||||
/**
|
||||
* @description Adjusting parent's children to suit the nature of the heap.
|
||||
* @param parent Parent's index.
|
||||
* @private
|
||||
*/
|
||||
private adjust;
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Push element into a container in order.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
push(element: T): void;
|
||||
/**
|
||||
* @description Removes the top element.
|
||||
*/
|
||||
pop(): void;
|
||||
/**
|
||||
* @description Accesses the top element.
|
||||
*/
|
||||
top(): T | undefined;
|
||||
}
|
||||
export default PriorityQueue;
|
||||
167
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js
generated
vendored
Normal file
167
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js
generated
vendored
Normal file
@@ -0,0 +1,167 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __read = (this && this.__read) || function (o, n) {
|
||||
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
||||
if (!m) return o;
|
||||
var i = m.call(o), r, ar = [], e;
|
||||
try {
|
||||
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
||||
}
|
||||
catch (error) { e = { error: error }; }
|
||||
finally {
|
||||
try {
|
||||
if (r && !r.done && (m = i["return"])) m.call(i);
|
||||
}
|
||||
finally { if (e) throw e.error; }
|
||||
}
|
||||
return ar;
|
||||
};
|
||||
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
||||
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
||||
if (ar || !(i in from)) {
|
||||
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
||||
ar[i] = from[i];
|
||||
}
|
||||
}
|
||||
return to.concat(ar || Array.prototype.slice.call(from));
|
||||
};
|
||||
import { Base } from "../ContainerBase/index";
|
||||
var PriorityQueue = /** @class */ (function (_super) {
|
||||
__extends(PriorityQueue, _super);
|
||||
/**
|
||||
* @description PriorityQueue's constructor.
|
||||
* @param container Initialize container, must have a forEach function.
|
||||
* @param cmp Compare function.
|
||||
* @param copy When the container is an array, you can choose to directly operate on the original object of
|
||||
* the array or perform a shallow copy. The default is shallow copy.
|
||||
*/
|
||||
function PriorityQueue(container, cmp, copy) {
|
||||
var _a;
|
||||
if (container === void 0) { container = []; }
|
||||
if (cmp === void 0) { cmp = function (x, y) {
|
||||
if (x > y)
|
||||
return -1;
|
||||
if (x < y)
|
||||
return 1;
|
||||
return 0;
|
||||
}; }
|
||||
if (copy === void 0) { copy = true; }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.cmp = cmp;
|
||||
if (Array.isArray(container)) {
|
||||
_this.priorityQueue = copy ? __spreadArray([], __read(container), false) : container;
|
||||
}
|
||||
else {
|
||||
_this.priorityQueue = [];
|
||||
container.forEach(function (element) { return _this.priorityQueue.push(element); });
|
||||
}
|
||||
_this.length = _this.priorityQueue.length;
|
||||
for (var parent_1 = (_this.length - 1) >> 1; parent_1 >= 0; --parent_1) {
|
||||
var curParent = parent_1;
|
||||
var curChild = (curParent << 1) | 1;
|
||||
while (curChild < _this.length) {
|
||||
var left = curChild;
|
||||
var right = left + 1;
|
||||
var minChild = left;
|
||||
if (right < _this.length &&
|
||||
_this.cmp(_this.priorityQueue[left], _this.priorityQueue[right]) > 0) {
|
||||
minChild = right;
|
||||
}
|
||||
if (_this.cmp(_this.priorityQueue[curParent], _this.priorityQueue[minChild]) <= 0)
|
||||
break;
|
||||
_a = __read([_this.priorityQueue[minChild], _this.priorityQueue[curParent]], 2), _this.priorityQueue[curParent] = _a[0], _this.priorityQueue[minChild] = _a[1];
|
||||
curParent = minChild;
|
||||
curChild = (curParent << 1) | 1;
|
||||
}
|
||||
}
|
||||
return _this;
|
||||
}
|
||||
/**
|
||||
* @description Adjusting parent's children to suit the nature of the heap.
|
||||
* @param parent Parent's index.
|
||||
* @private
|
||||
*/
|
||||
PriorityQueue.prototype.adjust = function (parent) {
|
||||
var _a, _b;
|
||||
var left = (parent << 1) | 1;
|
||||
var right = (parent << 1) + 2;
|
||||
if (left < this.length &&
|
||||
this.cmp(this.priorityQueue[parent], this.priorityQueue[left]) > 0) {
|
||||
_a = __read([this.priorityQueue[left], this.priorityQueue[parent]], 2), this.priorityQueue[parent] = _a[0], this.priorityQueue[left] = _a[1];
|
||||
}
|
||||
if (right < this.length &&
|
||||
this.cmp(this.priorityQueue[parent], this.priorityQueue[right]) > 0) {
|
||||
_b = __read([this.priorityQueue[right], this.priorityQueue[parent]], 2), this.priorityQueue[parent] = _b[0], this.priorityQueue[right] = _b[1];
|
||||
}
|
||||
};
|
||||
PriorityQueue.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.priorityQueue.length = 0;
|
||||
};
|
||||
/**
|
||||
* @description Push element into a container in order.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
PriorityQueue.prototype.push = function (element) {
|
||||
this.priorityQueue.push(element);
|
||||
this.length += 1;
|
||||
if (this.length === 1)
|
||||
return;
|
||||
var curNode = this.length - 1;
|
||||
while (curNode > 0) {
|
||||
var parent_2 = (curNode - 1) >> 1;
|
||||
if (this.cmp(this.priorityQueue[parent_2], element) <= 0)
|
||||
break;
|
||||
this.adjust(parent_2);
|
||||
curNode = parent_2;
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Removes the top element.
|
||||
*/
|
||||
PriorityQueue.prototype.pop = function () {
|
||||
if (!this.length)
|
||||
return;
|
||||
var last = this.priorityQueue[this.length - 1];
|
||||
this.length -= 1;
|
||||
var parent = 0;
|
||||
while (parent < this.length) {
|
||||
var left = (parent << 1) | 1;
|
||||
var right = (parent << 1) + 2;
|
||||
if (left >= this.length)
|
||||
break;
|
||||
var minChild = left;
|
||||
if (right < this.length &&
|
||||
this.cmp(this.priorityQueue[left], this.priorityQueue[right]) > 0) {
|
||||
minChild = right;
|
||||
}
|
||||
if (this.cmp(this.priorityQueue[minChild], last) >= 0)
|
||||
break;
|
||||
this.priorityQueue[parent] = this.priorityQueue[minChild];
|
||||
parent = minChild;
|
||||
}
|
||||
this.priorityQueue[parent] = last;
|
||||
this.priorityQueue.pop();
|
||||
};
|
||||
/**
|
||||
* @description Accesses the top element.
|
||||
*/
|
||||
PriorityQueue.prototype.top = function () {
|
||||
return this.priorityQueue[0];
|
||||
};
|
||||
return PriorityQueue;
|
||||
}(Base));
|
||||
export default PriorityQueue;
|
||||
19
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.d.ts
generated
vendored
Normal file
19
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.d.ts
generated
vendored
Normal file
@@ -0,0 +1,19 @@
|
||||
import { Base, initContainer } from "../ContainerBase/index";
|
||||
declare class Queue<T> extends Base {
|
||||
private queue;
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Inserts element to queue's end.
|
||||
*/
|
||||
push(element: T): void;
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
*/
|
||||
pop(): void;
|
||||
/**
|
||||
* @description Access the first element.
|
||||
*/
|
||||
front(): T | undefined;
|
||||
}
|
||||
export default Queue;
|
||||
54
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js
generated
vendored
Normal file
54
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js
generated
vendored
Normal file
@@ -0,0 +1,54 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import Deque from '../SequentialContainer/Deque';
|
||||
import { Base } from "../ContainerBase/index";
|
||||
var Queue = /** @class */ (function (_super) {
|
||||
__extends(Queue, _super);
|
||||
function Queue(container) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.queue = new Deque(container);
|
||||
_this.length = _this.queue.size();
|
||||
return _this;
|
||||
}
|
||||
Queue.prototype.clear = function () {
|
||||
this.queue.clear();
|
||||
this.length = 0;
|
||||
};
|
||||
/**
|
||||
* @description Inserts element to queue's end.
|
||||
*/
|
||||
Queue.prototype.push = function (element) {
|
||||
this.queue.pushBack(element);
|
||||
this.length += 1;
|
||||
};
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
*/
|
||||
Queue.prototype.pop = function () {
|
||||
this.queue.popFront();
|
||||
if (this.length)
|
||||
this.length -= 1;
|
||||
};
|
||||
/**
|
||||
* @description Access the first element.
|
||||
*/
|
||||
Queue.prototype.front = function () {
|
||||
return this.queue.front();
|
||||
};
|
||||
return Queue;
|
||||
}(Base));
|
||||
export default Queue;
|
||||
19
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.d.ts
generated
vendored
Normal file
19
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.d.ts
generated
vendored
Normal file
@@ -0,0 +1,19 @@
|
||||
import { Base, initContainer } from "../ContainerBase/index";
|
||||
declare class Stack<T> extends Base {
|
||||
private stack;
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Insert element to stack's end.
|
||||
*/
|
||||
push(element: T): void;
|
||||
/**
|
||||
* @description Removes the end element.
|
||||
*/
|
||||
pop(): void;
|
||||
/**
|
||||
* @description Accesses the end element.
|
||||
*/
|
||||
top(): T | undefined;
|
||||
}
|
||||
export default Stack;
|
||||
53
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js
generated
vendored
Normal file
53
WebUI/node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js
generated
vendored
Normal file
@@ -0,0 +1,53 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import { Base } from "../ContainerBase/index";
|
||||
var Stack = /** @class */ (function (_super) {
|
||||
__extends(Stack, _super);
|
||||
function Stack(container) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.stack = [];
|
||||
container.forEach(function (element) { return _this.push(element); });
|
||||
return _this;
|
||||
}
|
||||
Stack.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.stack.length = 0;
|
||||
};
|
||||
/**
|
||||
* @description Insert element to stack's end.
|
||||
*/
|
||||
Stack.prototype.push = function (element) {
|
||||
this.stack.push(element);
|
||||
this.length += 1;
|
||||
};
|
||||
/**
|
||||
* @description Removes the end element.
|
||||
*/
|
||||
Stack.prototype.pop = function () {
|
||||
this.stack.pop();
|
||||
if (this.length > 0)
|
||||
this.length -= 1;
|
||||
};
|
||||
/**
|
||||
* @description Accesses the end element.
|
||||
*/
|
||||
Stack.prototype.top = function () {
|
||||
return this.stack[this.length - 1];
|
||||
};
|
||||
return Stack;
|
||||
}(Base));
|
||||
export default Stack;
|
||||
13
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.d.ts
generated
vendored
Normal file
13
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.d.ts
generated
vendored
Normal file
@@ -0,0 +1,13 @@
|
||||
import { ContainerIterator } from "../../ContainerBase/index";
|
||||
export declare abstract class RandomIterator<T> extends ContainerIterator<T> {
|
||||
protected node: number;
|
||||
protected readonly size: () => number;
|
||||
protected readonly getElementByPos: (pos: number) => T;
|
||||
protected readonly setElementByPos: (pos: number, element: T) => void;
|
||||
pre: () => this;
|
||||
next: () => this;
|
||||
constructor(index: number, size: () => number, getElementByPos: (pos: number) => T, setElementByPos: (pos: number, element: T) => void, iteratorType?: boolean);
|
||||
get pointer(): T;
|
||||
set pointer(newValue: T);
|
||||
equals(obj: RandomIterator<T>): boolean;
|
||||
}
|
||||
77
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js
generated
vendored
Normal file
77
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js
generated
vendored
Normal file
@@ -0,0 +1,77 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import { checkWithinAccessParams } from "../../../utils/checkParams";
|
||||
import { ContainerIterator } from "../../ContainerBase/index";
|
||||
var RandomIterator = /** @class */ (function (_super) {
|
||||
__extends(RandomIterator, _super);
|
||||
function RandomIterator(index, size, getElementByPos, setElementByPos, iteratorType) {
|
||||
var _this = _super.call(this, iteratorType) || this;
|
||||
_this.node = index;
|
||||
_this.size = size;
|
||||
_this.getElementByPos = getElementByPos;
|
||||
_this.setElementByPos = setElementByPos;
|
||||
if (_this.iteratorType === ContainerIterator.NORMAL) {
|
||||
_this.pre = function () {
|
||||
if (this.node === 0) {
|
||||
throw new RangeError('Deque iterator access denied!');
|
||||
}
|
||||
this.node -= 1;
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === this.size()) {
|
||||
throw new RangeError('Deque Iterator access denied!');
|
||||
}
|
||||
this.node += 1;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
else {
|
||||
_this.pre = function () {
|
||||
if (this.node === this.size() - 1) {
|
||||
throw new RangeError('Deque iterator access denied!');
|
||||
}
|
||||
this.node += 1;
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === -1) {
|
||||
throw new RangeError('Deque iterator access denied!');
|
||||
}
|
||||
this.node -= 1;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return _this;
|
||||
}
|
||||
Object.defineProperty(RandomIterator.prototype, "pointer", {
|
||||
get: function () {
|
||||
checkWithinAccessParams(this.node, 0, this.size() - 1);
|
||||
return this.getElementByPos(this.node);
|
||||
},
|
||||
set: function (newValue) {
|
||||
checkWithinAccessParams(this.node, 0, this.size() - 1);
|
||||
this.setElementByPos(this.node, newValue);
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
RandomIterator.prototype.equals = function (obj) {
|
||||
return this.node === obj.node;
|
||||
};
|
||||
return RandomIterator;
|
||||
}(ContainerIterator));
|
||||
export { RandomIterator };
|
||||
44
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.d.ts
generated
vendored
Normal file
44
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.d.ts
generated
vendored
Normal file
@@ -0,0 +1,44 @@
|
||||
import { Container } from "../../ContainerBase/index";
|
||||
declare abstract class SequentialContainer<T> extends Container<T> {
|
||||
/**
|
||||
* @description Push the element to the back.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
abstract pushBack(element: T): void;
|
||||
/**
|
||||
* @description Removes the last element.
|
||||
*/
|
||||
abstract popBack(): void;
|
||||
/**
|
||||
* @description Sets element by position.
|
||||
* @param pos The position you want to change.
|
||||
* @param element The element's value you want to update.
|
||||
*/
|
||||
abstract setElementByPos(pos: number, element: T): void;
|
||||
/**
|
||||
* @description Removes the elements of the specified value.
|
||||
* @param value The value you want to remove.
|
||||
*/
|
||||
abstract eraseElementByValue(value: T): void;
|
||||
/**
|
||||
* @description Insert several elements after the specified position.
|
||||
* @param pos The position you want to insert.
|
||||
* @param element The element you want to insert.
|
||||
* @param num The number of elements you want to insert (default 1).
|
||||
*/
|
||||
abstract insert(pos: number, element: T, num?: number): void;
|
||||
/**
|
||||
* @description Reverses the container.
|
||||
*/
|
||||
abstract reverse(): void;
|
||||
/**
|
||||
* @description Removes the duplication of elements in the container.
|
||||
*/
|
||||
abstract unique(): void;
|
||||
/**
|
||||
* @description Sort the container.
|
||||
* @param cmp Comparison function.
|
||||
*/
|
||||
abstract sort(cmp?: (x: T, y: T) => number): void;
|
||||
}
|
||||
export default SequentialContainer;
|
||||
24
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js
generated
vendored
Normal file
24
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js
generated
vendored
Normal file
@@ -0,0 +1,24 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import { Container } from "../../ContainerBase/index";
|
||||
var SequentialContainer = /** @class */ (function (_super) {
|
||||
__extends(SequentialContainer, _super);
|
||||
function SequentialContainer() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
return SequentialContainer;
|
||||
}(Container));
|
||||
export default SequentialContainer;
|
||||
68
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.d.ts
generated
vendored
Normal file
68
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.d.ts
generated
vendored
Normal file
@@ -0,0 +1,68 @@
|
||||
import SequentialContainer from './Base/index';
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
export declare class DequeIterator<T> extends RandomIterator<T> {
|
||||
copy(): DequeIterator<T>;
|
||||
}
|
||||
declare class Deque<T> extends SequentialContainer<T> {
|
||||
private first;
|
||||
private curFirst;
|
||||
private last;
|
||||
private curLast;
|
||||
private bucketNum;
|
||||
private readonly bucketSize;
|
||||
private map;
|
||||
constructor(container?: initContainer<T>, bucketSize?: number);
|
||||
/**
|
||||
* @description Growth the Deque.
|
||||
* @private
|
||||
*/
|
||||
private reAllocate;
|
||||
/**
|
||||
* @description Get the bucket position of the element and the pointer position by index.
|
||||
* @param pos The element's index.
|
||||
* @private
|
||||
*/
|
||||
private getElementIndex;
|
||||
clear(): void;
|
||||
front(): T | undefined;
|
||||
back(): T | undefined;
|
||||
begin(): DequeIterator<T>;
|
||||
end(): DequeIterator<T>;
|
||||
rBegin(): DequeIterator<T>;
|
||||
rEnd(): DequeIterator<T>;
|
||||
pushBack(element: T): void;
|
||||
popBack(): void;
|
||||
/**
|
||||
* @description Push the element to the front.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
pushFront(element: T): void;
|
||||
/**
|
||||
* @description Remove the first element.
|
||||
*/
|
||||
popFront(): void;
|
||||
forEach(callback: (element: T, index: number) => void): void;
|
||||
getElementByPos(pos: number): T;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): void;
|
||||
/**
|
||||
* @description Remove all elements after the specified position (excluding the specified position).
|
||||
* @param pos The previous position of the first removed element.
|
||||
* @example deque.cut(1); // Then deque's size will be 2. deque -> [0, 1]
|
||||
*/
|
||||
cut(pos: number): void;
|
||||
eraseElementByPos(pos: number): void;
|
||||
eraseElementByValue(value: T): void;
|
||||
eraseElementByIterator(iter: DequeIterator<T>): DequeIterator<T>;
|
||||
find(element: T): DequeIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): void;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
/**
|
||||
* @description Remove as much useless space as possible.
|
||||
*/
|
||||
shrinkToFit(): void;
|
||||
[Symbol.iterator](): Generator<T, void, unknown>;
|
||||
}
|
||||
export default Deque;
|
||||
450
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js
generated
vendored
Normal file
450
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js
generated
vendored
Normal file
@@ -0,0 +1,450 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __read = (this && this.__read) || function (o, n) {
|
||||
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
||||
if (!m) return o;
|
||||
var i = m.call(o), r, ar = [], e;
|
||||
try {
|
||||
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
||||
}
|
||||
catch (error) { e = { error: error }; }
|
||||
finally {
|
||||
try {
|
||||
if (r && !r.done && (m = i["return"])) m.call(i);
|
||||
}
|
||||
finally { if (e) throw e.error; }
|
||||
}
|
||||
return ar;
|
||||
};
|
||||
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
||||
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
||||
if (ar || !(i in from)) {
|
||||
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
||||
ar[i] = from[i];
|
||||
}
|
||||
}
|
||||
return to.concat(ar || Array.prototype.slice.call(from));
|
||||
};
|
||||
import SequentialContainer from './Base/index';
|
||||
import { checkWithinAccessParams } from "../../utils/checkParams";
|
||||
import { ContainerIterator } from "../ContainerBase/index";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
var DequeIterator = /** @class */ (function (_super) {
|
||||
__extends(DequeIterator, _super);
|
||||
function DequeIterator() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
DequeIterator.prototype.copy = function () {
|
||||
return new DequeIterator(this.node, this.size, this.getElementByPos, this.setElementByPos, this.iteratorType);
|
||||
};
|
||||
return DequeIterator;
|
||||
}(RandomIterator));
|
||||
export { DequeIterator };
|
||||
var Deque = /** @class */ (function (_super) {
|
||||
__extends(Deque, _super);
|
||||
function Deque(container, bucketSize) {
|
||||
if (container === void 0) { container = []; }
|
||||
if (bucketSize === void 0) { bucketSize = (1 << 12); }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.first = 0;
|
||||
_this.curFirst = 0;
|
||||
_this.last = 0;
|
||||
_this.curLast = 0;
|
||||
_this.bucketNum = 0;
|
||||
_this.map = [];
|
||||
var _length;
|
||||
if ('size' in container) {
|
||||
if (typeof container.size === 'number') {
|
||||
_length = container.size;
|
||||
}
|
||||
else {
|
||||
_length = container.size();
|
||||
}
|
||||
}
|
||||
else if ('length' in container) {
|
||||
_length = container.length;
|
||||
}
|
||||
else {
|
||||
throw new RangeError('Can\'t get container\'s size!');
|
||||
}
|
||||
_this.bucketSize = bucketSize;
|
||||
_this.bucketNum = Math.max(Math.ceil(_length / _this.bucketSize), 1);
|
||||
for (var i = 0; i < _this.bucketNum; ++i) {
|
||||
_this.map.push(new Array(_this.bucketSize));
|
||||
}
|
||||
var needBucketNum = Math.ceil(_length / _this.bucketSize);
|
||||
_this.first = _this.last = (_this.bucketNum >> 1) - (needBucketNum >> 1);
|
||||
_this.curFirst = _this.curLast = (_this.bucketSize - _length % _this.bucketSize) >> 1;
|
||||
container.forEach(function (element) { return _this.pushBack(element); });
|
||||
_this.size = _this.size.bind(_this);
|
||||
_this.getElementByPos = _this.getElementByPos.bind(_this);
|
||||
_this.setElementByPos = _this.setElementByPos.bind(_this);
|
||||
return _this;
|
||||
}
|
||||
/**
|
||||
* @description Growth the Deque.
|
||||
* @private
|
||||
*/
|
||||
Deque.prototype.reAllocate = function () {
|
||||
var newMap = [];
|
||||
var addBucketNum = Math.max(this.bucketNum >> 1, 1);
|
||||
for (var i = 0; i < addBucketNum; ++i) {
|
||||
newMap[i] = new Array(this.bucketSize);
|
||||
}
|
||||
for (var i = this.first; i < this.bucketNum; ++i) {
|
||||
newMap[newMap.length] = this.map[i];
|
||||
}
|
||||
for (var i = 0; i < this.last; ++i) {
|
||||
newMap[newMap.length] = this.map[i];
|
||||
}
|
||||
newMap[newMap.length] = __spreadArray([], __read(this.map[this.last]), false);
|
||||
this.first = addBucketNum;
|
||||
this.last = newMap.length - 1;
|
||||
for (var i = 0; i < addBucketNum; ++i) {
|
||||
newMap[newMap.length] = new Array(this.bucketSize);
|
||||
}
|
||||
this.map = newMap;
|
||||
this.bucketNum = newMap.length;
|
||||
};
|
||||
/**
|
||||
* @description Get the bucket position of the element and the pointer position by index.
|
||||
* @param pos The element's index.
|
||||
* @private
|
||||
*/
|
||||
Deque.prototype.getElementIndex = function (pos) {
|
||||
var offset = this.curFirst + pos + 1;
|
||||
var offsetRemainder = offset % this.bucketSize;
|
||||
var curNodePointerIndex = offsetRemainder - 1;
|
||||
var curNodeBucketIndex = this.first + (offset - offsetRemainder) / this.bucketSize;
|
||||
if (offsetRemainder === 0)
|
||||
curNodeBucketIndex -= 1;
|
||||
curNodeBucketIndex %= this.bucketNum;
|
||||
if (curNodePointerIndex < 0)
|
||||
curNodePointerIndex += this.bucketSize;
|
||||
return { curNodeBucketIndex: curNodeBucketIndex, curNodePointerIndex: curNodePointerIndex };
|
||||
};
|
||||
Deque.prototype.clear = function () {
|
||||
this.map = [[]];
|
||||
this.bucketNum = 1;
|
||||
this.first = this.last = this.length = 0;
|
||||
this.curFirst = this.curLast = this.bucketSize >> 1;
|
||||
};
|
||||
Deque.prototype.front = function () {
|
||||
return this.map[this.first][this.curFirst];
|
||||
};
|
||||
Deque.prototype.back = function () {
|
||||
return this.map[this.last][this.curLast];
|
||||
};
|
||||
Deque.prototype.begin = function () {
|
||||
return new DequeIterator(0, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Deque.prototype.end = function () {
|
||||
return new DequeIterator(this.length, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Deque.prototype.rBegin = function () {
|
||||
return new DequeIterator(this.length - 1, this.size, this.getElementByPos, this.setElementByPos, ContainerIterator.REVERSE);
|
||||
};
|
||||
Deque.prototype.rEnd = function () {
|
||||
return new DequeIterator(-1, this.size, this.getElementByPos, this.setElementByPos, ContainerIterator.REVERSE);
|
||||
};
|
||||
Deque.prototype.pushBack = function (element) {
|
||||
if (this.length) {
|
||||
if (this.curLast < this.bucketSize - 1) {
|
||||
this.curLast += 1;
|
||||
}
|
||||
else if (this.last < this.bucketNum - 1) {
|
||||
this.last += 1;
|
||||
this.curLast = 0;
|
||||
}
|
||||
else {
|
||||
this.last = 0;
|
||||
this.curLast = 0;
|
||||
}
|
||||
if (this.last === this.first &&
|
||||
this.curLast === this.curFirst)
|
||||
this.reAllocate();
|
||||
}
|
||||
this.length += 1;
|
||||
this.map[this.last][this.curLast] = element;
|
||||
};
|
||||
Deque.prototype.popBack = function () {
|
||||
if (!this.length)
|
||||
return;
|
||||
this.map[this.last][this.curLast] = undefined;
|
||||
if (this.length !== 1) {
|
||||
if (this.curLast > 0) {
|
||||
this.curLast -= 1;
|
||||
}
|
||||
else if (this.last > 0) {
|
||||
this.last -= 1;
|
||||
this.curLast = this.bucketSize - 1;
|
||||
}
|
||||
else {
|
||||
this.last = this.bucketNum - 1;
|
||||
this.curLast = this.bucketSize - 1;
|
||||
}
|
||||
}
|
||||
this.length -= 1;
|
||||
};
|
||||
/**
|
||||
* @description Push the element to the front.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
Deque.prototype.pushFront = function (element) {
|
||||
if (this.length) {
|
||||
if (this.curFirst > 0) {
|
||||
this.curFirst -= 1;
|
||||
}
|
||||
else if (this.first > 0) {
|
||||
this.first -= 1;
|
||||
this.curFirst = this.bucketSize - 1;
|
||||
}
|
||||
else {
|
||||
this.first = this.bucketNum - 1;
|
||||
this.curFirst = this.bucketSize - 1;
|
||||
}
|
||||
if (this.first === this.last &&
|
||||
this.curFirst === this.curLast)
|
||||
this.reAllocate();
|
||||
}
|
||||
this.length += 1;
|
||||
this.map[this.first][this.curFirst] = element;
|
||||
};
|
||||
/**
|
||||
* @description Remove the first element.
|
||||
*/
|
||||
Deque.prototype.popFront = function () {
|
||||
if (!this.length)
|
||||
return;
|
||||
this.map[this.first][this.curFirst] = undefined;
|
||||
if (this.length !== 1) {
|
||||
if (this.curFirst < this.bucketSize - 1) {
|
||||
this.curFirst += 1;
|
||||
}
|
||||
else if (this.first < this.bucketNum - 1) {
|
||||
this.first += 1;
|
||||
this.curFirst = 0;
|
||||
}
|
||||
else {
|
||||
this.first = 0;
|
||||
this.curFirst = 0;
|
||||
}
|
||||
}
|
||||
this.length -= 1;
|
||||
};
|
||||
Deque.prototype.forEach = function (callback) {
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
callback(this.getElementByPos(i), i);
|
||||
}
|
||||
};
|
||||
Deque.prototype.getElementByPos = function (pos) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var _a = this.getElementIndex(pos), curNodeBucketIndex = _a.curNodeBucketIndex, curNodePointerIndex = _a.curNodePointerIndex;
|
||||
return this.map[curNodeBucketIndex][curNodePointerIndex];
|
||||
};
|
||||
Deque.prototype.setElementByPos = function (pos, element) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var _a = this.getElementIndex(pos), curNodeBucketIndex = _a.curNodeBucketIndex, curNodePointerIndex = _a.curNodePointerIndex;
|
||||
this.map[curNodeBucketIndex][curNodePointerIndex] = element;
|
||||
};
|
||||
Deque.prototype.insert = function (pos, element, num) {
|
||||
if (num === void 0) { num = 1; }
|
||||
checkWithinAccessParams(pos, 0, this.length);
|
||||
if (pos === 0) {
|
||||
while (num--)
|
||||
this.pushFront(element);
|
||||
}
|
||||
else if (pos === this.length) {
|
||||
while (num--)
|
||||
this.pushBack(element);
|
||||
}
|
||||
else {
|
||||
var arr = [];
|
||||
for (var i = pos; i < this.length; ++i) {
|
||||
arr.push(this.getElementByPos(i));
|
||||
}
|
||||
this.cut(pos - 1);
|
||||
for (var i = 0; i < num; ++i)
|
||||
this.pushBack(element);
|
||||
for (var i = 0; i < arr.length; ++i)
|
||||
this.pushBack(arr[i]);
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Remove all elements after the specified position (excluding the specified position).
|
||||
* @param pos The previous position of the first removed element.
|
||||
* @example deque.cut(1); // Then deque's size will be 2. deque -> [0, 1]
|
||||
*/
|
||||
Deque.prototype.cut = function (pos) {
|
||||
if (pos < 0) {
|
||||
this.clear();
|
||||
return;
|
||||
}
|
||||
var _a = this.getElementIndex(pos), curNodeBucketIndex = _a.curNodeBucketIndex, curNodePointerIndex = _a.curNodePointerIndex;
|
||||
this.last = curNodeBucketIndex;
|
||||
this.curLast = curNodePointerIndex;
|
||||
this.length = pos + 1;
|
||||
};
|
||||
Deque.prototype.eraseElementByPos = function (pos) {
|
||||
var _this = this;
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
if (pos === 0)
|
||||
this.popFront();
|
||||
else if (pos === this.length - 1)
|
||||
this.popBack();
|
||||
else {
|
||||
var arr = [];
|
||||
for (var i = pos + 1; i < this.length; ++i) {
|
||||
arr.push(this.getElementByPos(i));
|
||||
}
|
||||
this.cut(pos);
|
||||
this.popBack();
|
||||
arr.forEach(function (element) { return _this.pushBack(element); });
|
||||
}
|
||||
};
|
||||
Deque.prototype.eraseElementByValue = function (value) {
|
||||
if (!this.length)
|
||||
return;
|
||||
var arr = [];
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
var element = this.getElementByPos(i);
|
||||
if (element !== value)
|
||||
arr.push(element);
|
||||
}
|
||||
var _length = arr.length;
|
||||
for (var i = 0; i < _length; ++i)
|
||||
this.setElementByPos(i, arr[i]);
|
||||
this.cut(_length - 1);
|
||||
};
|
||||
Deque.prototype.eraseElementByIterator = function (iter) {
|
||||
// @ts-ignore
|
||||
var node = iter.node;
|
||||
this.eraseElementByPos(node);
|
||||
iter = iter.next();
|
||||
return iter;
|
||||
};
|
||||
Deque.prototype.find = function (element) {
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
if (this.getElementByPos(i) === element) {
|
||||
return new DequeIterator(i, this.size, this.getElementByPos, this.setElementByPos);
|
||||
}
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
Deque.prototype.reverse = function () {
|
||||
var l = 0;
|
||||
var r = this.length - 1;
|
||||
while (l < r) {
|
||||
var tmp = this.getElementByPos(l);
|
||||
this.setElementByPos(l, this.getElementByPos(r));
|
||||
this.setElementByPos(r, tmp);
|
||||
l += 1;
|
||||
r -= 1;
|
||||
}
|
||||
};
|
||||
Deque.prototype.unique = function () {
|
||||
if (this.length <= 1)
|
||||
return;
|
||||
var index = 1;
|
||||
var pre = this.getElementByPos(0);
|
||||
for (var i = 1; i < this.length; ++i) {
|
||||
var cur = this.getElementByPos(i);
|
||||
if (cur !== pre) {
|
||||
pre = cur;
|
||||
this.setElementByPos(index++, cur);
|
||||
}
|
||||
}
|
||||
while (this.length > index)
|
||||
this.popBack();
|
||||
};
|
||||
Deque.prototype.sort = function (cmp) {
|
||||
var arr = [];
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
arr.push(this.getElementByPos(i));
|
||||
}
|
||||
arr.sort(cmp);
|
||||
for (var i = 0; i < this.length; ++i)
|
||||
this.setElementByPos(i, arr[i]);
|
||||
};
|
||||
/**
|
||||
* @description Remove as much useless space as possible.
|
||||
*/
|
||||
Deque.prototype.shrinkToFit = function () {
|
||||
if (!this.length)
|
||||
return;
|
||||
var arr = [];
|
||||
this.forEach(function (element) { return arr.push(element); });
|
||||
this.bucketNum = Math.max(Math.ceil(this.length / this.bucketSize), 1);
|
||||
this.length = this.first = this.last = this.curFirst = this.curLast = 0;
|
||||
this.map = [];
|
||||
for (var i = 0; i < this.bucketNum; ++i) {
|
||||
this.map.push(new Array(this.bucketSize));
|
||||
}
|
||||
for (var i = 0; i < arr.length; ++i)
|
||||
this.pushBack(arr[i]);
|
||||
};
|
||||
Deque.prototype[Symbol.iterator] = function () {
|
||||
return function () {
|
||||
var i;
|
||||
return __generator(this, function (_a) {
|
||||
switch (_a.label) {
|
||||
case 0:
|
||||
i = 0;
|
||||
_a.label = 1;
|
||||
case 1:
|
||||
if (!(i < this.length)) return [3 /*break*/, 4];
|
||||
return [4 /*yield*/, this.getElementByPos(i)];
|
||||
case 2:
|
||||
_a.sent();
|
||||
_a.label = 3;
|
||||
case 3:
|
||||
++i;
|
||||
return [3 /*break*/, 1];
|
||||
case 4: return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
}.bind(this)();
|
||||
};
|
||||
return Deque;
|
||||
}(SequentialContainer));
|
||||
export default Deque;
|
||||
61
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.d.ts
generated
vendored
Normal file
61
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.d.ts
generated
vendored
Normal file
@@ -0,0 +1,61 @@
|
||||
import SequentialContainer from './Base/index';
|
||||
import { ContainerIterator, initContainer } from "../ContainerBase/index";
|
||||
export declare class LinkNode<T> {
|
||||
value: T | undefined;
|
||||
pre: LinkNode<T> | undefined;
|
||||
next: LinkNode<T> | undefined;
|
||||
constructor(element?: T);
|
||||
}
|
||||
export declare class LinkListIterator<T> extends ContainerIterator<T> {
|
||||
protected node: LinkNode<T>;
|
||||
private readonly header;
|
||||
pre: () => this;
|
||||
next: () => this;
|
||||
constructor(node: LinkNode<T>, header: LinkNode<T>, iteratorType?: boolean);
|
||||
get pointer(): T;
|
||||
set pointer(newValue: T);
|
||||
equals(obj: LinkListIterator<T>): boolean;
|
||||
copy(): LinkListIterator<T>;
|
||||
}
|
||||
declare class LinkList<T> extends SequentialContainer<T> {
|
||||
private header;
|
||||
private head;
|
||||
private tail;
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
begin(): LinkListIterator<T>;
|
||||
end(): LinkListIterator<T>;
|
||||
rBegin(): LinkListIterator<T>;
|
||||
rEnd(): LinkListIterator<T>;
|
||||
front(): T | undefined;
|
||||
back(): T | undefined;
|
||||
forEach(callback: (element: T, index: number) => void): void;
|
||||
getElementByPos(pos: number): T;
|
||||
eraseElementByPos(pos: number): void;
|
||||
eraseElementByValue(value: T): void;
|
||||
eraseElementByIterator(iter: LinkListIterator<T>): LinkListIterator<T>;
|
||||
pushBack(element: T): void;
|
||||
popBack(): void;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): void;
|
||||
find(element: T): LinkListIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): void;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
/**
|
||||
* @description Push an element to the front.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
pushFront(element: T): void;
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
*/
|
||||
popFront(): void;
|
||||
/**
|
||||
* @description Merges two sorted lists.
|
||||
* @param list The other list you want to merge (must be sorted).
|
||||
*/
|
||||
merge(list: LinkList<T>): void;
|
||||
[Symbol.iterator](): Generator<T, void, unknown>;
|
||||
}
|
||||
export default LinkList;
|
||||
458
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js
generated
vendored
Normal file
458
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js
generated
vendored
Normal file
@@ -0,0 +1,458 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
import SequentialContainer from './Base/index';
|
||||
import { checkWithinAccessParams } from "../../utils/checkParams";
|
||||
import { ContainerIterator } from "../ContainerBase/index";
|
||||
var LinkNode = /** @class */ (function () {
|
||||
function LinkNode(element) {
|
||||
this.value = undefined;
|
||||
this.pre = undefined;
|
||||
this.next = undefined;
|
||||
this.value = element;
|
||||
}
|
||||
return LinkNode;
|
||||
}());
|
||||
export { LinkNode };
|
||||
var LinkListIterator = /** @class */ (function (_super) {
|
||||
__extends(LinkListIterator, _super);
|
||||
function LinkListIterator(node, header, iteratorType) {
|
||||
var _this = _super.call(this, iteratorType) || this;
|
||||
_this.node = node;
|
||||
_this.header = header;
|
||||
if (_this.iteratorType === ContainerIterator.NORMAL) {
|
||||
_this.pre = function () {
|
||||
if (this.node.pre === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.pre;
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.next;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
else {
|
||||
_this.pre = function () {
|
||||
if (this.node.next === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.next;
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.pre;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return _this;
|
||||
}
|
||||
Object.defineProperty(LinkListIterator.prototype, "pointer", {
|
||||
get: function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
return this.node.value;
|
||||
},
|
||||
set: function (newValue) {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node.value = newValue;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
LinkListIterator.prototype.equals = function (obj) {
|
||||
return this.node === obj.node;
|
||||
};
|
||||
LinkListIterator.prototype.copy = function () {
|
||||
return new LinkListIterator(this.node, this.header, this.iteratorType);
|
||||
};
|
||||
return LinkListIterator;
|
||||
}(ContainerIterator));
|
||||
export { LinkListIterator };
|
||||
var LinkList = /** @class */ (function (_super) {
|
||||
__extends(LinkList, _super);
|
||||
function LinkList(container) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.header = new LinkNode();
|
||||
_this.head = undefined;
|
||||
_this.tail = undefined;
|
||||
container.forEach(function (element) { return _this.pushBack(element); });
|
||||
return _this;
|
||||
}
|
||||
LinkList.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.head = this.tail = undefined;
|
||||
this.header.pre = this.header.next = undefined;
|
||||
};
|
||||
LinkList.prototype.begin = function () {
|
||||
return new LinkListIterator(this.head || this.header, this.header);
|
||||
};
|
||||
LinkList.prototype.end = function () {
|
||||
return new LinkListIterator(this.header, this.header);
|
||||
};
|
||||
LinkList.prototype.rBegin = function () {
|
||||
return new LinkListIterator(this.tail || this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
LinkList.prototype.rEnd = function () {
|
||||
return new LinkListIterator(this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
LinkList.prototype.front = function () {
|
||||
return this.head ? this.head.value : undefined;
|
||||
};
|
||||
LinkList.prototype.back = function () {
|
||||
return this.tail ? this.tail.value : undefined;
|
||||
};
|
||||
LinkList.prototype.forEach = function (callback) {
|
||||
if (!this.length)
|
||||
return;
|
||||
var curNode = this.head;
|
||||
var index = 0;
|
||||
while (curNode !== this.header) {
|
||||
callback(curNode.value, index++);
|
||||
curNode = curNode.next;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.getElementByPos = function (pos) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var curNode = this.head;
|
||||
while (pos--) {
|
||||
curNode = curNode.next;
|
||||
}
|
||||
return curNode.value;
|
||||
};
|
||||
LinkList.prototype.eraseElementByPos = function (pos) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
if (pos === 0)
|
||||
this.popFront();
|
||||
else if (pos === this.length - 1)
|
||||
this.popBack();
|
||||
else {
|
||||
var curNode = this.head;
|
||||
while (pos--) {
|
||||
curNode = curNode.next;
|
||||
}
|
||||
curNode = curNode;
|
||||
var pre = curNode.pre;
|
||||
var next = curNode.next;
|
||||
next.pre = pre;
|
||||
pre.next = next;
|
||||
this.length -= 1;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.eraseElementByValue = function (value) {
|
||||
while (this.head && this.head.value === value)
|
||||
this.popFront();
|
||||
while (this.tail && this.tail.value === value)
|
||||
this.popBack();
|
||||
if (!this.head)
|
||||
return;
|
||||
var curNode = this.head;
|
||||
while (curNode !== this.header) {
|
||||
if (curNode.value === value) {
|
||||
var pre = curNode.pre;
|
||||
var next = curNode.next;
|
||||
if (next)
|
||||
next.pre = pre;
|
||||
if (pre)
|
||||
pre.next = next;
|
||||
this.length -= 1;
|
||||
}
|
||||
curNode = curNode.next;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.eraseElementByIterator = function (iter) {
|
||||
// @ts-ignore
|
||||
var node = iter.node;
|
||||
if (node === this.header) {
|
||||
throw new RangeError('Invalid iterator');
|
||||
}
|
||||
iter = iter.next();
|
||||
if (this.head === node)
|
||||
this.popFront();
|
||||
else if (this.tail === node)
|
||||
this.popBack();
|
||||
else {
|
||||
var pre = node.pre;
|
||||
var next = node.next;
|
||||
if (next)
|
||||
next.pre = pre;
|
||||
if (pre)
|
||||
pre.next = next;
|
||||
this.length -= 1;
|
||||
}
|
||||
return iter;
|
||||
};
|
||||
LinkList.prototype.pushBack = function (element) {
|
||||
this.length += 1;
|
||||
var newTail = new LinkNode(element);
|
||||
if (!this.tail) {
|
||||
this.head = this.tail = newTail;
|
||||
this.header.next = this.head;
|
||||
this.head.pre = this.header;
|
||||
}
|
||||
else {
|
||||
this.tail.next = newTail;
|
||||
newTail.pre = this.tail;
|
||||
this.tail = newTail;
|
||||
}
|
||||
this.tail.next = this.header;
|
||||
this.header.pre = this.tail;
|
||||
};
|
||||
LinkList.prototype.popBack = function () {
|
||||
if (!this.tail)
|
||||
return;
|
||||
this.length -= 1;
|
||||
if (this.head === this.tail) {
|
||||
this.head = this.tail = undefined;
|
||||
this.header.next = undefined;
|
||||
}
|
||||
else {
|
||||
this.tail = this.tail.pre;
|
||||
if (this.tail)
|
||||
this.tail.next = undefined;
|
||||
}
|
||||
this.header.pre = this.tail;
|
||||
if (this.tail)
|
||||
this.tail.next = this.header;
|
||||
};
|
||||
LinkList.prototype.setElementByPos = function (pos, element) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var curNode = this.head;
|
||||
while (pos--) {
|
||||
curNode = curNode.next;
|
||||
}
|
||||
curNode.value = element;
|
||||
};
|
||||
LinkList.prototype.insert = function (pos, element, num) {
|
||||
if (num === void 0) { num = 1; }
|
||||
checkWithinAccessParams(pos, 0, this.length);
|
||||
if (num <= 0)
|
||||
return;
|
||||
if (pos === 0) {
|
||||
while (num--)
|
||||
this.pushFront(element);
|
||||
}
|
||||
else if (pos === this.length) {
|
||||
while (num--)
|
||||
this.pushBack(element);
|
||||
}
|
||||
else {
|
||||
var curNode = this.head;
|
||||
for (var i = 1; i < pos; ++i) {
|
||||
curNode = curNode.next;
|
||||
}
|
||||
var next = curNode.next;
|
||||
this.length += num;
|
||||
while (num--) {
|
||||
curNode.next = new LinkNode(element);
|
||||
curNode.next.pre = curNode;
|
||||
curNode = curNode.next;
|
||||
}
|
||||
curNode.next = next;
|
||||
if (next)
|
||||
next.pre = curNode;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.find = function (element) {
|
||||
if (!this.head)
|
||||
return this.end();
|
||||
var curNode = this.head;
|
||||
while (curNode !== this.header) {
|
||||
if (curNode.value === element) {
|
||||
return new LinkListIterator(curNode, this.header);
|
||||
}
|
||||
curNode = curNode.next;
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
LinkList.prototype.reverse = function () {
|
||||
if (this.length <= 1)
|
||||
return;
|
||||
var pHead = this.head;
|
||||
var pTail = this.tail;
|
||||
var cnt = 0;
|
||||
while ((cnt << 1) < this.length) {
|
||||
var tmp = pHead.value;
|
||||
pHead.value = pTail.value;
|
||||
pTail.value = tmp;
|
||||
pHead = pHead.next;
|
||||
pTail = pTail.pre;
|
||||
cnt += 1;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.unique = function () {
|
||||
if (this.length <= 1)
|
||||
return;
|
||||
var curNode = this.head;
|
||||
while (curNode !== this.header) {
|
||||
var tmpNode = curNode;
|
||||
while (tmpNode.next && tmpNode.value === tmpNode.next.value) {
|
||||
tmpNode = tmpNode.next;
|
||||
this.length -= 1;
|
||||
}
|
||||
curNode.next = tmpNode.next;
|
||||
if (curNode.next)
|
||||
curNode.next.pre = curNode;
|
||||
curNode = curNode.next;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.sort = function (cmp) {
|
||||
if (this.length <= 1)
|
||||
return;
|
||||
var arr = [];
|
||||
this.forEach(function (element) { return arr.push(element); });
|
||||
arr.sort(cmp);
|
||||
var curNode = this.head;
|
||||
arr.forEach(function (element) {
|
||||
curNode.value = element;
|
||||
curNode = curNode.next;
|
||||
});
|
||||
};
|
||||
/**
|
||||
* @description Push an element to the front.
|
||||
* @param element The element you want to push.
|
||||
*/
|
||||
LinkList.prototype.pushFront = function (element) {
|
||||
this.length += 1;
|
||||
var newHead = new LinkNode(element);
|
||||
if (!this.head) {
|
||||
this.head = this.tail = newHead;
|
||||
this.tail.next = this.header;
|
||||
this.header.pre = this.tail;
|
||||
}
|
||||
else {
|
||||
newHead.next = this.head;
|
||||
this.head.pre = newHead;
|
||||
this.head = newHead;
|
||||
}
|
||||
this.header.next = this.head;
|
||||
this.head.pre = this.header;
|
||||
};
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
*/
|
||||
LinkList.prototype.popFront = function () {
|
||||
if (!this.head)
|
||||
return;
|
||||
this.length -= 1;
|
||||
if (this.head === this.tail) {
|
||||
this.head = this.tail = undefined;
|
||||
this.header.pre = this.tail;
|
||||
}
|
||||
else {
|
||||
this.head = this.head.next;
|
||||
if (this.head)
|
||||
this.head.pre = this.header;
|
||||
}
|
||||
this.header.next = this.head;
|
||||
};
|
||||
/**
|
||||
* @description Merges two sorted lists.
|
||||
* @param list The other list you want to merge (must be sorted).
|
||||
*/
|
||||
LinkList.prototype.merge = function (list) {
|
||||
var _this = this;
|
||||
if (!this.head) {
|
||||
list.forEach(function (element) { return _this.pushBack(element); });
|
||||
return;
|
||||
}
|
||||
var curNode = this.head;
|
||||
list.forEach(function (element) {
|
||||
while (curNode &&
|
||||
curNode !== _this.header &&
|
||||
curNode.value <= element) {
|
||||
curNode = curNode.next;
|
||||
}
|
||||
if (curNode === _this.header) {
|
||||
_this.pushBack(element);
|
||||
curNode = _this.tail;
|
||||
}
|
||||
else if (curNode === _this.head) {
|
||||
_this.pushFront(element);
|
||||
curNode = _this.head;
|
||||
}
|
||||
else {
|
||||
_this.length += 1;
|
||||
var pre = curNode.pre;
|
||||
pre.next = new LinkNode(element);
|
||||
pre.next.pre = pre;
|
||||
pre.next.next = curNode;
|
||||
curNode.pre = pre.next;
|
||||
}
|
||||
});
|
||||
};
|
||||
LinkList.prototype[Symbol.iterator] = function () {
|
||||
return function () {
|
||||
var curNode;
|
||||
return __generator(this, function (_a) {
|
||||
switch (_a.label) {
|
||||
case 0:
|
||||
if (!this.head)
|
||||
return [2 /*return*/];
|
||||
curNode = this.head;
|
||||
_a.label = 1;
|
||||
case 1:
|
||||
if (!(curNode !== this.header)) return [3 /*break*/, 3];
|
||||
return [4 /*yield*/, curNode.value];
|
||||
case 2:
|
||||
_a.sent();
|
||||
curNode = curNode.next;
|
||||
return [3 /*break*/, 1];
|
||||
case 3: return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
}.bind(this)();
|
||||
};
|
||||
return LinkList;
|
||||
}(SequentialContainer));
|
||||
export default LinkList;
|
||||
38
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.d.ts
generated
vendored
Normal file
38
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.d.ts
generated
vendored
Normal file
@@ -0,0 +1,38 @@
|
||||
import SequentialContainer from './Base/index';
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
export declare class VectorIterator<T> extends RandomIterator<T> {
|
||||
copy(): VectorIterator<T>;
|
||||
}
|
||||
declare class Vector<T> extends SequentialContainer<T> {
|
||||
private readonly vector;
|
||||
/**
|
||||
* @description Vector's constructor.
|
||||
* @param container Initialize container, must have a forEach function.
|
||||
* @param copy When the container is an array, you can choose to directly operate on the original object of
|
||||
* the array or perform a shallow copy. The default is shallow copy.
|
||||
*/
|
||||
constructor(container?: initContainer<T>, copy?: boolean);
|
||||
clear(): void;
|
||||
begin(): VectorIterator<T>;
|
||||
end(): VectorIterator<T>;
|
||||
rBegin(): VectorIterator<T>;
|
||||
rEnd(): VectorIterator<T>;
|
||||
front(): T | undefined;
|
||||
back(): T | undefined;
|
||||
forEach(callback: (element: T, index: number) => void): void;
|
||||
getElementByPos(pos: number): T;
|
||||
eraseElementByPos(pos: number): void;
|
||||
eraseElementByValue(value: T): void;
|
||||
eraseElementByIterator(iter: VectorIterator<T>): VectorIterator<T>;
|
||||
pushBack(element: T): void;
|
||||
popBack(): void;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): void;
|
||||
find(element: T): VectorIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): void;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
[Symbol.iterator](): Generator<T, any, undefined>;
|
||||
}
|
||||
export default Vector;
|
||||
227
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js
generated
vendored
Normal file
227
WebUI/node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js
generated
vendored
Normal file
@@ -0,0 +1,227 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __read = (this && this.__read) || function (o, n) {
|
||||
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
||||
if (!m) return o;
|
||||
var i = m.call(o), r, ar = [], e;
|
||||
try {
|
||||
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
||||
}
|
||||
catch (error) { e = { error: error }; }
|
||||
finally {
|
||||
try {
|
||||
if (r && !r.done && (m = i["return"])) m.call(i);
|
||||
}
|
||||
finally { if (e) throw e.error; }
|
||||
}
|
||||
return ar;
|
||||
};
|
||||
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
||||
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
||||
if (ar || !(i in from)) {
|
||||
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
||||
ar[i] = from[i];
|
||||
}
|
||||
}
|
||||
return to.concat(ar || Array.prototype.slice.call(from));
|
||||
};
|
||||
var __values = (this && this.__values) || function(o) {
|
||||
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
||||
if (m) return m.call(o);
|
||||
if (o && typeof o.length === "number") return {
|
||||
next: function () {
|
||||
if (o && i >= o.length) o = void 0;
|
||||
return { value: o && o[i++], done: !o };
|
||||
}
|
||||
};
|
||||
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
import SequentialContainer from './Base/index';
|
||||
import { checkWithinAccessParams } from "../../utils/checkParams";
|
||||
import { ContainerIterator } from "../ContainerBase/index";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
var VectorIterator = /** @class */ (function (_super) {
|
||||
__extends(VectorIterator, _super);
|
||||
function VectorIterator() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
VectorIterator.prototype.copy = function () {
|
||||
return new VectorIterator(this.node, this.size, this.getElementByPos, this.setElementByPos, this.iteratorType);
|
||||
};
|
||||
return VectorIterator;
|
||||
}(RandomIterator));
|
||||
export { VectorIterator };
|
||||
var Vector = /** @class */ (function (_super) {
|
||||
__extends(Vector, _super);
|
||||
/**
|
||||
* @description Vector's constructor.
|
||||
* @param container Initialize container, must have a forEach function.
|
||||
* @param copy When the container is an array, you can choose to directly operate on the original object of
|
||||
* the array or perform a shallow copy. The default is shallow copy.
|
||||
*/
|
||||
function Vector(container, copy) {
|
||||
if (container === void 0) { container = []; }
|
||||
if (copy === void 0) { copy = true; }
|
||||
var _this = _super.call(this) || this;
|
||||
if (Array.isArray(container)) {
|
||||
_this.vector = copy ? __spreadArray([], __read(container), false) : container;
|
||||
_this.length = container.length;
|
||||
}
|
||||
else {
|
||||
_this.vector = [];
|
||||
container.forEach(function (element) { return _this.pushBack(element); });
|
||||
}
|
||||
_this.size = _this.size.bind(_this);
|
||||
_this.getElementByPos = _this.getElementByPos.bind(_this);
|
||||
_this.setElementByPos = _this.setElementByPos.bind(_this);
|
||||
return _this;
|
||||
}
|
||||
Vector.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.vector.length = 0;
|
||||
};
|
||||
Vector.prototype.begin = function () {
|
||||
return new VectorIterator(0, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Vector.prototype.end = function () {
|
||||
return new VectorIterator(this.length, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Vector.prototype.rBegin = function () {
|
||||
return new VectorIterator(this.length - 1, this.size, this.getElementByPos, this.setElementByPos, ContainerIterator.REVERSE);
|
||||
};
|
||||
Vector.prototype.rEnd = function () {
|
||||
return new VectorIterator(-1, this.size, this.getElementByPos, this.setElementByPos, ContainerIterator.REVERSE);
|
||||
};
|
||||
Vector.prototype.front = function () {
|
||||
return this.vector[0];
|
||||
};
|
||||
Vector.prototype.back = function () {
|
||||
return this.vector[this.length - 1];
|
||||
};
|
||||
Vector.prototype.forEach = function (callback) {
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
callback(this.vector[i], i);
|
||||
}
|
||||
};
|
||||
Vector.prototype.getElementByPos = function (pos) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
return this.vector[pos];
|
||||
};
|
||||
Vector.prototype.eraseElementByPos = function (pos) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
this.vector.splice(pos, 1);
|
||||
this.length -= 1;
|
||||
};
|
||||
Vector.prototype.eraseElementByValue = function (value) {
|
||||
var index = 0;
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
if (this.vector[i] !== value) {
|
||||
this.vector[index++] = this.vector[i];
|
||||
}
|
||||
}
|
||||
this.length = this.vector.length = index;
|
||||
};
|
||||
Vector.prototype.eraseElementByIterator = function (iter) {
|
||||
// @ts-ignore
|
||||
var node = iter.node;
|
||||
iter = iter.next();
|
||||
this.eraseElementByPos(node);
|
||||
return iter;
|
||||
};
|
||||
Vector.prototype.pushBack = function (element) {
|
||||
this.vector.push(element);
|
||||
this.length += 1;
|
||||
};
|
||||
Vector.prototype.popBack = function () {
|
||||
if (!this.length)
|
||||
return;
|
||||
this.vector.pop();
|
||||
this.length -= 1;
|
||||
};
|
||||
Vector.prototype.setElementByPos = function (pos, element) {
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
this.vector[pos] = element;
|
||||
};
|
||||
Vector.prototype.insert = function (pos, element, num) {
|
||||
var _a;
|
||||
if (num === void 0) { num = 1; }
|
||||
checkWithinAccessParams(pos, 0, this.length);
|
||||
(_a = this.vector).splice.apply(_a, __spreadArray([pos, 0], __read(new Array(num).fill(element)), false));
|
||||
this.length += num;
|
||||
};
|
||||
Vector.prototype.find = function (element) {
|
||||
for (var i = 0; i < this.length; ++i) {
|
||||
if (this.vector[i] === element) {
|
||||
return new VectorIterator(i, this.size, this.getElementByPos, this.getElementByPos);
|
||||
}
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
Vector.prototype.reverse = function () {
|
||||
this.vector.reverse();
|
||||
};
|
||||
Vector.prototype.unique = function () {
|
||||
var index = 1;
|
||||
for (var i = 1; i < this.length; ++i) {
|
||||
if (this.vector[i] !== this.vector[i - 1]) {
|
||||
this.vector[index++] = this.vector[i];
|
||||
}
|
||||
}
|
||||
this.length = this.vector.length = index;
|
||||
};
|
||||
Vector.prototype.sort = function (cmp) {
|
||||
this.vector.sort(cmp);
|
||||
};
|
||||
Vector.prototype[Symbol.iterator] = function () {
|
||||
return function () {
|
||||
return __generator(this, function (_a) {
|
||||
switch (_a.label) {
|
||||
case 0: return [5 /*yield**/, __values(this.vector)];
|
||||
case 1: return [2 /*return*/, _a.sent()];
|
||||
}
|
||||
});
|
||||
}.bind(this)();
|
||||
};
|
||||
return Vector;
|
||||
}(SequentialContainer));
|
||||
export default Vector;
|
||||
11
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.d.ts
generated
vendored
Normal file
11
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.d.ts
generated
vendored
Normal file
@@ -0,0 +1,11 @@
|
||||
import TreeNode from './TreeNode';
|
||||
import { ContainerIterator } from "../../ContainerBase/index";
|
||||
declare abstract class TreeIterator<K, V> extends ContainerIterator<K | [K, V]> {
|
||||
protected node: TreeNode<K, V>;
|
||||
protected header: TreeNode<K, V>;
|
||||
pre: () => this;
|
||||
next: () => this;
|
||||
constructor(node: TreeNode<K, V>, header: TreeNode<K, V>, iteratorType?: boolean);
|
||||
equals(obj: TreeIterator<K, V>): boolean;
|
||||
}
|
||||
export default TreeIterator;
|
||||
62
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js
generated
vendored
Normal file
62
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js
generated
vendored
Normal file
@@ -0,0 +1,62 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
import { ContainerIterator } from "../../ContainerBase/index";
|
||||
var TreeIterator = /** @class */ (function (_super) {
|
||||
__extends(TreeIterator, _super);
|
||||
function TreeIterator(node, header, iteratorType) {
|
||||
var _this = _super.call(this, iteratorType) || this;
|
||||
_this.node = node;
|
||||
_this.header = header;
|
||||
if (_this.iteratorType === ContainerIterator.NORMAL) {
|
||||
_this.pre = function () {
|
||||
if (this.node === this.header.left) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.pre();
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.next();
|
||||
return this;
|
||||
};
|
||||
}
|
||||
else {
|
||||
_this.pre = function () {
|
||||
if (this.node === this.header.right) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.next();
|
||||
return this;
|
||||
};
|
||||
_this.next = function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('LinkList iterator access denied!');
|
||||
}
|
||||
this.node = this.node.pre();
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return _this;
|
||||
}
|
||||
TreeIterator.prototype.equals = function (obj) {
|
||||
return this.node === obj.node;
|
||||
};
|
||||
return TreeIterator;
|
||||
}(ContainerIterator));
|
||||
export default TreeIterator;
|
||||
36
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.d.ts
generated
vendored
Normal file
36
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.d.ts
generated
vendored
Normal file
@@ -0,0 +1,36 @@
|
||||
declare class TreeNode<K, V> {
|
||||
static readonly RED = true;
|
||||
static readonly BLACK = false;
|
||||
color: boolean;
|
||||
key: K | undefined;
|
||||
value: V | undefined;
|
||||
left: TreeNode<K, V> | undefined;
|
||||
right: TreeNode<K, V> | undefined;
|
||||
parent: TreeNode<K, V> | undefined;
|
||||
constructor(key?: K, value?: V);
|
||||
/**
|
||||
* @description Get the pre node.
|
||||
* @return TreeNode about the pre node.
|
||||
*/
|
||||
pre(): TreeNode<K, V>;
|
||||
/**
|
||||
* @description Get the next node.
|
||||
* @return TreeNode about the next node.
|
||||
*/
|
||||
next(): TreeNode<K, V>;
|
||||
/**
|
||||
* @description Rotate left.
|
||||
* @return TreeNode about moved to original position after rotation.
|
||||
*/
|
||||
rotateLeft(): TreeNode<K, V>;
|
||||
/**
|
||||
* @description Rotate left.
|
||||
* @return TreeNode about moved to original position after rotation.
|
||||
*/
|
||||
rotateRight(): TreeNode<K, V>;
|
||||
/**
|
||||
* @description Remove this.
|
||||
*/
|
||||
remove(): void;
|
||||
}
|
||||
export default TreeNode;
|
||||
121
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js
generated
vendored
Normal file
121
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js
generated
vendored
Normal file
@@ -0,0 +1,121 @@
|
||||
var TreeNode = /** @class */ (function () {
|
||||
function TreeNode(key, value) {
|
||||
this.color = true;
|
||||
this.key = undefined;
|
||||
this.value = undefined;
|
||||
this.left = undefined;
|
||||
this.right = undefined;
|
||||
this.parent = undefined;
|
||||
this.key = key;
|
||||
this.value = value;
|
||||
}
|
||||
/**
|
||||
* @description Get the pre node.
|
||||
* @return TreeNode about the pre node.
|
||||
*/
|
||||
TreeNode.prototype.pre = function () {
|
||||
var preNode = this;
|
||||
if (preNode.color === TreeNode.RED &&
|
||||
preNode.parent.parent === preNode) {
|
||||
preNode = preNode.right;
|
||||
}
|
||||
else if (preNode.left) {
|
||||
preNode = preNode.left;
|
||||
while (preNode.right) {
|
||||
preNode = preNode.right;
|
||||
}
|
||||
}
|
||||
else {
|
||||
var pre = preNode.parent;
|
||||
while (pre.left === preNode) {
|
||||
preNode = pre;
|
||||
pre = preNode.parent;
|
||||
}
|
||||
preNode = pre;
|
||||
}
|
||||
return preNode;
|
||||
};
|
||||
/**
|
||||
* @description Get the next node.
|
||||
* @return TreeNode about the next node.
|
||||
*/
|
||||
TreeNode.prototype.next = function () {
|
||||
var nextNode = this;
|
||||
if (nextNode.right) {
|
||||
nextNode = nextNode.right;
|
||||
while (nextNode.left) {
|
||||
nextNode = nextNode.left;
|
||||
}
|
||||
}
|
||||
else {
|
||||
var pre = nextNode.parent;
|
||||
while (pre.right === nextNode) {
|
||||
nextNode = pre;
|
||||
pre = nextNode.parent;
|
||||
}
|
||||
if (nextNode.right !== pre) {
|
||||
nextNode = pre;
|
||||
}
|
||||
}
|
||||
return nextNode;
|
||||
};
|
||||
/**
|
||||
* @description Rotate left.
|
||||
* @return TreeNode about moved to original position after rotation.
|
||||
*/
|
||||
TreeNode.prototype.rotateLeft = function () {
|
||||
var PP = this.parent;
|
||||
var V = this.right;
|
||||
var R = V.left;
|
||||
if (PP.parent === this)
|
||||
PP.parent = V;
|
||||
else if (PP.left === this)
|
||||
PP.left = V;
|
||||
else
|
||||
PP.right = V;
|
||||
V.parent = PP;
|
||||
V.left = this;
|
||||
this.parent = V;
|
||||
this.right = R;
|
||||
if (R)
|
||||
R.parent = this;
|
||||
return V;
|
||||
};
|
||||
/**
|
||||
* @description Rotate left.
|
||||
* @return TreeNode about moved to original position after rotation.
|
||||
*/
|
||||
TreeNode.prototype.rotateRight = function () {
|
||||
var PP = this.parent;
|
||||
var F = this.left;
|
||||
var K = F.right;
|
||||
if (PP.parent === this)
|
||||
PP.parent = F;
|
||||
else if (PP.left === this)
|
||||
PP.left = F;
|
||||
else
|
||||
PP.right = F;
|
||||
F.parent = PP;
|
||||
F.right = this;
|
||||
this.parent = F;
|
||||
this.left = K;
|
||||
if (K)
|
||||
K.parent = this;
|
||||
return F;
|
||||
};
|
||||
/**
|
||||
* @description Remove this.
|
||||
*/
|
||||
TreeNode.prototype.remove = function () {
|
||||
var parent = this.parent;
|
||||
if (this === parent.left) {
|
||||
parent.left = undefined;
|
||||
}
|
||||
else
|
||||
parent.right = undefined;
|
||||
};
|
||||
TreeNode.RED = true;
|
||||
TreeNode.BLACK = false;
|
||||
return TreeNode;
|
||||
}());
|
||||
export default TreeNode;
|
||||
127
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.d.ts
generated
vendored
Normal file
127
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.d.ts
generated
vendored
Normal file
@@ -0,0 +1,127 @@
|
||||
import TreeNode from './TreeNode';
|
||||
import TreeIterator from './TreeIterator';
|
||||
import { Container } from "../../ContainerBase/index";
|
||||
declare abstract class TreeContainer<K, V> extends Container<K | [K, V]> {
|
||||
protected root: TreeNode<K, V> | undefined;
|
||||
protected header: TreeNode<K, V>;
|
||||
protected cmp: (x: K, y: K) => number;
|
||||
protected constructor(cmp?: (x: K, y: K) => number);
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is greater than or equals to the given key.
|
||||
* @protected
|
||||
*/
|
||||
protected _lowerBound(curNode: TreeNode<K, V> | undefined, key: K): TreeNode<K, V>;
|
||||
/**
|
||||
* @param key The given key you want to compare.
|
||||
* @return An iterator to the first element not less than the given key.
|
||||
*/
|
||||
abstract lowerBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is greater than the given key.
|
||||
* @protected
|
||||
*/
|
||||
protected _upperBound(curNode: TreeNode<K, V> | undefined, key: K): TreeNode<K, V>;
|
||||
/**
|
||||
* @param key The given key you want to compare.
|
||||
* @return An iterator to the first element greater than the given key.
|
||||
*/
|
||||
abstract upperBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is less than or equals to the given key.
|
||||
* @protected
|
||||
*/
|
||||
protected _reverseLowerBound(curNode: TreeNode<K, V> | undefined, key: K): TreeNode<K, V>;
|
||||
/**
|
||||
* @param key The given key you want to compare.
|
||||
* @return An iterator to the first element not greater than the given key.
|
||||
*/
|
||||
abstract reverseLowerBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is less than the given key.
|
||||
* @protected
|
||||
*/
|
||||
protected _reverseUpperBound(curNode: TreeNode<K, V> | undefined, key: K): TreeNode<K, V>;
|
||||
/**
|
||||
* @param key The given key you want to compare.
|
||||
* @return An iterator to the first element less than the given key.
|
||||
*/
|
||||
abstract reverseUpperBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @description Union the other tree to self.
|
||||
* <br/>
|
||||
* Waiting for optimization, this is O(mlog(n+m)) algorithm now,
|
||||
* but we expect it to be O(mlog(n/m+1)).<br/>
|
||||
* More information =>
|
||||
* https://en.wikipedia.org/wiki/Red_black_tree
|
||||
* <br/>
|
||||
* @param other The other tree container you want to merge.
|
||||
*/
|
||||
abstract union(other: TreeContainer<K, V>): void;
|
||||
/**
|
||||
* @description Make self balance after erase a node.
|
||||
* @param curNode The node want to remove.
|
||||
* @protected
|
||||
*/
|
||||
protected eraseNodeSelfBalance(curNode: TreeNode<K, V>): void;
|
||||
/**
|
||||
* @description Remove a node.
|
||||
* @param curNode The node you want to remove.
|
||||
* @protected
|
||||
*/
|
||||
protected eraseNode(curNode: TreeNode<K, V>): void;
|
||||
/**
|
||||
* @description InOrder traversal the tree.
|
||||
* @protected
|
||||
*/
|
||||
protected inOrderTraversal: (curNode: TreeNode<K, V> | undefined, callback: (curNode: TreeNode<K, V>) => boolean) => boolean;
|
||||
/**
|
||||
* @description Make self balance after insert a node.
|
||||
* @param curNode The node want to insert.
|
||||
* @protected
|
||||
*/
|
||||
protected insertNodeSelfBalance(curNode: TreeNode<K, V>): void;
|
||||
/**
|
||||
* @description Find node which key is equals to the given key.
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @protected
|
||||
*/
|
||||
protected findElementNode(curNode: TreeNode<K, V> | undefined, key: K): TreeNode<K, V> | undefined;
|
||||
/**
|
||||
* @description Insert a key-value pair or set value by the given key.
|
||||
* @param key The key want to insert.
|
||||
* @param value The value want to set.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
* @protected
|
||||
*/
|
||||
protected set(key: K, value?: V, hint?: TreeIterator<K, V>): void;
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Update node's key by iterator.
|
||||
* @param iter The iterator you want to change.
|
||||
* @param key The key you want to update.
|
||||
* @return Boolean about if the modification is successful.
|
||||
*/
|
||||
updateKeyByIterator(iter: TreeIterator<K, V>, key: K): boolean;
|
||||
eraseElementByPos(pos: number): void;
|
||||
/**
|
||||
* @description Remove the element of the specified key.
|
||||
* @param key The key you want to remove.
|
||||
*/
|
||||
eraseElementByKey(key: K): void;
|
||||
eraseElementByIterator(iter: TreeIterator<K, V>): TreeIterator<K, V>;
|
||||
/**
|
||||
* @description Get the height of the tree.
|
||||
* @return Number about the height of the RB-tree.
|
||||
*/
|
||||
getHeight(): number;
|
||||
}
|
||||
export default TreeContainer;
|
||||
601
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js
generated
vendored
Normal file
601
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js
generated
vendored
Normal file
@@ -0,0 +1,601 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __read = (this && this.__read) || function (o, n) {
|
||||
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
||||
if (!m) return o;
|
||||
var i = m.call(o), r, ar = [], e;
|
||||
try {
|
||||
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
||||
}
|
||||
catch (error) { e = { error: error }; }
|
||||
finally {
|
||||
try {
|
||||
if (r && !r.done && (m = i["return"])) m.call(i);
|
||||
}
|
||||
finally { if (e) throw e.error; }
|
||||
}
|
||||
return ar;
|
||||
};
|
||||
import TreeNode from './TreeNode';
|
||||
import { Container } from "../../ContainerBase/index";
|
||||
import { checkWithinAccessParams } from "../../../utils/checkParams";
|
||||
var TreeContainer = /** @class */ (function (_super) {
|
||||
__extends(TreeContainer, _super);
|
||||
function TreeContainer(cmp) {
|
||||
if (cmp === void 0) { cmp = function (x, y) {
|
||||
if (x < y)
|
||||
return -1;
|
||||
if (x > y)
|
||||
return 1;
|
||||
return 0;
|
||||
}; }
|
||||
var _this = _super.call(this) || this;
|
||||
_this.root = undefined;
|
||||
_this.header = new TreeNode();
|
||||
/**
|
||||
* @description InOrder traversal the tree.
|
||||
* @protected
|
||||
*/
|
||||
_this.inOrderTraversal = function (curNode, callback) {
|
||||
if (curNode === undefined)
|
||||
return false;
|
||||
var ifReturn = _this.inOrderTraversal(curNode.left, callback);
|
||||
if (ifReturn)
|
||||
return true;
|
||||
if (callback(curNode))
|
||||
return true;
|
||||
return _this.inOrderTraversal(curNode.right, callback);
|
||||
};
|
||||
_this.cmp = cmp;
|
||||
return _this;
|
||||
}
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is greater than or equals to the given key.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype._lowerBound = function (curNode, key) {
|
||||
var resNode;
|
||||
while (curNode) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult < 0) {
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else if (cmpResult > 0) {
|
||||
resNode = curNode;
|
||||
curNode = curNode.left;
|
||||
}
|
||||
else
|
||||
return curNode;
|
||||
}
|
||||
return resNode === undefined ? this.header : resNode;
|
||||
};
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is greater than the given key.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype._upperBound = function (curNode, key) {
|
||||
var resNode;
|
||||
while (curNode) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult <= 0) {
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else if (cmpResult > 0) {
|
||||
resNode = curNode;
|
||||
curNode = curNode.left;
|
||||
}
|
||||
}
|
||||
return resNode === undefined ? this.header : resNode;
|
||||
};
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is less than or equals to the given key.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype._reverseLowerBound = function (curNode, key) {
|
||||
var resNode;
|
||||
while (curNode) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult < 0) {
|
||||
resNode = curNode;
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else if (cmpResult > 0) {
|
||||
curNode = curNode.left;
|
||||
}
|
||||
else
|
||||
return curNode;
|
||||
}
|
||||
return resNode === undefined ? this.header : resNode;
|
||||
};
|
||||
/**
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @return TreeNode which key is less than the given key.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype._reverseUpperBound = function (curNode, key) {
|
||||
var resNode;
|
||||
while (curNode) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult < 0) {
|
||||
resNode = curNode;
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else if (cmpResult >= 0) {
|
||||
curNode = curNode.left;
|
||||
}
|
||||
}
|
||||
return resNode === undefined ? this.header : resNode;
|
||||
};
|
||||
/**
|
||||
* @description Make self balance after erase a node.
|
||||
* @param curNode The node want to remove.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype.eraseNodeSelfBalance = function (curNode) {
|
||||
while (true) {
|
||||
var parentNode = curNode.parent;
|
||||
if (parentNode === this.header)
|
||||
return;
|
||||
if (curNode.color === TreeNode.RED) {
|
||||
curNode.color = TreeNode.BLACK;
|
||||
return;
|
||||
}
|
||||
if (curNode === parentNode.left) {
|
||||
var brother = parentNode.right;
|
||||
if (brother.color === TreeNode.RED) {
|
||||
brother.color = TreeNode.BLACK;
|
||||
parentNode.color = TreeNode.RED;
|
||||
if (parentNode === this.root) {
|
||||
this.root = parentNode.rotateLeft();
|
||||
}
|
||||
else
|
||||
parentNode.rotateLeft();
|
||||
}
|
||||
else if (brother.color === TreeNode.BLACK) {
|
||||
if (brother.right && brother.right.color === TreeNode.RED) {
|
||||
brother.color = parentNode.color;
|
||||
parentNode.color = TreeNode.BLACK;
|
||||
brother.right.color = TreeNode.BLACK;
|
||||
if (parentNode === this.root) {
|
||||
this.root = parentNode.rotateLeft();
|
||||
}
|
||||
else
|
||||
parentNode.rotateLeft();
|
||||
return;
|
||||
}
|
||||
else if (brother.left && brother.left.color === TreeNode.RED) {
|
||||
brother.color = TreeNode.RED;
|
||||
brother.left.color = TreeNode.BLACK;
|
||||
brother.rotateRight();
|
||||
}
|
||||
else {
|
||||
brother.color = TreeNode.RED;
|
||||
curNode = parentNode;
|
||||
}
|
||||
}
|
||||
}
|
||||
else {
|
||||
var brother = parentNode.left;
|
||||
if (brother.color === TreeNode.RED) {
|
||||
brother.color = TreeNode.BLACK;
|
||||
parentNode.color = TreeNode.RED;
|
||||
if (parentNode === this.root) {
|
||||
this.root = parentNode.rotateRight();
|
||||
}
|
||||
else
|
||||
parentNode.rotateRight();
|
||||
}
|
||||
else {
|
||||
if (brother.left && brother.left.color === TreeNode.RED) {
|
||||
brother.color = parentNode.color;
|
||||
parentNode.color = TreeNode.BLACK;
|
||||
brother.left.color = TreeNode.BLACK;
|
||||
if (parentNode === this.root) {
|
||||
this.root = parentNode.rotateRight();
|
||||
}
|
||||
else
|
||||
parentNode.rotateRight();
|
||||
return;
|
||||
}
|
||||
else if (brother.right && brother.right.color === TreeNode.RED) {
|
||||
brother.color = TreeNode.RED;
|
||||
brother.right.color = TreeNode.BLACK;
|
||||
brother.rotateLeft();
|
||||
}
|
||||
else {
|
||||
brother.color = TreeNode.RED;
|
||||
curNode = parentNode;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Remove a node.
|
||||
* @param curNode The node you want to remove.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype.eraseNode = function (curNode) {
|
||||
var _a, _b;
|
||||
if (this.length === 1) {
|
||||
this.clear();
|
||||
return;
|
||||
}
|
||||
var swapNode = curNode;
|
||||
while (swapNode.left || swapNode.right) {
|
||||
if (swapNode.right) {
|
||||
swapNode = swapNode.right;
|
||||
while (swapNode.left)
|
||||
swapNode = swapNode.left;
|
||||
}
|
||||
else if (swapNode.left) {
|
||||
swapNode = swapNode.left;
|
||||
}
|
||||
_a = __read([swapNode.key, curNode.key], 2), curNode.key = _a[0], swapNode.key = _a[1];
|
||||
_b = __read([swapNode.value, curNode.value], 2), curNode.value = _b[0], swapNode.value = _b[1];
|
||||
curNode = swapNode;
|
||||
}
|
||||
if (this.header.left === swapNode) {
|
||||
this.header.left = swapNode.parent;
|
||||
}
|
||||
else if (this.header.right === swapNode) {
|
||||
this.header.right = swapNode.parent;
|
||||
}
|
||||
this.eraseNodeSelfBalance(swapNode);
|
||||
swapNode.remove();
|
||||
this.length -= 1;
|
||||
this.root.color = TreeNode.BLACK;
|
||||
};
|
||||
/**
|
||||
* @description Make self balance after insert a node.
|
||||
* @param curNode The node want to insert.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype.insertNodeSelfBalance = function (curNode) {
|
||||
while (true) {
|
||||
var parentNode = curNode.parent;
|
||||
if (parentNode.color === TreeNode.BLACK)
|
||||
return;
|
||||
var grandParent = parentNode.parent;
|
||||
if (parentNode === grandParent.left) {
|
||||
var uncle = grandParent.right;
|
||||
if (uncle && uncle.color === TreeNode.RED) {
|
||||
uncle.color = parentNode.color = TreeNode.BLACK;
|
||||
if (grandParent === this.root)
|
||||
return;
|
||||
grandParent.color = TreeNode.RED;
|
||||
curNode = grandParent;
|
||||
continue;
|
||||
}
|
||||
else if (curNode === parentNode.right) {
|
||||
curNode.color = TreeNode.BLACK;
|
||||
if (curNode.left)
|
||||
curNode.left.parent = parentNode;
|
||||
if (curNode.right)
|
||||
curNode.right.parent = grandParent;
|
||||
parentNode.right = curNode.left;
|
||||
grandParent.left = curNode.right;
|
||||
curNode.left = parentNode;
|
||||
curNode.right = grandParent;
|
||||
if (grandParent === this.root) {
|
||||
this.root = curNode;
|
||||
this.header.parent = curNode;
|
||||
}
|
||||
else {
|
||||
var GP = grandParent.parent;
|
||||
if (GP.left === grandParent) {
|
||||
GP.left = curNode;
|
||||
}
|
||||
else
|
||||
GP.right = curNode;
|
||||
}
|
||||
curNode.parent = grandParent.parent;
|
||||
parentNode.parent = curNode;
|
||||
grandParent.parent = curNode;
|
||||
}
|
||||
else {
|
||||
parentNode.color = TreeNode.BLACK;
|
||||
if (grandParent === this.root) {
|
||||
this.root = grandParent.rotateRight();
|
||||
}
|
||||
else
|
||||
grandParent.rotateRight();
|
||||
}
|
||||
grandParent.color = TreeNode.RED;
|
||||
}
|
||||
else {
|
||||
var uncle = grandParent.left;
|
||||
if (uncle && uncle.color === TreeNode.RED) {
|
||||
uncle.color = parentNode.color = TreeNode.BLACK;
|
||||
if (grandParent === this.root)
|
||||
return;
|
||||
grandParent.color = TreeNode.RED;
|
||||
curNode = grandParent;
|
||||
continue;
|
||||
}
|
||||
else if (curNode === parentNode.left) {
|
||||
curNode.color = TreeNode.BLACK;
|
||||
if (curNode.left)
|
||||
curNode.left.parent = grandParent;
|
||||
if (curNode.right)
|
||||
curNode.right.parent = parentNode;
|
||||
grandParent.right = curNode.left;
|
||||
parentNode.left = curNode.right;
|
||||
curNode.left = grandParent;
|
||||
curNode.right = parentNode;
|
||||
if (grandParent === this.root) {
|
||||
this.root = curNode;
|
||||
this.header.parent = curNode;
|
||||
}
|
||||
else {
|
||||
var GP = grandParent.parent;
|
||||
if (GP.left === grandParent) {
|
||||
GP.left = curNode;
|
||||
}
|
||||
else
|
||||
GP.right = curNode;
|
||||
}
|
||||
curNode.parent = grandParent.parent;
|
||||
parentNode.parent = curNode;
|
||||
grandParent.parent = curNode;
|
||||
}
|
||||
else {
|
||||
parentNode.color = TreeNode.BLACK;
|
||||
if (grandParent === this.root) {
|
||||
this.root = grandParent.rotateLeft();
|
||||
}
|
||||
else
|
||||
grandParent.rotateLeft();
|
||||
}
|
||||
grandParent.color = TreeNode.RED;
|
||||
}
|
||||
return;
|
||||
}
|
||||
};
|
||||
/**
|
||||
* @description Find node which key is equals to the given key.
|
||||
* @param curNode The starting node of the search.
|
||||
* @param key The key you want to search.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype.findElementNode = function (curNode, key) {
|
||||
while (curNode) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult < 0) {
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else if (cmpResult > 0) {
|
||||
curNode = curNode.left;
|
||||
}
|
||||
else
|
||||
return curNode;
|
||||
}
|
||||
return curNode;
|
||||
};
|
||||
/**
|
||||
* @description Insert a key-value pair or set value by the given key.
|
||||
* @param key The key want to insert.
|
||||
* @param value The value want to set.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
* @protected
|
||||
*/
|
||||
TreeContainer.prototype.set = function (key, value, hint) {
|
||||
if (this.root === undefined) {
|
||||
this.length += 1;
|
||||
this.root = new TreeNode(key, value);
|
||||
this.root.color = TreeNode.BLACK;
|
||||
this.root.parent = this.header;
|
||||
this.header.parent = this.root;
|
||||
this.header.left = this.root;
|
||||
this.header.right = this.root;
|
||||
return;
|
||||
}
|
||||
var curNode;
|
||||
var minNode = this.header.left;
|
||||
var compareToMin = this.cmp(minNode.key, key);
|
||||
if (compareToMin === 0) {
|
||||
minNode.value = value;
|
||||
return;
|
||||
}
|
||||
else if (compareToMin > 0) {
|
||||
minNode.left = new TreeNode(key, value);
|
||||
minNode.left.parent = minNode;
|
||||
curNode = minNode.left;
|
||||
this.header.left = curNode;
|
||||
}
|
||||
else {
|
||||
var maxNode = this.header.right;
|
||||
var compareToMax = this.cmp(maxNode.key, key);
|
||||
if (compareToMax === 0) {
|
||||
maxNode.value = value;
|
||||
return;
|
||||
}
|
||||
else if (compareToMax < 0) {
|
||||
maxNode.right = new TreeNode(key, value);
|
||||
maxNode.right.parent = maxNode;
|
||||
curNode = maxNode.right;
|
||||
this.header.right = curNode;
|
||||
}
|
||||
else {
|
||||
if (hint !== undefined) {
|
||||
// @ts-ignore
|
||||
var iterNode = hint.node;
|
||||
if (iterNode !== this.header) {
|
||||
var iterCmpRes = this.cmp(iterNode.key, key);
|
||||
if (iterCmpRes === 0) {
|
||||
iterNode.value = value;
|
||||
return;
|
||||
}
|
||||
else if (iterCmpRes > 0) {
|
||||
var preNode = iterNode.pre();
|
||||
var preCmpRes = this.cmp(preNode.key, key);
|
||||
if (preCmpRes === 0) {
|
||||
preNode.value = value;
|
||||
return;
|
||||
}
|
||||
else if (preCmpRes < 0) {
|
||||
curNode = new TreeNode(key, value);
|
||||
if (preNode.right === undefined) {
|
||||
preNode.right = curNode;
|
||||
curNode.parent = preNode;
|
||||
}
|
||||
else {
|
||||
iterNode.left = curNode;
|
||||
curNode.parent = iterNode;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (curNode === undefined) {
|
||||
curNode = this.root;
|
||||
while (true) {
|
||||
var cmpResult = this.cmp(curNode.key, key);
|
||||
if (cmpResult > 0) {
|
||||
if (curNode.left === undefined) {
|
||||
curNode.left = new TreeNode(key, value);
|
||||
curNode.left.parent = curNode;
|
||||
curNode = curNode.left;
|
||||
break;
|
||||
}
|
||||
curNode = curNode.left;
|
||||
}
|
||||
else if (cmpResult < 0) {
|
||||
if (curNode.right === undefined) {
|
||||
curNode.right = new TreeNode(key, value);
|
||||
curNode.right.parent = curNode;
|
||||
curNode = curNode.right;
|
||||
break;
|
||||
}
|
||||
curNode = curNode.right;
|
||||
}
|
||||
else {
|
||||
curNode.value = value;
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
this.length += 1;
|
||||
this.insertNodeSelfBalance(curNode);
|
||||
};
|
||||
TreeContainer.prototype.clear = function () {
|
||||
this.length = 0;
|
||||
this.root = undefined;
|
||||
this.header.parent = undefined;
|
||||
this.header.left = this.header.right = undefined;
|
||||
};
|
||||
/**
|
||||
* @description Update node's key by iterator.
|
||||
* @param iter The iterator you want to change.
|
||||
* @param key The key you want to update.
|
||||
* @return Boolean about if the modification is successful.
|
||||
*/
|
||||
TreeContainer.prototype.updateKeyByIterator = function (iter, key) {
|
||||
// @ts-ignore
|
||||
var node = iter.node;
|
||||
if (node === this.header) {
|
||||
throw new TypeError('Invalid iterator!');
|
||||
}
|
||||
if (this.length === 1) {
|
||||
node.key = key;
|
||||
return true;
|
||||
}
|
||||
if (node === this.header.left) {
|
||||
if (this.cmp(node.next().key, key) > 0) {
|
||||
node.key = key;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
if (node === this.header.right) {
|
||||
if (this.cmp(node.pre().key, key) < 0) {
|
||||
node.key = key;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
var preKey = node.pre().key;
|
||||
if (this.cmp(preKey, key) >= 0)
|
||||
return false;
|
||||
var nextKey = node.next().key;
|
||||
if (this.cmp(nextKey, key) <= 0)
|
||||
return false;
|
||||
node.key = key;
|
||||
return true;
|
||||
};
|
||||
TreeContainer.prototype.eraseElementByPos = function (pos) {
|
||||
var _this = this;
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var index = 0;
|
||||
this.inOrderTraversal(this.root, function (curNode) {
|
||||
if (pos === index) {
|
||||
_this.eraseNode(curNode);
|
||||
return true;
|
||||
}
|
||||
index += 1;
|
||||
return false;
|
||||
});
|
||||
};
|
||||
/**
|
||||
* @description Remove the element of the specified key.
|
||||
* @param key The key you want to remove.
|
||||
*/
|
||||
TreeContainer.prototype.eraseElementByKey = function (key) {
|
||||
if (!this.length)
|
||||
return;
|
||||
var curNode = this.findElementNode(this.root, key);
|
||||
if (curNode === undefined)
|
||||
return;
|
||||
this.eraseNode(curNode);
|
||||
};
|
||||
TreeContainer.prototype.eraseElementByIterator = function (iter) {
|
||||
// @ts-ignore
|
||||
var node = iter.node;
|
||||
if (node === this.header) {
|
||||
throw new RangeError('Invalid iterator');
|
||||
}
|
||||
if (node.right === undefined) {
|
||||
iter = iter.next();
|
||||
}
|
||||
this.eraseNode(node);
|
||||
return iter;
|
||||
};
|
||||
/**
|
||||
* @description Get the height of the tree.
|
||||
* @return Number about the height of the RB-tree.
|
||||
*/
|
||||
TreeContainer.prototype.getHeight = function () {
|
||||
if (!this.length)
|
||||
return 0;
|
||||
var traversal = function (curNode) {
|
||||
if (!curNode)
|
||||
return 0;
|
||||
return Math.max(traversal(curNode.left), traversal(curNode.right)) + 1;
|
||||
};
|
||||
return traversal(this.root);
|
||||
};
|
||||
return TreeContainer;
|
||||
}(Container));
|
||||
export default TreeContainer;
|
||||
38
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.d.ts
generated
vendored
Normal file
38
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.d.ts
generated
vendored
Normal file
@@ -0,0 +1,38 @@
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
import TreeContainer from './Base/index';
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
export declare class OrderedMapIterator<K, V> extends TreeIterator<K, V> {
|
||||
get pointer(): [K, V];
|
||||
copy(): OrderedMapIterator<K, V>;
|
||||
}
|
||||
declare class OrderedMap<K, V> extends TreeContainer<K, V> {
|
||||
constructor(container?: initContainer<[K, V]>, cmp?: (x: K, y: K) => number);
|
||||
private readonly iterationFunc;
|
||||
begin(): OrderedMapIterator<K, V>;
|
||||
end(): OrderedMapIterator<K, V>;
|
||||
rBegin(): OrderedMapIterator<K, V>;
|
||||
rEnd(): OrderedMapIterator<K, V>;
|
||||
front(): [K, V] | undefined;
|
||||
back(): [K, V] | undefined;
|
||||
forEach(callback: (element: [K, V], index: number) => void): void;
|
||||
lowerBound(key: K): OrderedMapIterator<K, V>;
|
||||
upperBound(key: K): OrderedMapIterator<K, V>;
|
||||
reverseLowerBound(key: K): OrderedMapIterator<K, V>;
|
||||
reverseUpperBound(key: K): OrderedMapIterator<K, V>;
|
||||
/**
|
||||
* @description Insert a key-value pair or set value by the given key.
|
||||
* @param key The key want to insert.
|
||||
* @param value The value want to set.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
*/
|
||||
setElement(key: K, value: V, hint?: OrderedMapIterator<K, V>): void;
|
||||
find(key: K): OrderedMapIterator<K, V>;
|
||||
/**
|
||||
* @description Get the value of the element of the specified key.
|
||||
*/
|
||||
getElementByKey(key: K): V | undefined;
|
||||
getElementByPos(pos: number): [K, V];
|
||||
union(other: OrderedMap<K, V>): void;
|
||||
[Symbol.iterator](): Generator<[K, V], void, undefined>;
|
||||
}
|
||||
export default OrderedMap;
|
||||
257
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js
generated
vendored
Normal file
257
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js
generated
vendored
Normal file
@@ -0,0 +1,257 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __read = (this && this.__read) || function (o, n) {
|
||||
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
||||
if (!m) return o;
|
||||
var i = m.call(o), r, ar = [], e;
|
||||
try {
|
||||
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
||||
}
|
||||
catch (error) { e = { error: error }; }
|
||||
finally {
|
||||
try {
|
||||
if (r && !r.done && (m = i["return"])) m.call(i);
|
||||
}
|
||||
finally { if (e) throw e.error; }
|
||||
}
|
||||
return ar;
|
||||
};
|
||||
var __values = (this && this.__values) || function(o) {
|
||||
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
||||
if (m) return m.call(o);
|
||||
if (o && typeof o.length === "number") return {
|
||||
next: function () {
|
||||
if (o && i >= o.length) o = void 0;
|
||||
return { value: o && o[i++], done: !o };
|
||||
}
|
||||
};
|
||||
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
import { ContainerIterator } from "../ContainerBase/index";
|
||||
import { checkWithinAccessParams } from "../../utils/checkParams";
|
||||
import TreeContainer from './Base/index';
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
var OrderedMapIterator = /** @class */ (function (_super) {
|
||||
__extends(OrderedMapIterator, _super);
|
||||
function OrderedMapIterator() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(OrderedMapIterator.prototype, "pointer", {
|
||||
get: function () {
|
||||
var _this = this;
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('OrderedMap iterator access denied');
|
||||
}
|
||||
return new Proxy([], {
|
||||
get: function (_, props) {
|
||||
if (props === '0')
|
||||
return _this.node.key;
|
||||
else if (props === '1')
|
||||
return _this.node.value;
|
||||
},
|
||||
set: function (_, props, newValue) {
|
||||
if (props !== '1') {
|
||||
throw new TypeError('props must be 1');
|
||||
}
|
||||
_this.node.value = newValue;
|
||||
return true;
|
||||
}
|
||||
});
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
OrderedMapIterator.prototype.copy = function () {
|
||||
return new OrderedMapIterator(this.node, this.header, this.iteratorType);
|
||||
};
|
||||
return OrderedMapIterator;
|
||||
}(TreeIterator));
|
||||
export { OrderedMapIterator };
|
||||
var OrderedMap = /** @class */ (function (_super) {
|
||||
__extends(OrderedMap, _super);
|
||||
function OrderedMap(container, cmp) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this, cmp) || this;
|
||||
_this.iterationFunc = function (curNode) {
|
||||
return __generator(this, function (_a) {
|
||||
switch (_a.label) {
|
||||
case 0:
|
||||
if (curNode === undefined)
|
||||
return [2 /*return*/];
|
||||
return [5 /*yield**/, __values(this.iterationFunc(curNode.left))];
|
||||
case 1:
|
||||
_a.sent();
|
||||
return [4 /*yield*/, [curNode.key, curNode.value]];
|
||||
case 2:
|
||||
_a.sent();
|
||||
return [5 /*yield**/, __values(this.iterationFunc(curNode.right))];
|
||||
case 3:
|
||||
_a.sent();
|
||||
return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
};
|
||||
_this.iterationFunc = _this.iterationFunc.bind(_this);
|
||||
container.forEach(function (_a) {
|
||||
var _b = __read(_a, 2), key = _b[0], value = _b[1];
|
||||
return _this.setElement(key, value);
|
||||
});
|
||||
return _this;
|
||||
}
|
||||
OrderedMap.prototype.begin = function () {
|
||||
return new OrderedMapIterator(this.header.left || this.header, this.header);
|
||||
};
|
||||
OrderedMap.prototype.end = function () {
|
||||
return new OrderedMapIterator(this.header, this.header);
|
||||
};
|
||||
OrderedMap.prototype.rBegin = function () {
|
||||
return new OrderedMapIterator(this.header.right || this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
OrderedMap.prototype.rEnd = function () {
|
||||
return new OrderedMapIterator(this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
OrderedMap.prototype.front = function () {
|
||||
if (!this.length)
|
||||
return undefined;
|
||||
var minNode = this.header.left;
|
||||
return [minNode.key, minNode.value];
|
||||
};
|
||||
OrderedMap.prototype.back = function () {
|
||||
if (!this.length)
|
||||
return undefined;
|
||||
var maxNode = this.header.right;
|
||||
return [maxNode.key, maxNode.value];
|
||||
};
|
||||
OrderedMap.prototype.forEach = function (callback) {
|
||||
var e_1, _a;
|
||||
var index = 0;
|
||||
try {
|
||||
for (var _b = __values(this), _c = _b.next(); !_c.done; _c = _b.next()) {
|
||||
var pair = _c.value;
|
||||
callback(pair, index++);
|
||||
}
|
||||
}
|
||||
catch (e_1_1) { e_1 = { error: e_1_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
|
||||
}
|
||||
finally { if (e_1) throw e_1.error; }
|
||||
}
|
||||
};
|
||||
OrderedMap.prototype.lowerBound = function (key) {
|
||||
var resNode = this._lowerBound(this.root, key);
|
||||
return new OrderedMapIterator(resNode, this.header);
|
||||
};
|
||||
OrderedMap.prototype.upperBound = function (key) {
|
||||
var resNode = this._upperBound(this.root, key);
|
||||
return new OrderedMapIterator(resNode, this.header);
|
||||
};
|
||||
OrderedMap.prototype.reverseLowerBound = function (key) {
|
||||
var resNode = this._reverseLowerBound(this.root, key);
|
||||
return new OrderedMapIterator(resNode, this.header);
|
||||
};
|
||||
OrderedMap.prototype.reverseUpperBound = function (key) {
|
||||
var resNode = this._reverseUpperBound(this.root, key);
|
||||
return new OrderedMapIterator(resNode, this.header);
|
||||
};
|
||||
/**
|
||||
* @description Insert a key-value pair or set value by the given key.
|
||||
* @param key The key want to insert.
|
||||
* @param value The value want to set.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
*/
|
||||
OrderedMap.prototype.setElement = function (key, value, hint) {
|
||||
this.set(key, value, hint);
|
||||
};
|
||||
OrderedMap.prototype.find = function (key) {
|
||||
var curNode = this.findElementNode(this.root, key);
|
||||
if (curNode !== undefined) {
|
||||
return new OrderedMapIterator(curNode, this.header);
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
/**
|
||||
* @description Get the value of the element of the specified key.
|
||||
*/
|
||||
OrderedMap.prototype.getElementByKey = function (key) {
|
||||
var curNode = this.findElementNode(this.root, key);
|
||||
return curNode ? curNode.value : undefined;
|
||||
};
|
||||
OrderedMap.prototype.getElementByPos = function (pos) {
|
||||
var e_2, _a;
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var res;
|
||||
var index = 0;
|
||||
try {
|
||||
for (var _b = __values(this), _c = _b.next(); !_c.done; _c = _b.next()) {
|
||||
var pair = _c.value;
|
||||
if (index === pos) {
|
||||
res = pair;
|
||||
break;
|
||||
}
|
||||
index += 1;
|
||||
}
|
||||
}
|
||||
catch (e_2_1) { e_2 = { error: e_2_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
|
||||
}
|
||||
finally { if (e_2) throw e_2.error; }
|
||||
}
|
||||
return res;
|
||||
};
|
||||
OrderedMap.prototype.union = function (other) {
|
||||
var _this = this;
|
||||
other.forEach(function (_a) {
|
||||
var _b = __read(_a, 2), key = _b[0], value = _b[1];
|
||||
return _this.setElement(key, value);
|
||||
});
|
||||
};
|
||||
OrderedMap.prototype[Symbol.iterator] = function () {
|
||||
return this.iterationFunc(this.root);
|
||||
};
|
||||
return OrderedMap;
|
||||
}(TreeContainer));
|
||||
export default OrderedMap;
|
||||
33
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.d.ts
generated
vendored
Normal file
33
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.d.ts
generated
vendored
Normal file
@@ -0,0 +1,33 @@
|
||||
import TreeContainer from './Base/index';
|
||||
import { initContainer } from "../ContainerBase/index";
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
export declare class OrderedSetIterator<K> extends TreeIterator<K, undefined> {
|
||||
get pointer(): K;
|
||||
copy(): OrderedSetIterator<K>;
|
||||
}
|
||||
declare class OrderedSet<K> extends TreeContainer<K, undefined> {
|
||||
constructor(container?: initContainer<K>, cmp?: (x: K, y: K) => number);
|
||||
private readonly iterationFunc;
|
||||
begin(): OrderedSetIterator<K>;
|
||||
end(): OrderedSetIterator<K>;
|
||||
rBegin(): OrderedSetIterator<K>;
|
||||
rEnd(): OrderedSetIterator<K>;
|
||||
front(): K | undefined;
|
||||
back(): K | undefined;
|
||||
forEach(callback: (element: K, index: number) => void): void;
|
||||
getElementByPos(pos: number): K;
|
||||
/**
|
||||
* @description Insert element to set.
|
||||
* @param key The key want to insert.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
*/
|
||||
insert(key: K, hint?: OrderedSetIterator<K>): void;
|
||||
find(element: K): OrderedSetIterator<K>;
|
||||
lowerBound(key: K): OrderedSetIterator<K>;
|
||||
upperBound(key: K): OrderedSetIterator<K>;
|
||||
reverseLowerBound(key: K): OrderedSetIterator<K>;
|
||||
reverseUpperBound(key: K): OrderedSetIterator<K>;
|
||||
union(other: OrderedSet<K>): void;
|
||||
[Symbol.iterator](): Generator<K, void, undefined>;
|
||||
}
|
||||
export default OrderedSet;
|
||||
205
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js
generated
vendored
Normal file
205
WebUI/node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js
generated
vendored
Normal file
@@ -0,0 +1,205 @@
|
||||
var __extends = (this && this.__extends) || (function () {
|
||||
var extendStatics = function (d, b) {
|
||||
extendStatics = Object.setPrototypeOf ||
|
||||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
||||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
||||
return extendStatics(d, b);
|
||||
};
|
||||
return function (d, b) {
|
||||
if (typeof b !== "function" && b !== null)
|
||||
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
||||
extendStatics(d, b);
|
||||
function __() { this.constructor = d; }
|
||||
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
||||
};
|
||||
})();
|
||||
var __generator = (this && this.__generator) || function (thisArg, body) {
|
||||
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
||||
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
||||
function verb(n) { return function (v) { return step([n, v]); }; }
|
||||
function step(op) {
|
||||
if (f) throw new TypeError("Generator is already executing.");
|
||||
while (_) try {
|
||||
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
|
||||
if (y = 0, t) op = [op[0] & 2, t.value];
|
||||
switch (op[0]) {
|
||||
case 0: case 1: t = op; break;
|
||||
case 4: _.label++; return { value: op[1], done: false };
|
||||
case 5: _.label++; y = op[1]; op = [0]; continue;
|
||||
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
||||
default:
|
||||
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
||||
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
||||
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
||||
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
||||
if (t[2]) _.ops.pop();
|
||||
_.trys.pop(); continue;
|
||||
}
|
||||
op = body.call(thisArg, _);
|
||||
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
||||
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
||||
}
|
||||
};
|
||||
var __values = (this && this.__values) || function(o) {
|
||||
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
||||
if (m) return m.call(o);
|
||||
if (o && typeof o.length === "number") return {
|
||||
next: function () {
|
||||
if (o && i >= o.length) o = void 0;
|
||||
return { value: o && o[i++], done: !o };
|
||||
}
|
||||
};
|
||||
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
import TreeContainer from './Base/index';
|
||||
import { ContainerIterator } from "../ContainerBase/index";
|
||||
import { checkWithinAccessParams } from "../../utils/checkParams";
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
var OrderedSetIterator = /** @class */ (function (_super) {
|
||||
__extends(OrderedSetIterator, _super);
|
||||
function OrderedSetIterator() {
|
||||
return _super !== null && _super.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(OrderedSetIterator.prototype, "pointer", {
|
||||
get: function () {
|
||||
if (this.node === this.header) {
|
||||
throw new RangeError('OrderedSet iterator access denied!');
|
||||
}
|
||||
return this.node.key;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
OrderedSetIterator.prototype.copy = function () {
|
||||
return new OrderedSetIterator(this.node, this.header, this.iteratorType);
|
||||
};
|
||||
return OrderedSetIterator;
|
||||
}(TreeIterator));
|
||||
export { OrderedSetIterator };
|
||||
var OrderedSet = /** @class */ (function (_super) {
|
||||
__extends(OrderedSet, _super);
|
||||
function OrderedSet(container, cmp) {
|
||||
if (container === void 0) { container = []; }
|
||||
var _this = _super.call(this, cmp) || this;
|
||||
_this.iterationFunc = function (curNode) {
|
||||
return __generator(this, function (_a) {
|
||||
switch (_a.label) {
|
||||
case 0:
|
||||
if (curNode === undefined)
|
||||
return [2 /*return*/];
|
||||
return [5 /*yield**/, __values(this.iterationFunc(curNode.left))];
|
||||
case 1:
|
||||
_a.sent();
|
||||
return [4 /*yield*/, curNode.key];
|
||||
case 2:
|
||||
_a.sent();
|
||||
return [5 /*yield**/, __values(this.iterationFunc(curNode.right))];
|
||||
case 3:
|
||||
_a.sent();
|
||||
return [2 /*return*/];
|
||||
}
|
||||
});
|
||||
};
|
||||
container.forEach(function (element) { return _this.insert(element); });
|
||||
_this.iterationFunc = _this.iterationFunc.bind(_this);
|
||||
return _this;
|
||||
}
|
||||
OrderedSet.prototype.begin = function () {
|
||||
return new OrderedSetIterator(this.header.left || this.header, this.header);
|
||||
};
|
||||
OrderedSet.prototype.end = function () {
|
||||
return new OrderedSetIterator(this.header, this.header);
|
||||
};
|
||||
OrderedSet.prototype.rBegin = function () {
|
||||
return new OrderedSetIterator(this.header.right || this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
OrderedSet.prototype.rEnd = function () {
|
||||
return new OrderedSetIterator(this.header, this.header, ContainerIterator.REVERSE);
|
||||
};
|
||||
OrderedSet.prototype.front = function () {
|
||||
return this.header.left ? this.header.left.key : undefined;
|
||||
};
|
||||
OrderedSet.prototype.back = function () {
|
||||
return this.header.right ? this.header.right.key : undefined;
|
||||
};
|
||||
OrderedSet.prototype.forEach = function (callback) {
|
||||
var e_1, _a;
|
||||
var index = 0;
|
||||
try {
|
||||
for (var _b = __values(this), _c = _b.next(); !_c.done; _c = _b.next()) {
|
||||
var element = _c.value;
|
||||
callback(element, index++);
|
||||
}
|
||||
}
|
||||
catch (e_1_1) { e_1 = { error: e_1_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
|
||||
}
|
||||
finally { if (e_1) throw e_1.error; }
|
||||
}
|
||||
};
|
||||
OrderedSet.prototype.getElementByPos = function (pos) {
|
||||
var e_2, _a;
|
||||
checkWithinAccessParams(pos, 0, this.length - 1);
|
||||
var res;
|
||||
var index = 0;
|
||||
try {
|
||||
for (var _b = __values(this), _c = _b.next(); !_c.done; _c = _b.next()) {
|
||||
var element = _c.value;
|
||||
if (index === pos) {
|
||||
res = element;
|
||||
}
|
||||
index += 1;
|
||||
}
|
||||
}
|
||||
catch (e_2_1) { e_2 = { error: e_2_1 }; }
|
||||
finally {
|
||||
try {
|
||||
if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
|
||||
}
|
||||
finally { if (e_2) throw e_2.error; }
|
||||
}
|
||||
return res;
|
||||
};
|
||||
/**
|
||||
* @description Insert element to set.
|
||||
* @param key The key want to insert.
|
||||
* @param hint You can give an iterator hint to improve insertion efficiency.
|
||||
*/
|
||||
OrderedSet.prototype.insert = function (key, hint) {
|
||||
this.set(key, undefined, hint);
|
||||
};
|
||||
OrderedSet.prototype.find = function (element) {
|
||||
var curNode = this.findElementNode(this.root, element);
|
||||
if (curNode !== undefined) {
|
||||
return new OrderedSetIterator(curNode, this.header);
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
OrderedSet.prototype.lowerBound = function (key) {
|
||||
var resNode = this._lowerBound(this.root, key);
|
||||
return new OrderedSetIterator(resNode, this.header);
|
||||
};
|
||||
OrderedSet.prototype.upperBound = function (key) {
|
||||
var resNode = this._upperBound(this.root, key);
|
||||
return new OrderedSetIterator(resNode, this.header);
|
||||
};
|
||||
OrderedSet.prototype.reverseLowerBound = function (key) {
|
||||
var resNode = this._reverseLowerBound(this.root, key);
|
||||
return new OrderedSetIterator(resNode, this.header);
|
||||
};
|
||||
OrderedSet.prototype.reverseUpperBound = function (key) {
|
||||
var resNode = this._reverseUpperBound(this.root, key);
|
||||
return new OrderedSetIterator(resNode, this.header);
|
||||
};
|
||||
OrderedSet.prototype.union = function (other) {
|
||||
var _this = this;
|
||||
other.forEach(function (element) { return _this.insert(element); });
|
||||
};
|
||||
OrderedSet.prototype[Symbol.iterator] = function () {
|
||||
return this.iterationFunc(this.root);
|
||||
};
|
||||
return OrderedSet;
|
||||
}(TreeContainer));
|
||||
export default OrderedSet;
|
||||
Reference in New Issue
Block a user