Bump packages to fix linter
This commit is contained in:
Henry Mercer
parent
ed9506bbaf
commit
0a11e3fdd9
6063 changed files with 378752 additions and 306784 deletions
206
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.d.ts
generated
vendored
Normal file
206
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,206 @@
|
|||
/**
|
||||
* @description The iterator type including `NORMAL` and `REVERSE`.
|
||||
*/
|
||||
export declare const enum IteratorType {
|
||||
NORMAL = 0,
|
||||
REVERSE = 1
|
||||
}
|
||||
export declare abstract class ContainerIterator<T> {
|
||||
/**
|
||||
* @description Iterator's type.
|
||||
* @example
|
||||
* console.log(container.end().iteratorType === IteratorType.NORMAL); // true
|
||||
*/
|
||||
readonly iteratorType: IteratorType;
|
||||
/**
|
||||
* @param iter - The other iterator you want to compare.
|
||||
* @returns Whether this equals to obj.
|
||||
* @example
|
||||
* container.find(1).equals(container.end());
|
||||
*/
|
||||
equals(iter: ContainerIterator<T>): boolean;
|
||||
/**
|
||||
* @description Pointers to element.
|
||||
* @returns The value of the pointer's element.
|
||||
* @example
|
||||
* const val = container.begin().pointer;
|
||||
*/
|
||||
abstract get pointer(): T;
|
||||
/**
|
||||
* @description Set pointer's value (some containers are unavailable).
|
||||
* @param newValue - The new value you want to set.
|
||||
* @example
|
||||
* (<LinkList<number>>container).begin().pointer = 1;
|
||||
*/
|
||||
abstract set pointer(newValue: T);
|
||||
/**
|
||||
* @description Move `this` iterator to pre.
|
||||
* @returns The iterator's self.
|
||||
* @example
|
||||
* const iter = container.find(1); // container = [0, 1]
|
||||
* const pre = iter.pre();
|
||||
* console.log(pre === iter); // true
|
||||
* console.log(pre.equals(iter)); // true
|
||||
* console.log(pre.pointer, iter.pointer); // 0, 0
|
||||
*/
|
||||
abstract pre(): this;
|
||||
/**
|
||||
* @description Move `this` iterator to next.
|
||||
* @returns The iterator's self.
|
||||
* @example
|
||||
* const iter = container.find(1); // container = [1, 2]
|
||||
* const next = iter.next();
|
||||
* console.log(next === iter); // true
|
||||
* console.log(next.equals(iter)); // true
|
||||
* console.log(next.pointer, iter.pointer); // 2, 2
|
||||
*/
|
||||
abstract next(): this;
|
||||
/**
|
||||
* @description Get a copy of itself.
|
||||
* @returns The copy of self.
|
||||
* @example
|
||||
* const iter = container.find(1); // container = [1, 2]
|
||||
* const next = iter.copy().next();
|
||||
* console.log(next === iter); // false
|
||||
* console.log(next.equals(iter)); // false
|
||||
* console.log(next.pointer, iter.pointer); // 2, 1
|
||||
*/
|
||||
abstract copy(): ContainerIterator<T>;
|
||||
}
|
||||
export declare abstract class Base {
|
||||
/**
|
||||
* @returns The size of the container.
|
||||
* @example
|
||||
* const container = new Vector([1, 2]);
|
||||
* console.log(container.length); // 2
|
||||
*/
|
||||
get length(): number;
|
||||
/**
|
||||
* @returns The size of the container.
|
||||
* @example
|
||||
* const container = new Vector([1, 2]);
|
||||
* console.log(container.size()); // 2
|
||||
*/
|
||||
size(): number;
|
||||
/**
|
||||
* @returns Whether the container is empty.
|
||||
* @example
|
||||
* container.clear();
|
||||
* console.log(container.empty()); // true
|
||||
*/
|
||||
empty(): boolean;
|
||||
/**
|
||||
* @description Clear the container.
|
||||
* @example
|
||||
* container.clear();
|
||||
* console.log(container.empty()); // true
|
||||
*/
|
||||
abstract clear(): void;
|
||||
}
|
||||
export declare abstract class Container<T> extends Base {
|
||||
/**
|
||||
* @returns Iterator pointing to the beginning element.
|
||||
* @example
|
||||
* const begin = container.begin();
|
||||
* const end = container.end();
|
||||
* for (const it = begin; !it.equals(end); it.next()) {
|
||||
* doSomething(it.pointer);
|
||||
* }
|
||||
*/
|
||||
abstract begin(): ContainerIterator<T>;
|
||||
/**
|
||||
* @returns Iterator pointing to the super end like c++.
|
||||
* @example
|
||||
* const begin = container.begin();
|
||||
* const end = container.end();
|
||||
* for (const it = begin; !it.equals(end); it.next()) {
|
||||
* doSomething(it.pointer);
|
||||
* }
|
||||
*/
|
||||
abstract end(): ContainerIterator<T>;
|
||||
/**
|
||||
* @returns Iterator pointing to the end element.
|
||||
* @example
|
||||
* const rBegin = container.rBegin();
|
||||
* const rEnd = container.rEnd();
|
||||
* for (const it = rBegin; !it.equals(rEnd); it.next()) {
|
||||
* doSomething(it.pointer);
|
||||
* }
|
||||
*/
|
||||
abstract rBegin(): ContainerIterator<T>;
|
||||
/**
|
||||
* @returns Iterator pointing to the super begin like c++.
|
||||
* @example
|
||||
* const rBegin = container.rBegin();
|
||||
* const rEnd = container.rEnd();
|
||||
* for (const it = rBegin; !it.equals(rEnd); it.next()) {
|
||||
* doSomething(it.pointer);
|
||||
* }
|
||||
*/
|
||||
abstract rEnd(): ContainerIterator<T>;
|
||||
/**
|
||||
* @returns The first element of the container.
|
||||
*/
|
||||
abstract front(): T | undefined;
|
||||
/**
|
||||
* @returns The last element of the container.
|
||||
*/
|
||||
abstract back(): T | undefined;
|
||||
/**
|
||||
* @param element - The element you want to find.
|
||||
* @returns An iterator pointing to the element if found, or super end if not found.
|
||||
* @example
|
||||
* container.find(1).equals(container.end());
|
||||
*/
|
||||
abstract find(element: T): ContainerIterator<T>;
|
||||
/**
|
||||
* @description Iterate over all elements in the container.
|
||||
* @param callback - Callback function like Array.forEach.
|
||||
* @example
|
||||
* container.forEach((element, index) => console.log(element, index));
|
||||
*/
|
||||
abstract forEach(callback: (element: T, index: number, container: Container<T>) => void): void;
|
||||
/**
|
||||
* @description Gets the value of the element at the specified position.
|
||||
* @example
|
||||
* const val = container.getElementByPos(-1); // throw a RangeError
|
||||
*/
|
||||
abstract getElementByPos(pos: number): T;
|
||||
/**
|
||||
* @description Removes the element at the specified position.
|
||||
* @param pos - The element's position you want to remove.
|
||||
* @returns The container length after erasing.
|
||||
* @example
|
||||
* container.eraseElementByPos(-1); // throw a RangeError
|
||||
*/
|
||||
abstract eraseElementByPos(pos: number): number;
|
||||
/**
|
||||
* @description Removes element by iterator and move `iter` to next.
|
||||
* @param iter - The iterator you want to erase.
|
||||
* @returns The next iterator.
|
||||
* @example
|
||||
* container.eraseElementByIterator(container.begin());
|
||||
* container.eraseElementByIterator(container.end()); // throw a RangeError
|
||||
*/
|
||||
abstract eraseElementByIterator(iter: ContainerIterator<T>): ContainerIterator<T>;
|
||||
/**
|
||||
* @description Using for `for...of` syntax like Array.
|
||||
* @example
|
||||
* for (const element of container) {
|
||||
* console.log(element);
|
||||
* }
|
||||
*/
|
||||
abstract [Symbol.iterator](): Generator<T, void>;
|
||||
}
|
||||
/**
|
||||
* @description The initial data type passed in when initializing the container.
|
||||
*/
|
||||
export declare type initContainer<T> = ({
|
||||
size: number;
|
||||
} | {
|
||||
length: number;
|
||||
} | {
|
||||
size(): number;
|
||||
}) & {
|
||||
forEach(callback: (element: T) => void): void;
|
||||
};
|
||||
68
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js
generated
vendored
Normal file
68
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
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 __);
|
||||
};
|
||||
}();
|
||||
|
||||
var ContainerIterator = function() {
|
||||
function ContainerIterator(n) {
|
||||
if (n === void 0) {
|
||||
n = 0;
|
||||
}
|
||||
this.iteratorType = n;
|
||||
}
|
||||
ContainerIterator.prototype.equals = function(n) {
|
||||
return this.o === n.o;
|
||||
};
|
||||
return ContainerIterator;
|
||||
}();
|
||||
|
||||
export { ContainerIterator };
|
||||
|
||||
var Base = function() {
|
||||
function Base() {
|
||||
this.i = 0;
|
||||
}
|
||||
Object.defineProperty(Base.prototype, "length", {
|
||||
get: function() {
|
||||
return this.i;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
Base.prototype.size = function() {
|
||||
return this.i;
|
||||
};
|
||||
Base.prototype.empty = function() {
|
||||
return this.i === 0;
|
||||
};
|
||||
return Base;
|
||||
}();
|
||||
|
||||
export { Base };
|
||||
|
||||
var Container = function(n) {
|
||||
__extends(Container, n);
|
||||
function Container() {
|
||||
return n !== null && n.apply(this, arguments) || this;
|
||||
}
|
||||
return Container;
|
||||
}(Base);
|
||||
|
||||
export { Container };
|
||||
//# sourceMappingURL=index.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/ContainerBase/index.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
22
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.d.ts
generated
vendored
Normal file
22
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
import { Container, ContainerIterator } from "../../ContainerBase";
|
||||
export declare abstract class HashContainerIterator<K, V> extends ContainerIterator<K | [K, V]> {
|
||||
pre(): this;
|
||||
next(): this;
|
||||
}
|
||||
export declare abstract class HashContainer<K, V> extends Container<K | [K, V]> {
|
||||
/**
|
||||
* @description Unique symbol used to tag object.
|
||||
*/
|
||||
readonly HASH_TAG: symbol;
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Remove the element of the specified key.
|
||||
* @param key - The key you want to remove.
|
||||
* @param isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @returns Whether erase successfully.
|
||||
*/
|
||||
eraseElementByKey(key: K, isObject?: boolean): boolean;
|
||||
eraseElementByIterator(iter: HashContainerIterator<K, V>): HashContainerIterator<K, V>;
|
||||
eraseElementByPos(pos: number): number;
|
||||
}
|
||||
201
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js
generated
vendored
Normal file
201
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,201 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, i) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, i) {
|
||||
t.__proto__ = i;
|
||||
} || function(t, i) {
|
||||
for (var r in i) if (Object.prototype.hasOwnProperty.call(i, r)) t[r] = i[r];
|
||||
};
|
||||
return extendStatics(t, i);
|
||||
};
|
||||
return function(t, i) {
|
||||
if (typeof i !== "function" && i !== null) throw new TypeError("Class extends value " + String(i) + " is not a constructor or null");
|
||||
extendStatics(t, i);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = i === null ? Object.create(i) : (__.prototype = i.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
import { Container, ContainerIterator } from "../../ContainerBase";
|
||||
|
||||
import checkObject from "../../../utils/checkObject";
|
||||
|
||||
import { throwIteratorAccessError } from "../../../utils/throwError";
|
||||
|
||||
var HashContainerIterator = function(t) {
|
||||
__extends(HashContainerIterator, t);
|
||||
function HashContainerIterator(i, r, e) {
|
||||
var n = t.call(this, e) || this;
|
||||
n.o = i;
|
||||
n.h = r;
|
||||
if (n.iteratorType === 0) {
|
||||
n.pre = function() {
|
||||
if (this.o.W === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W;
|
||||
return this;
|
||||
};
|
||||
n.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m;
|
||||
return this;
|
||||
};
|
||||
} else {
|
||||
n.pre = function() {
|
||||
if (this.o.m === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m;
|
||||
return this;
|
||||
};
|
||||
n.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return n;
|
||||
}
|
||||
return HashContainerIterator;
|
||||
}(ContainerIterator);
|
||||
|
||||
export { HashContainerIterator };
|
||||
|
||||
var HashContainer = function(t) {
|
||||
__extends(HashContainer, t);
|
||||
function HashContainer() {
|
||||
var i = t.call(this) || this;
|
||||
i._ = [];
|
||||
i.I = {};
|
||||
i.HASH_TAG = Symbol("@@HASH_TAG");
|
||||
Object.setPrototypeOf(i.I, null);
|
||||
i.h = {};
|
||||
i.h.W = i.h.m = i.l = i.M = i.h;
|
||||
return i;
|
||||
}
|
||||
HashContainer.prototype.X = function(t) {
|
||||
var i = t.W, r = t.m;
|
||||
i.m = r;
|
||||
r.W = i;
|
||||
if (t === this.l) {
|
||||
this.l = r;
|
||||
}
|
||||
if (t === this.M) {
|
||||
this.M = i;
|
||||
}
|
||||
this.i -= 1;
|
||||
};
|
||||
HashContainer.prototype.v = function(t, i, r) {
|
||||
if (r === undefined) r = checkObject(t);
|
||||
var e;
|
||||
if (r) {
|
||||
var n = t[this.HASH_TAG];
|
||||
if (n !== undefined) {
|
||||
this._[n].H = i;
|
||||
return this.i;
|
||||
}
|
||||
Object.defineProperty(t, this.HASH_TAG, {
|
||||
value: this._.length,
|
||||
configurable: true
|
||||
});
|
||||
e = {
|
||||
p: t,
|
||||
H: i,
|
||||
W: this.M,
|
||||
m: this.h
|
||||
};
|
||||
this._.push(e);
|
||||
} else {
|
||||
var s = this.I[t];
|
||||
if (s) {
|
||||
s.H = i;
|
||||
return this.i;
|
||||
}
|
||||
e = {
|
||||
p: t,
|
||||
H: i,
|
||||
W: this.M,
|
||||
m: this.h
|
||||
};
|
||||
this.I[t] = e;
|
||||
}
|
||||
if (this.i === 0) {
|
||||
this.l = e;
|
||||
this.h.m = e;
|
||||
} else {
|
||||
this.M.m = e;
|
||||
}
|
||||
this.M = e;
|
||||
this.h.W = e;
|
||||
return ++this.i;
|
||||
};
|
||||
HashContainer.prototype.g = function(t, i) {
|
||||
if (i === undefined) i = checkObject(t);
|
||||
if (i) {
|
||||
var r = t[this.HASH_TAG];
|
||||
if (r === undefined) return this.h;
|
||||
return this._[r];
|
||||
} else {
|
||||
return this.I[t] || this.h;
|
||||
}
|
||||
};
|
||||
HashContainer.prototype.clear = function() {
|
||||
var t = this.HASH_TAG;
|
||||
this._.forEach((function(i) {
|
||||
delete i.p[t];
|
||||
}));
|
||||
this._ = [];
|
||||
this.I = {};
|
||||
Object.setPrototypeOf(this.I, null);
|
||||
this.i = 0;
|
||||
this.l = this.M = this.h.W = this.h.m = this.h;
|
||||
};
|
||||
HashContainer.prototype.eraseElementByKey = function(t, i) {
|
||||
var r;
|
||||
if (i === undefined) i = checkObject(t);
|
||||
if (i) {
|
||||
var e = t[this.HASH_TAG];
|
||||
if (e === undefined) return false;
|
||||
delete t[this.HASH_TAG];
|
||||
r = this._[e];
|
||||
delete this._[e];
|
||||
} else {
|
||||
r = this.I[t];
|
||||
if (r === undefined) return false;
|
||||
delete this.I[t];
|
||||
}
|
||||
this.X(r);
|
||||
return true;
|
||||
};
|
||||
HashContainer.prototype.eraseElementByIterator = function(t) {
|
||||
var i = t.o;
|
||||
if (i === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.X(i);
|
||||
return t.next();
|
||||
};
|
||||
HashContainer.prototype.eraseElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var i = this.l;
|
||||
while (t--) {
|
||||
i = i.m;
|
||||
}
|
||||
this.X(i);
|
||||
return this.i;
|
||||
};
|
||||
return HashContainer;
|
||||
}(Container);
|
||||
|
||||
export { HashContainer };
|
||||
//# sourceMappingURL=index.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/HashContainer/Base/index.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
47
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.d.ts
generated
vendored
Normal file
47
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,47 @@
|
|||
import { initContainer } from "../ContainerBase";
|
||||
import { HashContainer, HashContainerIterator } from "./Base";
|
||||
declare class HashMapIterator<K, V> extends HashContainerIterator<K, V> {
|
||||
get pointer(): [K, V];
|
||||
copy(): HashMapIterator<K, V>;
|
||||
equals(iter: HashMapIterator<K, V>): boolean;
|
||||
}
|
||||
export type { HashMapIterator };
|
||||
declare class HashMap<K, V> extends HashContainer<K, V> {
|
||||
constructor(container?: initContainer<[K, V]>);
|
||||
begin(): HashMapIterator<K, V>;
|
||||
end(): HashMapIterator<K, V>;
|
||||
rBegin(): HashMapIterator<K, V>;
|
||||
rEnd(): HashMapIterator<K, V>;
|
||||
front(): [K, V] | undefined;
|
||||
back(): [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 isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @returns The size of container after setting.
|
||||
*/
|
||||
setElement(key: K, value: V, isObject?: boolean): number;
|
||||
/**
|
||||
* @description Check key if exist in container.
|
||||
* @param key - The element you want to search.
|
||||
* @param isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @returns An iterator pointing to the element if found, or super end if not found.
|
||||
*/
|
||||
/**
|
||||
* @description Get the value of the element of the specified key.
|
||||
* @param key - The key want to search.
|
||||
* @param isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @example
|
||||
* const val = container.getElementByKey(1);
|
||||
*/
|
||||
getElementByKey(key: K, isObject?: boolean): V | undefined;
|
||||
getElementByPos(pos: number): [K, V];
|
||||
find(key: K, isObject?: boolean): HashMapIterator<K, V>;
|
||||
forEach(callback: (element: [K, V], index: number, hashMap: HashMap<K, V>) => void): void;
|
||||
[Symbol.iterator](): Generator<[K, V], void, unknown>;
|
||||
}
|
||||
export default HashMap;
|
||||
246
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js
generated
vendored
Normal file
246
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js
generated
vendored
Normal file
|
|
@ -0,0 +1,246 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, r) {
|
||||
t.__proto__ = r;
|
||||
} || function(t, r) {
|
||||
for (var n in r) if (Object.prototype.hasOwnProperty.call(r, n)) t[n] = r[n];
|
||||
};
|
||||
return extendStatics(t, r);
|
||||
};
|
||||
return function(t, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(t, r);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(t, r) {
|
||||
var n = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (a[0] & 1) throw a[1];
|
||||
return a[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, e, 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(t) {
|
||||
return function(r) {
|
||||
return step([ t, r ]);
|
||||
};
|
||||
}
|
||||
function step(s) {
|
||||
if (e) throw new TypeError("Generator is already executing.");
|
||||
while (n) try {
|
||||
if (e = 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:
|
||||
n.label++;
|
||||
return {
|
||||
value: s[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
n.label++;
|
||||
i = s[1];
|
||||
s = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
s = n.ops.pop();
|
||||
n.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(a = n.trys, a = a.length > 0 && a[a.length - 1]) && (s[0] === 6 || s[0] === 2)) {
|
||||
n = 0;
|
||||
continue;
|
||||
}
|
||||
if (s[0] === 3 && (!a || s[1] > a[0] && s[1] < a[3])) {
|
||||
n.label = s[1];
|
||||
break;
|
||||
}
|
||||
if (s[0] === 6 && n.label < a[1]) {
|
||||
n.label = a[1];
|
||||
a = s;
|
||||
break;
|
||||
}
|
||||
if (a && n.label < a[2]) {
|
||||
n.label = a[2];
|
||||
n.ops.push(s);
|
||||
break;
|
||||
}
|
||||
if (a[2]) n.ops.pop();
|
||||
n.trys.pop();
|
||||
continue;
|
||||
}
|
||||
s = r.call(t, n);
|
||||
} catch (t) {
|
||||
s = [ 6, t ];
|
||||
i = 0;
|
||||
} finally {
|
||||
e = a = 0;
|
||||
}
|
||||
if (s[0] & 5) throw s[1];
|
||||
return {
|
||||
value: s[0] ? s[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
import { HashContainer, HashContainerIterator } from "./Base";
|
||||
|
||||
import checkObject from "../../utils/checkObject";
|
||||
|
||||
import { throwIteratorAccessError } from "../../utils/throwError";
|
||||
|
||||
var HashMapIterator = function(t) {
|
||||
__extends(HashMapIterator, t);
|
||||
function HashMapIterator() {
|
||||
return t !== null && t.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(HashMapIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
var t = this;
|
||||
return new Proxy([], {
|
||||
get: function(r, n) {
|
||||
if (n === "0") return t.o.p; else if (n === "1") return t.o.H;
|
||||
},
|
||||
set: function(r, n, e) {
|
||||
if (n !== "1") {
|
||||
throw new TypeError("props must be 1");
|
||||
}
|
||||
t.o.H = e;
|
||||
return true;
|
||||
}
|
||||
});
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
HashMapIterator.prototype.copy = function() {
|
||||
return new HashMapIterator(this.o, this.h, this.iteratorType);
|
||||
};
|
||||
return HashMapIterator;
|
||||
}(HashContainerIterator);
|
||||
|
||||
var HashMap = function(t) {
|
||||
__extends(HashMap, t);
|
||||
function HashMap(r) {
|
||||
if (r === void 0) {
|
||||
r = [];
|
||||
}
|
||||
var n = t.call(this) || this;
|
||||
var e = n;
|
||||
r.forEach((function(t) {
|
||||
e.setElement(t[0], t[1]);
|
||||
}));
|
||||
return n;
|
||||
}
|
||||
HashMap.prototype.begin = function() {
|
||||
return new HashMapIterator(this.l, this.h);
|
||||
};
|
||||
HashMap.prototype.end = function() {
|
||||
return new HashMapIterator(this.h, this.h);
|
||||
};
|
||||
HashMap.prototype.rBegin = function() {
|
||||
return new HashMapIterator(this.M, this.h, 1);
|
||||
};
|
||||
HashMap.prototype.rEnd = function() {
|
||||
return new HashMapIterator(this.h, this.h, 1);
|
||||
};
|
||||
HashMap.prototype.front = function() {
|
||||
if (this.i === 0) return;
|
||||
return [ this.l.p, this.l.H ];
|
||||
};
|
||||
HashMap.prototype.back = function() {
|
||||
if (this.i === 0) return;
|
||||
return [ this.M.p, this.M.H ];
|
||||
};
|
||||
HashMap.prototype.setElement = function(t, r, n) {
|
||||
return this.v(t, r, n);
|
||||
};
|
||||
HashMap.prototype.getElementByKey = function(t, r) {
|
||||
if (r === undefined) r = checkObject(t);
|
||||
if (r) {
|
||||
var n = t[this.HASH_TAG];
|
||||
return n !== undefined ? this._[n].H : undefined;
|
||||
}
|
||||
var e = this.I[t];
|
||||
return e ? e.H : undefined;
|
||||
};
|
||||
HashMap.prototype.getElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var r = this.l;
|
||||
while (t--) {
|
||||
r = r.m;
|
||||
}
|
||||
return [ r.p, r.H ];
|
||||
};
|
||||
HashMap.prototype.find = function(t, r) {
|
||||
var n = this.g(t, r);
|
||||
return new HashMapIterator(n, this.h);
|
||||
};
|
||||
HashMap.prototype.forEach = function(t) {
|
||||
var r = 0;
|
||||
var n = this.l;
|
||||
while (n !== this.h) {
|
||||
t([ n.p, n.H ], r++, this);
|
||||
n = n.m;
|
||||
}
|
||||
};
|
||||
HashMap.prototype[Symbol.iterator] = function() {
|
||||
return function() {
|
||||
var t;
|
||||
return __generator(this, (function(r) {
|
||||
switch (r.label) {
|
||||
case 0:
|
||||
t = this.l;
|
||||
r.label = 1;
|
||||
|
||||
case 1:
|
||||
if (!(t !== this.h)) return [ 3, 3 ];
|
||||
return [ 4, [ t.p, t.H ] ];
|
||||
|
||||
case 2:
|
||||
r.sent();
|
||||
t = t.m;
|
||||
return [ 3, 1 ];
|
||||
|
||||
case 3:
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
}.bind(this)();
|
||||
};
|
||||
return HashMap;
|
||||
}(HashContainer);
|
||||
|
||||
export default HashMap;
|
||||
//# sourceMappingURL=HashMap.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/HashContainer/HashMap.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
37
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.d.ts
generated
vendored
Normal file
37
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,37 @@
|
|||
import { initContainer } from "../ContainerBase";
|
||||
import { HashContainer, HashContainerIterator } from "./Base";
|
||||
declare class HashSetIterator<K, V> extends HashContainerIterator<K, V> {
|
||||
get pointer(): K;
|
||||
copy(): HashSetIterator<K, V>;
|
||||
equals(iter: HashSetIterator<K, V>): boolean;
|
||||
}
|
||||
export type { HashSetIterator };
|
||||
declare class HashSet<K> extends HashContainer<K, undefined> {
|
||||
constructor(container?: initContainer<K>);
|
||||
begin(): HashSetIterator<K, undefined>;
|
||||
end(): HashSetIterator<K, undefined>;
|
||||
rBegin(): HashSetIterator<K, undefined>;
|
||||
rEnd(): HashSetIterator<K, undefined>;
|
||||
front(): K | undefined;
|
||||
back(): K | undefined;
|
||||
/**
|
||||
* @description Insert element to set.
|
||||
* @param key - The key want to insert.
|
||||
* @param isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @returns The size of container after inserting.
|
||||
*/
|
||||
insert(key: K, isObject?: boolean): number;
|
||||
getElementByPos(pos: number): K;
|
||||
/**
|
||||
* @description Check key if exist in container.
|
||||
* @param key - The element you want to search.
|
||||
* @param isObject - Tell us if the type of inserted key is `object` to improve efficiency.<br/>
|
||||
* If a `undefined` value is passed in, the type will be automatically judged.
|
||||
* @returns An iterator pointing to the element if found, or super end if not found.
|
||||
*/
|
||||
find(key: K, isObject?: boolean): HashSetIterator<K, undefined>;
|
||||
forEach(callback: (element: K, index: number, container: HashSet<K>) => void): void;
|
||||
[Symbol.iterator](): Generator<K, void, unknown>;
|
||||
}
|
||||
export default HashSet;
|
||||
221
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js
generated
vendored
Normal file
221
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js
generated
vendored
Normal file
|
|
@ -0,0 +1,221 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, r) {
|
||||
t.__proto__ = r;
|
||||
} || function(t, r) {
|
||||
for (var e in r) if (Object.prototype.hasOwnProperty.call(r, e)) t[e] = r[e];
|
||||
};
|
||||
return extendStatics(t, r);
|
||||
};
|
||||
return function(t, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(t, r);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(t, r) {
|
||||
var e = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (s[0] & 1) throw s[1];
|
||||
return s[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, n, i, s, a;
|
||||
return a = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (a[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), a;
|
||||
function verb(t) {
|
||||
return function(r) {
|
||||
return step([ t, r ]);
|
||||
};
|
||||
}
|
||||
function step(a) {
|
||||
if (n) throw new TypeError("Generator is already executing.");
|
||||
while (e) try {
|
||||
if (n = 1, i && (s = a[0] & 2 ? i["return"] : a[0] ? i["throw"] || ((s = i["return"]) && s.call(i),
|
||||
0) : i.next) && !(s = s.call(i, a[1])).done) return s;
|
||||
if (i = 0, s) a = [ a[0] & 2, s.value ];
|
||||
switch (a[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
s = a;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
e.label++;
|
||||
return {
|
||||
value: a[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
e.label++;
|
||||
i = a[1];
|
||||
a = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
a = e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(s = e.trys, s = s.length > 0 && s[s.length - 1]) && (a[0] === 6 || a[0] === 2)) {
|
||||
e = 0;
|
||||
continue;
|
||||
}
|
||||
if (a[0] === 3 && (!s || a[1] > s[0] && a[1] < s[3])) {
|
||||
e.label = a[1];
|
||||
break;
|
||||
}
|
||||
if (a[0] === 6 && e.label < s[1]) {
|
||||
e.label = s[1];
|
||||
s = a;
|
||||
break;
|
||||
}
|
||||
if (s && e.label < s[2]) {
|
||||
e.label = s[2];
|
||||
e.ops.push(a);
|
||||
break;
|
||||
}
|
||||
if (s[2]) e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
}
|
||||
a = r.call(t, e);
|
||||
} catch (t) {
|
||||
a = [ 6, t ];
|
||||
i = 0;
|
||||
} finally {
|
||||
n = s = 0;
|
||||
}
|
||||
if (a[0] & 5) throw a[1];
|
||||
return {
|
||||
value: a[0] ? a[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
import { HashContainer, HashContainerIterator } from "./Base";
|
||||
|
||||
import { throwIteratorAccessError } from "../../utils/throwError";
|
||||
|
||||
var HashSetIterator = function(t) {
|
||||
__extends(HashSetIterator, t);
|
||||
function HashSetIterator() {
|
||||
return t !== null && t.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(HashSetIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
return this.o.p;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
HashSetIterator.prototype.copy = function() {
|
||||
return new HashSetIterator(this.o, this.h, this.iteratorType);
|
||||
};
|
||||
return HashSetIterator;
|
||||
}(HashContainerIterator);
|
||||
|
||||
var HashSet = function(t) {
|
||||
__extends(HashSet, t);
|
||||
function HashSet(r) {
|
||||
if (r === void 0) {
|
||||
r = [];
|
||||
}
|
||||
var e = t.call(this) || this;
|
||||
var n = e;
|
||||
r.forEach((function(t) {
|
||||
n.insert(t);
|
||||
}));
|
||||
return e;
|
||||
}
|
||||
HashSet.prototype.begin = function() {
|
||||
return new HashSetIterator(this.l, this.h);
|
||||
};
|
||||
HashSet.prototype.end = function() {
|
||||
return new HashSetIterator(this.h, this.h);
|
||||
};
|
||||
HashSet.prototype.rBegin = function() {
|
||||
return new HashSetIterator(this.M, this.h, 1);
|
||||
};
|
||||
HashSet.prototype.rEnd = function() {
|
||||
return new HashSetIterator(this.h, this.h, 1);
|
||||
};
|
||||
HashSet.prototype.front = function() {
|
||||
return this.l.p;
|
||||
};
|
||||
HashSet.prototype.back = function() {
|
||||
return this.M.p;
|
||||
};
|
||||
HashSet.prototype.insert = function(t, r) {
|
||||
return this.v(t, undefined, r);
|
||||
};
|
||||
HashSet.prototype.getElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var r = this.l;
|
||||
while (t--) {
|
||||
r = r.m;
|
||||
}
|
||||
return r.p;
|
||||
};
|
||||
HashSet.prototype.find = function(t, r) {
|
||||
var e = this.g(t, r);
|
||||
return new HashSetIterator(e, this.h);
|
||||
};
|
||||
HashSet.prototype.forEach = function(t) {
|
||||
var r = 0;
|
||||
var e = this.l;
|
||||
while (e !== this.h) {
|
||||
t(e.p, r++, this);
|
||||
e = e.m;
|
||||
}
|
||||
};
|
||||
HashSet.prototype[Symbol.iterator] = function() {
|
||||
return function() {
|
||||
var t;
|
||||
return __generator(this, (function(r) {
|
||||
switch (r.label) {
|
||||
case 0:
|
||||
t = this.l;
|
||||
r.label = 1;
|
||||
|
||||
case 1:
|
||||
if (!(t !== this.h)) return [ 3, 3 ];
|
||||
return [ 4, t.p ];
|
||||
|
||||
case 2:
|
||||
r.sent();
|
||||
t = t.m;
|
||||
return [ 3, 1 ];
|
||||
|
||||
case 3:
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
}.bind(this)();
|
||||
};
|
||||
return HashSet;
|
||||
}(HashContainer);
|
||||
|
||||
export default HashSet;
|
||||
//# sourceMappingURL=HashSet.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/HashContainer/HashSet.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
79
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.d.ts
generated
vendored
Normal file
79
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,79 @@
|
|||
import { Base, initContainer } from "../ContainerBase";
|
||||
declare class PriorityQueue<T> extends Base {
|
||||
/**
|
||||
* @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.
|
||||
* @example
|
||||
* new PriorityQueue();
|
||||
* new PriorityQueue([1, 2, 3]);
|
||||
* new PriorityQueue([1, 2, 3], (x, y) => x - y);
|
||||
* new PriorityQueue([1, 2, 3], (x, y) => x - y, false);
|
||||
*/
|
||||
constructor(container?: initContainer<T>, cmp?: (x: T, y: T) => number, copy?: boolean);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Push element into a container in order.
|
||||
* @param item - The element you want to push.
|
||||
* @returns The size of heap after pushing.
|
||||
* @example
|
||||
* queue.push(1);
|
||||
*/
|
||||
push(item: T): void;
|
||||
/**
|
||||
* @description Removes the top element.
|
||||
* @returns The element you popped.
|
||||
* @example
|
||||
* queue.pop();
|
||||
*/
|
||||
pop(): T | undefined;
|
||||
/**
|
||||
* @description Accesses the top element.
|
||||
* @example
|
||||
* const top = queue.top();
|
||||
*/
|
||||
top(): T | undefined;
|
||||
/**
|
||||
* @description Check if element is in heap.
|
||||
* @param item - The item want to find.
|
||||
* @returns Whether element is in heap.
|
||||
* @example
|
||||
* const que = new PriorityQueue([], (x, y) => x.id - y.id);
|
||||
* const obj = { id: 1 };
|
||||
* que.push(obj);
|
||||
* console.log(que.find(obj)); // true
|
||||
*/
|
||||
find(item: T): boolean;
|
||||
/**
|
||||
* @description Remove specified item from heap.
|
||||
* @param item - The item want to remove.
|
||||
* @returns Whether remove success.
|
||||
* @example
|
||||
* const que = new PriorityQueue([], (x, y) => x.id - y.id);
|
||||
* const obj = { id: 1 };
|
||||
* que.push(obj);
|
||||
* que.remove(obj);
|
||||
*/
|
||||
remove(item: T): boolean;
|
||||
/**
|
||||
* @description Update item and it's pos in the heap.
|
||||
* @param item - The item want to update.
|
||||
* @returns Whether update success.
|
||||
* @example
|
||||
* const que = new PriorityQueue([], (x, y) => x.id - y.id);
|
||||
* const obj = { id: 1 };
|
||||
* que.push(obj);
|
||||
* obj.id = 2;
|
||||
* que.updateItem(obj);
|
||||
*/
|
||||
updateItem(item: T): boolean;
|
||||
/**
|
||||
* @returns Return a copy array of heap.
|
||||
* @example
|
||||
* const arr = queue.toArray();
|
||||
*/
|
||||
toArray(): T[];
|
||||
}
|
||||
export default PriorityQueue;
|
||||
171
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js
generated
vendored
Normal file
171
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js
generated
vendored
Normal file
|
|
@ -0,0 +1,171 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(i, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(i, r) {
|
||||
i.__proto__ = r;
|
||||
} || function(i, r) {
|
||||
for (var t in r) if (Object.prototype.hasOwnProperty.call(r, t)) i[t] = r[t];
|
||||
};
|
||||
return extendStatics(i, r);
|
||||
};
|
||||
return function(i, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(i, r);
|
||||
function __() {
|
||||
this.constructor = i;
|
||||
}
|
||||
i.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __read = this && this.P || function(i, r) {
|
||||
var t = typeof Symbol === "function" && i[Symbol.iterator];
|
||||
if (!t) return i;
|
||||
var e = t.call(i), n, u = [], s;
|
||||
try {
|
||||
while ((r === void 0 || r-- > 0) && !(n = e.next()).done) u.push(n.value);
|
||||
} catch (i) {
|
||||
s = {
|
||||
error: i
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (n && !n.done && (t = e["return"])) t.call(e);
|
||||
} finally {
|
||||
if (s) throw s.error;
|
||||
}
|
||||
}
|
||||
return u;
|
||||
};
|
||||
|
||||
var __spreadArray = this && this.A || function(i, r, t) {
|
||||
if (t || arguments.length === 2) for (var e = 0, n = r.length, u; e < n; e++) {
|
||||
if (u || !(e in r)) {
|
||||
if (!u) u = Array.prototype.slice.call(r, 0, e);
|
||||
u[e] = r[e];
|
||||
}
|
||||
}
|
||||
return i.concat(u || Array.prototype.slice.call(r));
|
||||
};
|
||||
|
||||
import { Base } from "../ContainerBase";
|
||||
|
||||
var PriorityQueue = function(i) {
|
||||
__extends(PriorityQueue, i);
|
||||
function PriorityQueue(r, t, e) {
|
||||
if (r === void 0) {
|
||||
r = [];
|
||||
}
|
||||
if (t === void 0) {
|
||||
t = function(i, r) {
|
||||
if (i > r) return -1;
|
||||
if (i < r) return 1;
|
||||
return 0;
|
||||
};
|
||||
}
|
||||
if (e === void 0) {
|
||||
e = true;
|
||||
}
|
||||
var n = i.call(this) || this;
|
||||
n.j = t;
|
||||
if (Array.isArray(r)) {
|
||||
n.B = e ? __spreadArray([], __read(r), false) : r;
|
||||
} else {
|
||||
n.B = [];
|
||||
var u = n;
|
||||
r.forEach((function(i) {
|
||||
u.B.push(i);
|
||||
}));
|
||||
}
|
||||
n.i = n.B.length;
|
||||
var s = n.i >> 1;
|
||||
for (var o = n.i - 1 >> 1; o >= 0; --o) {
|
||||
n.O(o, s);
|
||||
}
|
||||
return n;
|
||||
}
|
||||
PriorityQueue.prototype.S = function(i) {
|
||||
var r = this.B[i];
|
||||
while (i > 0) {
|
||||
var t = i - 1 >> 1;
|
||||
var e = this.B[t];
|
||||
if (this.j(e, r) <= 0) break;
|
||||
this.B[i] = e;
|
||||
i = t;
|
||||
}
|
||||
this.B[i] = r;
|
||||
};
|
||||
PriorityQueue.prototype.O = function(i, r) {
|
||||
var t = this.B[i];
|
||||
while (i < r) {
|
||||
var e = i << 1 | 1;
|
||||
var n = e + 1;
|
||||
var u = this.B[e];
|
||||
if (n < this.i && this.j(u, this.B[n]) > 0) {
|
||||
e = n;
|
||||
u = this.B[n];
|
||||
}
|
||||
if (this.j(u, t) >= 0) break;
|
||||
this.B[i] = u;
|
||||
i = e;
|
||||
}
|
||||
this.B[i] = t;
|
||||
};
|
||||
PriorityQueue.prototype.clear = function() {
|
||||
this.i = 0;
|
||||
this.B.length = 0;
|
||||
};
|
||||
PriorityQueue.prototype.push = function(i) {
|
||||
this.B.push(i);
|
||||
this.S(this.i);
|
||||
this.i += 1;
|
||||
};
|
||||
PriorityQueue.prototype.pop = function() {
|
||||
if (this.i === 0) return;
|
||||
var i = this.B[0];
|
||||
var r = this.B.pop();
|
||||
this.i -= 1;
|
||||
if (this.i) {
|
||||
this.B[0] = r;
|
||||
this.O(0, this.i >> 1);
|
||||
}
|
||||
return i;
|
||||
};
|
||||
PriorityQueue.prototype.top = function() {
|
||||
return this.B[0];
|
||||
};
|
||||
PriorityQueue.prototype.find = function(i) {
|
||||
return this.B.indexOf(i) >= 0;
|
||||
};
|
||||
PriorityQueue.prototype.remove = function(i) {
|
||||
var r = this.B.indexOf(i);
|
||||
if (r < 0) return false;
|
||||
if (r === 0) {
|
||||
this.pop();
|
||||
} else if (r === this.i - 1) {
|
||||
this.B.pop();
|
||||
this.i -= 1;
|
||||
} else {
|
||||
this.B.splice(r, 1, this.B.pop());
|
||||
this.i -= 1;
|
||||
this.S(r);
|
||||
this.O(r, this.i >> 1);
|
||||
}
|
||||
return true;
|
||||
};
|
||||
PriorityQueue.prototype.updateItem = function(i) {
|
||||
var r = this.B.indexOf(i);
|
||||
if (r < 0) return false;
|
||||
this.S(r);
|
||||
this.O(r, this.i >> 1);
|
||||
return true;
|
||||
};
|
||||
PriorityQueue.prototype.toArray = function() {
|
||||
return __spreadArray([], __read(this.B), false);
|
||||
};
|
||||
return PriorityQueue;
|
||||
}(Base);
|
||||
|
||||
export default PriorityQueue;
|
||||
//# sourceMappingURL=PriorityQueue.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/PriorityQueue.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
22
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.d.ts
generated
vendored
Normal file
22
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
import { Base, initContainer } from "../ContainerBase";
|
||||
declare class Queue<T> extends Base {
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Inserts element to queue's end.
|
||||
* @param element - The element you want to push to the front.
|
||||
* @returns The container length after pushing.
|
||||
*/
|
||||
push(element: T): number;
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
* @returns The element you popped.
|
||||
*/
|
||||
pop(): T | undefined;
|
||||
/**
|
||||
* @description Access the first element.
|
||||
* @returns The first element.
|
||||
*/
|
||||
front(): T | undefined;
|
||||
}
|
||||
export default Queue;
|
||||
58
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js
generated
vendored
Normal file
58
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js
generated
vendored
Normal file
|
|
@ -0,0 +1,58 @@
|
|||
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 n in t) if (Object.prototype.hasOwnProperty.call(t, n)) e[n] = t[n];
|
||||
};
|
||||
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 __);
|
||||
};
|
||||
}();
|
||||
|
||||
import { Base } from "../ContainerBase";
|
||||
|
||||
import Deque from "../SequentialContainer/Deque";
|
||||
|
||||
var Queue = function(e) {
|
||||
__extends(Queue, e);
|
||||
function Queue(t) {
|
||||
if (t === void 0) {
|
||||
t = [];
|
||||
}
|
||||
var n = e.call(this) || this;
|
||||
n.q = new Deque(t);
|
||||
n.i = n.q.size();
|
||||
return n;
|
||||
}
|
||||
Queue.prototype.clear = function() {
|
||||
this.q.clear();
|
||||
this.i = 0;
|
||||
};
|
||||
Queue.prototype.push = function(e) {
|
||||
this.q.pushBack(e);
|
||||
this.i += 1;
|
||||
return this.i;
|
||||
};
|
||||
Queue.prototype.pop = function() {
|
||||
if (this.i === 0) return;
|
||||
this.i -= 1;
|
||||
return this.q.popFront();
|
||||
};
|
||||
Queue.prototype.front = function() {
|
||||
return this.q.front();
|
||||
};
|
||||
return Queue;
|
||||
}(Base);
|
||||
|
||||
export default Queue;
|
||||
//# sourceMappingURL=Queue.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/Queue.js.map
generated
vendored
Normal file
|
|
@ -0,0 +1 @@
|
|||
{"version":3,"sources":["container/OtherContainer/Queue.js","../../src/container/OtherContainer/Queue.ts"],"names":["__extends","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","TypeError","String","__","constructor","create","Base","Deque","Queue","_super","container","_this","_queue","_length","size","clear","push","element","pushBack","pop","popFront","front"],"mappings":"AAAA,IAAIA,YAAaC,QAAQA,KAAKD,KAAe;IACzC,IAAIE,gBAAgB,SAAUC,GAAGC;QAC7BF,gBAAgBG,OAAOC,kBAClB;YAAEC,WAAW;qBAAgBC,SAAS,SAAUL,GAAGC;YAAKD,EAAEI,YAAYH;AAAG,aAC1E,SAAUD,GAAGC;YAAK,KAAK,IAAIK,KAAKL,GAAG,IAAIC,OAAOK,UAAUC,eAAeC,KAAKR,GAAGK,IAAIN,EAAEM,KAAKL,EAAEK;AAAI;QACpG,OAAOP,cAAcC,GAAGC;AAC5B;IACA,OAAO,SAAUD,GAAGC;QAChB,WAAWA,MAAM,cAAcA,MAAM,MACjC,MAAM,IAAIS,UAAU,yBAAyBC,OAAOV,KAAK;QAC7DF,cAAcC,GAAGC;QACjB,SAASW;YAAOd,KAAKe,cAAcb;AAAG;QACtCA,EAAEO,YAAYN,MAAM,OAAOC,OAAOY,OAAOb,MAAMW,GAAGL,YAAYN,EAAEM,WAAW,IAAIK;AACnF;AACJ,CAd6C;;SCApCG,YAAqB;;OACvBC,WAAK;;AAEZ,IAAAC,QAAA,SAAAC;IAAuBrB,UAAAoB,OAAAC;IAKrB,SAAAD,MAAYE;QAAA,IAAAA,WAAA,GAAA;YAAAA,IAAA;AAAgC;QAA5C,IAAAC,IACEF,EAAAT,KAAAX,SAAOA;QACPsB,EAAKC,IAAS,IAAIL,MAAMG;QACxBC,EAAKE,IAAUF,EAAKC,EAAOE;QDavB,OAAOH;AACX;ICZFH,MAAAV,UAAAiB,QAAA;QACE1B,KAAKuB,EAAOG;QACZ1B,KAAKwB,IAAU;ADcf;ICPFL,MAAAV,UAAAkB,OAAA,SAAKC;QACH5B,KAAKuB,EAAOM,SAASD;QACrB5B,KAAKwB,KAAW;QAChB,OAAOxB,KAAKwB;ADcZ;ICRFL,MAAAV,UAAAqB,MAAA;QACE,IAAI9B,KAAKwB,MAAY,GAAG;QACxBxB,KAAKwB,KAAW;QAChB,OAAOxB,KAAKuB,EAAOQ;ADenB;ICTFZ,MAAAV,UAAAuB,QAAA;QACE,OAAOhC,KAAKuB,EAAOS;ADenB;ICbJ,OAAAb;AAAA,CAxCA,CAAuBF;;eA0CRE","file":"Queue.js","sourcesContent":["var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport { Base } from \"../ContainerBase\";\nimport Deque from \"../SequentialContainer/Deque\";\nvar Queue = /** @class */ (function (_super) {\n __extends(Queue, _super);\n function Queue(container) {\n if (container === void 0) { container = []; }\n var _this = _super.call(this) || this;\n _this._queue = new Deque(container);\n _this._length = _this._queue.size();\n return _this;\n }\n Queue.prototype.clear = function () {\n this._queue.clear();\n this._length = 0;\n };\n /**\n * @description Inserts element to queue's end.\n * @param element - The element you want to push to the front.\n * @returns The container length after pushing.\n */\n Queue.prototype.push = function (element) {\n this._queue.pushBack(element);\n this._length += 1;\n return this._length;\n };\n /**\n * @description Removes the first element.\n * @returns The element you popped.\n */\n Queue.prototype.pop = function () {\n if (this._length === 0)\n return;\n this._length -= 1;\n return this._queue.popFront();\n };\n /**\n * @description Access the first element.\n * @returns The first element.\n */\n Queue.prototype.front = function () {\n return this._queue.front();\n };\n return Queue;\n}(Base));\nexport default Queue;\n","import { Base, initContainer } from '@/container/ContainerBase';\nimport Deque from '@/container/SequentialContainer/Deque';\n\nclass Queue<T> extends Base {\n /**\n * @internal\n */\n private _queue: Deque<T>;\n constructor(container: initContainer<T> = []) {\n super();\n this._queue = new Deque(container);\n this._length = this._queue.size();\n }\n clear() {\n this._queue.clear();\n this._length = 0;\n }\n /**\n * @description Inserts element to queue's end.\n * @param element - The element you want to push to the front.\n * @returns The container length after pushing.\n */\n push(element: T) {\n this._queue.pushBack(element);\n this._length += 1;\n return this._length;\n }\n /**\n * @description Removes the first element.\n * @returns The element you popped.\n */\n pop() {\n if (this._length === 0) return;\n this._length -= 1;\n return this._queue.popFront();\n }\n /**\n * @description Access the first element.\n * @returns The first element.\n */\n front() {\n return this._queue.front();\n }\n}\n\nexport default Queue;\n"]}
|
||||
22
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.d.ts
generated
vendored
Normal file
22
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
import { Base, initContainer } from "../ContainerBase";
|
||||
declare class Stack<T> extends Base {
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
/**
|
||||
* @description Insert element to stack's end.
|
||||
* @description The element you want to push to the back.
|
||||
* @returns The container length after erasing.
|
||||
*/
|
||||
push(element: T): number;
|
||||
/**
|
||||
* @description Removes the end element.
|
||||
* @returns The element you popped.
|
||||
*/
|
||||
pop(): T | undefined;
|
||||
/**
|
||||
* @description Accesses the end element.
|
||||
* @returns The last element.
|
||||
*/
|
||||
top(): T | undefined;
|
||||
}
|
||||
export default Stack;
|
||||
59
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js
generated
vendored
Normal file
59
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js
generated
vendored
Normal file
|
|
@ -0,0 +1,59 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, n) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, n) {
|
||||
t.__proto__ = n;
|
||||
} || function(t, n) {
|
||||
for (var i in n) if (Object.prototype.hasOwnProperty.call(n, i)) t[i] = n[i];
|
||||
};
|
||||
return extendStatics(t, n);
|
||||
};
|
||||
return function(t, n) {
|
||||
if (typeof n !== "function" && n !== null) throw new TypeError("Class extends value " + String(n) + " is not a constructor or null");
|
||||
extendStatics(t, n);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = n === null ? Object.create(n) : (__.prototype = n.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
import { Base } from "../ContainerBase";
|
||||
|
||||
var Stack = function(t) {
|
||||
__extends(Stack, t);
|
||||
function Stack(n) {
|
||||
if (n === void 0) {
|
||||
n = [];
|
||||
}
|
||||
var i = t.call(this) || this;
|
||||
i.k = [];
|
||||
var r = i;
|
||||
n.forEach((function(t) {
|
||||
r.push(t);
|
||||
}));
|
||||
return i;
|
||||
}
|
||||
Stack.prototype.clear = function() {
|
||||
this.i = 0;
|
||||
this.k = [];
|
||||
};
|
||||
Stack.prototype.push = function(t) {
|
||||
this.k.push(t);
|
||||
this.i += 1;
|
||||
return this.i;
|
||||
};
|
||||
Stack.prototype.pop = function() {
|
||||
if (this.i === 0) return;
|
||||
this.i -= 1;
|
||||
return this.k.pop();
|
||||
};
|
||||
Stack.prototype.top = function() {
|
||||
return this.k[this.i - 1];
|
||||
};
|
||||
return Stack;
|
||||
}(Base);
|
||||
|
||||
export default Stack;
|
||||
//# sourceMappingURL=Stack.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/OtherContainer/Stack.js.map
generated
vendored
Normal file
|
|
@ -0,0 +1 @@
|
|||
{"version":3,"sources":["container/OtherContainer/Stack.js","../../src/container/OtherContainer/Stack.ts"],"names":["__extends","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","TypeError","String","__","constructor","create","Base","Stack","_super","container","_this","_stack","self","forEach","el","push","clear","_length","element","pop","top"],"mappings":"AAAA,IAAIA,YAAaC,QAAQA,KAAKD,KAAe;IACzC,IAAIE,gBAAgB,SAAUC,GAAGC;QAC7BF,gBAAgBG,OAAOC,kBAClB;YAAEC,WAAW;qBAAgBC,SAAS,SAAUL,GAAGC;YAAKD,EAAEI,YAAYH;AAAG,aAC1E,SAAUD,GAAGC;YAAK,KAAK,IAAIK,KAAKL,GAAG,IAAIC,OAAOK,UAAUC,eAAeC,KAAKR,GAAGK,IAAIN,EAAEM,KAAKL,EAAEK;AAAI;QACpG,OAAOP,cAAcC,GAAGC;AAC5B;IACA,OAAO,SAAUD,GAAGC;QAChB,WAAWA,MAAM,cAAcA,MAAM,MACjC,MAAM,IAAIS,UAAU,yBAAyBC,OAAOV,KAAK;QAC7DF,cAAcC,GAAGC;QACjB,SAASW;YAAOd,KAAKe,cAAcb;AAAG;QACtCA,EAAEO,YAAYN,MAAM,OAAOC,OAAOY,OAAOb,MAAMW,GAAGL,YAAYN,EAAEM,WAAW,IAAIK;AACnF;AACJ,CAd6C;;SCApCG,YAAqB;;AAE9B,IAAAC,QAAA,SAAAC;IAAuBpB,UAAAmB,OAAAC;IAKrB,SAAAD,MAAYE;QAAA,IAAAA,WAAA,GAAA;YAAAA,IAAA;AAAgC;QAA5C,IAAAC,IACEF,EAAAR,KAAAX,SAAOA;QAFDqB,EAAAC,IAAc;QAGpB,IAAMC,IAAOF;QACbD,EAAUI,SAAQ,SAAUC;YAC1BF,EAAKG,KAAKD;ADiBR;QACA,OAAOJ;AACX;IChBFH,MAAAT,UAAAkB,QAAA;QACE3B,KAAK4B,IAAU;QACf5B,KAAKsB,IAAS;ADkBd;ICXFJ,MAAAT,UAAAiB,OAAA,SAAKG;QACH7B,KAAKsB,EAAOI,KAAKG;QACjB7B,KAAK4B,KAAW;QAChB,OAAO5B,KAAK4B;ADkBZ;ICZFV,MAAAT,UAAAqB,MAAA;QACE,IAAI9B,KAAK4B,MAAY,GAAG;QACxB5B,KAAK4B,KAAW;QAChB,OAAO5B,KAAKsB,EAAOQ;ADmBnB;ICbFZ,MAAAT,UAAAsB,MAAA;QACE,OAAO/B,KAAKsB,EAAOtB,KAAK4B,IAAU;ADmBlC;ICjBJ,OAAAV;AAAA,CA1CA,CAAuBD;;eA4CRC","file":"Stack.js","sourcesContent":["var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport { Base } from \"../ContainerBase\";\nvar Stack = /** @class */ (function (_super) {\n __extends(Stack, _super);\n function Stack(container) {\n if (container === void 0) { container = []; }\n var _this = _super.call(this) || this;\n /**\n * @internal\n */\n _this._stack = [];\n var self = _this;\n container.forEach(function (el) {\n self.push(el);\n });\n return _this;\n }\n Stack.prototype.clear = function () {\n this._length = 0;\n this._stack = [];\n };\n /**\n * @description Insert element to stack's end.\n * @description The element you want to push to the back.\n * @returns The container length after erasing.\n */\n Stack.prototype.push = function (element) {\n this._stack.push(element);\n this._length += 1;\n return this._length;\n };\n /**\n * @description Removes the end element.\n * @returns The element you popped.\n */\n Stack.prototype.pop = function () {\n if (this._length === 0)\n return;\n this._length -= 1;\n return this._stack.pop();\n };\n /**\n * @description Accesses the end element.\n * @returns The last element.\n */\n Stack.prototype.top = function () {\n return this._stack[this._length - 1];\n };\n return Stack;\n}(Base));\nexport default Stack;\n","import { Base, initContainer } from '@/container/ContainerBase';\n\nclass Stack<T> extends Base {\n /**\n * @internal\n */\n private _stack: T[] = [];\n constructor(container: initContainer<T> = []) {\n super();\n const self = this;\n container.forEach(function (el) {\n self.push(el);\n });\n }\n clear() {\n this._length = 0;\n this._stack = [];\n }\n /**\n * @description Insert element to stack's end.\n * @description The element you want to push to the back.\n * @returns The container length after erasing.\n */\n push(element: T) {\n this._stack.push(element);\n this._length += 1;\n return this._length;\n }\n /**\n * @description Removes the end element.\n * @returns The element you popped.\n */\n pop() {\n if (this._length === 0) return;\n this._length -= 1;\n return this._stack.pop();\n }\n /**\n * @description Accesses the end element.\n * @returns The last element.\n */\n top(): T | undefined {\n return this._stack[this._length - 1];\n }\n}\n\nexport default Stack;\n"]}
|
||||
7
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.d.ts
generated
vendored
Normal file
7
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
import { ContainerIterator } from "../../ContainerBase";
|
||||
export declare abstract class RandomIterator<T> extends ContainerIterator<T> {
|
||||
get pointer(): T;
|
||||
set pointer(newValue: T);
|
||||
pre(): this;
|
||||
next(): this;
|
||||
}
|
||||
87
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js
generated
vendored
Normal file
87
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js
generated
vendored
Normal file
|
|
@ -0,0 +1,87 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, r) {
|
||||
t.__proto__ = r;
|
||||
} || function(t, r) {
|
||||
for (var n in r) if (Object.prototype.hasOwnProperty.call(r, n)) t[n] = r[n];
|
||||
};
|
||||
return extendStatics(t, r);
|
||||
};
|
||||
return function(t, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(t, r);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
import { ContainerIterator } from "../../ContainerBase";
|
||||
|
||||
import { throwIteratorAccessError } from "../../../utils/throwError";
|
||||
|
||||
var RandomIterator = function(t) {
|
||||
__extends(RandomIterator, t);
|
||||
function RandomIterator(r, n, o, i, e) {
|
||||
var s = t.call(this, e) || this;
|
||||
s.o = r;
|
||||
s.D = n;
|
||||
s.R = o;
|
||||
s.C = i;
|
||||
if (s.iteratorType === 0) {
|
||||
s.pre = function() {
|
||||
if (this.o === 0) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o -= 1;
|
||||
return this;
|
||||
};
|
||||
s.next = function() {
|
||||
if (this.o === this.D()) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o += 1;
|
||||
return this;
|
||||
};
|
||||
} else {
|
||||
s.pre = function() {
|
||||
if (this.o === this.D() - 1) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o += 1;
|
||||
return this;
|
||||
};
|
||||
s.next = function() {
|
||||
if (this.o === -1) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o -= 1;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return s;
|
||||
}
|
||||
Object.defineProperty(RandomIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o < 0 || this.o > this.D() - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
return this.R(this.o);
|
||||
},
|
||||
set: function(t) {
|
||||
if (this.o < 0 || this.o > this.D() - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
this.C(this.o, t);
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
return RandomIterator;
|
||||
}(ContainerIterator);
|
||||
|
||||
export { RandomIterator };
|
||||
//# sourceMappingURL=RandomIterator.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/RandomIterator.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
67
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.d.ts
generated
vendored
Normal file
67
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,67 @@
|
|||
import { Container } from "../../ContainerBase";
|
||||
declare abstract class SequentialContainer<T> extends Container<T> {
|
||||
/**
|
||||
* @description Push the element to the back.
|
||||
* @param element - The element you want to push.
|
||||
* @returns The size of container after pushing.
|
||||
*/
|
||||
abstract pushBack(element: T): number;
|
||||
/**
|
||||
* @description Removes the last element.
|
||||
* @returns The element you popped.
|
||||
*/
|
||||
abstract popBack(): T | undefined;
|
||||
/**
|
||||
* @description Sets element by position.
|
||||
* @param pos - The position you want to change.
|
||||
* @param element - The element's value you want to update.
|
||||
* @example
|
||||
* container.setElementByPos(-1, 1); // throw a RangeError
|
||||
*/
|
||||
abstract setElementByPos(pos: number, element: T): void;
|
||||
/**
|
||||
* @description Removes the elements of the specified value.
|
||||
* @param value - The value you want to remove.
|
||||
* @returns The size of container after erasing.
|
||||
* @example
|
||||
* container.eraseElementByValue(-1);
|
||||
*/
|
||||
abstract eraseElementByValue(value: T): number;
|
||||
/**
|
||||
* @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).
|
||||
* @returns The size of container after inserting.
|
||||
* @example
|
||||
* const container = new Vector([1, 2, 3]);
|
||||
* container.insert(1, 4); // [1, 4, 2, 3]
|
||||
* container.insert(1, 5, 3); // [1, 5, 5, 5, 4, 2, 3]
|
||||
*/
|
||||
abstract insert(pos: number, element: T, num?: number): number;
|
||||
/**
|
||||
* @description Reverses the container.
|
||||
* @example
|
||||
* const container = new Vector([1, 2, 3]);
|
||||
* container.reverse(); // [3, 2, 1]
|
||||
*/
|
||||
abstract reverse(): void;
|
||||
/**
|
||||
* @description Removes the duplication of elements in the container.
|
||||
* @returns The size of container after inserting.
|
||||
* @example
|
||||
* const container = new Vector([1, 1, 3, 2, 2, 5, 5, 2]);
|
||||
* container.unique(); // [1, 3, 2, 5, 2]
|
||||
*/
|
||||
abstract unique(): number;
|
||||
/**
|
||||
* @description Sort the container.
|
||||
* @param cmp - Comparison function to sort.
|
||||
* @example
|
||||
* const container = new Vector([3, 1, 10]);
|
||||
* container.sort(); // [1, 10, 3]
|
||||
* container.sort((x, y) => x - y); // [1, 3, 10]
|
||||
*/
|
||||
abstract sort(cmp?: (x: T, y: T) => number): void;
|
||||
}
|
||||
export default SequentialContainer;
|
||||
33
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js
generated
vendored
Normal file
33
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,33 @@
|
|||
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 e in t) if (Object.prototype.hasOwnProperty.call(t, e)) n[e] = t[e];
|
||||
};
|
||||
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 { Container } from "../../ContainerBase";
|
||||
|
||||
var SequentialContainer = function(n) {
|
||||
__extends(SequentialContainer, n);
|
||||
function SequentialContainer() {
|
||||
return n !== null && n.apply(this, arguments) || this;
|
||||
}
|
||||
return SequentialContainer;
|
||||
}(Container);
|
||||
|
||||
export default SequentialContainer;
|
||||
//# sourceMappingURL=index.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Base/index.js.map
generated
vendored
Normal file
|
|
@ -0,0 +1 @@
|
|||
{"version":3,"sources":["container/SequentialContainer/Base/index.js","../../src/container/SequentialContainer/Base/index.ts"],"names":["__extends","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","TypeError","String","__","constructor","create","Container","SequentialContainer","_super","apply","arguments"],"mappings":"AAAA,IAAIA,YAAaC,QAAQA,KAAKD,KAAe;IACzC,IAAIE,gBAAgB,SAAUC,GAAGC;QAC7BF,gBAAgBG,OAAOC,kBAClB;YAAEC,WAAW;qBAAgBC,SAAS,SAAUL,GAAGC;YAAKD,EAAEI,YAAYH;AAAG,aAC1E,SAAUD,GAAGC;YAAK,KAAK,IAAIK,KAAKL,GAAG,IAAIC,OAAOK,UAAUC,eAAeC,KAAKR,GAAGK,IAAIN,EAAEM,KAAKL,EAAEK;AAAI;QACpG,OAAOP,cAAcC,GAAGC;AAC5B;IACA,OAAO,SAAUD,GAAGC;QAChB,WAAWA,MAAM,cAAcA,MAAM,MACjC,MAAM,IAAIS,UAAU,yBAAyBC,OAAOV,KAAK;QAC7DF,cAAcC,GAAGC;QACjB,SAASW;YAAOd,KAAKe,cAAcb;AAAG;QACtCA,EAAEO,YAAYN,MAAM,OAAOC,OAAOY,OAAOb,MAAMW,GAAGL,YAAYN,EAAEM,WAAW,IAAIK;AACnF;AACJ,CAd6C;;SCApCG,iBAAW;;AAEpB,IAAAC,sBAAA,SAAAC;IAA8CpB,UAAAmB,qBAAAC;IAA9C,SAAAD;QDiBQ,OAAOC,MAAW,QAAQA,EAAOC,MAAMpB,MAAMqB,cAAcrB;AC+CnE;IAAA,OAAAkB;AAAA,CAhEA,CAA8CD;;eAkE/BC","file":"index.js","sourcesContent":["var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport { Container } from \"../../ContainerBase\";\nvar SequentialContainer = /** @class */ (function (_super) {\n __extends(SequentialContainer, _super);\n function SequentialContainer() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n return SequentialContainer;\n}(Container));\nexport default SequentialContainer;\n","import { Container } from '@/container/ContainerBase';\n\nabstract class SequentialContainer<T> extends Container<T> {\n /**\n * @description Push the element to the back.\n * @param element - The element you want to push.\n * @returns The size of container after pushing.\n */\n abstract pushBack(element: T): number;\n /**\n * @description Removes the last element.\n * @returns The element you popped.\n */\n abstract popBack(): T | undefined;\n /**\n * @description Sets element by position.\n * @param pos - The position you want to change.\n * @param element - The element's value you want to update.\n * @example\n * container.setElementByPos(-1, 1); // throw a RangeError\n */\n abstract setElementByPos(pos: number, element: T): void;\n /**\n * @description Removes the elements of the specified value.\n * @param value - The value you want to remove.\n * @returns The size of container after erasing.\n * @example\n * container.eraseElementByValue(-1);\n */\n abstract eraseElementByValue(value: T): number;\n /**\n * @description Insert several elements after the specified position.\n * @param pos - The position you want to insert.\n * @param element - The element you want to insert.\n * @param num - The number of elements you want to insert (default 1).\n * @returns The size of container after inserting.\n * @example\n * const container = new Vector([1, 2, 3]);\n * container.insert(1, 4); // [1, 4, 2, 3]\n * container.insert(1, 5, 3); // [1, 5, 5, 5, 4, 2, 3]\n */\n abstract insert(pos: number, element: T, num?: number): number;\n /**\n * @description Reverses the container.\n * @example\n * const container = new Vector([1, 2, 3]);\n * container.reverse(); // [3, 2, 1]\n */\n abstract reverse(): void;\n /**\n * @description Removes the duplication of elements in the container.\n * @returns The size of container after inserting.\n * @example\n * const container = new Vector([1, 1, 3, 2, 2, 5, 5, 2]);\n * container.unique(); // [1, 3, 2, 5, 2]\n */\n abstract unique(): number;\n /**\n * @description Sort the container.\n * @param cmp - Comparison function to sort.\n * @example\n * const container = new Vector([3, 1, 10]);\n * container.sort(); // [1, 10, 3]\n * container.sort((x, y) => x - y); // [1, 3, 10]\n */\n abstract sort(cmp?: (x: T, y: T) => number): void;\n}\n\nexport default SequentialContainer;\n"]}
|
||||
56
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.d.ts
generated
vendored
Normal file
56
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
import SequentialContainer from './Base';
|
||||
import { initContainer } from "../ContainerBase";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
declare class DequeIterator<T> extends RandomIterator<T> {
|
||||
copy(): DequeIterator<T>;
|
||||
equals(iter: DequeIterator<T>): boolean;
|
||||
}
|
||||
export type { DequeIterator };
|
||||
declare class Deque<T> extends SequentialContainer<T> {
|
||||
constructor(container?: initContainer<T>, _bucketSize?: number);
|
||||
clear(): void;
|
||||
begin(): DequeIterator<T>;
|
||||
end(): DequeIterator<T>;
|
||||
rBegin(): DequeIterator<T>;
|
||||
rEnd(): DequeIterator<T>;
|
||||
front(): T | undefined;
|
||||
back(): T | undefined;
|
||||
pushBack(element: T): number;
|
||||
popBack(): T | undefined;
|
||||
/**
|
||||
* @description Push the element to the front.
|
||||
* @param element - The element you want to push.
|
||||
* @returns The size of queue after pushing.
|
||||
*/
|
||||
pushFront(element: T): number;
|
||||
/**
|
||||
* @description Remove the _first element.
|
||||
* @returns The element you popped.
|
||||
*/
|
||||
popFront(): T | undefined;
|
||||
getElementByPos(pos: number): T;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): number;
|
||||
/**
|
||||
* @description Remove all elements after the specified position (excluding the specified position).
|
||||
* @param pos - The previous position of the first removed element.
|
||||
* @returns The size of the container after cutting.
|
||||
* @example
|
||||
* deque.cut(1); // Then deque's size will be 2. deque -> [0, 1]
|
||||
*/
|
||||
cut(pos: number): number;
|
||||
eraseElementByPos(pos: number): number;
|
||||
eraseElementByValue(value: T): number;
|
||||
eraseElementByIterator(iter: DequeIterator<T>): DequeIterator<T>;
|
||||
find(element: T): DequeIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): number;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
/**
|
||||
* @description Remove as much useless space as possible.
|
||||
*/
|
||||
shrinkToFit(): void;
|
||||
forEach(callback: (element: T, index: number, deque: Deque<T>) => void): void;
|
||||
[Symbol.iterator](): Generator<T, void, unknown>;
|
||||
}
|
||||
export default Deque;
|
||||
505
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js
generated
vendored
Normal file
505
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js
generated
vendored
Normal file
|
|
@ -0,0 +1,505 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, i) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, i) {
|
||||
t.__proto__ = i;
|
||||
} || function(t, i) {
|
||||
for (var e in i) if (Object.prototype.hasOwnProperty.call(i, e)) t[e] = i[e];
|
||||
};
|
||||
return extendStatics(t, i);
|
||||
};
|
||||
return function(t, i) {
|
||||
if (typeof i !== "function" && i !== null) throw new TypeError("Class extends value " + String(i) + " is not a constructor or null");
|
||||
extendStatics(t, i);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = i === null ? Object.create(i) : (__.prototype = i.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(t, i) {
|
||||
var e = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (h[0] & 1) throw h[1];
|
||||
return h[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, r, s, h, n;
|
||||
return n = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (n[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), n;
|
||||
function verb(t) {
|
||||
return function(i) {
|
||||
return step([ t, i ]);
|
||||
};
|
||||
}
|
||||
function step(n) {
|
||||
if (r) throw new TypeError("Generator is already executing.");
|
||||
while (e) try {
|
||||
if (r = 1, s && (h = n[0] & 2 ? s["return"] : n[0] ? s["throw"] || ((h = s["return"]) && h.call(s),
|
||||
0) : s.next) && !(h = h.call(s, n[1])).done) return h;
|
||||
if (s = 0, h) n = [ n[0] & 2, h.value ];
|
||||
switch (n[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
h = n;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
e.label++;
|
||||
return {
|
||||
value: n[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
e.label++;
|
||||
s = n[1];
|
||||
n = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
n = e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(h = e.trys, h = h.length > 0 && h[h.length - 1]) && (n[0] === 6 || n[0] === 2)) {
|
||||
e = 0;
|
||||
continue;
|
||||
}
|
||||
if (n[0] === 3 && (!h || n[1] > h[0] && n[1] < h[3])) {
|
||||
e.label = n[1];
|
||||
break;
|
||||
}
|
||||
if (n[0] === 6 && e.label < h[1]) {
|
||||
e.label = h[1];
|
||||
h = n;
|
||||
break;
|
||||
}
|
||||
if (h && e.label < h[2]) {
|
||||
e.label = h[2];
|
||||
e.ops.push(n);
|
||||
break;
|
||||
}
|
||||
if (h[2]) e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
}
|
||||
n = i.call(t, e);
|
||||
} catch (t) {
|
||||
n = [ 6, t ];
|
||||
s = 0;
|
||||
} finally {
|
||||
r = h = 0;
|
||||
}
|
||||
if (n[0] & 5) throw n[1];
|
||||
return {
|
||||
value: n[0] ? n[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
var __read = this && this.P || function(t, i) {
|
||||
var e = typeof Symbol === "function" && t[Symbol.iterator];
|
||||
if (!e) return t;
|
||||
var r = e.call(t), s, h = [], n;
|
||||
try {
|
||||
while ((i === void 0 || i-- > 0) && !(s = r.next()).done) h.push(s.value);
|
||||
} catch (t) {
|
||||
n = {
|
||||
error: t
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (s && !s.done && (e = r["return"])) e.call(r);
|
||||
} finally {
|
||||
if (n) throw n.error;
|
||||
}
|
||||
}
|
||||
return h;
|
||||
};
|
||||
|
||||
var __spreadArray = this && this.A || function(t, i, e) {
|
||||
if (e || arguments.length === 2) for (var r = 0, s = i.length, h; r < s; r++) {
|
||||
if (h || !(r in i)) {
|
||||
if (!h) h = Array.prototype.slice.call(i, 0, r);
|
||||
h[r] = i[r];
|
||||
}
|
||||
}
|
||||
return t.concat(h || Array.prototype.slice.call(i));
|
||||
};
|
||||
|
||||
import SequentialContainer from "./Base";
|
||||
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
|
||||
var DequeIterator = function(t) {
|
||||
__extends(DequeIterator, t);
|
||||
function DequeIterator() {
|
||||
return t !== null && t.apply(this, arguments) || this;
|
||||
}
|
||||
DequeIterator.prototype.copy = function() {
|
||||
return new DequeIterator(this.o, this.D, this.R, this.C, this.iteratorType);
|
||||
};
|
||||
return DequeIterator;
|
||||
}(RandomIterator);
|
||||
|
||||
var Deque = function(t) {
|
||||
__extends(Deque, t);
|
||||
function Deque(i, e) {
|
||||
if (i === void 0) {
|
||||
i = [];
|
||||
}
|
||||
if (e === void 0) {
|
||||
e = 1 << 12;
|
||||
}
|
||||
var r = t.call(this) || this;
|
||||
r.N = 0;
|
||||
r.T = 0;
|
||||
r.G = 0;
|
||||
r.F = 0;
|
||||
r.J = 0;
|
||||
r.K = [];
|
||||
var s;
|
||||
if ("size" in i) {
|
||||
if (typeof i.size === "number") {
|
||||
s = i.size;
|
||||
} else {
|
||||
s = i.size();
|
||||
}
|
||||
} else if ("length" in i) {
|
||||
s = i.length;
|
||||
} else {
|
||||
throw new RangeError("Can't get container's size!");
|
||||
}
|
||||
r.L = e;
|
||||
r.J = Math.max(Math.ceil(s / r.L), 1);
|
||||
for (var h = 0; h < r.J; ++h) {
|
||||
r.K.push(new Array(r.L));
|
||||
}
|
||||
var n = Math.ceil(s / r.L);
|
||||
r.N = r.G = (r.J >> 1) - (n >> 1);
|
||||
r.T = r.F = r.L - s % r.L >> 1;
|
||||
var u = r;
|
||||
i.forEach((function(t) {
|
||||
u.pushBack(t);
|
||||
}));
|
||||
r.size = r.size.bind(r);
|
||||
r.getElementByPos = r.getElementByPos.bind(r);
|
||||
r.setElementByPos = r.setElementByPos.bind(r);
|
||||
return r;
|
||||
}
|
||||
Deque.prototype.U = function() {
|
||||
var t = [];
|
||||
var i = Math.max(this.J >> 1, 1);
|
||||
for (var e = 0; e < i; ++e) {
|
||||
t[e] = new Array(this.L);
|
||||
}
|
||||
for (var e = this.N; e < this.J; ++e) {
|
||||
t[t.length] = this.K[e];
|
||||
}
|
||||
for (var e = 0; e < this.G; ++e) {
|
||||
t[t.length] = this.K[e];
|
||||
}
|
||||
t[t.length] = __spreadArray([], __read(this.K[this.G]), false);
|
||||
this.N = i;
|
||||
this.G = t.length - 1;
|
||||
for (var e = 0; e < i; ++e) {
|
||||
t[t.length] = new Array(this.L);
|
||||
}
|
||||
this.K = t;
|
||||
this.J = t.length;
|
||||
};
|
||||
Deque.prototype.V = function(t) {
|
||||
var i = this.T + t + 1;
|
||||
var e = i % this.L;
|
||||
var r = e - 1;
|
||||
var s = this.N + (i - e) / this.L;
|
||||
if (e === 0) s -= 1;
|
||||
s %= this.J;
|
||||
if (r < 0) r += this.L;
|
||||
return {
|
||||
curNodeBucketIndex: s,
|
||||
curNodePointerIndex: r
|
||||
};
|
||||
};
|
||||
Deque.prototype.clear = function() {
|
||||
this.K = [ [] ];
|
||||
this.J = 1;
|
||||
this.N = this.G = this.i = 0;
|
||||
this.T = this.F = this.L >> 1;
|
||||
};
|
||||
Deque.prototype.begin = function() {
|
||||
return new DequeIterator(0, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Deque.prototype.end = function() {
|
||||
return new DequeIterator(this.i, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Deque.prototype.rBegin = function() {
|
||||
return new DequeIterator(this.i - 1, this.size, this.getElementByPos, this.setElementByPos, 1);
|
||||
};
|
||||
Deque.prototype.rEnd = function() {
|
||||
return new DequeIterator(-1, this.size, this.getElementByPos, this.setElementByPos, 1);
|
||||
};
|
||||
Deque.prototype.front = function() {
|
||||
return this.K[this.N][this.T];
|
||||
};
|
||||
Deque.prototype.back = function() {
|
||||
return this.K[this.G][this.F];
|
||||
};
|
||||
Deque.prototype.pushBack = function(t) {
|
||||
if (this.i) {
|
||||
if (this.F < this.L - 1) {
|
||||
this.F += 1;
|
||||
} else if (this.G < this.J - 1) {
|
||||
this.G += 1;
|
||||
this.F = 0;
|
||||
} else {
|
||||
this.G = 0;
|
||||
this.F = 0;
|
||||
}
|
||||
if (this.G === this.N && this.F === this.T) this.U();
|
||||
}
|
||||
this.i += 1;
|
||||
this.K[this.G][this.F] = t;
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.popBack = function() {
|
||||
if (this.i === 0) return;
|
||||
var t = this.K[this.G][this.F];
|
||||
delete this.K[this.G][this.F];
|
||||
if (this.i !== 1) {
|
||||
if (this.F > 0) {
|
||||
this.F -= 1;
|
||||
} else if (this.G > 0) {
|
||||
this.G -= 1;
|
||||
this.F = this.L - 1;
|
||||
} else {
|
||||
this.G = this.J - 1;
|
||||
this.F = this.L - 1;
|
||||
}
|
||||
}
|
||||
this.i -= 1;
|
||||
return t;
|
||||
};
|
||||
Deque.prototype.pushFront = function(t) {
|
||||
if (this.i) {
|
||||
if (this.T > 0) {
|
||||
this.T -= 1;
|
||||
} else if (this.N > 0) {
|
||||
this.N -= 1;
|
||||
this.T = this.L - 1;
|
||||
} else {
|
||||
this.N = this.J - 1;
|
||||
this.T = this.L - 1;
|
||||
}
|
||||
if (this.N === this.G && this.T === this.F) this.U();
|
||||
}
|
||||
this.i += 1;
|
||||
this.K[this.N][this.T] = t;
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.popFront = function() {
|
||||
if (this.i === 0) return;
|
||||
var t = this.K[this.N][this.T];
|
||||
delete this.K[this.N][this.T];
|
||||
if (this.i !== 1) {
|
||||
if (this.T < this.L - 1) {
|
||||
this.T += 1;
|
||||
} else if (this.N < this.J - 1) {
|
||||
this.N += 1;
|
||||
this.T = 0;
|
||||
} else {
|
||||
this.N = 0;
|
||||
this.T = 0;
|
||||
}
|
||||
}
|
||||
this.i -= 1;
|
||||
return t;
|
||||
};
|
||||
Deque.prototype.getElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var i = this.V(t), e = i.curNodeBucketIndex, r = i.curNodePointerIndex;
|
||||
return this.K[e][r];
|
||||
};
|
||||
Deque.prototype.setElementByPos = function(t, i) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var e = this.V(t), r = e.curNodeBucketIndex, s = e.curNodePointerIndex;
|
||||
this.K[r][s] = i;
|
||||
};
|
||||
Deque.prototype.insert = function(t, i, e) {
|
||||
if (e === void 0) {
|
||||
e = 1;
|
||||
}
|
||||
if (t < 0 || t > this.i) {
|
||||
throw new RangeError;
|
||||
}
|
||||
if (t === 0) {
|
||||
while (e--) this.pushFront(i);
|
||||
} else if (t === this.i) {
|
||||
while (e--) this.pushBack(i);
|
||||
} else {
|
||||
var r = [];
|
||||
for (var s = t; s < this.i; ++s) {
|
||||
r.push(this.getElementByPos(s));
|
||||
}
|
||||
this.cut(t - 1);
|
||||
for (var s = 0; s < e; ++s) this.pushBack(i);
|
||||
for (var s = 0; s < r.length; ++s) this.pushBack(r[s]);
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.cut = function(t) {
|
||||
if (t < 0) {
|
||||
this.clear();
|
||||
return 0;
|
||||
}
|
||||
var i = this.V(t), e = i.curNodeBucketIndex, r = i.curNodePointerIndex;
|
||||
this.G = e;
|
||||
this.F = r;
|
||||
this.i = t + 1;
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.eraseElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
if (t === 0) this.popFront(); else if (t === this.i - 1) this.popBack(); else {
|
||||
var i = [];
|
||||
for (var e = t + 1; e < this.i; ++e) {
|
||||
i.push(this.getElementByPos(e));
|
||||
}
|
||||
this.cut(t);
|
||||
this.popBack();
|
||||
var r = this;
|
||||
i.forEach((function(t) {
|
||||
r.pushBack(t);
|
||||
}));
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.eraseElementByValue = function(t) {
|
||||
if (this.i === 0) return 0;
|
||||
var i = [];
|
||||
for (var e = 0; e < this.i; ++e) {
|
||||
var r = this.getElementByPos(e);
|
||||
if (r !== t) i.push(r);
|
||||
}
|
||||
var s = i.length;
|
||||
for (var e = 0; e < s; ++e) this.setElementByPos(e, i[e]);
|
||||
return this.cut(s - 1);
|
||||
};
|
||||
Deque.prototype.eraseElementByIterator = function(t) {
|
||||
var i = t.o;
|
||||
this.eraseElementByPos(i);
|
||||
t = t.next();
|
||||
return t;
|
||||
};
|
||||
Deque.prototype.find = function(t) {
|
||||
for (var i = 0; i < this.i; ++i) {
|
||||
if (this.getElementByPos(i) === t) {
|
||||
return new DequeIterator(i, this.size, this.getElementByPos, this.setElementByPos);
|
||||
}
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
Deque.prototype.reverse = function() {
|
||||
var t = 0;
|
||||
var i = this.i - 1;
|
||||
while (t < i) {
|
||||
var e = this.getElementByPos(t);
|
||||
this.setElementByPos(t, this.getElementByPos(i));
|
||||
this.setElementByPos(i, e);
|
||||
t += 1;
|
||||
i -= 1;
|
||||
}
|
||||
};
|
||||
Deque.prototype.unique = function() {
|
||||
if (this.i <= 1) {
|
||||
return this.i;
|
||||
}
|
||||
var t = 1;
|
||||
var i = this.getElementByPos(0);
|
||||
for (var e = 1; e < this.i; ++e) {
|
||||
var r = this.getElementByPos(e);
|
||||
if (r !== i) {
|
||||
i = r;
|
||||
this.setElementByPos(t++, r);
|
||||
}
|
||||
}
|
||||
while (this.i > t) this.popBack();
|
||||
return this.i;
|
||||
};
|
||||
Deque.prototype.sort = function(t) {
|
||||
var i = [];
|
||||
for (var e = 0; e < this.i; ++e) {
|
||||
i.push(this.getElementByPos(e));
|
||||
}
|
||||
i.sort(t);
|
||||
for (var e = 0; e < this.i; ++e) this.setElementByPos(e, i[e]);
|
||||
};
|
||||
Deque.prototype.shrinkToFit = function() {
|
||||
if (this.i === 0) return;
|
||||
var t = [];
|
||||
this.forEach((function(i) {
|
||||
t.push(i);
|
||||
}));
|
||||
this.J = Math.max(Math.ceil(this.i / this.L), 1);
|
||||
this.i = this.N = this.G = this.T = this.F = 0;
|
||||
this.K = [];
|
||||
for (var i = 0; i < this.J; ++i) {
|
||||
this.K.push(new Array(this.L));
|
||||
}
|
||||
for (var i = 0; i < t.length; ++i) this.pushBack(t[i]);
|
||||
};
|
||||
Deque.prototype.forEach = function(t) {
|
||||
for (var i = 0; i < this.i; ++i) {
|
||||
t(this.getElementByPos(i), i, this);
|
||||
}
|
||||
};
|
||||
Deque.prototype[Symbol.iterator] = function() {
|
||||
return function() {
|
||||
var t;
|
||||
return __generator(this, (function(i) {
|
||||
switch (i.label) {
|
||||
case 0:
|
||||
t = 0;
|
||||
i.label = 1;
|
||||
|
||||
case 1:
|
||||
if (!(t < this.i)) return [ 3, 4 ];
|
||||
return [ 4, this.getElementByPos(t) ];
|
||||
|
||||
case 2:
|
||||
i.sent();
|
||||
i.label = 3;
|
||||
|
||||
case 3:
|
||||
++t;
|
||||
return [ 3, 1 ];
|
||||
|
||||
case 4:
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
}.bind(this)();
|
||||
};
|
||||
return Deque;
|
||||
}(SequentialContainer);
|
||||
|
||||
export default Deque;
|
||||
//# sourceMappingURL=Deque.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Deque.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
57
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.d.ts
generated
vendored
Normal file
57
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,57 @@
|
|||
import SequentialContainer from './Base';
|
||||
import { ContainerIterator, initContainer } from "../ContainerBase";
|
||||
declare class LinkListIterator<T> extends ContainerIterator<T> {
|
||||
get pointer(): T;
|
||||
set pointer(newValue: T);
|
||||
copy(): LinkListIterator<T>;
|
||||
equals(iter: LinkListIterator<T>): boolean;
|
||||
pre(): this;
|
||||
next(): this;
|
||||
}
|
||||
export type { LinkListIterator };
|
||||
declare class LinkList<T> extends SequentialContainer<T> {
|
||||
constructor(container?: initContainer<T>);
|
||||
clear(): void;
|
||||
begin(): LinkListIterator<T>;
|
||||
end(): LinkListIterator<T>;
|
||||
rBegin(): LinkListIterator<T>;
|
||||
rEnd(): LinkListIterator<T>;
|
||||
front(): T | undefined;
|
||||
back(): T | undefined;
|
||||
getElementByPos(pos: number): T;
|
||||
eraseElementByPos(pos: number): number;
|
||||
eraseElementByValue(_value: T): number;
|
||||
eraseElementByIterator(iter: LinkListIterator<T>): LinkListIterator<T>;
|
||||
pushBack(element: T): number;
|
||||
popBack(): T | undefined;
|
||||
/**
|
||||
* @description Push an element to the front.
|
||||
* @param element - The element you want to push.
|
||||
* @returns The size of queue after pushing.
|
||||
*/
|
||||
pushFront(element: T): number;
|
||||
/**
|
||||
* @description Removes the first element.
|
||||
* @returns The element you popped.
|
||||
*/
|
||||
popFront(): T | undefined;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): number;
|
||||
find(element: T): LinkListIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): number;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
/**
|
||||
* @description Merges two sorted lists.
|
||||
* @param list - The other list you want to merge (must be sorted).
|
||||
* @returns The size of list after merging.
|
||||
* @example
|
||||
* const linkA = new LinkList([1, 3, 5]);
|
||||
* const linkB = new LinkList([2, 4, 6]);
|
||||
* linkA.merge(linkB); // [1, 2, 3, 4, 5];
|
||||
*/
|
||||
merge(list: LinkList<T>): number;
|
||||
forEach(callback: (element: T, index: number, list: LinkList<T>) => void): void;
|
||||
[Symbol.iterator](): Generator<T, void, unknown>;
|
||||
}
|
||||
export default LinkList;
|
||||
455
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js
generated
vendored
Normal file
455
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js
generated
vendored
Normal file
|
|
@ -0,0 +1,455 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, i) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, i) {
|
||||
t.__proto__ = i;
|
||||
} || function(t, i) {
|
||||
for (var r in i) if (Object.prototype.hasOwnProperty.call(i, r)) t[r] = i[r];
|
||||
};
|
||||
return extendStatics(t, i);
|
||||
};
|
||||
return function(t, i) {
|
||||
if (typeof i !== "function" && i !== null) throw new TypeError("Class extends value " + String(i) + " is not a constructor or null");
|
||||
extendStatics(t, i);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = i === null ? Object.create(i) : (__.prototype = i.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(t, i) {
|
||||
var r = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (e[0] & 1) throw e[1];
|
||||
return e[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, n, s, e, h;
|
||||
return h = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (h[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), h;
|
||||
function verb(t) {
|
||||
return function(i) {
|
||||
return step([ t, i ]);
|
||||
};
|
||||
}
|
||||
function step(h) {
|
||||
if (n) throw new TypeError("Generator is already executing.");
|
||||
while (r) try {
|
||||
if (n = 1, s && (e = h[0] & 2 ? s["return"] : h[0] ? s["throw"] || ((e = s["return"]) && e.call(s),
|
||||
0) : s.next) && !(e = e.call(s, h[1])).done) return e;
|
||||
if (s = 0, e) h = [ h[0] & 2, e.value ];
|
||||
switch (h[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
e = h;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
r.label++;
|
||||
return {
|
||||
value: h[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
r.label++;
|
||||
s = h[1];
|
||||
h = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
h = r.ops.pop();
|
||||
r.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(e = r.trys, e = e.length > 0 && e[e.length - 1]) && (h[0] === 6 || h[0] === 2)) {
|
||||
r = 0;
|
||||
continue;
|
||||
}
|
||||
if (h[0] === 3 && (!e || h[1] > e[0] && h[1] < e[3])) {
|
||||
r.label = h[1];
|
||||
break;
|
||||
}
|
||||
if (h[0] === 6 && r.label < e[1]) {
|
||||
r.label = e[1];
|
||||
e = h;
|
||||
break;
|
||||
}
|
||||
if (e && r.label < e[2]) {
|
||||
r.label = e[2];
|
||||
r.ops.push(h);
|
||||
break;
|
||||
}
|
||||
if (e[2]) r.ops.pop();
|
||||
r.trys.pop();
|
||||
continue;
|
||||
}
|
||||
h = i.call(t, r);
|
||||
} catch (t) {
|
||||
h = [ 6, t ];
|
||||
s = 0;
|
||||
} finally {
|
||||
n = e = 0;
|
||||
}
|
||||
if (h[0] & 5) throw h[1];
|
||||
return {
|
||||
value: h[0] ? h[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
import SequentialContainer from "./Base";
|
||||
|
||||
import { ContainerIterator } from "../ContainerBase";
|
||||
|
||||
import { throwIteratorAccessError } from "../../utils/throwError";
|
||||
|
||||
var LinkListIterator = function(t) {
|
||||
__extends(LinkListIterator, t);
|
||||
function LinkListIterator(i, r, n) {
|
||||
var s = t.call(this, n) || this;
|
||||
s.o = i;
|
||||
s.h = r;
|
||||
if (s.iteratorType === 0) {
|
||||
s.pre = function() {
|
||||
if (this.o.W === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W;
|
||||
return this;
|
||||
};
|
||||
s.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m;
|
||||
return this;
|
||||
};
|
||||
} else {
|
||||
s.pre = function() {
|
||||
if (this.o.m === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m;
|
||||
return this;
|
||||
};
|
||||
s.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W;
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return s;
|
||||
}
|
||||
Object.defineProperty(LinkListIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
return this.o.H;
|
||||
},
|
||||
set: function(t) {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o.H = t;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
LinkListIterator.prototype.copy = function() {
|
||||
return new LinkListIterator(this.o, this.h, this.iteratorType);
|
||||
};
|
||||
return LinkListIterator;
|
||||
}(ContainerIterator);
|
||||
|
||||
var LinkList = function(t) {
|
||||
__extends(LinkList, t);
|
||||
function LinkList(i) {
|
||||
if (i === void 0) {
|
||||
i = [];
|
||||
}
|
||||
var r = t.call(this) || this;
|
||||
r.h = {};
|
||||
r.l = r.M = r.h.W = r.h.m = r.h;
|
||||
var n = r;
|
||||
i.forEach((function(t) {
|
||||
n.pushBack(t);
|
||||
}));
|
||||
return r;
|
||||
}
|
||||
LinkList.prototype.X = function(t) {
|
||||
var i = t.W, r = t.m;
|
||||
i.m = r;
|
||||
r.W = i;
|
||||
if (t === this.l) {
|
||||
this.l = r;
|
||||
}
|
||||
if (t === this.M) {
|
||||
this.M = i;
|
||||
}
|
||||
this.i -= 1;
|
||||
};
|
||||
LinkList.prototype.Y = function(t, i) {
|
||||
var r = i.m;
|
||||
var n = {
|
||||
H: t,
|
||||
W: i,
|
||||
m: r
|
||||
};
|
||||
i.m = n;
|
||||
r.W = n;
|
||||
if (i === this.h) {
|
||||
this.l = n;
|
||||
}
|
||||
if (r === this.h) {
|
||||
this.M = n;
|
||||
}
|
||||
this.i += 1;
|
||||
};
|
||||
LinkList.prototype.clear = function() {
|
||||
this.i = 0;
|
||||
this.l = this.M = this.h.W = this.h.m = this.h;
|
||||
};
|
||||
LinkList.prototype.begin = function() {
|
||||
return new LinkListIterator(this.l, this.h);
|
||||
};
|
||||
LinkList.prototype.end = function() {
|
||||
return new LinkListIterator(this.h, this.h);
|
||||
};
|
||||
LinkList.prototype.rBegin = function() {
|
||||
return new LinkListIterator(this.M, this.h, 1);
|
||||
};
|
||||
LinkList.prototype.rEnd = function() {
|
||||
return new LinkListIterator(this.h, this.h, 1);
|
||||
};
|
||||
LinkList.prototype.front = function() {
|
||||
return this.l.H;
|
||||
};
|
||||
LinkList.prototype.back = function() {
|
||||
return this.M.H;
|
||||
};
|
||||
LinkList.prototype.getElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var i = this.l;
|
||||
while (t--) {
|
||||
i = i.m;
|
||||
}
|
||||
return i.H;
|
||||
};
|
||||
LinkList.prototype.eraseElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var i = this.l;
|
||||
while (t--) {
|
||||
i = i.m;
|
||||
}
|
||||
this.X(i);
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.eraseElementByValue = function(t) {
|
||||
var i = this.l;
|
||||
while (i !== this.h) {
|
||||
if (i.H === t) {
|
||||
this.X(i);
|
||||
}
|
||||
i = i.m;
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.eraseElementByIterator = function(t) {
|
||||
var i = t.o;
|
||||
if (i === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
t = t.next();
|
||||
this.X(i);
|
||||
return t;
|
||||
};
|
||||
LinkList.prototype.pushBack = function(t) {
|
||||
this.Y(t, this.M);
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.popBack = function() {
|
||||
if (this.i === 0) return;
|
||||
var t = this.M.H;
|
||||
this.X(this.M);
|
||||
return t;
|
||||
};
|
||||
LinkList.prototype.pushFront = function(t) {
|
||||
this.Y(t, this.h);
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.popFront = function() {
|
||||
if (this.i === 0) return;
|
||||
var t = this.l.H;
|
||||
this.X(this.l);
|
||||
return t;
|
||||
};
|
||||
LinkList.prototype.setElementByPos = function(t, i) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var r = this.l;
|
||||
while (t--) {
|
||||
r = r.m;
|
||||
}
|
||||
r.H = i;
|
||||
};
|
||||
LinkList.prototype.insert = function(t, i, r) {
|
||||
if (r === void 0) {
|
||||
r = 1;
|
||||
}
|
||||
if (t < 0 || t > this.i) {
|
||||
throw new RangeError;
|
||||
}
|
||||
if (r <= 0) return this.i;
|
||||
if (t === 0) {
|
||||
while (r--) this.pushFront(i);
|
||||
} else if (t === this.i) {
|
||||
while (r--) this.pushBack(i);
|
||||
} else {
|
||||
var n = this.l;
|
||||
for (var s = 1; s < t; ++s) {
|
||||
n = n.m;
|
||||
}
|
||||
var e = n.m;
|
||||
this.i += r;
|
||||
while (r--) {
|
||||
n.m = {
|
||||
H: i,
|
||||
W: n
|
||||
};
|
||||
n.m.W = n;
|
||||
n = n.m;
|
||||
}
|
||||
n.m = e;
|
||||
e.W = n;
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.find = function(t) {
|
||||
var i = this.l;
|
||||
while (i !== this.h) {
|
||||
if (i.H === t) {
|
||||
return new LinkListIterator(i, this.h);
|
||||
}
|
||||
i = i.m;
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
LinkList.prototype.reverse = function() {
|
||||
if (this.i <= 1) return;
|
||||
var t = this.l;
|
||||
var i = this.M;
|
||||
var r = 0;
|
||||
while (r << 1 < this.i) {
|
||||
var n = t.H;
|
||||
t.H = i.H;
|
||||
i.H = n;
|
||||
t = t.m;
|
||||
i = i.W;
|
||||
r += 1;
|
||||
}
|
||||
};
|
||||
LinkList.prototype.unique = function() {
|
||||
if (this.i <= 1) {
|
||||
return this.i;
|
||||
}
|
||||
var t = this.l;
|
||||
while (t !== this.h) {
|
||||
var i = t;
|
||||
while (i.m !== this.h && i.H === i.m.H) {
|
||||
i = i.m;
|
||||
this.i -= 1;
|
||||
}
|
||||
t.m = i.m;
|
||||
t.m.W = t;
|
||||
t = t.m;
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.sort = function(t) {
|
||||
if (this.i <= 1) return;
|
||||
var i = [];
|
||||
this.forEach((function(t) {
|
||||
i.push(t);
|
||||
}));
|
||||
i.sort(t);
|
||||
var r = this.l;
|
||||
i.forEach((function(t) {
|
||||
r.H = t;
|
||||
r = r.m;
|
||||
}));
|
||||
};
|
||||
LinkList.prototype.merge = function(t) {
|
||||
var i = this;
|
||||
if (this.i === 0) {
|
||||
t.forEach((function(t) {
|
||||
i.pushBack(t);
|
||||
}));
|
||||
} else {
|
||||
var r = this.l;
|
||||
t.forEach((function(t) {
|
||||
while (r !== i.h && r.H <= t) {
|
||||
r = r.m;
|
||||
}
|
||||
i.Y(t, r.W);
|
||||
}));
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
LinkList.prototype.forEach = function(t) {
|
||||
var i = this.l;
|
||||
var r = 0;
|
||||
while (i !== this.h) {
|
||||
t(i.H, r++, this);
|
||||
i = i.m;
|
||||
}
|
||||
};
|
||||
LinkList.prototype[Symbol.iterator] = function() {
|
||||
return function() {
|
||||
var t;
|
||||
return __generator(this, (function(i) {
|
||||
switch (i.label) {
|
||||
case 0:
|
||||
if (this.i === 0) return [ 2 ];
|
||||
t = this.l;
|
||||
i.label = 1;
|
||||
|
||||
case 1:
|
||||
if (!(t !== this.h)) return [ 3, 3 ];
|
||||
return [ 4, t.H ];
|
||||
|
||||
case 2:
|
||||
i.sent();
|
||||
t = t.m;
|
||||
return [ 3, 1 ];
|
||||
|
||||
case 3:
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
}.bind(this)();
|
||||
};
|
||||
return LinkList;
|
||||
}(SequentialContainer);
|
||||
|
||||
export default LinkList;
|
||||
//# sourceMappingURL=LinkList.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/LinkList.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
38
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.d.ts
generated
vendored
Normal file
38
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,38 @@
|
|||
import SequentialContainer from './Base';
|
||||
import { initContainer } from "../ContainerBase";
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
declare class VectorIterator<T> extends RandomIterator<T> {
|
||||
copy(): VectorIterator<T>;
|
||||
equals(iter: VectorIterator<T>): boolean;
|
||||
}
|
||||
export type { VectorIterator };
|
||||
declare class Vector<T> extends SequentialContainer<T> {
|
||||
/**
|
||||
* @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;
|
||||
getElementByPos(pos: number): T;
|
||||
eraseElementByPos(pos: number): number;
|
||||
eraseElementByValue(value: T): number;
|
||||
eraseElementByIterator(iter: VectorIterator<T>): VectorIterator<T>;
|
||||
pushBack(element: T): number;
|
||||
popBack(): T | undefined;
|
||||
setElementByPos(pos: number, element: T): void;
|
||||
insert(pos: number, element: T, num?: number): number;
|
||||
find(element: T): VectorIterator<T>;
|
||||
reverse(): void;
|
||||
unique(): number;
|
||||
sort(cmp?: (x: T, y: T) => number): void;
|
||||
forEach(callback: (element: T, index: number, vector: Vector<T>) => void): void;
|
||||
[Symbol.iterator](): Generator<T, void, undefined>;
|
||||
}
|
||||
export default Vector;
|
||||
324
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js
generated
vendored
Normal file
324
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js
generated
vendored
Normal file
|
|
@ -0,0 +1,324 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(t, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(t, r) {
|
||||
t.__proto__ = r;
|
||||
} || function(t, r) {
|
||||
for (var e in r) if (Object.prototype.hasOwnProperty.call(r, e)) t[e] = r[e];
|
||||
};
|
||||
return extendStatics(t, r);
|
||||
};
|
||||
return function(t, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(t, r);
|
||||
function __() {
|
||||
this.constructor = t;
|
||||
}
|
||||
t.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(t, r) {
|
||||
var e = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (o[0] & 1) throw o[1];
|
||||
return o[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, n, i, o, s;
|
||||
return s = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (s[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), s;
|
||||
function verb(t) {
|
||||
return function(r) {
|
||||
return step([ t, r ]);
|
||||
};
|
||||
}
|
||||
function step(s) {
|
||||
if (n) throw new TypeError("Generator is already executing.");
|
||||
while (e) try {
|
||||
if (n = 1, i && (o = s[0] & 2 ? i["return"] : s[0] ? i["throw"] || ((o = i["return"]) && o.call(i),
|
||||
0) : i.next) && !(o = o.call(i, s[1])).done) return o;
|
||||
if (i = 0, o) s = [ s[0] & 2, o.value ];
|
||||
switch (s[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
o = s;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
e.label++;
|
||||
return {
|
||||
value: s[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
e.label++;
|
||||
i = s[1];
|
||||
s = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
s = e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(o = e.trys, o = o.length > 0 && o[o.length - 1]) && (s[0] === 6 || s[0] === 2)) {
|
||||
e = 0;
|
||||
continue;
|
||||
}
|
||||
if (s[0] === 3 && (!o || s[1] > o[0] && s[1] < o[3])) {
|
||||
e.label = s[1];
|
||||
break;
|
||||
}
|
||||
if (s[0] === 6 && e.label < o[1]) {
|
||||
e.label = o[1];
|
||||
o = s;
|
||||
break;
|
||||
}
|
||||
if (o && e.label < o[2]) {
|
||||
e.label = o[2];
|
||||
e.ops.push(s);
|
||||
break;
|
||||
}
|
||||
if (o[2]) e.ops.pop();
|
||||
e.trys.pop();
|
||||
continue;
|
||||
}
|
||||
s = r.call(t, e);
|
||||
} catch (t) {
|
||||
s = [ 6, t ];
|
||||
i = 0;
|
||||
} finally {
|
||||
n = o = 0;
|
||||
}
|
||||
if (s[0] & 5) throw s[1];
|
||||
return {
|
||||
value: s[0] ? s[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
var __read = this && this.P || function(t, r) {
|
||||
var e = typeof Symbol === "function" && t[Symbol.iterator];
|
||||
if (!e) return t;
|
||||
var n = e.call(t), i, o = [], s;
|
||||
try {
|
||||
while ((r === void 0 || r-- > 0) && !(i = n.next()).done) o.push(i.value);
|
||||
} catch (t) {
|
||||
s = {
|
||||
error: t
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (i && !i.done && (e = n["return"])) e.call(n);
|
||||
} finally {
|
||||
if (s) throw s.error;
|
||||
}
|
||||
}
|
||||
return o;
|
||||
};
|
||||
|
||||
var __spreadArray = this && this.A || function(t, r, e) {
|
||||
if (e || arguments.length === 2) for (var n = 0, i = r.length, o; n < i; n++) {
|
||||
if (o || !(n in r)) {
|
||||
if (!o) o = Array.prototype.slice.call(r, 0, n);
|
||||
o[n] = r[n];
|
||||
}
|
||||
}
|
||||
return t.concat(o || Array.prototype.slice.call(r));
|
||||
};
|
||||
|
||||
var __values = this && this.Z || function(t) {
|
||||
var r = typeof Symbol === "function" && Symbol.iterator, e = r && t[r], n = 0;
|
||||
if (e) return e.call(t);
|
||||
if (t && typeof t.length === "number") return {
|
||||
next: function() {
|
||||
if (t && n >= t.length) t = void 0;
|
||||
return {
|
||||
value: t && t[n++],
|
||||
done: !t
|
||||
};
|
||||
}
|
||||
};
|
||||
throw new TypeError(r ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
|
||||
import SequentialContainer from "./Base";
|
||||
|
||||
import { RandomIterator } from "./Base/RandomIterator";
|
||||
|
||||
var VectorIterator = function(t) {
|
||||
__extends(VectorIterator, t);
|
||||
function VectorIterator() {
|
||||
return t !== null && t.apply(this, arguments) || this;
|
||||
}
|
||||
VectorIterator.prototype.copy = function() {
|
||||
return new VectorIterator(this.o, this.D, this.R, this.C, this.iteratorType);
|
||||
};
|
||||
return VectorIterator;
|
||||
}(RandomIterator);
|
||||
|
||||
var Vector = function(t) {
|
||||
__extends(Vector, t);
|
||||
function Vector(r, e) {
|
||||
if (r === void 0) {
|
||||
r = [];
|
||||
}
|
||||
if (e === void 0) {
|
||||
e = true;
|
||||
}
|
||||
var n = t.call(this) || this;
|
||||
if (Array.isArray(r)) {
|
||||
n.$ = e ? __spreadArray([], __read(r), false) : r;
|
||||
n.i = r.length;
|
||||
} else {
|
||||
n.$ = [];
|
||||
var i = n;
|
||||
r.forEach((function(t) {
|
||||
i.pushBack(t);
|
||||
}));
|
||||
}
|
||||
n.size = n.size.bind(n);
|
||||
n.getElementByPos = n.getElementByPos.bind(n);
|
||||
n.setElementByPos = n.setElementByPos.bind(n);
|
||||
return n;
|
||||
}
|
||||
Vector.prototype.clear = function() {
|
||||
this.i = 0;
|
||||
this.$.length = 0;
|
||||
};
|
||||
Vector.prototype.begin = function() {
|
||||
return new VectorIterator(0, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Vector.prototype.end = function() {
|
||||
return new VectorIterator(this.i, this.size, this.getElementByPos, this.setElementByPos);
|
||||
};
|
||||
Vector.prototype.rBegin = function() {
|
||||
return new VectorIterator(this.i - 1, this.size, this.getElementByPos, this.setElementByPos, 1);
|
||||
};
|
||||
Vector.prototype.rEnd = function() {
|
||||
return new VectorIterator(-1, this.size, this.getElementByPos, this.setElementByPos, 1);
|
||||
};
|
||||
Vector.prototype.front = function() {
|
||||
return this.$[0];
|
||||
};
|
||||
Vector.prototype.back = function() {
|
||||
return this.$[this.i - 1];
|
||||
};
|
||||
Vector.prototype.getElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
return this.$[t];
|
||||
};
|
||||
Vector.prototype.eraseElementByPos = function(t) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
this.$.splice(t, 1);
|
||||
this.i -= 1;
|
||||
return this.i;
|
||||
};
|
||||
Vector.prototype.eraseElementByValue = function(t) {
|
||||
var r = 0;
|
||||
for (var e = 0; e < this.i; ++e) {
|
||||
if (this.$[e] !== t) {
|
||||
this.$[r++] = this.$[e];
|
||||
}
|
||||
}
|
||||
this.i = this.$.length = r;
|
||||
return this.i;
|
||||
};
|
||||
Vector.prototype.eraseElementByIterator = function(t) {
|
||||
var r = t.o;
|
||||
t = t.next();
|
||||
this.eraseElementByPos(r);
|
||||
return t;
|
||||
};
|
||||
Vector.prototype.pushBack = function(t) {
|
||||
this.$.push(t);
|
||||
this.i += 1;
|
||||
return this.i;
|
||||
};
|
||||
Vector.prototype.popBack = function() {
|
||||
if (this.i === 0) return;
|
||||
this.i -= 1;
|
||||
return this.$.pop();
|
||||
};
|
||||
Vector.prototype.setElementByPos = function(t, r) {
|
||||
if (t < 0 || t > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
this.$[t] = r;
|
||||
};
|
||||
Vector.prototype.insert = function(t, r, e) {
|
||||
var n;
|
||||
if (e === void 0) {
|
||||
e = 1;
|
||||
}
|
||||
if (t < 0 || t > this.i) {
|
||||
throw new RangeError;
|
||||
}
|
||||
(n = this.$).splice.apply(n, __spreadArray([ t, 0 ], __read(new Array(e).fill(r)), false));
|
||||
this.i += e;
|
||||
return this.i;
|
||||
};
|
||||
Vector.prototype.find = function(t) {
|
||||
for (var r = 0; r < this.i; ++r) {
|
||||
if (this.$[r] === t) {
|
||||
return new VectorIterator(r, this.size, this.getElementByPos, this.getElementByPos);
|
||||
}
|
||||
}
|
||||
return this.end();
|
||||
};
|
||||
Vector.prototype.reverse = function() {
|
||||
this.$.reverse();
|
||||
};
|
||||
Vector.prototype.unique = function() {
|
||||
var t = 1;
|
||||
for (var r = 1; r < this.i; ++r) {
|
||||
if (this.$[r] !== this.$[r - 1]) {
|
||||
this.$[t++] = this.$[r];
|
||||
}
|
||||
}
|
||||
this.i = this.$.length = t;
|
||||
return this.i;
|
||||
};
|
||||
Vector.prototype.sort = function(t) {
|
||||
this.$.sort(t);
|
||||
};
|
||||
Vector.prototype.forEach = function(t) {
|
||||
for (var r = 0; r < this.i; ++r) {
|
||||
t(this.$[r], r, this);
|
||||
}
|
||||
};
|
||||
Vector.prototype[Symbol.iterator] = function() {
|
||||
return function() {
|
||||
return __generator(this, (function(t) {
|
||||
switch (t.label) {
|
||||
case 0:
|
||||
return [ 5, __values(this.$) ];
|
||||
|
||||
case 1:
|
||||
t.sent();
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
}.bind(this)();
|
||||
};
|
||||
return Vector;
|
||||
}(SequentialContainer);
|
||||
|
||||
export default Vector;
|
||||
//# sourceMappingURL=Vector.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/SequentialContainer/Vector.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
16
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.d.ts
generated
vendored
Normal file
16
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,16 @@
|
|||
import { ContainerIterator } from "../../ContainerBase";
|
||||
declare abstract class TreeIterator<K, V> extends ContainerIterator<K | [K, V]> {
|
||||
/**
|
||||
* @description Get the sequential index of the iterator in the tree container.<br/>
|
||||
* <strong>Note:</strong>
|
||||
* This function only takes effect when the specified tree container `enableIndex = true`.
|
||||
* @returns The index subscript of the node in the tree.
|
||||
* @example
|
||||
* const st = new OrderedSet([1, 2, 3], true);
|
||||
* console.log(st.begin().next().index); // 1
|
||||
*/
|
||||
get index(): number;
|
||||
pre(): this;
|
||||
next(): this;
|
||||
}
|
||||
export default TreeIterator;
|
||||
98
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js
generated
vendored
Normal file
98
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js
generated
vendored
Normal file
|
|
@ -0,0 +1,98 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(r, t) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(r, t) {
|
||||
r.__proto__ = t;
|
||||
} || function(r, t) {
|
||||
for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) r[e] = t[e];
|
||||
};
|
||||
return extendStatics(r, t);
|
||||
};
|
||||
return function(r, t) {
|
||||
if (typeof t !== "function" && t !== null) throw new TypeError("Class extends value " + String(t) + " is not a constructor or null");
|
||||
extendStatics(r, t);
|
||||
function __() {
|
||||
this.constructor = r;
|
||||
}
|
||||
r.prototype = t === null ? Object.create(t) : (__.prototype = t.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
import { ContainerIterator } from "../../ContainerBase";
|
||||
|
||||
import { throwIteratorAccessError } from "../../../utils/throwError";
|
||||
|
||||
var TreeIterator = function(r) {
|
||||
__extends(TreeIterator, r);
|
||||
function TreeIterator(t, e, i) {
|
||||
var n = r.call(this, i) || this;
|
||||
n.o = t;
|
||||
n.h = e;
|
||||
if (n.iteratorType === 0) {
|
||||
n.pre = function() {
|
||||
if (this.o === this.h.er) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W();
|
||||
return this;
|
||||
};
|
||||
n.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m();
|
||||
return this;
|
||||
};
|
||||
} else {
|
||||
n.pre = function() {
|
||||
if (this.o === this.h.tr) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.m();
|
||||
return this;
|
||||
};
|
||||
n.next = function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
this.o = this.o.W();
|
||||
return this;
|
||||
};
|
||||
}
|
||||
return n;
|
||||
}
|
||||
Object.defineProperty(TreeIterator.prototype, "index", {
|
||||
get: function() {
|
||||
var r = this.o;
|
||||
var t = this.h.hr;
|
||||
if (r === this.h) {
|
||||
if (t) {
|
||||
return t.cr - 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
var e = 0;
|
||||
if (r.er) {
|
||||
e += r.er.cr;
|
||||
}
|
||||
while (r !== t) {
|
||||
var i = r.hr;
|
||||
if (r === i.tr) {
|
||||
e += 1;
|
||||
if (i.er) {
|
||||
e += i.er.cr;
|
||||
}
|
||||
}
|
||||
r = i;
|
||||
}
|
||||
return e;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
return TreeIterator;
|
||||
}(ContainerIterator);
|
||||
|
||||
export default TreeIterator;
|
||||
//# sourceMappingURL=TreeIterator.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeIterator.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.d.ts
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1 @@
|
|||
export {};
|
||||
132
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js
generated
vendored
Normal file
132
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js
generated
vendored
Normal file
|
|
@ -0,0 +1,132 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(e, n) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(e, n) {
|
||||
e.__proto__ = n;
|
||||
} || function(e, n) {
|
||||
for (var t in n) if (Object.prototype.hasOwnProperty.call(n, t)) e[t] = n[t];
|
||||
};
|
||||
return extendStatics(e, n);
|
||||
};
|
||||
return function(e, n) {
|
||||
if (typeof n !== "function" && n !== null) throw new TypeError("Class extends value " + String(n) + " is not a constructor or null");
|
||||
extendStatics(e, n);
|
||||
function __() {
|
||||
this.constructor = e;
|
||||
}
|
||||
e.prototype = n === null ? Object.create(n) : (__.prototype = n.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var TreeNode = function() {
|
||||
function TreeNode(e, n) {
|
||||
this.ee = 1;
|
||||
this.p = undefined;
|
||||
this.H = undefined;
|
||||
this.er = undefined;
|
||||
this.tr = undefined;
|
||||
this.hr = undefined;
|
||||
this.p = e;
|
||||
this.H = n;
|
||||
}
|
||||
TreeNode.prototype.W = function() {
|
||||
var e = this;
|
||||
if (e.ee === 1 && e.hr.hr === e) {
|
||||
e = e.tr;
|
||||
} else if (e.er) {
|
||||
e = e.er;
|
||||
while (e.tr) {
|
||||
e = e.tr;
|
||||
}
|
||||
} else {
|
||||
var n = e.hr;
|
||||
while (n.er === e) {
|
||||
e = n;
|
||||
n = e.hr;
|
||||
}
|
||||
e = n;
|
||||
}
|
||||
return e;
|
||||
};
|
||||
TreeNode.prototype.m = function() {
|
||||
var e = this;
|
||||
if (e.tr) {
|
||||
e = e.tr;
|
||||
while (e.er) {
|
||||
e = e.er;
|
||||
}
|
||||
return e;
|
||||
} else {
|
||||
var n = e.hr;
|
||||
while (n.tr === e) {
|
||||
e = n;
|
||||
n = e.hr;
|
||||
}
|
||||
if (e.tr !== n) {
|
||||
return n;
|
||||
} else return e;
|
||||
}
|
||||
};
|
||||
TreeNode.prototype.ne = function() {
|
||||
var e = this.hr;
|
||||
var n = this.tr;
|
||||
var t = n.er;
|
||||
if (e.hr === this) e.hr = n; else if (e.er === this) e.er = n; else e.tr = n;
|
||||
n.hr = e;
|
||||
n.er = this;
|
||||
this.hr = n;
|
||||
this.tr = t;
|
||||
if (t) t.hr = this;
|
||||
return n;
|
||||
};
|
||||
TreeNode.prototype.te = function() {
|
||||
var e = this.hr;
|
||||
var n = this.er;
|
||||
var t = n.tr;
|
||||
if (e.hr === this) e.hr = n; else if (e.er === this) e.er = n; else e.tr = n;
|
||||
n.hr = e;
|
||||
n.tr = this;
|
||||
this.hr = n;
|
||||
this.er = t;
|
||||
if (t) t.hr = this;
|
||||
return n;
|
||||
};
|
||||
return TreeNode;
|
||||
}();
|
||||
|
||||
export { TreeNode };
|
||||
|
||||
var TreeNodeEnableIndex = function(e) {
|
||||
__extends(TreeNodeEnableIndex, e);
|
||||
function TreeNodeEnableIndex() {
|
||||
var n = e !== null && e.apply(this, arguments) || this;
|
||||
n.cr = 1;
|
||||
return n;
|
||||
}
|
||||
TreeNodeEnableIndex.prototype.ne = function() {
|
||||
var n = e.prototype.ne.call(this);
|
||||
this.ie();
|
||||
n.ie();
|
||||
return n;
|
||||
};
|
||||
TreeNodeEnableIndex.prototype.te = function() {
|
||||
var n = e.prototype.te.call(this);
|
||||
this.ie();
|
||||
n.ie();
|
||||
return n;
|
||||
};
|
||||
TreeNodeEnableIndex.prototype.ie = function() {
|
||||
this.cr = 1;
|
||||
if (this.er) {
|
||||
this.cr += this.er.cr;
|
||||
}
|
||||
if (this.tr) {
|
||||
this.cr += this.tr.cr;
|
||||
}
|
||||
};
|
||||
return TreeNodeEnableIndex;
|
||||
}(TreeNode);
|
||||
|
||||
export { TreeNodeEnableIndex };
|
||||
//# sourceMappingURL=TreeNode.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/TreeNode.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
58
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.d.ts
generated
vendored
Normal file
58
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,58 @@
|
|||
import type TreeIterator from './TreeIterator';
|
||||
import { Container } from "../../ContainerBase";
|
||||
declare abstract class TreeContainer<K, V> extends Container<K | [K, V]> {
|
||||
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.
|
||||
* @returns Whether the modification is successful.
|
||||
* @example
|
||||
* const st = new orderedSet([1, 2, 5]);
|
||||
* const iter = st.find(2);
|
||||
* st.updateKeyByIterator(iter, 3); // then st will become [1, 3, 5]
|
||||
*/
|
||||
updateKeyByIterator(iter: TreeIterator<K, V>, key: K): boolean;
|
||||
eraseElementByPos(pos: number): number;
|
||||
/**
|
||||
* @description Remove the element of the specified key.
|
||||
* @param key - The key you want to remove.
|
||||
* @returns Whether erase successfully.
|
||||
*/
|
||||
eraseElementByKey(key: K): boolean;
|
||||
eraseElementByIterator(iter: TreeIterator<K, V>): TreeIterator<K, V>;
|
||||
forEach(callback: (element: K | [K, V], index: number, tree: TreeContainer<K, V>) => void): void;
|
||||
getElementByPos(pos: number): K | [K, V];
|
||||
/**
|
||||
* @description Get the height of the tree.
|
||||
* @returns Number about the height of the RB-tree.
|
||||
*/
|
||||
getHeight(): number;
|
||||
/**
|
||||
* @param key - The given key you want to compare.
|
||||
* @returns 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.
|
||||
* @param other - The other tree container you want to merge.
|
||||
* @returns The size of the tree after union.
|
||||
*/
|
||||
abstract union(other: TreeContainer<K, V>): number;
|
||||
/**
|
||||
* @param key - The given key you want to compare.
|
||||
* @returns An iterator to the first element not greater than the given key.
|
||||
*/
|
||||
abstract reverseLowerBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @param key - The given key you want to compare.
|
||||
* @returns An iterator to the first element not less than the given key.
|
||||
*/
|
||||
abstract lowerBound(key: K): TreeIterator<K, V>;
|
||||
/**
|
||||
* @param key - The given key you want to compare.
|
||||
* @returns An iterator to the first element greater than the given key.
|
||||
*/
|
||||
abstract upperBound(key: K): TreeIterator<K, V>;
|
||||
}
|
||||
export default TreeContainer;
|
||||
600
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js
generated
vendored
Normal file
600
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,600 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(e, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(e, r) {
|
||||
e.__proto__ = r;
|
||||
} || function(e, r) {
|
||||
for (var i in r) if (Object.prototype.hasOwnProperty.call(r, i)) e[i] = r[i];
|
||||
};
|
||||
return extendStatics(e, r);
|
||||
};
|
||||
return function(e, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(e, r);
|
||||
function __() {
|
||||
this.constructor = e;
|
||||
}
|
||||
e.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __read = this && this.P || function(e, r) {
|
||||
var i = typeof Symbol === "function" && e[Symbol.iterator];
|
||||
if (!i) return e;
|
||||
var t = i.call(e), n, s = [], f;
|
||||
try {
|
||||
while ((r === void 0 || r-- > 0) && !(n = t.next()).done) s.push(n.value);
|
||||
} catch (e) {
|
||||
f = {
|
||||
error: e
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (n && !n.done && (i = t["return"])) i.call(t);
|
||||
} finally {
|
||||
if (f) throw f.error;
|
||||
}
|
||||
}
|
||||
return s;
|
||||
};
|
||||
|
||||
var __values = this && this.Z || function(e) {
|
||||
var r = typeof Symbol === "function" && Symbol.iterator, i = r && e[r], t = 0;
|
||||
if (i) return i.call(e);
|
||||
if (e && typeof e.length === "number") return {
|
||||
next: function() {
|
||||
if (e && t >= e.length) e = void 0;
|
||||
return {
|
||||
value: e && e[t++],
|
||||
done: !e
|
||||
};
|
||||
}
|
||||
};
|
||||
throw new TypeError(r ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
|
||||
import { TreeNode, TreeNodeEnableIndex } from "./TreeNode";
|
||||
|
||||
import { Container } from "../../ContainerBase";
|
||||
|
||||
import { throwIteratorAccessError } from "../../../utils/throwError";
|
||||
|
||||
var TreeContainer = function(e) {
|
||||
__extends(TreeContainer, e);
|
||||
function TreeContainer(r, i) {
|
||||
if (r === void 0) {
|
||||
r = function(e, r) {
|
||||
if (e < r) return -1;
|
||||
if (e > r) return 1;
|
||||
return 0;
|
||||
};
|
||||
}
|
||||
if (i === void 0) {
|
||||
i = false;
|
||||
}
|
||||
var t = e.call(this) || this;
|
||||
t.ir = undefined;
|
||||
t.j = r;
|
||||
if (i) {
|
||||
t.re = TreeNodeEnableIndex;
|
||||
t.v = function(e, r, i) {
|
||||
var t = this.se(e, r, i);
|
||||
if (t) {
|
||||
var n = t.hr;
|
||||
while (n !== this.h) {
|
||||
n.cr += 1;
|
||||
n = n.hr;
|
||||
}
|
||||
var s = this.fe(t);
|
||||
if (s) {
|
||||
var f = s, h = f.parentNode, u = f.grandParent, a = f.curNode;
|
||||
h.ie();
|
||||
u.ie();
|
||||
a.ie();
|
||||
}
|
||||
}
|
||||
return this.i;
|
||||
};
|
||||
t.X = function(e) {
|
||||
var r = this.he(e);
|
||||
while (r !== this.h) {
|
||||
r.cr -= 1;
|
||||
r = r.hr;
|
||||
}
|
||||
};
|
||||
} else {
|
||||
t.re = TreeNode;
|
||||
t.v = function(e, r, i) {
|
||||
var t = this.se(e, r, i);
|
||||
if (t) this.fe(t);
|
||||
return this.i;
|
||||
};
|
||||
t.X = t.he;
|
||||
}
|
||||
t.h = new t.re;
|
||||
return t;
|
||||
}
|
||||
TreeContainer.prototype.nr = function(e, r) {
|
||||
var i = this.h;
|
||||
while (e) {
|
||||
var t = this.j(e.p, r);
|
||||
if (t < 0) {
|
||||
e = e.tr;
|
||||
} else if (t > 0) {
|
||||
i = e;
|
||||
e = e.er;
|
||||
} else return e;
|
||||
}
|
||||
return i;
|
||||
};
|
||||
TreeContainer.prototype.ar = function(e, r) {
|
||||
var i = this.h;
|
||||
while (e) {
|
||||
var t = this.j(e.p, r);
|
||||
if (t <= 0) {
|
||||
e = e.tr;
|
||||
} else {
|
||||
i = e;
|
||||
e = e.er;
|
||||
}
|
||||
}
|
||||
return i;
|
||||
};
|
||||
TreeContainer.prototype.ur = function(e, r) {
|
||||
var i = this.h;
|
||||
while (e) {
|
||||
var t = this.j(e.p, r);
|
||||
if (t < 0) {
|
||||
i = e;
|
||||
e = e.tr;
|
||||
} else if (t > 0) {
|
||||
e = e.er;
|
||||
} else return e;
|
||||
}
|
||||
return i;
|
||||
};
|
||||
TreeContainer.prototype.sr = function(e, r) {
|
||||
var i = this.h;
|
||||
while (e) {
|
||||
var t = this.j(e.p, r);
|
||||
if (t < 0) {
|
||||
i = e;
|
||||
e = e.tr;
|
||||
} else {
|
||||
e = e.er;
|
||||
}
|
||||
}
|
||||
return i;
|
||||
};
|
||||
TreeContainer.prototype.ue = function(e) {
|
||||
while (true) {
|
||||
var r = e.hr;
|
||||
if (r === this.h) return;
|
||||
if (e.ee === 1) {
|
||||
e.ee = 0;
|
||||
return;
|
||||
}
|
||||
if (e === r.er) {
|
||||
var i = r.tr;
|
||||
if (i.ee === 1) {
|
||||
i.ee = 0;
|
||||
r.ee = 1;
|
||||
if (r === this.ir) {
|
||||
this.ir = r.ne();
|
||||
} else r.ne();
|
||||
} else {
|
||||
if (i.tr && i.tr.ee === 1) {
|
||||
i.ee = r.ee;
|
||||
r.ee = 0;
|
||||
i.tr.ee = 0;
|
||||
if (r === this.ir) {
|
||||
this.ir = r.ne();
|
||||
} else r.ne();
|
||||
return;
|
||||
} else if (i.er && i.er.ee === 1) {
|
||||
i.ee = 1;
|
||||
i.er.ee = 0;
|
||||
i.te();
|
||||
} else {
|
||||
i.ee = 1;
|
||||
e = r;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
var i = r.er;
|
||||
if (i.ee === 1) {
|
||||
i.ee = 0;
|
||||
r.ee = 1;
|
||||
if (r === this.ir) {
|
||||
this.ir = r.te();
|
||||
} else r.te();
|
||||
} else {
|
||||
if (i.er && i.er.ee === 1) {
|
||||
i.ee = r.ee;
|
||||
r.ee = 0;
|
||||
i.er.ee = 0;
|
||||
if (r === this.ir) {
|
||||
this.ir = r.te();
|
||||
} else r.te();
|
||||
return;
|
||||
} else if (i.tr && i.tr.ee === 1) {
|
||||
i.ee = 1;
|
||||
i.tr.ee = 0;
|
||||
i.ne();
|
||||
} else {
|
||||
i.ee = 1;
|
||||
e = r;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
TreeContainer.prototype.he = function(e) {
|
||||
var r, i;
|
||||
if (this.i === 1) {
|
||||
this.clear();
|
||||
return this.h;
|
||||
}
|
||||
var t = e;
|
||||
while (t.er || t.tr) {
|
||||
if (t.tr) {
|
||||
t = t.tr;
|
||||
while (t.er) t = t.er;
|
||||
} else {
|
||||
t = t.er;
|
||||
}
|
||||
r = __read([ t.p, e.p ], 2), e.p = r[0], t.p = r[1];
|
||||
i = __read([ t.H, e.H ], 2), e.H = i[0], t.H = i[1];
|
||||
e = t;
|
||||
}
|
||||
if (this.h.er === t) {
|
||||
this.h.er = t.hr;
|
||||
} else if (this.h.tr === t) {
|
||||
this.h.tr = t.hr;
|
||||
}
|
||||
this.ue(t);
|
||||
var n = t.hr;
|
||||
if (t === n.er) {
|
||||
n.er = undefined;
|
||||
} else n.tr = undefined;
|
||||
this.i -= 1;
|
||||
this.ir.ee = 0;
|
||||
return n;
|
||||
};
|
||||
TreeContainer.prototype.ae = function(e, r) {
|
||||
if (e === undefined) return false;
|
||||
var i = this.ae(e.er, r);
|
||||
if (i) return true;
|
||||
if (r(e)) return true;
|
||||
return this.ae(e.tr, r);
|
||||
};
|
||||
TreeContainer.prototype.fe = function(e) {
|
||||
while (true) {
|
||||
var r = e.hr;
|
||||
if (r.ee === 0) return;
|
||||
var i = r.hr;
|
||||
if (r === i.er) {
|
||||
var t = i.tr;
|
||||
if (t && t.ee === 1) {
|
||||
t.ee = r.ee = 0;
|
||||
if (i === this.ir) return;
|
||||
i.ee = 1;
|
||||
e = i;
|
||||
continue;
|
||||
} else if (e === r.tr) {
|
||||
e.ee = 0;
|
||||
if (e.er) e.er.hr = r;
|
||||
if (e.tr) e.tr.hr = i;
|
||||
r.tr = e.er;
|
||||
i.er = e.tr;
|
||||
e.er = r;
|
||||
e.tr = i;
|
||||
if (i === this.ir) {
|
||||
this.ir = e;
|
||||
this.h.hr = e;
|
||||
} else {
|
||||
var n = i.hr;
|
||||
if (n.er === i) {
|
||||
n.er = e;
|
||||
} else n.tr = e;
|
||||
}
|
||||
e.hr = i.hr;
|
||||
r.hr = e;
|
||||
i.hr = e;
|
||||
i.ee = 1;
|
||||
return {
|
||||
parentNode: r,
|
||||
grandParent: i,
|
||||
curNode: e
|
||||
};
|
||||
} else {
|
||||
r.ee = 0;
|
||||
if (i === this.ir) {
|
||||
this.ir = i.te();
|
||||
} else i.te();
|
||||
i.ee = 1;
|
||||
}
|
||||
} else {
|
||||
var t = i.er;
|
||||
if (t && t.ee === 1) {
|
||||
t.ee = r.ee = 0;
|
||||
if (i === this.ir) return;
|
||||
i.ee = 1;
|
||||
e = i;
|
||||
continue;
|
||||
} else if (e === r.er) {
|
||||
e.ee = 0;
|
||||
if (e.er) e.er.hr = i;
|
||||
if (e.tr) e.tr.hr = r;
|
||||
i.tr = e.er;
|
||||
r.er = e.tr;
|
||||
e.er = i;
|
||||
e.tr = r;
|
||||
if (i === this.ir) {
|
||||
this.ir = e;
|
||||
this.h.hr = e;
|
||||
} else {
|
||||
var n = i.hr;
|
||||
if (n.er === i) {
|
||||
n.er = e;
|
||||
} else n.tr = e;
|
||||
}
|
||||
e.hr = i.hr;
|
||||
r.hr = e;
|
||||
i.hr = e;
|
||||
i.ee = 1;
|
||||
return {
|
||||
parentNode: r,
|
||||
grandParent: i,
|
||||
curNode: e
|
||||
};
|
||||
} else {
|
||||
r.ee = 0;
|
||||
if (i === this.ir) {
|
||||
this.ir = i.ne();
|
||||
} else i.ne();
|
||||
i.ee = 1;
|
||||
}
|
||||
}
|
||||
return;
|
||||
}
|
||||
};
|
||||
TreeContainer.prototype.se = function(e, r, i) {
|
||||
if (this.ir === undefined) {
|
||||
this.i += 1;
|
||||
this.ir = new this.re(e, r);
|
||||
this.ir.ee = 0;
|
||||
this.ir.hr = this.h;
|
||||
this.h.hr = this.ir;
|
||||
this.h.er = this.ir;
|
||||
this.h.tr = this.ir;
|
||||
return;
|
||||
}
|
||||
var t;
|
||||
var n = this.h.er;
|
||||
var s = this.j(n.p, e);
|
||||
if (s === 0) {
|
||||
n.H = r;
|
||||
return;
|
||||
} else if (s > 0) {
|
||||
n.er = new this.re(e, r);
|
||||
n.er.hr = n;
|
||||
t = n.er;
|
||||
this.h.er = t;
|
||||
} else {
|
||||
var f = this.h.tr;
|
||||
var h = this.j(f.p, e);
|
||||
if (h === 0) {
|
||||
f.H = r;
|
||||
return;
|
||||
} else if (h < 0) {
|
||||
f.tr = new this.re(e, r);
|
||||
f.tr.hr = f;
|
||||
t = f.tr;
|
||||
this.h.tr = t;
|
||||
} else {
|
||||
if (i !== undefined) {
|
||||
var u = i.o;
|
||||
if (u !== this.h) {
|
||||
var a = this.j(u.p, e);
|
||||
if (a === 0) {
|
||||
u.H = r;
|
||||
return;
|
||||
} else if (a > 0) {
|
||||
var o = u.W();
|
||||
var l = this.j(o.p, e);
|
||||
if (l === 0) {
|
||||
o.H = r;
|
||||
return;
|
||||
} else if (l < 0) {
|
||||
t = new this.re(e, r);
|
||||
if (o.tr === undefined) {
|
||||
o.tr = t;
|
||||
t.hr = o;
|
||||
} else {
|
||||
u.er = t;
|
||||
t.hr = u;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (t === undefined) {
|
||||
t = this.ir;
|
||||
while (true) {
|
||||
var v = this.j(t.p, e);
|
||||
if (v > 0) {
|
||||
if (t.er === undefined) {
|
||||
t.er = new this.re(e, r);
|
||||
t.er.hr = t;
|
||||
t = t.er;
|
||||
break;
|
||||
}
|
||||
t = t.er;
|
||||
} else if (v < 0) {
|
||||
if (t.tr === undefined) {
|
||||
t.tr = new this.re(e, r);
|
||||
t.tr.hr = t;
|
||||
t = t.tr;
|
||||
break;
|
||||
}
|
||||
t = t.tr;
|
||||
} else {
|
||||
t.H = r;
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
this.i += 1;
|
||||
return t;
|
||||
};
|
||||
TreeContainer.prototype.g = function(e, r) {
|
||||
while (e) {
|
||||
var i = this.j(e.p, r);
|
||||
if (i < 0) {
|
||||
e = e.tr;
|
||||
} else if (i > 0) {
|
||||
e = e.er;
|
||||
} else return e;
|
||||
}
|
||||
return e || this.h;
|
||||
};
|
||||
TreeContainer.prototype.clear = function() {
|
||||
this.i = 0;
|
||||
this.ir = undefined;
|
||||
this.h.hr = undefined;
|
||||
this.h.er = this.h.tr = undefined;
|
||||
};
|
||||
TreeContainer.prototype.updateKeyByIterator = function(e, r) {
|
||||
var i = e.o;
|
||||
if (i === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
if (this.i === 1) {
|
||||
i.p = r;
|
||||
return true;
|
||||
}
|
||||
if (i === this.h.er) {
|
||||
if (this.j(i.m().p, r) > 0) {
|
||||
i.p = r;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
if (i === this.h.tr) {
|
||||
if (this.j(i.W().p, r) < 0) {
|
||||
i.p = r;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
var t = i.W().p;
|
||||
if (this.j(t, r) >= 0) return false;
|
||||
var n = i.m().p;
|
||||
if (this.j(n, r) <= 0) return false;
|
||||
i.p = r;
|
||||
return true;
|
||||
};
|
||||
TreeContainer.prototype.eraseElementByPos = function(e) {
|
||||
if (e < 0 || e > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var r = 0;
|
||||
var i = this;
|
||||
this.ae(this.ir, (function(t) {
|
||||
if (e === r) {
|
||||
i.X(t);
|
||||
return true;
|
||||
}
|
||||
r += 1;
|
||||
return false;
|
||||
}));
|
||||
return this.i;
|
||||
};
|
||||
TreeContainer.prototype.eraseElementByKey = function(e) {
|
||||
if (this.i === 0) return false;
|
||||
var r = this.g(this.ir, e);
|
||||
if (r === this.h) return false;
|
||||
this.X(r);
|
||||
return true;
|
||||
};
|
||||
TreeContainer.prototype.eraseElementByIterator = function(e) {
|
||||
var r = e.o;
|
||||
if (r === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
var i = r.tr === undefined;
|
||||
var t = e.iteratorType === 0;
|
||||
if (t) {
|
||||
if (i) e.next();
|
||||
} else {
|
||||
if (!i || r.er === undefined) e.next();
|
||||
}
|
||||
this.X(r);
|
||||
return e;
|
||||
};
|
||||
TreeContainer.prototype.forEach = function(e) {
|
||||
var r, i;
|
||||
var t = 0;
|
||||
try {
|
||||
for (var n = __values(this), s = n.next(); !s.done; s = n.next()) {
|
||||
var f = s.value;
|
||||
e(f, t++, this);
|
||||
}
|
||||
} catch (e) {
|
||||
r = {
|
||||
error: e
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (s && !s.done && (i = n.return)) i.call(n);
|
||||
} finally {
|
||||
if (r) throw r.error;
|
||||
}
|
||||
}
|
||||
};
|
||||
TreeContainer.prototype.getElementByPos = function(e) {
|
||||
var r, i;
|
||||
if (e < 0 || e > this.i - 1) {
|
||||
throw new RangeError;
|
||||
}
|
||||
var t;
|
||||
var n = 0;
|
||||
try {
|
||||
for (var s = __values(this), f = s.next(); !f.done; f = s.next()) {
|
||||
var h = f.value;
|
||||
if (n === e) {
|
||||
t = h;
|
||||
break;
|
||||
}
|
||||
n += 1;
|
||||
}
|
||||
} catch (e) {
|
||||
r = {
|
||||
error: e
|
||||
};
|
||||
} finally {
|
||||
try {
|
||||
if (f && !f.done && (i = s.return)) i.call(s);
|
||||
} finally {
|
||||
if (r) throw r.error;
|
||||
}
|
||||
}
|
||||
return t;
|
||||
};
|
||||
TreeContainer.prototype.getHeight = function() {
|
||||
if (this.i === 0) return 0;
|
||||
var traversal = function(e) {
|
||||
if (!e) return 0;
|
||||
return Math.max(traversal(e.er), traversal(e.tr)) + 1;
|
||||
};
|
||||
return traversal(this.ir);
|
||||
};
|
||||
return TreeContainer;
|
||||
}(Container);
|
||||
|
||||
export default TreeContainer;
|
||||
//# sourceMappingURL=index.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/Base/index.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
59
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.d.ts
generated
vendored
Normal file
59
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,59 @@
|
|||
import TreeContainer from './Base';
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
import { initContainer } from "../ContainerBase";
|
||||
declare class OrderedMapIterator<K, V> extends TreeIterator<K, V> {
|
||||
get pointer(): [K, V];
|
||||
copy(): OrderedMapIterator<K, V>;
|
||||
equals(iter: OrderedMapIterator<K, V>): boolean;
|
||||
}
|
||||
export type { OrderedMapIterator };
|
||||
declare class OrderedMap<K, V> extends TreeContainer<K, V> {
|
||||
/**
|
||||
* @param container - The initialization container.
|
||||
* @param cmp - The compare function.
|
||||
* @param enableIndex - Whether to enable iterator indexing function.
|
||||
* @example
|
||||
* new OrderedMap();
|
||||
* new OrderedMap([[0, 1], [2, 1]]);
|
||||
* new OrderedMap([[0, 1], [2, 1]], (x, y) => x - y);
|
||||
* new OrderedMap([[0, 1], [2, 1]], (x, y) => x - y, true);
|
||||
*/
|
||||
constructor(container?: initContainer<[K, V]>, cmp?: (x: K, y: K) => number, enableIndex?: boolean);
|
||||
begin(): OrderedMapIterator<K, V>;
|
||||
end(): OrderedMapIterator<K, V>;
|
||||
rBegin(): OrderedMapIterator<K, V>;
|
||||
rEnd(): OrderedMapIterator<K, V>;
|
||||
front(): [K, V] | undefined;
|
||||
back(): [K, V] | undefined;
|
||||
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.
|
||||
* @return The size of container after setting.
|
||||
* @example
|
||||
* const mp = new OrderedMap([[2, 0], [4, 0], [5, 0]]);
|
||||
* const iter = mp.begin();
|
||||
* mp.setElement(1, 0);
|
||||
* mp.setElement(3, 0, iter); // give a hint will be faster.
|
||||
*/
|
||||
setElement(key: K, value: V, hint?: OrderedMapIterator<K, V>): number;
|
||||
find(key: K): OrderedMapIterator<K, V>;
|
||||
/**
|
||||
* @description Get the value of the element of the specified key.
|
||||
* @param key - The specified key you want to get.
|
||||
* @example
|
||||
* const val = container.getElementByKey(1);
|
||||
*/
|
||||
getElementByKey(key: K): V | undefined;
|
||||
union(other: OrderedMap<K, V>): number;
|
||||
[Symbol.iterator](): Generator<[K, V], void, unknown>;
|
||||
eraseElementByIterator(iter: OrderedMapIterator<K, V>): OrderedMapIterator<K, V>;
|
||||
forEach(callback: (element: [K, V], index: number, map: OrderedMap<K, V>) => void): void;
|
||||
getElementByPos(pos: number): [K, V];
|
||||
}
|
||||
export default OrderedMap;
|
||||
263
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js
generated
vendored
Normal file
263
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js
generated
vendored
Normal file
|
|
@ -0,0 +1,263 @@
|
|||
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.u || function(r, e) {
|
||||
var t = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (o[0] & 1) throw o[1];
|
||||
return o[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, n, i, o, a;
|
||||
return a = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (a[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), a;
|
||||
function verb(r) {
|
||||
return function(e) {
|
||||
return step([ r, e ]);
|
||||
};
|
||||
}
|
||||
function step(a) {
|
||||
if (n) throw new TypeError("Generator is already executing.");
|
||||
while (t) try {
|
||||
if (n = 1, i && (o = a[0] & 2 ? i["return"] : a[0] ? i["throw"] || ((o = i["return"]) && o.call(i),
|
||||
0) : i.next) && !(o = o.call(i, a[1])).done) return o;
|
||||
if (i = 0, o) a = [ a[0] & 2, o.value ];
|
||||
switch (a[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
o = a;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
t.label++;
|
||||
return {
|
||||
value: a[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
t.label++;
|
||||
i = a[1];
|
||||
a = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
a = t.ops.pop();
|
||||
t.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(o = t.trys, o = o.length > 0 && o[o.length - 1]) && (a[0] === 6 || a[0] === 2)) {
|
||||
t = 0;
|
||||
continue;
|
||||
}
|
||||
if (a[0] === 3 && (!o || a[1] > o[0] && a[1] < o[3])) {
|
||||
t.label = a[1];
|
||||
break;
|
||||
}
|
||||
if (a[0] === 6 && t.label < o[1]) {
|
||||
t.label = o[1];
|
||||
o = a;
|
||||
break;
|
||||
}
|
||||
if (o && t.label < o[2]) {
|
||||
t.label = o[2];
|
||||
t.ops.push(a);
|
||||
break;
|
||||
}
|
||||
if (o[2]) t.ops.pop();
|
||||
t.trys.pop();
|
||||
continue;
|
||||
}
|
||||
a = e.call(r, t);
|
||||
} catch (r) {
|
||||
a = [ 6, r ];
|
||||
i = 0;
|
||||
} finally {
|
||||
n = o = 0;
|
||||
}
|
||||
if (a[0] & 5) throw a[1];
|
||||
return {
|
||||
value: a[0] ? a[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
var __values = this && this.Z || 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 TreeContainer from "./Base";
|
||||
|
||||
import TreeIterator from "./Base/TreeIterator";
|
||||
|
||||
import { throwIteratorAccessError } from "../../utils/throwError";
|
||||
|
||||
var OrderedMapIterator = function(r) {
|
||||
__extends(OrderedMapIterator, r);
|
||||
function OrderedMapIterator() {
|
||||
return r !== null && r.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(OrderedMapIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
var r = this;
|
||||
return new Proxy([], {
|
||||
get: function(e, t) {
|
||||
if (t === "0") return r.o.p; else if (t === "1") return r.o.H;
|
||||
},
|
||||
set: function(e, t, n) {
|
||||
if (t !== "1") {
|
||||
throw new TypeError("props must be 1");
|
||||
}
|
||||
r.o.H = n;
|
||||
return true;
|
||||
}
|
||||
});
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
OrderedMapIterator.prototype.copy = function() {
|
||||
return new OrderedMapIterator(this.o, this.h, this.iteratorType);
|
||||
};
|
||||
return OrderedMapIterator;
|
||||
}(TreeIterator);
|
||||
|
||||
var OrderedMap = function(r) {
|
||||
__extends(OrderedMap, r);
|
||||
function OrderedMap(e, t, n) {
|
||||
if (e === void 0) {
|
||||
e = [];
|
||||
}
|
||||
var i = r.call(this, t, n) || this;
|
||||
var o = i;
|
||||
e.forEach((function(r) {
|
||||
o.setElement(r[0], r[1]);
|
||||
}));
|
||||
return i;
|
||||
}
|
||||
OrderedMap.prototype.rr = function(r) {
|
||||
return __generator(this, (function(e) {
|
||||
switch (e.label) {
|
||||
case 0:
|
||||
if (r === undefined) return [ 2 ];
|
||||
return [ 5, __values(this.rr(r.er)) ];
|
||||
|
||||
case 1:
|
||||
e.sent();
|
||||
return [ 4, [ r.p, r.H ] ];
|
||||
|
||||
case 2:
|
||||
e.sent();
|
||||
return [ 5, __values(this.rr(r.tr)) ];
|
||||
|
||||
case 3:
|
||||
e.sent();
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
};
|
||||
OrderedMap.prototype.begin = function() {
|
||||
return new OrderedMapIterator(this.h.er || this.h, this.h);
|
||||
};
|
||||
OrderedMap.prototype.end = function() {
|
||||
return new OrderedMapIterator(this.h, this.h);
|
||||
};
|
||||
OrderedMap.prototype.rBegin = function() {
|
||||
return new OrderedMapIterator(this.h.tr || this.h, this.h, 1);
|
||||
};
|
||||
OrderedMap.prototype.rEnd = function() {
|
||||
return new OrderedMapIterator(this.h, this.h, 1);
|
||||
};
|
||||
OrderedMap.prototype.front = function() {
|
||||
if (this.i === 0) return;
|
||||
var r = this.h.er;
|
||||
return [ r.p, r.H ];
|
||||
};
|
||||
OrderedMap.prototype.back = function() {
|
||||
if (this.i === 0) return;
|
||||
var r = this.h.tr;
|
||||
return [ r.p, r.H ];
|
||||
};
|
||||
OrderedMap.prototype.lowerBound = function(r) {
|
||||
var e = this.nr(this.ir, r);
|
||||
return new OrderedMapIterator(e, this.h);
|
||||
};
|
||||
OrderedMap.prototype.upperBound = function(r) {
|
||||
var e = this.ar(this.ir, r);
|
||||
return new OrderedMapIterator(e, this.h);
|
||||
};
|
||||
OrderedMap.prototype.reverseLowerBound = function(r) {
|
||||
var e = this.ur(this.ir, r);
|
||||
return new OrderedMapIterator(e, this.h);
|
||||
};
|
||||
OrderedMap.prototype.reverseUpperBound = function(r) {
|
||||
var e = this.sr(this.ir, r);
|
||||
return new OrderedMapIterator(e, this.h);
|
||||
};
|
||||
OrderedMap.prototype.setElement = function(r, e, t) {
|
||||
return this.v(r, e, t);
|
||||
};
|
||||
OrderedMap.prototype.find = function(r) {
|
||||
var e = this.g(this.ir, r);
|
||||
return new OrderedMapIterator(e, this.h);
|
||||
};
|
||||
OrderedMap.prototype.getElementByKey = function(r) {
|
||||
var e = this.g(this.ir, r);
|
||||
return e.H;
|
||||
};
|
||||
OrderedMap.prototype.union = function(r) {
|
||||
var e = this;
|
||||
r.forEach((function(r) {
|
||||
e.setElement(r[0], r[1]);
|
||||
}));
|
||||
return this.i;
|
||||
};
|
||||
OrderedMap.prototype[Symbol.iterator] = function() {
|
||||
return this.rr(this.ir);
|
||||
};
|
||||
return OrderedMap;
|
||||
}(TreeContainer);
|
||||
|
||||
export default OrderedMap;
|
||||
//# sourceMappingURL=OrderedMap.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedMap.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
51
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.d.ts
generated
vendored
Normal file
51
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.d.ts
generated
vendored
Normal file
|
|
@ -0,0 +1,51 @@
|
|||
import TreeContainer from './Base';
|
||||
import TreeIterator from './Base/TreeIterator';
|
||||
import { initContainer } from "../ContainerBase";
|
||||
declare class OrderedSetIterator<K> extends TreeIterator<K, undefined> {
|
||||
get pointer(): NonNullable<K>;
|
||||
copy(): OrderedSetIterator<K>;
|
||||
equals(iter: OrderedSetIterator<K>): boolean;
|
||||
}
|
||||
export type { OrderedSetIterator };
|
||||
declare class OrderedSet<K> extends TreeContainer<K, undefined> {
|
||||
/**
|
||||
* @param container - The initialization container.
|
||||
* @param cmp - The compare function.
|
||||
* @param enableIndex - Whether to enable iterator indexing function.
|
||||
* @example
|
||||
* new OrderedSet();
|
||||
* new OrderedSet([0, 1, 2]);
|
||||
* new OrderedSet([0, 1, 2], (x, y) => x - y);
|
||||
* new OrderedSet([0, 1, 2], (x, y) => x - y, true);
|
||||
*/
|
||||
constructor(container?: initContainer<K>, cmp?: (x: K, y: K) => number, enableIndex?: boolean);
|
||||
begin(): OrderedSetIterator<K>;
|
||||
end(): OrderedSetIterator<K>;
|
||||
rBegin(): OrderedSetIterator<K>;
|
||||
rEnd(): OrderedSetIterator<K>;
|
||||
front(): K | undefined;
|
||||
back(): K | undefined;
|
||||
/**
|
||||
* @description Insert element to set.
|
||||
* @param key - The key want to insert.
|
||||
* @param hint - You can give an iterator hint to improve insertion efficiency.
|
||||
* @return The size of container after setting.
|
||||
* @example
|
||||
* const st = new OrderedSet([2, 4, 5]);
|
||||
* const iter = st.begin();
|
||||
* st.insert(1);
|
||||
* st.insert(3, iter); // give a hint will be faster.
|
||||
*/
|
||||
insert(key: K, hint?: OrderedSetIterator<K>): number;
|
||||
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>): number;
|
||||
[Symbol.iterator](): Generator<K, void, unknown>;
|
||||
eraseElementByIterator(iter: OrderedSetIterator<K>): OrderedSetIterator<K>;
|
||||
forEach(callback: (element: K, index: number, tree: OrderedSet<K>) => void): void;
|
||||
getElementByPos(pos: number): K;
|
||||
}
|
||||
export default OrderedSet;
|
||||
243
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js
generated
vendored
Normal file
243
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js
generated
vendored
Normal file
|
|
@ -0,0 +1,243 @@
|
|||
var __extends = this && this.t || function() {
|
||||
var extendStatics = function(e, r) {
|
||||
extendStatics = Object.setPrototypeOf || {
|
||||
__proto__: []
|
||||
} instanceof Array && function(e, r) {
|
||||
e.__proto__ = r;
|
||||
} || function(e, r) {
|
||||
for (var t in r) if (Object.prototype.hasOwnProperty.call(r, t)) e[t] = r[t];
|
||||
};
|
||||
return extendStatics(e, r);
|
||||
};
|
||||
return function(e, r) {
|
||||
if (typeof r !== "function" && r !== null) throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
|
||||
extendStatics(e, r);
|
||||
function __() {
|
||||
this.constructor = e;
|
||||
}
|
||||
e.prototype = r === null ? Object.create(r) : (__.prototype = r.prototype, new __);
|
||||
};
|
||||
}();
|
||||
|
||||
var __generator = this && this.u || function(e, r) {
|
||||
var t = {
|
||||
label: 0,
|
||||
sent: function() {
|
||||
if (o[0] & 1) throw o[1];
|
||||
return o[1];
|
||||
},
|
||||
trys: [],
|
||||
ops: []
|
||||
}, n, i, o, u;
|
||||
return u = {
|
||||
next: verb(0),
|
||||
throw: verb(1),
|
||||
return: verb(2)
|
||||
}, typeof Symbol === "function" && (u[Symbol.iterator] = function() {
|
||||
return this;
|
||||
}), u;
|
||||
function verb(e) {
|
||||
return function(r) {
|
||||
return step([ e, r ]);
|
||||
};
|
||||
}
|
||||
function step(u) {
|
||||
if (n) throw new TypeError("Generator is already executing.");
|
||||
while (t) try {
|
||||
if (n = 1, i && (o = u[0] & 2 ? i["return"] : u[0] ? i["throw"] || ((o = i["return"]) && o.call(i),
|
||||
0) : i.next) && !(o = o.call(i, u[1])).done) return o;
|
||||
if (i = 0, o) u = [ u[0] & 2, o.value ];
|
||||
switch (u[0]) {
|
||||
case 0:
|
||||
case 1:
|
||||
o = u;
|
||||
break;
|
||||
|
||||
case 4:
|
||||
t.label++;
|
||||
return {
|
||||
value: u[1],
|
||||
done: false
|
||||
};
|
||||
|
||||
case 5:
|
||||
t.label++;
|
||||
i = u[1];
|
||||
u = [ 0 ];
|
||||
continue;
|
||||
|
||||
case 7:
|
||||
u = t.ops.pop();
|
||||
t.trys.pop();
|
||||
continue;
|
||||
|
||||
default:
|
||||
if (!(o = t.trys, o = o.length > 0 && o[o.length - 1]) && (u[0] === 6 || u[0] === 2)) {
|
||||
t = 0;
|
||||
continue;
|
||||
}
|
||||
if (u[0] === 3 && (!o || u[1] > o[0] && u[1] < o[3])) {
|
||||
t.label = u[1];
|
||||
break;
|
||||
}
|
||||
if (u[0] === 6 && t.label < o[1]) {
|
||||
t.label = o[1];
|
||||
o = u;
|
||||
break;
|
||||
}
|
||||
if (o && t.label < o[2]) {
|
||||
t.label = o[2];
|
||||
t.ops.push(u);
|
||||
break;
|
||||
}
|
||||
if (o[2]) t.ops.pop();
|
||||
t.trys.pop();
|
||||
continue;
|
||||
}
|
||||
u = r.call(e, t);
|
||||
} catch (e) {
|
||||
u = [ 6, e ];
|
||||
i = 0;
|
||||
} finally {
|
||||
n = o = 0;
|
||||
}
|
||||
if (u[0] & 5) throw u[1];
|
||||
return {
|
||||
value: u[0] ? u[1] : void 0,
|
||||
done: true
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
var __values = this && this.Z || function(e) {
|
||||
var r = typeof Symbol === "function" && Symbol.iterator, t = r && e[r], n = 0;
|
||||
if (t) return t.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(r ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
||||
};
|
||||
|
||||
import TreeContainer from "./Base";
|
||||
|
||||
import TreeIterator from "./Base/TreeIterator";
|
||||
|
||||
import { throwIteratorAccessError } from "../../utils/throwError";
|
||||
|
||||
var OrderedSetIterator = function(e) {
|
||||
__extends(OrderedSetIterator, e);
|
||||
function OrderedSetIterator() {
|
||||
return e !== null && e.apply(this, arguments) || this;
|
||||
}
|
||||
Object.defineProperty(OrderedSetIterator.prototype, "pointer", {
|
||||
get: function() {
|
||||
if (this.o === this.h) {
|
||||
throwIteratorAccessError();
|
||||
}
|
||||
return this.o.p;
|
||||
},
|
||||
enumerable: false,
|
||||
configurable: true
|
||||
});
|
||||
OrderedSetIterator.prototype.copy = function() {
|
||||
return new OrderedSetIterator(this.o, this.h, this.iteratorType);
|
||||
};
|
||||
return OrderedSetIterator;
|
||||
}(TreeIterator);
|
||||
|
||||
var OrderedSet = function(e) {
|
||||
__extends(OrderedSet, e);
|
||||
function OrderedSet(r, t, n) {
|
||||
if (r === void 0) {
|
||||
r = [];
|
||||
}
|
||||
var i = e.call(this, t, n) || this;
|
||||
var o = i;
|
||||
r.forEach((function(e) {
|
||||
o.insert(e);
|
||||
}));
|
||||
return i;
|
||||
}
|
||||
OrderedSet.prototype.rr = function(e) {
|
||||
return __generator(this, (function(r) {
|
||||
switch (r.label) {
|
||||
case 0:
|
||||
if (e === undefined) return [ 2 ];
|
||||
return [ 5, __values(this.rr(e.er)) ];
|
||||
|
||||
case 1:
|
||||
r.sent();
|
||||
return [ 4, e.p ];
|
||||
|
||||
case 2:
|
||||
r.sent();
|
||||
return [ 5, __values(this.rr(e.tr)) ];
|
||||
|
||||
case 3:
|
||||
r.sent();
|
||||
return [ 2 ];
|
||||
}
|
||||
}));
|
||||
};
|
||||
OrderedSet.prototype.begin = function() {
|
||||
return new OrderedSetIterator(this.h.er || this.h, this.h);
|
||||
};
|
||||
OrderedSet.prototype.end = function() {
|
||||
return new OrderedSetIterator(this.h, this.h);
|
||||
};
|
||||
OrderedSet.prototype.rBegin = function() {
|
||||
return new OrderedSetIterator(this.h.tr || this.h, this.h, 1);
|
||||
};
|
||||
OrderedSet.prototype.rEnd = function() {
|
||||
return new OrderedSetIterator(this.h, this.h, 1);
|
||||
};
|
||||
OrderedSet.prototype.front = function() {
|
||||
return this.h.er ? this.h.er.p : undefined;
|
||||
};
|
||||
OrderedSet.prototype.back = function() {
|
||||
return this.h.tr ? this.h.tr.p : undefined;
|
||||
};
|
||||
OrderedSet.prototype.insert = function(e, r) {
|
||||
return this.v(e, undefined, r);
|
||||
};
|
||||
OrderedSet.prototype.find = function(e) {
|
||||
var r = this.g(this.ir, e);
|
||||
return new OrderedSetIterator(r, this.h);
|
||||
};
|
||||
OrderedSet.prototype.lowerBound = function(e) {
|
||||
var r = this.nr(this.ir, e);
|
||||
return new OrderedSetIterator(r, this.h);
|
||||
};
|
||||
OrderedSet.prototype.upperBound = function(e) {
|
||||
var r = this.ar(this.ir, e);
|
||||
return new OrderedSetIterator(r, this.h);
|
||||
};
|
||||
OrderedSet.prototype.reverseLowerBound = function(e) {
|
||||
var r = this.ur(this.ir, e);
|
||||
return new OrderedSetIterator(r, this.h);
|
||||
};
|
||||
OrderedSet.prototype.reverseUpperBound = function(e) {
|
||||
var r = this.sr(this.ir, e);
|
||||
return new OrderedSetIterator(r, this.h);
|
||||
};
|
||||
OrderedSet.prototype.union = function(e) {
|
||||
var r = this;
|
||||
e.forEach((function(e) {
|
||||
r.insert(e);
|
||||
}));
|
||||
return this.i;
|
||||
};
|
||||
OrderedSet.prototype[Symbol.iterator] = function() {
|
||||
return this.rr(this.ir);
|
||||
};
|
||||
return OrderedSet;
|
||||
}(TreeContainer);
|
||||
|
||||
export default OrderedSet;
|
||||
//# sourceMappingURL=OrderedSet.js.map
|
||||
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js.map
generated
vendored
Normal file
1
node_modules/js-sdsl/dist/esm/container/TreeContainer/OrderedSet.js.map
generated
vendored
Normal file
File diff suppressed because one or more lines are too long
Loading…
Add table
Add a link
Reference in a new issue