Bradley/Breadbot
1
0
Fork 0
Code Issues Pull Requests 1 Actions Packages Projects Releases Wiki Activity

Insane number of adds to setup env and packages

Browse Source
This commit is contained in:
Bradley
2022-11-07 17:45:54 -05:00
parent 62c2bb73a9
commit 55ecf095a9
3127 changed files with 485223 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.d.ts generated vendored Normal file
View File

@@ -0,0 +1,25 @@
import { Base } from "../../ContainerBase";
declare abstract class HashContainer<K> extends Base {
protected constructor(initBucketNum?: number, hashFunc?: (x: K) => number);
clear(): void;
/**
* @description Iterate over all elements in the container.
* @param callback Callback function like Array.forEach.
*/
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;
/**
* @description Using for `for...of` syntax like Array.
*/
abstract [Symbol.iterator](): Generator<K | [K, unknown], void, undefined>;
}
export default HashContainer;

62
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js generated vendored Normal file
View File

@@ -0,0 +1,62 @@
var __extends = this && this.t || function() {
var extendStatics = function(n, t) {
extendStatics = Object.setPrototypeOf || {
__proto__: []
} instanceof Array && function(n, t) {
n.__proto__ = t;
} || function(n, t) {
for (var r in t) if (Object.prototype.hasOwnProperty.call(t, r)) n[r] = t[r];
};
return extendStatics(n, t);
};
return function(n, t) {
if (typeof t !== "function" && t !== null) throw new TypeError("Class extends value " + String(t) + " is not a constructor or null");
extendStatics(n, t);
function __() {
this.constructor = n;
}
n.prototype = t === null ? Object.create(t) : (__.prototype = t.prototype, new __);
};
}();
import { Base } from "../../ContainerBase";
var HashContainer = function(n) {
__extends(HashContainer, n);
function HashContainer(t, r) {
if (t === void 0) {
t = 16;
}
if (r === void 0) {
r = function(n) {
var t;
if (typeof n !== "string") {
t = JSON.stringify(n);
} else t = n;
var r = 0;
var i = t.length;
for (var e = 0; e < i; e++) {
var o = t.charCodeAt(e);
r = (r << 5) - r + o;
r |= 0;
}
return r >>> 0;
};
}
var i = n.call(this) || this;
if (t < 16 || (t & t - 1) !== 0) {
throw new RangeError("InitBucketNum range error");
}
i.l = i.nn = t;
i.p = r;
return i;
}
HashContainer.prototype.clear = function() {
this.o = 0;
this.l = this.nn;
this.h = [];
};
return HashContainer;
}(Base);
export default HashContainer;

22
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.d.ts generated vendored Normal file
View File

@@ -0,0 +1,22 @@
import { initContainer } from "../ContainerBase";
import HashContainer from './Base';
declare class HashMap<K, V> extends HashContainer<K> {
constructor(container?: initContainer<[K, V]>, initBucketNum?: number, hashFunc?: (x: K) => number);
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;

410
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js generated vendored Normal file
View File

@@ -0,0 +1,410 @@
var __extends = this && this.t || function() {
var extendStatics = function(r, e) {
extendStatics = Object.setPrototypeOf || {
__proto__: []
} instanceof Array && function(r, e) {
r.__proto__ = e;
} || function(r, e) {
for (var t in e) if (Object.prototype.hasOwnProperty.call(e, t)) r[t] = e[t];
};
return extendStatics(r, e);
};
return function(r, e) {
if (typeof e !== "function" && e !== null) throw new TypeError("Class extends value " + String(e) + " is not a constructor or null");
extendStatics(r, e);
function __() {
this.constructor = r;
}
r.prototype = e === null ? Object.create(e) : (__.prototype = e.prototype, new __);
};
}();
var __generator = this && this.i || function(r, e) {
var t = {
label: 0,
sent: function() {
if (a[0] & 1) throw a[1];
return a[1];
},
trys: [],
ops: []
}, n, i, a, f;
return f = {
next: verb(0),
throw: verb(1),
return: verb(2)
}, typeof Symbol === "function" && (f[Symbol.iterator] = function() {
return this;
}), f;
function verb(r) {
return function(e) {
return step([ r, e ]);
};
}
function step(f) {
if (n) throw new TypeError("Generator is already executing.");
while (t) try {
if (n = 1, i && (a = f[0] & 2 ? i["return"] : f[0] ? i["throw"] || ((a = i["return"]) && a.call(i),
0) : i.next) && !(a = a.call(i, f[1])).done) return a;
if (i = 0, a) f = [ f[0] & 2, a.value ];
switch (f[0]) {
case 0:
case 1:
a = f;
break;
case 4:
t.label++;
return {
value: f[1],
done: false
};
case 5:
t.label++;
i = f[1];
f = [ 0 ];
continue;
case 7:
f = t.ops.pop();
t.trys.pop();
continue;
default:
if (!(a = t.trys, a = a.length > 0 && a[a.length - 1]) && (f[0] === 6 || f[0] === 2)) {
t = 0;
continue;
}
if (f[0] === 3 && (!a || f[1] > a[0] && f[1] < a[3])) {
t.label = f[1];
break;
}
if (f[0] === 6 && t.label < a[1]) {
t.label = a[1];
a = f;
break;
}
if (a && t.label < a[2]) {
t.label = a[2];
t.ops.push(f);
break;
}
if (a[2]) t.ops.pop();
t.trys.pop();
continue;
}
f = e.call(r, t);
} catch (r) {
f = [ 6, r ];
i = 0;
} finally {
n = a = 0;
}
if (f[0] & 5) throw f[1];
return {
value: f[0] ? f[1] : void 0,
done: true
};
}
};
var __values = this && this.u || function(r) {
var e = typeof Symbol === "function" && Symbol.iterator, t = e && r[e], n = 0;
if (t) return t.call(r);
if (r && typeof r.length === "number") return {
next: function() {
if (r && n >= r.length) r = void 0;
return {
value: r && r[n++],
done: !r
};
}
};
throw new TypeError(e ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
import HashContainer from "./Base";
import Vector from "../SequentialContainer/Vector";
import OrderedMap from "../TreeContainer/OrderedMap";
var HashMap = function(r) {
__extends(HashMap, r);
function HashMap(e, t, n) {
if (e === void 0) {
e = [];
}
var i = r.call(this, t, n) || this;
i.h = [];
e.forEach((function(r) {
return i.setElement(r[0], r[1]);
}));
return i;
}
HashMap.prototype.v = function() {
var r = this;
if (this.l >= 1073741824) return;
var e = [];
var t = this.l;
this.l <<= 1;
var n = Object.keys(this.h);
var i = n.length;
var _loop_1 = function(i) {
var f = parseInt(n[i]);
var s = a.h[f];
var o = s.size();
if (o === 0) return "continue";
if (o === 1) {
var u = s.front();
e[a.p(u[0]) & a.l - 1] = new Vector([ u ], false);
return "continue";
}
var c = [];
var h = [];
s.forEach((function(e) {
var n = r.p(e[0]);
if ((n & t) === 0) {
c.push(e);
} else h.push(e);
}));
if (s instanceof OrderedMap) {
if (c.length > 6) {
e[f] = new OrderedMap(c);
} else {
e[f] = new Vector(c, false);
}
if (h.length > 6) {
e[f + t] = new OrderedMap(h);
} else {
e[f + t] = new Vector(h, false);
}
} else {
e[f] = new Vector(c, false);
e[f + t] = new Vector(h, false);
}
};
var a = this;
for (var f = 0; f < i; ++f) {
_loop_1(f);
}
this.h = e;
};
HashMap.prototype.forEach = function(r) {
var e = Object.values(this.h);
var t = e.length;
var n = 0;
for (var i = 0; i < t; ++i) {
e[i].forEach((function(e) {
return r(e, n++);
}));
}
};
HashMap.prototype.setElement = function(r, e) {
var t, n;
var i = this.p(r) & this.l - 1;
var a = this.h[i];
if (!a) {
this.o += 1;
this.h[i] = new Vector([ [ r, e ] ], false);
} else {
var f = a.size();
if (a instanceof Vector) {
try {
for (var s = __values(a), o = s.next(); !o.done; o = s.next()) {
var u = o.value;
if (u[0] === r) {
u[1] = e;
return;
}
}
} catch (r) {
t = {
error: r
};
} finally {
try {
if (o && !o.done && (n = s.return)) n.call(s);
} finally {
if (t) throw t.error;
}
}
a.pushBack([ r, e ]);
if (f + 1 >= 8) {
if (this.l <= 64) {
this.o += 1;
this.v();
return;
}
this.h[i] = new OrderedMap(this.h[i]);
}
this.o += 1;
} else {
a.setElement(r, e);
var c = a.size();
this.o += c - f;
}
}
if (this.o > this.l * .75) {
this.v();
}
};
HashMap.prototype.getElementByKey = function(r) {
var e, t;
var n = this.p(r) & this.l - 1;
var i = this.h[n];
if (!i) return undefined;
if (i instanceof OrderedMap) {
return i.getElementByKey(r);
} else {
try {
for (var a = __values(i), f = a.next(); !f.done; f = a.next()) {
var s = f.value;
if (s[0] === r) return s[1];
}
} catch (r) {
e = {
error: r
};
} finally {
try {
if (f && !f.done && (t = a.return)) t.call(a);
} finally {
if (e) throw e.error;
}
}
return undefined;
}
};
HashMap.prototype.eraseElementByKey = function(r) {
var e, t;
var n = this.p(r) & this.l - 1;
var i = this.h[n];
if (!i) return;
if (i instanceof Vector) {
var a = 0;
try {
for (var f = __values(i), s = f.next(); !s.done; s = f.next()) {
var o = s.value;
if (o[0] === r) {
i.eraseElementByPos(a);
this.o -= 1;
return;
}
a += 1;
}
} catch (r) {
e = {
error: r
};
} finally {
try {
if (s && !s.done && (t = f.return)) t.call(f);
} finally {
if (e) throw e.error;
}
}
} else {
var u = i.size();
i.eraseElementByKey(r);
var c = i.size();
this.o += c - u;
if (c <= 6) {
this.h[n] = new Vector(i);
}
}
};
HashMap.prototype.find = function(r) {
var e, t;
var n = this.p(r) & this.l - 1;
var i = this.h[n];
if (!i) return false;
if (i instanceof OrderedMap) {
return !i.find(r).equals(i.end());
}
try {
for (var a = __values(i), f = a.next(); !f.done; f = a.next()) {
var s = f.value;
if (s[0] === r) return true;
}
} catch (r) {
e = {
error: r
};
} finally {
try {
if (f && !f.done && (t = a.return)) t.call(a);
} finally {
if (e) throw e.error;
}
}
return false;
};
HashMap.prototype[Symbol.iterator] = function() {
return function() {
var r, e, t, n, i, a, f, s;
var o, u;
return __generator(this, (function(c) {
switch (c.label) {
case 0:
r = Object.values(this.h);
e = r.length;
t = 0;
c.label = 1;
case 1:
if (!(t < e)) return [ 3, 10 ];
n = r[t];
c.label = 2;
case 2:
c.trys.push([ 2, 7, 8, 9 ]);
i = (o = void 0, __values(n)), a = i.next();
c.label = 3;
case 3:
if (!!a.done) return [ 3, 6 ];
f = a.value;
return [ 4, f ];
case 4:
c.sent();
c.label = 5;
case 5:
a = i.next();
return [ 3, 3 ];
case 6:
return [ 3, 9 ];
case 7:
s = c.sent();
o = {
error: s
};
return [ 3, 9 ];
case 8:
try {
if (a && !a.done && (u = i.return)) u.call(i);
} finally {
if (o) throw o.error;
}
return [ 7 ];
case 9:
++t;
return [ 3, 1 ];
case 10:
return [ 2 ];
}
}));
}.bind(this)();
};
return HashMap;
}(HashContainer);
export default HashMap;

15
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.d.ts generated vendored Normal file
View File

@@ -0,0 +1,15 @@
import HashContainer from './Base';
import { initContainer } from "../ContainerBase";
declare class HashSet<K> extends HashContainer<K> {
constructor(container?: initContainer<K>, initBucketNum?: number, _hashFunc?: (x: K) => number);
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;

325
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js generated vendored Normal file
View File

@@ -0,0 +1,325 @@
var __extends = this && this.t || function() {
var extendStatics = function(e, t) {
extendStatics = Object.setPrototypeOf || {
__proto__: []
} instanceof Array && function(e, t) {
e.__proto__ = t;
} || function(e, t) {
for (var r in t) if (Object.prototype.hasOwnProperty.call(t, r)) e[r] = t[r];
};
return extendStatics(e, t);
};
return function(e, t) {
if (typeof t !== "function" && t !== null) throw new TypeError("Class extends value " + String(t) + " is not a constructor or null");
extendStatics(e, t);
function __() {
this.constructor = e;
}
e.prototype = t === null ? Object.create(t) : (__.prototype = t.prototype, new __);
};
}();
var __generator = this && this.i || function(e, t) {
var r = {
label: 0,
sent: function() {
if (a[0] & 1) throw a[1];
return a[1];
},
trys: [],
ops: []
}, n, i, a, s;
return s = {
next: verb(0),
throw: verb(1),
return: verb(2)
}, typeof Symbol === "function" && (s[Symbol.iterator] = function() {
return this;
}), s;
function verb(e) {
return function(t) {
return step([ e, t ]);
};
}
function step(s) {
if (n) throw new TypeError("Generator is already executing.");
while (r) try {
if (n = 1, i && (a = s[0] & 2 ? i["return"] : s[0] ? i["throw"] || ((a = i["return"]) && a.call(i),
0) : i.next) && !(a = a.call(i, s[1])).done) return a;
if (i = 0, a) s = [ s[0] & 2, a.value ];
switch (s[0]) {
case 0:
case 1:
a = s;
break;
case 4:
r.label++;
return {
value: s[1],
done: false
};
case 5:
r.label++;
i = s[1];
s = [ 0 ];
continue;
case 7:
s = r.ops.pop();
r.trys.pop();
continue;
default:
if (!(a = r.trys, a = a.length > 0 && a[a.length - 1]) && (s[0] === 6 || s[0] === 2)) {
r = 0;
continue;
}
if (s[0] === 3 && (!a || s[1] > a[0] && s[1] < a[3])) {
r.label = s[1];
break;
}
if (s[0] === 6 && r.label < a[1]) {
r.label = a[1];
a = s;
break;
}
if (a && r.label < a[2]) {
r.label = a[2];
r.ops.push(s);
break;
}
if (a[2]) r.ops.pop();
r.trys.pop();
continue;
}
s = t.call(e, r);
} catch (e) {
s = [ 6, e ];
i = 0;
} finally {
n = a = 0;
}
if (s[0] & 5) throw s[1];
return {
value: s[0] ? s[1] : void 0,
done: true
};
}
};
var __values = this && this.u || function(e) {
var t = typeof Symbol === "function" && Symbol.iterator, r = t && e[t], n = 0;
if (r) return r.call(e);
if (e && typeof e.length === "number") return {
next: function() {
if (e && n >= e.length) e = void 0;
return {
value: e && e[n++],
done: !e
};
}
};
throw new TypeError(t ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
import HashContainer from "./Base";
import Vector from "../SequentialContainer/Vector";
import OrderedSet from "../TreeContainer/OrderedSet";
var HashSet = function(e) {
__extends(HashSet, e);
function HashSet(t, r, n) {
if (t === void 0) {
t = [];
}
var i = e.call(this, r, n) || this;
i.h = [];
t.forEach((function(e) {
return i.insert(e);
}));
return i;
}
HashSet.prototype.v = function() {
var e = this;
if (this.l >= 1073741824) return;
var t = [];
var r = this.l;
this.l <<= 1;
var n = Object.keys(this.h);
var i = n.length;
var _loop_1 = function(i) {
var s = parseInt(n[i]);
var o = a.h[s];
var f = o.size();
if (f === 0) return "continue";
if (f === 1) {
var u = o.front();
t[a.p(u) & a.l - 1] = new Vector([ u ], false);
return "continue";
}
var c = [];
var h = [];
o.forEach((function(t) {
var n = e.p(t);
if ((n & r) === 0) {
c.push(t);
} else h.push(t);
}));
if (o instanceof OrderedSet) {
if (c.length > 6) {
t[s] = new OrderedSet(c);
} else {
t[s] = new Vector(c, false);
}
if (h.length > 6) {
t[s + r] = new OrderedSet(h);
} else {
t[s + r] = new Vector(h, false);
}
} else {
t[s] = new Vector(c, false);
t[s + r] = new Vector(h, false);
}
};
var a = this;
for (var s = 0; s < i; ++s) {
_loop_1(s);
}
this.h = t;
};
HashSet.prototype.forEach = function(e) {
var t = Object.values(this.h);
var r = t.length;
var n = 0;
for (var i = 0; i < r; ++i) {
t[i].forEach((function(t) {
return e(t, n++);
}));
}
};
HashSet.prototype.insert = function(e) {
var t = this.p(e) & this.l - 1;
var r = this.h[t];
if (!r) {
this.h[t] = new Vector([ e ], false);
this.o += 1;
} else {
var n = r.size();
if (r instanceof Vector) {
if (!r.find(e).equals(r.end())) return;
r.pushBack(e);
if (n + 1 >= 8) {
if (this.l <= 64) {
this.o += 1;
this.v();
return;
}
this.h[t] = new OrderedSet(r);
}
this.o += 1;
} else {
r.insert(e);
var i = r.size();
this.o += i - n;
}
}
if (this.o > this.l * .75) {
this.v();
}
};
HashSet.prototype.eraseElementByKey = function(e) {
var t = this.p(e) & this.l - 1;
var r = this.h[t];
if (!r) return;
var n = r.size();
if (n === 0) return;
if (r instanceof Vector) {
r.eraseElementByValue(e);
var i = r.size();
this.o += i - n;
} else {
r.eraseElementByKey(e);
var i = r.size();
this.o += i - n;
if (i <= 6) {
this.h[t] = new Vector(r);
}
}
};
HashSet.prototype.find = function(e) {
var t = this.p(e) & this.l - 1;
var r = this.h[t];
if (!r) return false;
return !r.find(e).equals(r.end());
};
HashSet.prototype[Symbol.iterator] = function() {
return function() {
var e, t, r, n, i, a, s, o;
var f, u;
return __generator(this, (function(c) {
switch (c.label) {
case 0:
e = Object.values(this.h);
t = e.length;
r = 0;
c.label = 1;
case 1:
if (!(r < t)) return [ 3, 10 ];
n = e[r];
c.label = 2;
case 2:
c.trys.push([ 2, 7, 8, 9 ]);
i = (f = void 0, __values(n)), a = i.next();
c.label = 3;
case 3:
if (!!a.done) return [ 3, 6 ];
s = a.value;
return [ 4, s ];
case 4:
c.sent();
c.label = 5;
case 5:
a = i.next();
return [ 3, 3 ];
case 6:
return [ 3, 9 ];
case 7:
o = c.sent();
f = {
error: o
};
return [ 3, 9 ];
case 8:
try {
if (a && !a.done && (u = i.return)) u.call(i);
} finally {
if (f) throw f.error;
}
return [ 7 ];
case 9:
++r;
return [ 3, 1 ];
case 10:
return [ 2 ];
}
}));
}.bind(this)();
};
return HashSet;
}(HashContainer);
export default HashSet;