data-structure-typed 2.5.3 → 2.6.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "2.5.3",
+  "version": "2.6.1",
   "description": "Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.",
   "browser": "dist/umd/data-structure-typed.min.js",
   "umd:main": "dist/umd/data-structure-typed.min.js",
@@ -128,48 +128,6 @@
     "node": ">=12.20.0",
     "npm": ">=6.14.0"
   },
-  "scripts": {
-    "build": "npm run build:node && npm run build:types && npm run build:umd",
-    "build:node": "tsup",
-    "build:umd": "tsup --config tsup.umd.config.js",
-    "build:types": "rm -rf dist/types && tsc -p tsconfig.types.json",
-    "build:leetcode": "tsup --config tsup.leetcode.config.js",
-    "build:typedoc-plugin": "tsc scripts/typedoc-plugin-example-rewrite.ts --outDir scripts --esModuleInterop --module commonjs --target es2020 --moduleResolution node --skipLibCheck",
-    "gen:examples": "ts-node scripts/test-to-example.ts",
-    "generate:schema": "ts-node scripts/generate-schema.ts",
-    "test": "jest --runInBand",
-    "test:coverage": "jest --runInBand --coverage",
-    "test:integration": "npm run update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.test.ts && node test/integration/compile.mjs",
-    "test:perf": "npm run build && NODE_OPTIONS='--expose-gc --max-old-space-size=8192' node test/performance/benchmark-runner-enhanced.mjs",
-    "test:perf:report": "node test/performance/reportor-enhanced.mjs",
-    "check": "npm run check:src && npm run check:test",
-    "check:src": "tsc --noEmit",
-    "check:test": "tsc -p tsconfig.test.json --noEmit",
-    "check:circular-refs": "dependency-cruiser src",
-    "lint": "npm run lint:src && npm run lint:test",
-    "lint:src": "eslint --fix 'src/**/*.{js,ts}'",
-    "lint:test": "eslint --fix 'test/**/*.{js,ts}'",
-    "format": "npm run format:src && npm run format:test",
-    "format:src": "prettier --write 'src/**/*.{js,ts}'",
-    "format:test": "prettier --write 'test/**/*.{js,ts}'",
-    "inspect": "npm run build && npm run check && npm run lint",
-    "ci": "env && git fetch --tags && npm run update:subs && npm run inspect && npm run test:coverage && npm run changelog",
-    "docs:sync": "node scripts/sync-docs-to-site.mjs",
-    "docs:api": "npm run gen:examples && npm run build:typedoc-plugin && cd docs-site-docusaurus && npx typedoc --options typedoc.json && node sort-protected.mjs",
-    "docs:dev": "cd docs-site-docusaurus && npm run start",
-    "docs:build": "cd docs-site-docusaurus && rm -rf docs/api && npx typedoc --options typedoc.json && node sort-protected.mjs && npm run build",
-    "docs:preview": "cd docs-site-docusaurus && npm run serve",
-    "update:subs": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed data-structure-typed --save-dev",
-    "install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
-    "copy:to-subs": "sh scripts/copy_to_all_subs.sh",
-    "publish:subs": "npm run copy:to-subs && sh scripts/publish_all_subs.sh",
-    "publish:docs": "sh scripts/publish_docs.sh",
-    "publish:all": "npm run ci && npm publish && npm run publish:docs && npm run check:exist-latest && npm run publish:subs",
-    "check:exist-latest": "sh scripts/check_exist_remotely.sh",
-    "changelog": "auto-changelog",
-    "coverage:badge": "istanbul-badges-readme",
-    "toc": "doctoc README.md"
-  },
   "repository": {
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
@@ -194,11 +152,11 @@
     "@typescript-eslint/eslint-plugin": "^8.12.1",
     "@typescript-eslint/parser": "^8.12.1",
     "auto-changelog": "^2.5.0",
-    "avl-tree-typed": "^2.5.2",
+    "avl-tree-typed": "^2.5.3",
     "benchmark": "^2.1.4",
-    "binary-tree-typed": "^2.5.2",
-    "bst-typed": "^2.5.2",
-    "data-structure-typed": "^2.5.2",
+    "binary-tree-typed": "^2.5.3",
+    "bst-typed": "^2.5.3",
+    "data-structure-typed": "^2.5.3",
     "dependency-cruiser": "^16.5.0",
     "doctoc": "^2.2.1",
     "eslint": "^9.13.0",
@@ -207,7 +165,8 @@
     "eslint-import-resolver-typescript": "^3.6.3",
     "eslint-plugin-import": "^2.31.0",
     "fast-glob": "^3.3.2",
-    "heap-typed": "^2.5.2",
+    "heap-typed": "^2.5.3",
+    "husky": "^9.1.7",
     "istanbul-badges-readme": "^1.9.0",
     "jest": "^29.7.0",
     "js-sdsl": "^4.4.2",
@@ -288,5 +247,47 @@
     "UMD",
     "collection",
     "sorted collection"
-  ]
-}
+  ],
+  "scripts": {
+    "build": "pnpm build:node && pnpm build:types && pnpm build:umd",
+    "build:node": "tsup",
+    "build:umd": "tsup --config tsup.umd.config.js",
+    "build:types": "rm -rf dist/types && tsc -p tsconfig.types.json",
+    "build:leetcode": "tsup --config tsup.leetcode.config.js",
+    "build:typedoc-plugin": "tsc scripts/typedoc-plugin-example-rewrite.ts --outDir scripts --esModuleInterop --module commonjs --target es2020 --moduleResolution node --skipLibCheck",
+    "gen:examples": "ts-node scripts/test-to-example.ts",
+    "generate:schema": "ts-node scripts/generate-schema.ts",
+    "test": "jest --runInBand",
+    "test:coverage": "jest --runInBand --coverage",
+    "test:integration": "pnpm update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.test.ts && node test/integration/compile.mjs",
+    "test:perf": "pnpm build && NODE_OPTIONS='--expose-gc --max-old-space-size=8192' node test/performance/benchmark-runner-enhanced.mjs",
+    "test:perf:report": "node test/performance/reportor-enhanced.mjs",
+    "check": "pnpm check:src && pnpm check:test",
+    "check:src": "tsc --noEmit",
+    "check:test": "tsc -p tsconfig.test.json --noEmit",
+    "check:circular-refs": "dependency-cruiser src",
+    "lint": "pnpm lint:src && pnpm lint:test",
+    "lint:src": "eslint --fix 'src/**/*.{js,ts}'",
+    "lint:test": "eslint --fix 'test/**/*.{js,ts}'",
+    "format": "pnpm format:src && pnpm format:test",
+    "format:src": "prettier --write 'src/**/*.{js,ts}'",
+    "format:test": "prettier --write 'test/**/*.{js,ts}'",
+    "inspect": "pnpm build && pnpm check && pnpm lint",
+    "ci": "env && git fetch --tags && pnpm update:subs && pnpm inspect && pnpm test:coverage && pnpm changelog",
+    "docs:sync": "node scripts/sync-docs-to-site.mjs",
+    "docs:api": "pnpm gen:examples && pnpm build:typedoc-plugin && cd docs-site-docusaurus && npx typedoc --options typedoc.json && node sort-protected.mjs",
+    "docs:dev": "cd docs-site-docusaurus && pnpm start",
+    "docs:build": "cd docs-site-docusaurus && rm -rf docs/api && npx typedoc --options typedoc.json && node sort-protected.mjs && pnpm build",
+    "docs:preview": "cd docs-site-docusaurus && pnpm serve",
+    "update:subs": "pnpm add avl-tree-typed binary-tree-typed bst-typed heap-typed data-structure-typed --save-dev",
+    "install:all-subs": "pnpm add avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
+    "copy:to-subs": "sh scripts/copy_to_all_subs.sh",
+    "publish:subs": "pnpm copy:to-subs && sh scripts/publish_all_subs.sh",
+    "publish:docs": "sh scripts/publish_docs.sh",
+    "publish:all": "pnpm install --frozen-lockfile && pnpm publish && pnpm publish:docs && pnpm check:exist-latest && pnpm publish:subs",
+    "check:exist-latest": "sh scripts/check_exist_remotely.sh",
+    "changelog": "auto-changelog",
+    "coverage:badge": "istanbul-badges-readme",
+    "toc": "doctoc README.md"
+  }
+}

package/src/common/error.ts

@@ -5,10 +5,7 @@
  * @param ErrorClass - The error constructor (Error, TypeError, RangeError, etc.)
  * @param message - The error message.
  */
-export function raise(
-  ErrorClass: new (msg: string) => Error,
-  message: string
-): never {
+export function raise(ErrorClass: new (msg: string) => Error, message: string): never {
   throw new ErrorClass(message);
 }
 
@@ -21,56 +18,42 @@ export const ERR = {
   indexOutOfRange: (index: number, min: number, max: number, ctx?: string) =>
     `${ctx ? ctx + ': ' : ''}Index ${index} is out of range [${min}, ${max}].`,
 
-  invalidIndex: (ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}Index must be an integer.`,
+  invalidIndex: (ctx?: string) => `${ctx ? ctx + ': ' : ''}Index must be an integer.`,
 
   // Type / argument
-  invalidArgument: (reason: string, ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}${reason}`,
+  invalidArgument: (reason: string, ctx?: string) => `${ctx ? ctx + ': ' : ''}${reason}`,
 
   comparatorRequired: (ctx?: string) =>
     `${ctx ? ctx + ': ' : ''}Comparator is required for non-number/non-string/non-Date keys.`,
 
-  invalidKey: (reason: string, ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}${reason}`,
+  invalidKey: (reason: string, ctx?: string) => `${ctx ? ctx + ': ' : ''}${reason}`,
 
-  notAFunction: (name: string, ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}${name} must be a function.`,
+  notAFunction: (name: string, ctx?: string) => `${ctx ? ctx + ': ' : ''}${name} must be a function.`,
 
-  invalidEntry: (ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}Each entry must be a [key, value] tuple.`,
+  invalidEntry: (ctx?: string) => `${ctx ? ctx + ': ' : ''}Each entry must be a [key, value] tuple.`,
 
-  invalidNaN: (ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}NaN is not a valid key.`,
+  invalidNaN: (ctx?: string) => `${ctx ? ctx + ': ' : ''}NaN is not a valid key.`,
 
-  invalidDate: (ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}Invalid Date key.`,
+  invalidDate: (ctx?: string) => `${ctx ? ctx + ': ' : ''}Invalid Date key.`,
 
-  reduceEmpty: (ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}Reduce of empty structure with no initial value.`,
+  reduceEmpty: (ctx?: string) => `${ctx ? ctx + ': ' : ''}Reduce of empty structure with no initial value.`,
 
   callbackReturnType: (expected: string, got: string, ctx?: string) =>
     `${ctx ? ctx + ': ' : ''}Callback must return ${expected}; got ${got}.`,
 
   // State / operation
-  invalidOperation: (reason: string, ctx?: string) =>
-    `${ctx ? ctx + ': ' : ''}${reason}`,
+  invalidOperation: (reason: string, ctx?: string) => `${ctx ? ctx + ': ' : ''}${reason}`,
 
   // Matrix
-  matrixDimensionMismatch: (op: string) =>
-    `Matrix: Dimensions must be compatible for ${op}.`,
+  matrixDimensionMismatch: (op: string) => `Matrix: Dimensions must be compatible for ${op}.`,
 
-  matrixSingular: () =>
-    'Matrix: Singular matrix, inverse does not exist.',
+  matrixSingular: () => 'Matrix: Singular matrix, inverse does not exist.',
 
-  matrixNotSquare: () =>
-    'Matrix: Must be square for inversion.',
+  matrixNotSquare: () => 'Matrix: Must be square for inversion.',
 
-  matrixNotRectangular: () =>
-    'Matrix: Must be rectangular for transposition.',
+  matrixNotRectangular: () => 'Matrix: Must be rectangular for transposition.',
 
-  matrixRowMismatch: (expected: number, got: number) =>
-    `Matrix: Expected row length ${expected}, but got ${got}.`,
+  matrixRowMismatch: (expected: number, got: number) => `Matrix: Expected row length ${expected}, but got ${got}.`,
 
   // Order statistic
   orderStatisticNotEnabled: (method: string, ctx?: string) =>

package/src/common/index.ts

@@ -1,10 +1,8 @@
 export { ERR, raise } from './error';
-
 export enum DFSOperation {
   VISIT = 0,
   PROCESS = 1
 }
-
 export class Range<K> {
   constructor(
     public low: K,
@@ -15,7 +13,6 @@ export class Range<K> {
     // if (!(isComparable(low) && isComparable(high))) throw new RangeError('low or high is not comparable');
     // if (low > high) throw new RangeError('low must be less than or equal to high');
   }
-
   // Determine whether a key is within the range
   isInRange(key: K, comparator: (a: K, b: K) => number): boolean {
     const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;

package/src/data-structures/base/iterable-element-base.ts

@@ -162,7 +162,6 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
    */
   find<S extends E>(predicate: ElementCallback<E, R, S>, thisArg?: unknown): S | undefined;
   find(predicate: ElementCallback<E, R, unknown>, thisArg?: unknown): E | undefined;
-
   // Implementation signature
   find(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): E | undefined {
     let index = 0;
@@ -191,6 +190,38 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
     return false;
   }
 
+  /**
+   * Check whether a value exists (Array-compatible alias for `has`).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param element - Element to search for (uses `===`).
+   * @returns `true` if found.
+   */
+  includes(element: E): boolean {
+    return this.has(element);
+  }
+
+  /**
+   * Return an iterator of `[index, value]` pairs (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *entries(): IterableIterator<[number, E]> {
+    let index = 0;
+    for (const value of this) {
+      yield [index++, value];
+    }
+  }
+
+  /**
+   * Return an iterator of numeric indices (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *keys(): IterableIterator<number> {
+    let index = 0;
+    for (const _ of this) {
+      yield index++;
+    }
+  }
+
   reduce(callbackfn: ReduceElementCallback<E, R>): E;
   reduce(callbackfn: ReduceElementCallback<E, R>, initialValue: E): E;
   reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue: U): U;
@@ -220,7 +251,6 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
     let index = 0;
     const iter = this[Symbol.iterator]();
     let acc: U;
-
     if (arguments.length >= 2) {
       acc = initialValue as U;
     } else {
@@ -229,7 +259,6 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
       acc = first.value as unknown as U;
       index = 1;
     }
-
     for (const value of iter as unknown as Iterable<E>) {
       acc = callbackfn(acc, value, index++, this);
     }

package/src/data-structures/base/linear-base.ts

@@ -75,7 +75,7 @@ export abstract class LinearBase<
    * @param options - `{ maxLen?, ... }` bounds/behavior options.
    * @remarks Time O(1), Space O(1)
    */
-   constructor(options?: LinearBaseOptions<E, R>) {
+  constructor(options?: LinearBaseOptions<E, R>) {
     super(options);
     if (options) {
       const { maxLen } = options;
@@ -112,12 +112,10 @@ export abstract class LinearBase<
     if (this.length === 0) return -1;
     if (fromIndex < 0) fromIndex = this.length + fromIndex;
     if (fromIndex < 0) fromIndex = 0;
-
     for (let i = fromIndex; i < this.length; i++) {
       const element = this.at(i);
       if (element === searchElement) return i;
     }
-
     return -1;
   }
 
@@ -132,12 +130,10 @@ export abstract class LinearBase<
     if (this.length === 0) return -1;
     if (fromIndex >= this.length) fromIndex = this.length - 1;
     if (fromIndex < 0) fromIndex = this.length + fromIndex;
-
     for (let i = fromIndex; i >= 0; i--) {
       const element = this.at(i);
       if (element === searchElement) return i;
     }
-
     return -1;
   }
 
@@ -164,7 +160,6 @@ export abstract class LinearBase<
    */
   concat(...items: (E | this)[]): this {
     const newList = this.clone();
-
     for (const item of items) {
       if (item instanceof LinearBase) {
         newList.pushMany(item);
@@ -172,7 +167,6 @@ export abstract class LinearBase<
         newList.push(item);
       }
     }
-
     return newList;
   }
 
@@ -200,22 +194,18 @@ export abstract class LinearBase<
    */
   splice(start: number, deleteCount: number = 0, ...items: E[]): this {
     const removedList = this._createInstance();
-
     start = start < 0 ? this.length + start : start;
     start = Math.max(0, Math.min(start, this.length));
     deleteCount = Math.max(0, Math.min(deleteCount, this.length - start));
-
     for (let i = 0; i < deleteCount; i++) {
       const removed = this.deleteAt(start);
       if (removed !== undefined) {
         removedList.push(removed);
       }
     }
-
     for (let i = 0; i < items.length; i++) {
       this.addAt(start + i, items[i]);
     }
-
     return removedList;
   }
 
@@ -243,7 +233,6 @@ export abstract class LinearBase<
   }
 
   reduceRight(callbackfn: ReduceLinearCallback<E>): E;
-
   reduceRight(callbackfn: ReduceLinearCallback<E>, initialValue: E): E;
 
   /**
@@ -254,7 +243,6 @@ export abstract class LinearBase<
    * @remarks Time O(n), Space O(1)
    */
   reduceRight<U>(callbackfn: ReduceLinearCallback<E, U>, initialValue: U): U;
-
   reduceRight<U>(callbackfn: ReduceLinearCallback<E, U>, initialValue?: U): U {
     let accumulator = initialValue ?? (0 as U);
     for (let i = this.length - 1; i >= 0; i--) {
@@ -273,7 +261,6 @@ export abstract class LinearBase<
   slice(start: number = 0, end: number = this.length): this {
     start = start < 0 ? this.length + start : start;
     end = end < 0 ? this.length + end : end;
-
     const newList = this._createInstance();
     for (let i = start; i < end; i++) {
       newList.push(this.at(i)!);
@@ -292,15 +279,12 @@ export abstract class LinearBase<
   fill(value: E, start = 0, end = this.length): this {
     start = start < 0 ? this.length + start : start;
     end = end < 0 ? this.length + end : end;
-
     if (start < 0) start = 0;
     if (end > this.length) end = this.length;
     if (start >= end) return this;
-
     for (let i = start; i < end; i++) {
       this.setAt(i, value);
     }
-
     return this;
   }
 
@@ -327,6 +311,17 @@ export abstract class LinearBase<
    */
   abstract reverse(): this;
 
+  /**
+   * Return a new instance of the same type with elements in reverse order (non-mutating).
+   * @remarks Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+   * @returns A new reversed instance.
+   */
+  toReversed(): this {
+    const cloned = this.clone();
+    cloned.reverse();
+    return cloned as this;
+  }
+
   /**
    * Append one element or node to the tail.
    * @param elementOrNode - Element or node.
@@ -404,7 +399,7 @@ export abstract class LinearLinkedBase<
   R = any,
   NODE extends LinkedListNode<E> = LinkedListNode<E>
 > extends LinearBase<E, R, NODE> {
-   constructor(options?: LinearBaseOptions<E, R>) {
+  constructor(options?: LinearBaseOptions<E, R>) {
     super(options);
     if (options) {
       const { maxLen } = options;
@@ -422,19 +417,16 @@ export abstract class LinearLinkedBase<
   override indexOf(searchElement: E, fromIndex: number = 0): number {
     const iterator = this._getIterator();
     let current = iterator.next();
-
     let index = 0;
     while (index < fromIndex) {
       current = iterator.next();
       index++;
     }
-
     while (!current.done) {
       if (current.value === searchElement) return index;
       current = iterator.next();
       index++;
     }
-
     return -1;
   }
 
@@ -448,19 +440,16 @@ export abstract class LinearLinkedBase<
   override lastIndexOf(searchElement: E, fromIndex: number = this.length - 1): number {
     const iterator = this._getReverseIterator();
     let current = iterator.next();
-
     let index = this.length - 1;
     while (index > fromIndex) {
       current = iterator.next();
       index--;
     }
-
     while (!current.done) {
       if (current.value === searchElement) return index;
       current = iterator.next();
       index--;
     }
-
     return -1;
   }
 
@@ -472,7 +461,6 @@ export abstract class LinearLinkedBase<
    */
   override concat(...items: (E | LinearBase<E, R>)[]): this {
     const newList = this.clone();
-
     for (const item of items) {
       if (item instanceof LinearBase) {
         newList.pushMany(item);
@@ -480,7 +468,6 @@ export abstract class LinearLinkedBase<
         newList.push(item);
       }
     }
-
     return newList;
   }
 
@@ -494,7 +481,6 @@ export abstract class LinearLinkedBase<
   override slice(start: number = 0, end: number = this.length): this {
     start = start < 0 ? this.length + start : start;
     end = end < 0 ? this.length + end : end;
-
     const newList = this._createInstance();
     const iterator = this._getIterator();
     let current = iterator.next();
@@ -507,7 +493,6 @@ export abstract class LinearLinkedBase<
       newList.push(current.value);
       current = iterator.next();
     }
-
     return newList;
   }
 
@@ -521,15 +506,12 @@ export abstract class LinearLinkedBase<
    */
   override splice(start: number, deleteCount: number = 0, ...items: E[]): this {
     const removedList = this._createInstance();
-
     start = start < 0 ? this.length + start : start;
     start = Math.max(0, Math.min(start, this.length));
     deleteCount = Math.max(0, deleteCount);
-
     let currentIndex = 0;
     let currentNode: NODE | undefined = undefined;
     let previousNode: NODE | undefined = undefined;
-
     const iterator = this._getNodeIterator();
     for (const node of iterator) {
       if (currentIndex === start) {
@@ -539,14 +521,12 @@ export abstract class LinearLinkedBase<
       previousNode = node;
       currentIndex++;
     }
-
     for (let i = 0; i < deleteCount && currentNode; i++) {
       removedList.push(currentNode.value);
       const nextNode = currentNode.next;
       this.delete(currentNode);
       currentNode = nextNode as NODE;
     }
-
     for (let i = 0; i < items.length; i++) {
       if (previousNode) {
         this.addAfter(previousNode, items[i]);
@@ -556,12 +536,10 @@ export abstract class LinearLinkedBase<
         previousNode = this._getNodeIterator().next().value;
       }
     }
-
     return removedList;
   }
 
   override reduceRight(callbackfn: ReduceLinearCallback<E>): E;
-
   override reduceRight(callbackfn: ReduceLinearCallback<E>, initialValue: E): E;
 
   /**
@@ -572,7 +550,6 @@ export abstract class LinearLinkedBase<
    * @remarks Time O(n), Space O(1)
    */
   override reduceRight<U>(callbackfn: ReduceLinearCallback<E, U>, initialValue: U): U;
-
   override reduceRight<U>(callbackfn: ReduceLinearCallback<E, U>, initialValue?: U): U {
     let accumulator = initialValue ?? (0 as U);
     let index = this.length - 1;