data-structure-typed 2.5.3 → 2.6.1

package/src/data-structures/stack/stack.ts

@@ -5,7 +5,6 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-
 import type { ElementCallback, IterableElementBaseOptions, StackOptions } from '../../types';
 import { IterableElementBase } from '../base';
 
@@ -133,8 +132,6 @@ import { IterableElementBase } from '../base';
  *     console.log(stack.toArray()); // [1, 2, 3];
  */
 export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
-  protected _equals: (a: E, b: E) => boolean = (a, b) => Object.is(a, b);
-
   /**
    * Create a Stack and optionally bulk-push elements.
    * @remarks Time O(N), Space O(N)
@@ -142,7 +139,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [options] - Options such as toElementFn and equality function.
    * @returns New Stack instance.
    */
-
   constructor(elements: Iterable<E> | Iterable<R> = [], options?: StackOptions<E, R>) {
     super(options);
     this.pushMany(elements);
@@ -155,7 +151,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @remarks Time O(1), Space O(1)
    * @returns Internal elements array.
    */
-
   get elements(): E[] {
     return this._elements;
   }
@@ -164,49 +159,11 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Get the number of stored elements.
    * @remarks Time O(1), Space O(1)
    * @returns Current size.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Get number of elements
- *  const stack = new Stack<number>([1, 2, 3]);
- *     console.log(stack.size); // 3;
+   * @example
+   * // Get number of elements
+   *  const stack = new Stack<number>([1, 2, 3]);
+   *     console.log(stack.size); // 3;
    */
-
   get size(): number {
     return this.elements.length;
   }
@@ -221,7 +178,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [options] - Options forwarded to the constructor.
    * @returns A new Stack populated from the array.
    */
-
   static fromArray<E, R = any>(
     this: new (elements?: Iterable<E> | Iterable<R>, options?: StackOptions<E, R>) => any,
     elements: E[],
@@ -234,53 +190,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Check whether the stack is empty.
    * @remarks Time O(1), Space O(1)
    * @returns True if size is 0.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Check if stack has elements
- *  const stack = new Stack<number>();
- *     console.log(stack.isEmpty()); // true;
- *     stack.push(1);
- *     console.log(stack.isEmpty()); // false;
+   * @example
+   * // Check if stack has elements
+   *  const stack = new Stack<number>();
+   *     console.log(stack.isEmpty()); // true;
+   *     stack.push(1);
+   *     console.log(stack.isEmpty()); // false;
    */
-
   isEmpty(): boolean {
     return this.elements.length === 0;
   }
@@ -289,52 +205,12 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Get the top element without removing it.
    * @remarks Time O(1), Space O(1)
    * @returns Top element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // View the top element without removing it
- *  const stack = new Stack<string>(['a', 'b', 'c']);
- *     console.log(stack.peek()); // 'c';
- *     console.log(stack.size); // 3;
+   * @example
+   * // View the top element without removing it
+   *  const stack = new Stack<string>(['a', 'b', 'c']);
+   *     console.log(stack.peek()); // 'c';
+   *     console.log(stack.size); // 3;
    */
-
   peek(): E | undefined {
     return this.isEmpty() ? undefined : this.elements[this.elements.length - 1];
   }
@@ -344,61 +220,21 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @remarks Time O(1), Space O(1)
    * @param element - Element to push.
    * @returns True when pushed.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // basic Stack creation and push operation
- *  // Create a simple Stack with initial values
- *     const stack = new Stack([1, 2, 3, 4, 5]);
- *
- *     // Verify the stack maintains insertion order (LIFO will be shown in pop)
- *     console.log([...stack]); // [1, 2, 3, 4, 5];
- *
- *     // Check length
- *     console.log(stack.size); // 5;
- *
- *     // Push a new element to the top
- *     stack.push(6);
- *     console.log(stack.size); // 6;
+   * @example
+   * // basic Stack creation and push operation
+   *  // Create a simple Stack with initial values
+   *     const stack = new Stack([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the stack maintains insertion order (LIFO will be shown in pop)
+   *     console.log([...stack]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(stack.size); // 5;
+   *
+   *     // Push a new element to the top
+   *     stack.push(6);
+   *     console.log(stack.size); // 6;
    */
-
   push(element: E): boolean {
     this.elements.push(element);
     return true;
@@ -408,65 +244,25 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Pop and return the top element.
    * @remarks Time O(1), Space O(1)
    * @returns Removed element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Stack pop operation (LIFO - Last In First Out)
- *  const stack = new Stack<number>([10, 20, 30, 40, 50]);
- *
- *     // Peek at the top element without removing
- *     const top = stack.peek();
- *     console.log(top); // 50;
- *
- *     // Pop removes from the top (LIFO order)
- *     const popped = stack.pop();
- *     console.log(popped); // 50;
- *
- *     // Next pop gets the previous element
- *     const next = stack.pop();
- *     console.log(next); // 40;
- *
- *     // Verify length decreased
- *     console.log(stack.size); // 3;
+   * @example
+   * // Stack pop operation (LIFO - Last In First Out)
+   *  const stack = new Stack<number>([10, 20, 30, 40, 50]);
+   *
+   *     // Peek at the top element without removing
+   *     const top = stack.peek();
+   *     console.log(top); // 50;
+   *
+   *     // Pop removes from the top (LIFO order)
+   *     const popped = stack.pop();
+   *     console.log(popped); // 50;
+   *
+   *     // Next pop gets the previous element
+   *     const next = stack.pop();
+   *     console.log(next); // 40;
+   *
+   *     // Verify length decreased
+   *     console.log(stack.size); // 3;
    */
-
   pop(): E | undefined {
     return this.isEmpty() ? undefined : this.elements.pop();
   }
@@ -477,7 +273,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param elements - Iterable of elements (or raw records if toElementFn is set).
    * @returns Array of per-element success flags.
    */
-
   pushMany(elements: Iterable<E> | Iterable<R>): boolean[] {
     const ans: boolean[] = [];
     for (const el of elements) {
@@ -492,49 +287,12 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @remarks Time O(N), Space O(1)
    * @param element - Element to remove (using the configured equality).
    * @returns True if an element was removed.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove element
- *  const stack = new Stack<number>([1, 2, 3]);
- *     stack.delete(2);
- *     console.log(stack.toArray()); // [1, 3];
+   * @example
+   * // Remove element
+   *  const stack = new Stack<number>([1, 2, 3]);
+   *     stack.delete(2);
+   *     console.log(stack.toArray()); // [1, 3];
    */
-
   delete(element: E): boolean {
     const idx = this._indexOfByEquals(element);
     return this.deleteAt(idx) !== undefined;
@@ -546,7 +304,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param index - Zero-based index from the bottom.
    * @returns The removed element, or undefined if the index is out of range.
    */
-
   deleteAt(index: number): E | undefined {
     if (index < 0 || index >= this.elements.length) return undefined;
     const spliced = this.elements.splice(index, 1);
@@ -559,7 +316,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param predicate - Function (value, index, stack) → boolean to decide deletion.
    * @returns True if a match was removed.
    */
-
   deleteWhere(predicate: (value: E, index: number, stack: this) => boolean): boolean {
     for (let i = 0; i < this.elements.length; i++) {
       if (predicate(this.elements[i], i, this)) {
@@ -574,50 +330,12 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Remove all elements and reset storage.
    * @remarks Time O(1), Space O(1)
    * @returns void
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove all elements
- *  const stack = new Stack<number>([1, 2, 3]);
- *     stack.clear();
- *     console.log(stack.isEmpty()); // true;
+   * @example
+   * // Remove all elements
+   *  const stack = new Stack<number>([1, 2, 3]);
+   *     stack.clear();
+   *     console.log(stack.isEmpty()); // true;
    */
-
   clear(): void {
     this._elements = [];
   }
@@ -626,52 +344,14 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * Deep clone this stack.
    * @remarks Time O(N), Space O(N)
    * @returns A new stack with the same content.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Create independent copy
- *  const stack = new Stack<number>([1, 2, 3]);
- *     const copy = stack.clone();
- *     copy.pop();
- *     console.log(stack.size); // 3;
- *     console.log(copy.size); // 2;
+   * @example
+   * // Create independent copy
+   *  const stack = new Stack<number>([1, 2, 3]);
+   *     const copy = stack.clone();
+   *     copy.pop();
+   *     console.log(stack.size); // 3;
+   *     console.log(copy.size); // 2;
    */
-
   clone(): this {
     const out = this._createInstance({ toElementFn: this.toElementFn });
     for (const v of this) out.push(v);
@@ -684,50 +364,12 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param predicate - Predicate (value, index, stack) → boolean to keep value.
    * @param [thisArg] - Value for `this` inside the predicate.
    * @returns A new stack with kept values.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Filter elements
- *  const stack = new Stack<number>([1, 2, 3, 4, 5]);
- *     const evens = stack.filter(x => x % 2 === 0);
- *     console.log(evens.toArray()); // [2, 4];
+   * @example
+   * // Filter elements
+   *  const stack = new Stack<number>([1, 2, 3, 4, 5]);
+   *     const evens = stack.filter(x => x % 2 === 0);
+   *     console.log(evens.toArray()); // [2, 4];
    */
-
   filter(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): this {
     const out = this._createInstance({ toElementFn: this.toElementFn });
     let index = 0;
@@ -745,7 +387,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new stack with mapped values.
    */
-
   mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this {
     const out = this._createInstance({ toElementFn: this.toElementFn });
     let index = 0;
@@ -765,49 +406,12 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [options] - Options for the output stack (e.g., toElementFn).
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new Stack with mapped elements.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Transform elements
- *  const stack = new Stack<number>([1, 2, 3]);
- *     const doubled = stack.map(x => x * 2);
- *     console.log(doubled.toArray()); // [2, 4, 6];
+   * @example
+   * // Transform elements
+   *  const stack = new Stack<number>([1, 2, 3]);
+   *     const doubled = stack.map(x => x * 2);
+   *     console.log(doubled.toArray()); // [2, 4, 6];
    */
-
   map<EM, RM>(
     callback: ElementCallback<E, R, EM>,
     options?: IterableElementBaseOptions<EM, RM>,
@@ -828,19 +432,19 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param equals - Equality predicate (a, b) → boolean.
    * @returns This stack.
    */
-
   setEquality(equals: (a: E, b: E) => boolean): this {
     this._equals = equals;
     return this;
   }
 
+  protected _equals: (a: E, b: E) => boolean = (a, b) => Object.is(a, b);
+
   /**
    * (Protected) Find the index of a target element using the equality function.
    * @remarks Time O(N), Space O(1)
    * @param target - Element to search for.
    * @returns Index or -1 if not found.
    */
-
   protected _indexOfByEquals(target: E): number {
     for (let i = 0; i < this.elements.length; i++) if (this._equals(this.elements[i], target)) return i;
     return -1;
@@ -852,7 +456,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [options] - Options forwarded to the constructor.
    * @returns An empty like-kind stack instance.
    */
-
   protected _createInstance(options?: StackOptions<E, R>): this {
     const Ctor = this.constructor as new (elements?: Iterable<E> | Iterable<R>, options?: StackOptions<E, R>) => this;
     return new Ctor([], options);
@@ -867,7 +470,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @param [options] - Options forwarded to the constructor.
    * @returns A like-kind Stack instance.
    */
-
   protected _createLike<T = E, RR = R>(
     elements: Iterable<T> | Iterable<RR> = [],
     options?: StackOptions<T, RR>
@@ -884,7 +486,6 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    * @remarks Time O(N), Space O(1)
    * @returns Iterator of elements.
    */
-
   protected *_getIterator(): IterableIterator<E> {
     for (let i = 0; i < this.elements.length; i++) yield this.elements[i];
   }