mqtt and socket added
This commit is contained in:
Miisa Ekholm
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;
|
||||
Reference in New Issue
Block a user