@danielsimonjr/mathts-functions 0.35.0 → 0.36.0

package/dist/geometry/geometry-extra.d.ts

@@ -0,0 +1,109 @@
+type Quat = readonly [number, number, number, number] | readonly number[];
+/**
+ * Multiplicative inverse of a quaternion: `conj(q) / |q|²`. For unit
+ * quaternions this equals the conjugate.
+ *
+ * @example
+ * quaternionInverse([0, 1, 0, 0])  // [0, -1, 0, 0]
+ */
+export declare function quaternionInverse(q: Quat): number[];
+/**
+ * Spherical linear interpolation between two (unit) quaternions, `t ∈ [0,1]`.
+ * Chooses the shortest arc (negating `q2` when the dot product is negative)
+ * and falls back to normalized linear interpolation (nlerp) when the inputs
+ * are nearly parallel, where the slerp coefficients become numerically
+ * unstable.
+ *
+ * @example
+ * quaternionSlerp([1,0,0,0], [0,1,0,0], 0)    // [1,0,0,0]
+ * quaternionSlerp([1,0,0,0], [0,1,0,0], 1)    // [0,1,0,0]
+ */
+export declare function quaternionSlerp(q1: Quat, q2: Quat, t: number): number[];
+/**
+ * Convert a (unit) quaternion `[w, x, y, z]` to ZYX intrinsic Euler angles
+ * `[roll, pitch, yaw]` in radians (the standard aerospace yaw-pitch-roll
+ * sequence). Pitch is clamped at the ±90° gimbal-lock singularity.
+ *
+ * @example
+ * quaternionToEuler([1, 0, 0, 0])  // [0, 0, 0]
+ */
+export declare function quaternionToEuler(q: Quat): [number, number, number];
+/**
+ * Axis-aligned bounding box (per-dimension min/max) of a set of nD points.
+ *
+ * @example
+ * boundingBox([[1,2],[3,0],[2,5]])  // { min: [1,0], max: [3,5] }
+ */
+export declare function boundingBox(points: number[][]): {
+    min: number[];
+    max: number[];
+};
+/** Result of {@link procrustes}: best-fit rotation, uniform scale, and residual. */
+export interface ProcrustesResult {
+    /** Orthogonal `d x d` rotation (or reflection) matrix. */
+    R: number[][];
+    /** Optimal uniform scale factor. */
+    scale: number;
+    /** Residual sum of squares after alignment (centered + unit-normalized inputs). */
+    disparity: number;
+}
+/**
+ * Orthogonal Procrustes alignment: find the rotation `R`, uniform scale
+ * `scale`, and residual `disparity` that best map `B` onto `A` after both are
+ * centered on their centroid and normalized to unit Frobenius norm.
+ *
+ * Algorithm: `A0`, `B0` = centered + unit-normalized `A`, `B`;
+ * `M = A0ᵀ B0 = U Σ Vᵀ` (SVD); `R = V Uᵀ` (minimizes `‖B0 R − A0‖`);
+ * `scale = Σ Σᵢ` (sum of singular values); `disparity = ‖A0 − scale·B0·R‖²`.
+ * Pinned against `scipy.spatial.procrustes` (disparity matches to float
+ * precision for both exact-rotation and unrelated-point-set inputs).
+ *
+ * @example
+ * procrustes([[0,0],[1,0],[0,1]], [[0,0],[0,1],[-1,0]])
+ * // R ~ 90° rotation, disparity ~ 0
+ */
+export declare function procrustes(A: number[][], B: number[][]): ProcrustesResult;
+/**
+ * Indices of the `k` nearest points to `query` (Euclidean distance,
+ * nearest-first). Brute-force — see `../ml/dbscan-knn.ts` for the same
+ * strategy used by the k-NN classifier/regressor.
+ *
+ * @example
+ * kdTreeKNN([[0,0],[1,0],[5,5]], [0,0], 2)  // [0, 1]
+ */
+export declare function kdTreeKNN(points: number[][], query: number[], k: number): number[];
+/**
+ * Indices of all points within Euclidean radius `r` of `query` (brute force).
+ *
+ * @example
+ * kdTreeRadius([[0,0],[1,0],[5,5]], [0,0], 2)  // [0, 1]
+ */
+export declare function kdTreeRadius(points: number[][], query: number[], r: number): number[];
+/**
+ * True when every element of `b` (with multiplicity) appears in `a` — i.e.
+ * `a` is a (multiset) superset of `b`. Complement of `setIsSubset`.
+ *
+ * @example
+ * setIsSuperset([1, 2, 3], [1, 2])  // true
+ * setIsSuperset([1, 2], [1, 2, 3])  // false
+ */
+export declare function setIsSuperset(a: unknown[], b: unknown[]): boolean;
+/**
+ * True when `a` and `b` are equal as multisets (same elements, same
+ * multiplicities, order-independent).
+ *
+ * @example
+ * setEqual([1, 2, 2], [2, 1, 2])  // true
+ * setEqual([1, 2], [1, 2, 2])     // false
+ */
+export declare function setEqual(a: unknown[], b: unknown[]): boolean;
+/**
+ * True when `a` and `b` share no elements (multiset intersection is empty).
+ *
+ * @example
+ * setDisjoint([1, 2], [3, 4])  // true
+ * setDisjoint([1, 2], [2, 3])  // false
+ */
+export declare function setDisjoint(a: unknown[], b: unknown[]): boolean;
+export {};
+//# sourceMappingURL=geometry-extra.d.ts.map

package/dist/geometry/geometry-extra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry-extra.d.ts","sourceRoot":"","sources":["../../src/geometry/geometry-extra.ts"],"names":[],"mappings":"AAcA,KAAK,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,MAAM,EAAE,CAAC;AAU1E;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,CAInD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAuBvE;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAOnE;AAMD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG;IAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,CAAA;CAAE,CAahF;AAMD,oFAAoF;AACpF,MAAM,WAAW,gBAAgB;IAC/B,0DAA0D;IAC1D,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACd,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,mFAAmF;IACnF,SAAS,EAAE,MAAM,CAAC;CACnB;AA6CD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,gBAAgB,CAyBzE;AAeD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAIlF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAMrF;AAoBD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,CAEjE;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,CAE5D;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,CAM/D"}

package/dist/graph/optimization.d.ts

@@ -0,0 +1,116 @@
+/**
+ * Graph Optimization — Max-Flow/Min-Cut, A* Search, Hungarian Assignment
+ *
+ * Complements the existing traversal/shortest-path/centrality graph
+ * functions (`typed/graph.ts`, `graph/traversal-centrality.ts`) with
+ * classic combinatorial-optimization algorithms:
+ *
+ * - `maxFlow` / `minCut`: Edmonds-Karp max-flow (BFS shortest-augmenting-path
+ *   on the residual graph) and the corresponding min-cut via the
+ *   max-flow-min-cut theorem.
+ * - `astar`: heuristic-guided shortest path on a weighted adjacency matrix;
+ *   reduces to Dijkstra when the heuristic is the zero function.
+ * - `hungarian`: Kuhn-Munkres optimal assignment minimizing total cost on a
+ *   square cost matrix.
+ *
+ * Input format: adjacency/capacity/cost matrices as `number[][]`, matching
+ * the convention used elsewhere in this directory.
+ *
+ * @packageDocumentation
+ */
+/** Result of `maxFlow`. */
+export interface MaxFlowResult {
+    /** Total maximum flow value from `source` to `sink`. */
+    maxFlow: number;
+    /** Flow matrix: `flow[i][j]` is the net flow sent along edge i -> j. */
+    flow: number[][];
+}
+/**
+ * Maximum flow from `source` to `sink` via the Edmonds-Karp algorithm
+ * (Ford-Fulkerson with BFS shortest-augmenting-path selection).
+ *
+ * Time complexity: O(V*E^2) (O(V^5) on a dense adjacency matrix).
+ *
+ * @param capacity - Capacity matrix (directed reading; `capacity[i][j]` is
+ *   the capacity of edge i -> j; 0 or negative means no edge)
+ * @param source - Source node index
+ * @param sink - Sink node index
+ * @returns `{ maxFlow, flow }`
+ *
+ * @example
+ * const cap = [[0,3,2,0],[0,0,1,2],[0,0,0,3],[0,0,0,0]];
+ * maxFlow(cap, 0, 3).maxFlow // => 5
+ */
+export declare function maxFlow(capacity: number[][], source: number, sink: number): MaxFlowResult;
+/** Result of `minCut`. */
+export interface MinCutResult {
+    /** Value of the minimum cut (equals the maximum flow value). */
+    value: number;
+    /** `[S, T]` partition: `S` reachable from `source` in the residual
+     * graph after saturating max-flow, `T` the rest. */
+    partition: [number[], number[]];
+}
+/**
+ * Minimum s-t cut, computed via the max-flow-min-cut theorem: run
+ * `maxFlow`, then BFS the residual graph from `source` — reachable nodes
+ * form the source-side partition `S`, the rest form `T`.
+ *
+ * @param capacity - Capacity matrix (directed reading)
+ * @param source - Source node index
+ * @param sink - Sink node index
+ * @returns `{ value, partition: [S, T] }`
+ *
+ * @example
+ * const cap = [[0,3,2,0],[0,0,1,2],[0,0,0,3],[0,0,0,0]];
+ * minCut(cap, 0, 3) // => { value: 5, partition: [[0, ...], [...]] }
+ */
+export declare function minCut(capacity: number[][], source: number, sink: number): MinCutResult;
+/** Result of `astar`. */
+export interface AStarResult {
+    /** Node sequence from `start` to `goal` (empty if unreachable). */
+    path: number[];
+    /** Total path cost (Infinity if unreachable). */
+    cost: number;
+}
+/**
+ * A* shortest path on a weighted adjacency matrix, guided by `heuristic`
+ * (an admissible estimate of the remaining cost to `goal`). With
+ * `heuristic = () => 0` this reduces to Dijkstra's algorithm.
+ *
+ * A directed edge i -> j exists when `adj[i][j]` is finite and nonzero.
+ *
+ * @param adj - Adjacency matrix (directed reading; edge weights should be
+ *   non-negative for optimality)
+ * @param start - Source node index
+ * @param goal - Target node index
+ * @param heuristic - `(node) => estimated cost from node to goal`
+ * @returns `{ path, cost }`; `{ path: [], cost: Infinity }` if unreachable
+ *
+ * @example
+ * const adj = [[0,1,4],[1,0,1],[4,1,0]];
+ * astar(adj, 0, 2, () => 0) // => { path: [0, 1, 2], cost: 2 }
+ */
+export declare function astar(adj: number[][], start: number, goal: number, heuristic: (node: number) => number): AStarResult;
+/** Result of `hungarian`. */
+export interface HungarianResult {
+    /** `assignment[i]` is the column assigned to row i. */
+    assignment: number[];
+    /** Total cost of the optimal assignment. */
+    cost: number;
+}
+/**
+ * Optimal assignment minimizing total cost, via the Kuhn-Munkres
+ * (Hungarian) algorithm on a square cost matrix. Uses the O(n^3)
+ * Jonker-Volgenant-style potential/shortest-augmenting-path formulation
+ * (1-indexed internally per the classical presentation).
+ *
+ * @param cost - Square cost matrix (`cost[i][j]` = cost of assigning row i
+ *   to column j)
+ * @returns `{ assignment, cost }`
+ *
+ * @example
+ * hungarian([[4,1,3],[2,0,5],[3,2,2]])
+ * // => { assignment: [1, 0, 2], cost: 5 } (scipy linear_sum_assignment)
+ */
+export declare function hungarian(cost: number[][]): HungarianResult;
+//# sourceMappingURL=optimization.d.ts.map

package/dist/graph/optimization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"optimization.d.ts","sourceRoot":"","sources":["../../src/graph/optimization.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAMH,2BAA2B;AAC3B,MAAM,WAAW,aAAa;IAC5B,wDAAwD;IACxD,OAAO,EAAE,MAAM,CAAC;IAChB,wEAAwE;IACxE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;CAClB;AA6BD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,aAAa,CAuCzF;AAED,0BAA0B;AAC1B,MAAM,WAAW,YAAY;IAC3B,gEAAgE;IAChE,KAAK,EAAE,MAAM,CAAC;IACd;wDACoD;IACpD,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;CACjC;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,YAAY,CAgCvF;AAMD,yBAAyB;AACzB,MAAM,WAAW,WAAW;IAC1B,mEAAmE;IACnE,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EAAE,EAAE,EACf,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAClC,WAAW,CAsDb;AAMD,6BAA6B;AAC7B,MAAM,WAAW,eAAe;IAC9B,uDAAuD;IACvD,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,eAAe,CAwE3D"}

package/dist/graph/traversal-centrality.d.ts

@@ -0,0 +1,147 @@
+/**
+ * Graph Traversal, All-Pairs Shortest Paths, and Distance-Based Centrality
+ *
+ * Complements the existing single-source Dijkstra `shortestPath` /
+ * `graphDistance` (see `../typed/graph.ts`) with:
+ *
+ * - `bfs` / `dfs`: visitation-order traversal (directed reading; neighbors
+ *   visited in ascending index order).
+ * - `floydWarshall`: all-pairs shortest-path distances (handles negative
+ *   edge weights, not negative cycles).
+ * - `bellmanFord`: single-source shortest paths, negative-weight-aware,
+ *   with negative-cycle detection.
+ * - `closenessCentrality` / `harmonicCentrality`: distance-based centrality
+ *   measures (networkx-compatible conventions), built on `floydWarshall`.
+ *
+ * Input format: adjacency matrix as `number[][]` where `adj[i][j]` is the
+ * weight of the directed edge i -> j.  Both `Infinity` and `0` (off the
+ * diagonal) are treated as "no edge" by the weighted routines
+ * (`floydWarshall`, `bellmanFord`, and the centrality functions).  `bfs`/`dfs`
+ * instead treat any finite, nonzero off-diagonal entry as an edge.  Graphs
+ * are read as directed (adjacency is never symmetrized).
+ *
+ * @packageDocumentation
+ */
+/**
+ * Breadth-first traversal order starting from `start`.
+ *
+ * A directed edge i -> j exists when `adj[i][j]` is finite and nonzero.
+ * Neighbors are visited in ascending index order.
+ *
+ * @param adj - Adjacency matrix (directed reading; not symmetrized)
+ * @param start - Source node index
+ * @returns Node indices in BFS visitation order
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * bfs(adj, 0) // => [0, 1, 2]
+ */
+export declare function bfs(adj: number[][], start: number): number[];
+/**
+ * Depth-first traversal order starting from `start` (iterative, preserves
+ * ascending-neighbor-order visitation as if implemented recursively).
+ *
+ * A directed edge i -> j exists when `adj[i][j]` is finite and nonzero.
+ *
+ * @param adj - Adjacency matrix (directed reading; not symmetrized)
+ * @param start - Source node index
+ * @returns Node indices in DFS visitation order
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * dfs(adj, 0) // => [0, 1, 2]
+ */
+export declare function dfs(adj: number[][], start: number): number[];
+/**
+ * All-pairs shortest-path distances via the Floyd-Warshall algorithm.
+ *
+ * `d[i][j]` = 0 if i === j, else `adj[i][j]` when it is a finite nonzero
+ * edge, else `Infinity`.  Handles negative edge weights.  A negative value
+ * remaining on the diagonal after the triple loop indicates a negative
+ * cycle reachable through that node (not flagged by this function — use
+ * `bellmanFord` for explicit negative-cycle detection).
+ *
+ * Time complexity: O(V^3).
+ *
+ * @param adj - Adjacency matrix (directed reading)
+ * @returns n x n matrix of shortest-path distances
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * floydWarshall(adj)[0][2] // => 2
+ */
+export declare function floydWarshall(adj: number[][]): number[][];
+/** Result of `bellmanFord`. */
+export interface BellmanFordResult {
+    /** Shortest-path distance from source to each node (Infinity if unreachable). */
+    dist: number[];
+    /** True if a negative-weight cycle is reachable from the source. */
+    hasNegativeCycle: boolean;
+}
+/**
+ * Single-source shortest paths via the Bellman-Ford algorithm.
+ *
+ * Handles negative edge weights and detects a negative-weight cycle
+ * reachable from `source`: relaxes all edges |V|-1 times, then performs one
+ * additional pass — any edge that can still be relaxed indicates a
+ * reachable negative cycle.
+ *
+ * Time complexity: O(V*E) (O(V^3) on a dense adjacency matrix).
+ *
+ * @param adj - Adjacency matrix (directed reading)
+ * @param source - Source node index
+ * @returns `{ dist, hasNegativeCycle }`
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * bellmanFord(adj, 0) // => { dist: [0, 1, 2], hasNegativeCycle: false }
+ */
+export declare function bellmanFord(adj: number[][], source: number): BellmanFordResult;
+/**
+ * Closeness centrality for each node, using the networkx (Wasserman &
+ * Faust) convention for possibly-disconnected graphs:
+ *
+ * `C(u) = ((r-1)/(n-1)) * ((r-1)/sum(d))`
+ *
+ * where `r` is the number of nodes that can reach `u` (including `u`) and
+ * `sum(d)` is the sum of shortest-path distances from those nodes to `u`.
+ * For a graph where every node reaches all others (`r === n`), this reduces
+ * to `(n-1)/sum(d)`.  Isolated nodes (`r === 1`) score 0.
+ *
+ * **Direction note (matches networkx default):** closeness uses the
+ * *incoming* distance to `u` for directed graphs — how reachable `u` is
+ * *from* the rest of the graph, not how far `u` can reach. This mirrors
+ * `networkx.closeness_centrality`'s documented default ("the closeness
+ * distance function computes the incoming distance to u for directed
+ * graphs"). For undirected graphs (symmetric `adj`) direction is moot.
+ *
+ * @param adj - Adjacency matrix (directed reading)
+ * @returns Closeness centrality score for each node (length = n)
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * closenessCentrality(adj) // middle node scores highest
+ */
+export declare function closenessCentrality(adj: number[][]): number[];
+/**
+ * Harmonic centrality for each node:
+ *
+ * `H(u) = sum_{v != u} 1/d(v,u)`
+ *
+ * Unreachable nodes contribute 0 (1/Infinity), so this remains well-defined
+ * for disconnected graphs without normalization.
+ *
+ * **Direction note (matches networkx default):** like closeness, harmonic
+ * centrality sums *incoming* distances (`d(v,u)`, from other nodes to `u`),
+ * matching `networkx.harmonic_centrality`'s directed-graph default. For
+ * undirected graphs (symmetric `adj`) direction is moot.
+ *
+ * @param adj - Adjacency matrix (directed reading)
+ * @returns Harmonic centrality score for each node (length = n)
+ *
+ * @example
+ * const adj = [[0,1,Infinity],[1,0,1],[Infinity,1,0]];
+ * harmonicCentrality(adj) // => [1.5, 2, 1.5] (middle node reaches both neighbors at distance 1)
+ */
+export declare function harmonicCentrality(adj: number[][]): number[];
+//# sourceMappingURL=traversal-centrality.d.ts.map

package/dist/graph/traversal-centrality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal-centrality.d.ts","sourceRoot":"","sources":["../../src/graph/traversal-centrality.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAMH;;;;;;;;;;;;;GAaG;AACH,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAqB5D;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAmB5D;AAeD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CA0BzD;AAMD,+BAA+B;AAC/B,MAAM,WAAW,iBAAiB;IAChC,iFAAiF;IACjF,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,oEAAoE;IACpE,gBAAgB,EAAE,OAAO,CAAC;CAC3B;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,iBAAiB,CAsC9E;AAMD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAuB7D;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAgB5D"}

package/dist/index.d.ts

@@ -49,6 +49,8 @@ export { minimizeScalar } from './numeric/minimize-scalar.js';
 export type { MinimizeScalarOptions, MinimizeScalarResult } from './numeric/minimize-scalar.js';
 export { quad } from './numeric/adaptive-quad.js';
 export type { QuadOptions, QuadResult } from './numeric/adaptive-quad.js';
+export { interpn } from './numeric/interpn.js';
+export type { NDArrayInput } from './numeric/interpn.js';
 export { movingAverage, ewma, detrend, acf } from './timeseries-extra.js';
 export { pacf, ljungBox, durbinWatson, adfuller } from './stats/timeseries.js';
 export type { LjungBoxResult, AdfullerResult } from './stats/timeseries.js';
@@ -85,6 +87,8 @@ export { idwt, wavedec, waverec, cwt } from './signal/wavelets.js';
 export { findPeaks, peakWidths, csd, coherence, stft, istft, decimate, } from './signal/spectral-peaks.js';
 export type { FindPeaksOptions, CsdOptions, StftOptions, StftResult, } from './signal/spectral-peaks.js';
 export { haversine, EARTH_RADIUS_KM, slerp, quaternionMultiply, quaternionConjugate, quaternionNormalize, quaternionFromAxisAngle, quaternionRotate, quaternionToRotationMatrix, } from './geometry-extra.js';
+export { quaternionInverse, quaternionSlerp, quaternionToEuler, boundingBox, procrustes, kdTreeKNN, kdTreeRadius, setIsSuperset, setEqual, setDisjoint, } from './geometry/geometry-extra.js';
+export type { ProcrustesResult } from './geometry/geometry-extra.js';
 export { noncentralChi2CDF, noncentralFCDF, noncentralTCDF, circmean, circstd, circvar, vonMisesPDF, mcnemar, cochranQ, } from './stats/inference-extra2.js';
 export type { CircularOptions, McNemarOptions, McNemarResult, CochranQResult, } from './stats/inference-extra2.js';
 export { hyp0f1, hyp1f1, hyp2f1, pFq } from './special/hypergeometric.js';
@@ -92,4 +96,9 @@ export { polygamma, trigamma, jacobiP, gegenbauerC } from './special/polygamma-o
 export { jacobiSN, jacobiCN, jacobiDN } from './special/jacobi-elliptic.js';
 export { rootsLegendre } from './numeric/gauss-nodes.js';
 export type { RootsLegendreResult } from './numeric/gauss-nodes.js';
+export { bfs, dfs, floydWarshall, bellmanFord, closenessCentrality, harmonicCentrality, } from './graph/traversal-centrality.js';
+export type { BellmanFordResult } from './graph/traversal-centrality.js';
+export { maxFlow, minCut, astar, hungarian } from './graph/optimization.js';
+export type { MaxFlowResult, MinCutResult, AStarResult, HungarianResult, } from './graph/optimization.js';
+export { interval, Interval } from './numeric/interval.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAMjC,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,eAAe,EACf,eAAe,EACf,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,UAAU,EACV,QAAQ,EACR,SAAS,EACT,UAAU,EACV,cAAc,EACd,GAAG,EACH,SAAS,EACT,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAKxD,OAAO,EAAE,GAAG,EAAE,MAAM,8BAA8B,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAIzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AACxE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAIlG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAClE,YAAY,EACV,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAOxF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAC/F,YAAY,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAQjE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AACzF,YAAY,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,GACtB,MAAM,+BAA+B,CAAC;AAQvC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,gCAAgC,CAAC;AAKnE,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAKhG,OAAO,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AAClD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAG1E,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI1E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAC/E,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAGzD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC1E,YAAY,EACV,YAAY,EACZ,wBAAwB,EACxB,2BAA2B,GAC5B,MAAM,gCAAgC,CAAC;AAGxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EACV,yBAAyB,EACzB,wBAAwB,GACzB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAInE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIrE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAIzE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC3E,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AAIpC,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,YAAY,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAM3F,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACjE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAK1D,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACrD,YAAY,EACV,WAAW,EACX,UAAU,EACV,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAIpG,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIpG,OAAO,EACL,cAAc,EACd,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,UAAU,GACX,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAIlE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAKnE,OAAO,EACL,SAAS,EACT,UAAU,EACV,GAAG,EACH,SAAS,EACT,IAAI,EACJ,KAAK,EACL,QAAQ,GACT,MAAM,4BAA4B,CAAC;AACpC,YAAY,EACV,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,UAAU,GACX,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAU7B,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,cAAc,EACd,QAAQ,EACR,OAAO,EACP,OAAO,EACP,WAAW,EACX,OAAO,EACP,QAAQ,GACT,MAAM,6BAA6B,CAAC;AACrC,YAAY,EACV,eAAe,EACf,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAK1E,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAM7F,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,YAAY,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAMjC,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,eAAe,EACf,eAAe,EACf,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,UAAU,EACV,QAAQ,EACR,SAAS,EACT,UAAU,EACV,cAAc,EACd,GAAG,EACH,SAAS,EACT,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAKxD,OAAO,EAAE,GAAG,EAAE,MAAM,8BAA8B,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAIzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AACxE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAIlG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAClE,YAAY,EACV,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAOxF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAC/F,YAAY,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAQjE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AACzF,YAAY,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,GACtB,MAAM,+BAA+B,CAAC;AAQvC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,gCAAgC,CAAC;AAKnE,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAKhG,OAAO,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AAClD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAM1E,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,YAAY,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAGzD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI1E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAC/E,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAGzD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC1E,YAAY,EACV,YAAY,EACZ,wBAAwB,EACxB,2BAA2B,GAC5B,MAAM,gCAAgC,CAAC;AAGxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EACV,yBAAyB,EACzB,wBAAwB,GACzB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAInE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIrE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAIzE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC3E,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AAIpC,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,YAAY,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAM3F,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACjE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAK1D,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACrD,YAAY,EACV,WAAW,EACX,UAAU,EACV,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAIpG,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIpG,OAAO,EACL,cAAc,EACd,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,UAAU,GACX,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAIlE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAKnE,OAAO,EACL,SAAS,EACT,UAAU,EACV,GAAG,EACH,SAAS,EACT,IAAI,EACJ,KAAK,EACL,QAAQ,GACT,MAAM,4BAA4B,CAAC;AACpC,YAAY,EACV,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,UAAU,GACX,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAI7B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,SAAS,EACT,YAAY,EACZ,aAAa,EACb,QAAQ,EACR,WAAW,GACZ,MAAM,8BAA8B,CAAC;AACtC,YAAY,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAUrE,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,cAAc,EACd,QAAQ,EACR,OAAO,EACP,OAAO,EACP,WAAW,EACX,OAAO,EACP,QAAQ,GACT,MAAM,6BAA6B,CAAC;AACrC,YAAY,EACV,eAAe,EACf,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAK1E,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAM7F,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,YAAY,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAMpE,OAAO,EACL,GAAG,EACH,GAAG,EACH,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,iCAAiC,CAAC;AACzC,YAAY,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAKzE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAC5E,YAAY,EACV,aAAa,EACb,YAAY,EACZ,WAAW,EACX,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAMjC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC"}