Bump packages to fix linter

node_modules/js-sdsl/dist/cjs/container/SequentialContainer/Base/RandomIterator.d.ts

@@ -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;
+}

node_modules/js-sdsl/dist/cjs/container/SequentialContainer/Base/RandomIterator.js

@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "t", {
+    value: true
+});
+
+exports.RandomIterator = void 0;
+
+var _ContainerBase = require("../../ContainerBase");
+
+var _throwError = require("../../../utils/throwError");
+
+class RandomIterator extends _ContainerBase.ContainerIterator {
+    constructor(t, r, i, s, h) {
+        super(h);
+        this.o = t;
+        this.D = r;
+        this.R = i;
+        this.N = s;
+        if (this.iteratorType === 0) {
+            this.pre = function() {
+                if (this.o === 0) {
+                    (0, _throwError.throwIteratorAccessError)();
+                }
+                this.o -= 1;
+                return this;
+            };
+            this.next = function() {
+                if (this.o === this.D()) {
+                    (0, _throwError.throwIteratorAccessError)();
+                }
+                this.o += 1;
+                return this;
+            };
+        } else {
+            this.pre = function() {
+                if (this.o === this.D() - 1) {
+                    (0, _throwError.throwIteratorAccessError)();
+                }
+                this.o += 1;
+                return this;
+            };
+            this.next = function() {
+                if (this.o === -1) {
+                    (0, _throwError.throwIteratorAccessError)();
+                }
+                this.o -= 1;
+                return this;
+            };
+        }
+    }
+    get pointer() {
+        if (this.o < 0 || this.o > this.D() - 1) {
+            throw new RangeError;
+        }
+        return this.R(this.o);
+    }
+    set pointer(t) {
+        if (this.o < 0 || this.o > this.D() - 1) {
+            throw new RangeError;
+        }
+        this.N(this.o, t);
+    }
+}
+
+exports.RandomIterator = RandomIterator;
+//# sourceMappingURL=RandomIterator.js.map

node_modules/js-sdsl/dist/cjs/container/SequentialContainer/Base/index.d.ts

@@ -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;

node_modules/js-sdsl/dist/cjs/container/SequentialContainer/Base/index.js

@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "t", {
+    value: true
+});
+
+exports.default = void 0;
+
+var _ContainerBase = require("../../ContainerBase");
+
+class SequentialContainer extends _ContainerBase.Container {}
+
+var _default = SequentialContainer;
+
+exports.default = _default;
+//# sourceMappingURL=index.js.map

node_modules/js-sdsl/dist/cjs/container/SequentialContainer/Base/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["container/SequentialContainer/Base/index.js","../../src/container/SequentialContainer/Base/index.ts"],"names":["Object","defineProperty","exports","value","default","_ContainerBase","require","SequentialContainer","Container","_default"],"mappings":"AAAA;;AAEAA,OAAOC,eAAeC,SAAS,KAAc;IAC3CC,OAAO;;;AAETD,QAAQE,eAAe;;ACLvB,IAAAC,iBAAAC,QAAA;;AAEA,MAAeC,4BAA+BC,eAAAA;;AAgE7C,IAAAC,WAEcF;;AAAmBL,QAAAE,UAAAK","file":"index.js","sourcesContent":[null,"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"]}