data-structure-typed 2.6.0 → 2.6.1

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;
@@ -252,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 {
@@ -261,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;
   }
 
@@ -415,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;
@@ -433,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;
   }
 
@@ -459,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;
   }
 
@@ -483,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);
@@ -491,7 +468,6 @@ export abstract class LinearLinkedBase<
         newList.push(item);
       }
     }
-
     return newList;
   }
 
@@ -505,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();
@@ -518,7 +493,6 @@ export abstract class LinearLinkedBase<
       newList.push(current.value);
       current = iterator.next();
     }
-
     return newList;
   }
 
@@ -532,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) {
@@ -550,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]);
@@ -567,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;
 
   /**
@@ -583,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;