data-structure-typed 1.47.5 → 1.47.6

package/dist/mjs/data-structures/linked-list/singly-linked-list.js

@@ -22,10 +22,14 @@ export class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    constructor() {
+    constructor(elements) {
         this._head = null;
         this._tail = null;
         this._length = 0;
+        if (elements) {
+            for (const el of elements)
+                this.push(el);
+        }
     }
     _head;
     get head() {
@@ -710,4 +714,7 @@ export class SinglyLinkedList {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
 }

package/dist/mjs/data-structures/priority-queue/max-priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { Comparator } from '../../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MaxPriorityQueue<E = any> extends PriorityQueue<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/mjs/data-structures/priority-queue/max-priority-queue.js

@@ -7,7 +7,7 @@
  */
 import { PriorityQueue } from './priority-queue';
 export class MaxPriorityQueue extends PriorityQueue {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -17,6 +17,6 @@ export class MaxPriorityQueue extends PriorityQueue {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }

package/dist/mjs/data-structures/priority-queue/min-priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { Comparator } from '../../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MinPriorityQueue<E = any> extends PriorityQueue<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/mjs/data-structures/priority-queue/min-priority-queue.js

@@ -7,7 +7,7 @@
  */
 import { PriorityQueue } from './priority-queue';
 export class MinPriorityQueue extends PriorityQueue {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -17,6 +17,6 @@ export class MinPriorityQueue extends PriorityQueue {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }

package/dist/mjs/data-structures/priority-queue/priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { Heap } from '../heap';
-import { Comparator } from '../../types';
+import { PriorityQueueOptions } from '../../types';
 export declare class PriorityQueue<E = any> extends Heap<E> {
-    constructor(options: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/mjs/data-structures/priority-queue/priority-queue.js

@@ -7,7 +7,7 @@
  */
 import { Heap } from '../heap';
 export class PriorityQueue extends Heap {
-    constructor(options) {
-        super(options);
+    constructor(elements, options) {
+        super(elements, options);
     }
 }

package/dist/mjs/data-structures/queue/deque.d.ts

@@ -428,6 +428,7 @@ export declare class Deque<E> {
      * applying the callback function to each element.
      */
     reduce<T>(callback: (accumulator: T, element: E, index: number, deque: this) => T, initialValue: T): T;
+    print(): void;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

package/dist/mjs/data-structures/queue/deque.js

@@ -759,6 +759,9 @@ export class Deque {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

package/dist/mjs/data-structures/queue/queue.d.ts

@@ -205,6 +205,7 @@ export declare class Queue<E = any> {
      * @returns The `clone()` method is returning a new instance of the `Queue` class.
      */
     clone(): Queue<E>;
+    print(): void;
     [Symbol.iterator](): Generator<E, void, unknown>;
     /**
      * Time Complexity: O(n)

package/dist/mjs/data-structures/queue/queue.js

@@ -262,6 +262,9 @@ export class Queue {
     clone() {
         return new Queue(this.nodes.slice(this.offset));
     }
+    print() {
+        console.log([...this]);
+    }
     *[Symbol.iterator]() {
         for (const item of this.nodes) {
             yield item;

package/dist/mjs/data-structures/stack/stack.d.ts

@@ -10,7 +10,7 @@ export declare class Stack<E = any> {
      * of elements of type `E`. It is used to initialize the `_elements` property of the class. If the `elements` parameter
      * is provided and is an array, it is assigned to the `_elements
      */
-    constructor(elements?: E[]);
+    constructor(elements?: Iterable<E>);
     protected _elements: E[];
     get elements(): E[];
     /**
@@ -116,4 +116,5 @@ export declare class Stack<E = any> {
     filter(predicate: (element: E, index: number, stack: this) => boolean): Stack<E>;
     map<T>(callback: (element: E, index: number, stack: this) => T): Stack<T>;
     reduce<T>(callback: (accumulator: T, element: E, index: number, stack: this) => T, initialValue: T): T;
+    print(): void;
 }

package/dist/mjs/data-structures/stack/stack.js

@@ -11,7 +11,12 @@ export class Stack {
      * is provided and is an array, it is assigned to the `_elements
      */
     constructor(elements) {
-        this._elements = Array.isArray(elements) ? elements : [];
+        this._elements = [];
+        if (elements) {
+            for (const el of elements) {
+                this.push(el);
+            }
+        }
     }
     _elements;
     get elements() {
@@ -135,7 +140,7 @@ export class Stack {
      * @returns An iterator object.
      */
     *[Symbol.iterator]() {
-        for (let i = this.elements.length - 1; i >= 0; i--) {
+        for (let i = 0; i < this.elements.length; i++) {
             yield this.elements[i];
         }
     }
@@ -179,4 +184,7 @@ export class Stack {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
 }

package/dist/mjs/interfaces/binary-tree.d.ts

@@ -1,7 +1,9 @@
 import { BinaryTree, BinaryTreeNode } from '../data-structures';
-import { BinaryTreeNested, BinaryTreeNodeNested, BiTreeDeleteResult, BTNCallback, BTNKey } from '../types';
+import { BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BiTreeDeleteResult, BTNCallback, BTNKey, IterableEntriesOrKeys } from '../types';
 export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>, TREE extends BinaryTree<V, N, TREE> = BinaryTreeNested<V, N>> {
     createNode(key: BTNKey, value?: N['value']): N;
+    createTree(options?: Partial<BinaryTreeOptions>): TREE;
+    init(elements: IterableEntriesOrKeys<V>): void;
     add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;
     delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BiTreeDeleteResult<N>[];
 }

package/dist/mjs/types/common.d.ts

@@ -1,3 +1,4 @@
+import { BTNKey } from "./data-structures";
 export type Comparator<T> = (a: T, b: T) => number;
 export type DFSOrderPattern = 'pre' | 'in' | 'post';
 export type BTNCallback<N, D = any> = (node: N) => D;
@@ -18,3 +19,4 @@ export type BinaryTreePrintOptions = {
     isShowNull?: boolean;
     isShowRedBlackNIL?: boolean;
 };
+export type IterableEntriesOrKeys<T> = Iterable<[BTNKey, T | undefined] | BTNKey>;

package/dist/mjs/types/data-structures/binary-tree/binary-tree.d.ts

@@ -26,6 +26,6 @@ export type BiTreeDeleteResult<N> = {
 export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeNested<T, N extends BinaryTreeNode<T, N>> = BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions = {
-    iterationType?: IterationType;
+    iterationType: IterationType;
 };
 export type NodeDisplayLayout = [string[], number, number, number];

package/dist/mjs/types/data-structures/binary-tree/bst.d.ts

@@ -1,8 +1,8 @@
 import { BST, BSTNode } from '../../../data-structures';
 import type { BinaryTreeOptions, BTNKey } from './binary-tree';
-export type BSTComparator = (a: BTNKey, b: BTNKey) => number;
+import { Comparator } from "../../common";
 export type BSTNodeNested<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BSTNested<T, N extends BSTNode<T, N>> = BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BSTOptions = BinaryTreeOptions & {
-    comparator?: BSTComparator;
+    comparator: Comparator<BTNKey>;
 };

package/dist/mjs/types/data-structures/heap/heap.d.ts

@@ -1 +1,4 @@
-export {};
+import { Comparator } from "../../common";
+export type HeapOptions<T> = {
+    comparator: Comparator<T>;
+};

package/dist/mjs/types/data-structures/priority-queue/priority-queue.d.ts

@@ -1 +1,2 @@
-export {};
+import { HeapOptions } from "../heap";
+export type PriorityQueueOptions<T> = HeapOptions<T> & {};