tree-multimap-typed 2.4.4 → 2.4.5

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

@@ -0,0 +1,23 @@
+/**
+ * Centralized error message templates.
+ * Keep using native Error/TypeError/RangeError — this only standardizes messages.
+ */
+export declare const ERR: {
+    readonly indexOutOfRange: (index: number, min: number, max: number, ctx?: string) => string;
+    readonly invalidIndex: (ctx?: string) => string;
+    readonly invalidArgument: (reason: string, ctx?: string) => string;
+    readonly comparatorRequired: (ctx?: string) => string;
+    readonly invalidKey: (reason: string, ctx?: string) => string;
+    readonly notAFunction: (name: string, ctx?: string) => string;
+    readonly invalidEntry: (ctx?: string) => string;
+    readonly invalidNaN: (ctx?: string) => string;
+    readonly invalidDate: (ctx?: string) => string;
+    readonly reduceEmpty: (ctx?: string) => string;
+    readonly callbackReturnType: (expected: string, got: string, ctx?: string) => string;
+    readonly invalidOperation: (reason: string, ctx?: string) => string;
+    readonly matrixDimensionMismatch: (op: string) => string;
+    readonly matrixSingular: () => string;
+    readonly matrixNotSquare: () => string;
+    readonly matrixNotRectangular: () => string;
+    readonly matrixRowMismatch: (expected: number, got: number) => string;
+};

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

@@ -1,3 +1,4 @@
+export { ERR } from './error';
 export declare enum DFSOperation {
     VISIT = 0,
     PROCESS = 1

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

@@ -735,6 +735,16 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns Layout information for this subtree.
      */
     protected _displayAux(node: BinaryTreeNode<K, V> | null | undefined, options: BinaryTreePrintOptions): NodeDisplayLayout;
+    protected static _buildNodeDisplay(line: string, width: number, left: NodeDisplayLayout, right: NodeDisplayLayout): NodeDisplayLayout;
+    /**
+     * Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
+     */
+    protected _isDisplayLeaf(node: BinaryTreeNode<K, V> | null | undefined, options: BinaryTreePrintOptions): boolean;
+    protected _hasDisplayableChild(child: BinaryTreeNode<K, V> | null | undefined, options: BinaryTreePrintOptions): boolean;
+    /**
+     * Resolve a display leaf node to its layout.
+     */
+    protected _resolveDisplayLeaf(node: BinaryTreeNode<K, V> | null | undefined, options: BinaryTreePrintOptions, emptyDisplayLayout: NodeDisplayLayout): NodeDisplayLayout;
     /**
      * (Protected) Swaps the key/value properties of two nodes.
      * @remarks Time O(1)

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeDeleteResult, BTNRep, CRUD, EntryCallback, FamilyPosition, NodePredicate, RBTNColor, RedBlackTreeOptions } from '../../types';
+import type { BinaryTreeDeleteResult, BTNRep, CRUD, EntryCallback, FamilyPosition, NodePredicate, RBTNColor, IterationType, RedBlackTreeOptions } from '../../types';
 import { BST } from './bst';
 import { IBinaryTree } from '../../interfaces';
 export declare class RedBlackTreeNode<K = any, V = any> {
@@ -375,6 +375,12 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      * @param [thisArg] - See parameter type for details.
      * @returns A new RedBlackTree with mapped entries.
      */
+    /**
+     * Red-Black trees are self-balancing — `perfectlyBalance` rebuilds via
+     * sorted bulk insert, which naturally produces a balanced RBT.
+     * @remarks Time O(N), Space O(N)
+     */
+    perfectlyBalance(iterationType?: IterationType): boolean;
     map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<RedBlackTreeOptions<MK, MV, MR>>, thisArg?: unknown): RedBlackTree<MK, MV, MR>;
     /**
      * (Internal) Create an empty instance of the same concrete tree type.

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

@@ -337,4 +337,48 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @remarks Time O(1), Space O(1)
      */
     protected _getVertexKey(vertexOrKey: VO | VertexKey): VertexKey;
+    /**
+     * The edge connector string used in visual output.
+     * Override in subclasses (e.g., '--' for undirected, '->' for directed).
+     */
+    protected get _edgeConnector(): string;
+    /**
+     * Generate a text-based visual representation of the graph.
+     *
+     * **Adjacency list format:**
+     * ```
+     * Graph (5 vertices, 6 edges):
+     * A -> B (1), C (2)
+     * B -> D (3)
+     * C -> (no outgoing edges)
+     * D -> A (1)
+     * E (isolated)
+     * ```
+     *
+     * @param options - Optional display settings.
+     * @param options.showWeight - Whether to show edge weights (default: true).
+     * @returns The visual string.
+     */
+    toVisual(options?: {
+        showWeight?: boolean;
+    }): string;
+    /**
+     * Generate DOT language representation for Graphviz.
+     *
+     * @param options - Optional display settings.
+     * @param options.name - Graph name (default: 'G').
+     * @param options.showWeight - Whether to label edges with weight (default: true).
+     * @returns DOT format string.
+     */
+    toDot(options?: {
+        name?: string;
+        showWeight?: boolean;
+    }): string;
+    /**
+     * Print the graph to console.
+     * @param options - Display settings passed to `toVisual`.
+     */
+    print(options?: {
+        showWeight?: boolean;
+    }): void;
 }

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

@@ -157,6 +157,7 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @remarks Time O(1), Space O(1)
      */
     constructor(options?: Partial<GraphOptions<V>>);
+    protected get _edgeConnector(): string;
     protected _outEdgeMap: Map<VO, EO[]>;
     get outEdgeMap(): Map<VO, EO[]>;
     set outEdgeMap(v: Map<VO, EO[]>);

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

@@ -313,6 +313,20 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
         bridges: EO[];
         cutVertices: VO[];
     };
+    /**
+     * Find biconnected components using edge-stack Tarjan variant.
+     * A biconnected component is a maximal biconnected subgraph.
+     * @returns Array of edge arrays, each representing a biconnected component.
+     * @remarks Time O(V + E), Space O(V + E)
+     */
+    getBiconnectedComponents(): EO[][];
+    /**
+     * Detect whether the graph contains a cycle.
+     * Uses DFS with parent tracking.
+     * @returns `true` if a cycle exists, `false` otherwise.
+     * @remarks Time O(V + E), Space O(V)
+     */
+    hasCycle(): boolean;
     /**
      * Get bridges discovered by `tarjan()`.
      * @returns Array of edges that are bridges.

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

@@ -143,7 +143,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      * @param [options] - Options such as bucketSize, toElementFn, and maxLen.
      * @returns New Deque instance.
      */
-    constructor(elements?: IterableWithSizeOrLength<E> | IterableWithSizeOrLength<R>, options?: DequeOptions<E, R>);
+    constructor(elements?: IterableWithSizeOrLength<E>, options?: DequeOptions<E, R>);
+    constructor(elements: IterableWithSizeOrLength<R>, options: DequeOptions<E, R> & {
+        toElementFn: (rawElement: R) => E;
+    });
     protected _bucketSize: number;
     /**
      * Get the current bucket size.
@@ -151,6 +154,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      * @returns Bucket capacity per bucket.
      */
     get bucketSize(): number;
+    protected _autoCompactRatio: number;
+    /**
+     * Get the auto-compaction ratio.
+     * When `elements / (bucketCount * bucketSize)` drops below this ratio after
+     * enough shift/pop operations, the deque auto-compacts.
+     * @remarks Time O(1), Space O(1)
+     * @returns Current ratio threshold. 0 means auto-compact is disabled.
+     */
+    get autoCompactRatio(): number;
+    /**
+     * Set the auto-compaction ratio.
+     * @remarks Time O(1), Space O(1)
+     * @param value - Ratio in [0,1]. 0 disables auto-compact.
+     */
+    set autoCompactRatio(value: number);
+    /**
+     * Counter for shift/pop operations since last compaction check.
+     * Only checks ratio every `_bucketSize` operations to minimize overhead.
+     */
+    protected _compactCounter: number;
     protected _bucketFirst: number;
     /**
      * Get the index of the first bucket in use.
@@ -369,6 +392,23 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      * @remarks Time O(N), Space O(1)
      * @returns void
      */
+    /**
+     * (Protected) Trigger auto-compaction if space utilization drops below threshold.
+     * Only checks every `_bucketSize` operations to minimize hot-path overhead.
+     * Uses element-based ratio: `elements / (bucketCount * bucketSize)`.
+     */
+    protected _autoCompact(): void;
+    /**
+     * Compact the deque by removing unused buckets.
+     * @remarks Time O(N), Space O(1)
+     * @returns True if compaction was performed (bucket count reduced).
+     */
+    /**
+     * Compact the deque by removing unused buckets.
+     * @remarks Time O(N), Space O(1)
+     * @returns True if compaction was performed (bucket count reduced).
+     */
+    compact(): boolean;
     shrinkToFit(): void;
     /**
      * Deep clone this deque, preserving options.

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

@@ -1,4 +1,10 @@
 import { LinearBaseOptions } from '../base';
 export type DequeOptions<E, R> = {
     bucketSize?: number;
+    /**
+     * When the ratio of used buckets to total buckets falls below this threshold
+     * after a shift/pop, auto-compact is triggered. Set to 0 to disable.
+     * Default: 0.5 (compact when less than half the buckets are in use).
+     */
+    autoCompactRatio?: number;
 } & LinearBaseOptions<E, R>;