undirected-graph-typed 2.4.2 → 2.4.4

package/dist/types/data-structures/base/iterable-element-base.d.ts

@@ -27,7 +27,7 @@ export declare abstract class IterableElementBase<E, R> implements Iterable<E> {
      * @remarks
      * Time O(1), Space O(1).
      */
-    protected _toElementFn?: (rawElement: R) => E;
+    protected readonly _toElementFn?: (rawElement: R) => E;
     /**
      * Exposes the current `toElementFn`, if configured.
      *

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

@@ -275,7 +275,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @param [options] - Configuration options for the tree.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, options?: BinaryTreeOptions<K, V, R>);
-    protected _isMapMode: boolean;
+    protected readonly _isMapMode: boolean;
     /**
      * Gets whether the tree is in Map mode.
      * @remarks In Map mode (default), values are stored in an external Map, and nodes only hold keys. If false, values are stored directly on the nodes. Time O(1)
@@ -283,7 +283,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns True if in Map mode, false otherwise.
      */
     get isMapMode(): boolean;
-    protected _isDuplicate: boolean;
+    protected readonly _isDuplicate: boolean;
     /**
      * Gets whether the tree allows duplicate keys.
      * @remarks Time O(1)
@@ -315,7 +315,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns The size of the tree.
      */
     get size(): number;
-    protected _NIL: BinaryTreeNode<K, V>;
+    protected readonly _NIL: BinaryTreeNode<K, V>;
     /**
      * Gets the sentinel NIL node (used in self-balancing trees like Red-Black Tree).
      * @remarks Time O(1)
@@ -323,7 +323,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns The NIL node.
      */
     get NIL(): BinaryTreeNode<K, V>;
-    protected _toEntryFn?: ToEntryFn<K, V, R>;
+    protected readonly _toEntryFn?: ToEntryFn<K, V, R>;
     /**
      * Gets the function used to convert raw data objects (R) into [key, value] entries.
      * @remarks Time O(1)
@@ -682,7 +682,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @param node - The node.
      * @returns The node's key or undefined.
      */
-    protected _DEFAULT_NODE_CALLBACK: (node: BinaryTreeNode<K, V> | null | undefined) => K | undefined;
+    protected readonly _DEFAULT_NODE_CALLBACK: NodeCallback<BinaryTreeNode<K, V> | null | undefined, K | undefined>;
     /**
      * (Protected) Snapshots the current tree's configuration options.
      * @remarks Time O(1)

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

@@ -294,7 +294,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
   
      * @remarks Time O(1) Space O(1)
      */
-    protected _comparator: Comparator<K>;
+    protected readonly _comparator: Comparator<K>;
     /**
      * Gets the comparator function used by the tree.
      * @remarks Time O(1)

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

@@ -185,4 +185,14 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      * @param options Inclusive/exclusive bounds (defaults to inclusive).
      */
     rangeSearch(range: [K, K], options?: TreeMapRangeOptions): Array<[K, V | undefined]>;
+    /**
+     * Creates a shallow clone of this map.
+     * @remarks Time O(n log n), Space O(n)
+     * @example
+     * const original = new TreeMap([['a', 1], ['b', 2]]);
+     * const copy = original.clone();
+     * copy.set('c', 3);
+     * original.has('c'); // false (original unchanged)
+     */
+    clone(): TreeMap<K, V>;
 }

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

@@ -178,4 +178,14 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      * @param options Inclusive/exclusive bounds (defaults to inclusive).
      */
     rangeSearch(range: [K, K], options?: TreeSetRangeOptions): K[];
+    /**
+     * Creates a shallow clone of this set.
+     * @remarks Time O(n log n), Space O(n)
+     * @example
+     * const original = new TreeSet([1, 2, 3]);
+     * const copy = original.clone();
+     * copy.add(4);
+     * original.has(4); // false (original unchanged)
+     */
+    clone(): TreeSet<K>;
 }

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -170,7 +170,7 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns DirectedGraph with all keys added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromKeys<K extends VertexKey>(keys: Iterable<K>): DirectedGraph<K, any, DirectedVertex<K>, DirectedEdge<any>>;
+    static fromKeys<K extends VertexKey>(keys: Iterable<K>): DirectedGraph<K, undefined, DirectedVertex<K>, DirectedEdge<undefined>>;
     /**
      * Construct a directed graph from `[key, value]` entries.
      * @template V - Vertex value type.
@@ -178,7 +178,7 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns DirectedGraph with all vertices added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): DirectedGraph<V, any, DirectedVertex<V>, DirectedEdge<any>>;
+    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): DirectedGraph<V, undefined, DirectedVertex<V>, DirectedEdge<undefined>>;
     /**
      * Create a directed vertex instance. Does not insert into the graph.
      * @param key - Vertex identifier.

package/dist/types/data-structures/graph/undirected-graph.d.ts

@@ -200,7 +200,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns UndirectedGraph with all keys added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromKeys<K extends VertexKey>(keys: Iterable<K>): UndirectedGraph<K, any, UndirectedVertex<K>, UndirectedEdge<any>>;
+    static fromKeys<K extends VertexKey>(keys: Iterable<K>): UndirectedGraph<K, undefined, UndirectedVertex<K>, UndirectedEdge<undefined>>;
     /**
      * Construct an undirected graph from `[key, value]` entries.
      * @template V - Vertex value type.
@@ -208,7 +208,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns UndirectedGraph with all vertices added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): UndirectedGraph<V, any, UndirectedVertex<V>, UndirectedEdge<any>>;
+    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): UndirectedGraph<V, undefined, UndirectedVertex<V>, UndirectedEdge<undefined>>;
     /**
      * Create an undirected vertex instance. Does not insert into the graph.
      * @param key - Vertex identifier.

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -175,7 +175,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @returns Map of object→value.
      */
     get objMap(): Map<object, V>;
-    protected _toEntryFn?: (rawElement: R) => [K, V];
+    protected readonly _toEntryFn?: (rawElement: R) => [K, V];
     /**
      * Get the raw→entry converter function if present.
      * @remarks Time O(1), Space O(1)
@@ -346,7 +346,7 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns Tail node or sentinel.
      */
     get tail(): HashMapLinkedNode<K, V | undefined>;
-    protected _toEntryFn?: (rawElement: R) => [K, V];
+    protected readonly _toEntryFn?: (rawElement: R) => [K, V];
     get toEntryFn(): ((rawElement: R) => [K, V]) | undefined;
     protected _size: number;
     get size(): number;

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

@@ -414,12 +414,8 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @returns A new heap with mapped elements.
      */
     mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;
-    protected _DEFAULT_COMPARATOR: (a: E, b: E) => number;
-    protected _comparator: Comparator<E>; /**
-     * Get the comparator used to order elements.
-     * @remarks Time O(1), Space O(1)
-     * @returns Comparator function.
-     */
+    protected readonly _DEFAULT_COMPARATOR: Comparator<E>;
+    protected readonly _comparator: Comparator<E>;
     /**
      * Get the comparator used to order elements.
      * @remarks Time O(1), Space O(1)
@@ -501,7 +497,7 @@ export declare class FibonacciHeap<E> {
      * @returns Min node or undefined.
      */
     get min(): FibonacciHeapNode<E> | undefined;
-    protected _comparator: Comparator<E>;
+    protected readonly _comparator: Comparator<E>;
     get comparator(): Comparator<E>;
     clear(): void;
     add(element: E): boolean;

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

@@ -1,2 +1,2 @@
 import { BSTOptions } from './bst';
-export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R>;

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

@@ -1,3 +1,3 @@
 import type { BSTOptions } from './bst';
 export type RBTNColor = 'RED' | 'BLACK';
-export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R>;

package/dist/types/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

package/dist/types/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

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

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

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

@@ -1,2 +1,2 @@
 import { IterableElementBaseOptions } from '../base';
-export type StackOptions<E, R> = IterableElementBaseOptions<E, R> & {};
+export type StackOptions<E, R> = IterableElementBaseOptions<E, R>;

package/dist/umd/undirected-graph-typed.js

@@ -800,11 +800,6 @@ var undirectedGraphTyped = (() => {
       }
       return out;
     }
-    /**
-    * Get the comparator used to order elements.
-    * @remarks Time O(1), Space O(1)
-    * @returns Comparator function.
-    */
     /**
      * Get the comparator used to order elements.
      * @remarks Time O(1), Space O(1)
@@ -853,8 +848,7 @@ var undirectedGraphTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
-      return next;
+      return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance seeded by elements.
@@ -2182,8 +2176,8 @@ var undirectedGraphTyped = (() => {
       const Ctor = this.constructor;
       const instance = new Ctor();
       const graph = _options == null ? void 0 : _options.graph;
-      if (graph) instance._options = { ...instance._options, ...graph };
-      else instance._options = { ...instance._options, ...this._options };
+      if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+      else instance["_options"] = { ...instance["_options"], ...this._options };
       return instance;
     }
     /**
@@ -2216,12 +2210,10 @@ var undirectedGraphTyped = (() => {
         const [va, vb] = ends;
         const ka = va.key;
         const kb = vb.key;
-        const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-        const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+        const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+        const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
         if (hasA && hasB) {
-          const w = e.weight;
-          const val = e.value;
-          const newEdge = g.createEdge(ka, kb, w, val);
+          const newEdge = g.createEdge(ka, kb, e.weight, e.value);
           g._addEdge(newEdge);
         }
       }