@danielsimonjr/mathts-functions 0.49.0 → 0.50.0

package/dist/geometry/alpha-shape.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Alpha shape (2-D) — a consumer of the Delaunay triangulation.
+ *
+ * An alpha shape generalises the convex hull: it keeps only the Delaunay
+ * triangles whose circumradius is `≤ 1/alpha`, then returns the boundary of
+ * that region (edges belonging to exactly one kept triangle). Large `alpha`
+ * hugs the point set tightly; `alpha → 0` recovers the convex hull. With the
+ * right `alpha`, an annulus-shaped point cloud yields a shape with a hole.
+ *
+ * Pinned on a known shape (annulus → recovers the hole: two boundary loops) in
+ * `functions/tests/geometry-consumers-oracle.test.ts`.
+ *
+ * @packageDocumentation
+ */
+/** Structured alpha-shape result. */
+export interface AlphaShapeResult {
+    /** Kept Delaunay triangles (circumradius ≤ 1/alpha), as index triples. */
+    triangles: number[][];
+    /**
+     * Boundary edges of the alpha shape — the edges that belong to exactly one
+     * kept triangle — as index pairs `[i, j]` with `i < j`.
+     */
+    edges: number[][];
+}
+/**
+ * Alpha shape of a set of 2-D points.
+ *
+ * @param points - Array of `[x, y]` points (at least 3, not all collinear).
+ * @param alpha - Positive alpha parameter; triangles with circumradius `≤ 1/alpha`
+ *   are kept. Smaller `alpha` → looser shape (→ convex hull); larger `alpha` →
+ *   tighter shape that can open holes/concavities.
+ * @returns An {@link AlphaShapeResult} (kept triangles + boundary edges).
+ * @throws When given fewer than 3 points, a non-2-D point set, or `alpha ≤ 0`.
+ */
+export declare function alphaShape(points: number[][], alpha: number): AlphaShapeResult;
+//# sourceMappingURL=alpha-shape.d.ts.map

package/dist/geometry/alpha-shape.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"alpha-shape.d.ts","sourceRoot":"","sources":["../../src/geometry/alpha-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,qCAAqC;AACrC,MAAM,WAAW,gBAAgB;IAC/B,0EAA0E;IAC1E,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB;;;OAGG;IACH,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;CACnB;AAcD;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,gBAAgB,CA8B9E"}

package/dist/geometry/delaunay.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Delaunay triangulation (2-D) — part of the computational-geometry engine.
+ *
+ * `delaunay` triangulates a 2-D point set so that no point lies strictly inside
+ * the circumcircle of any triangle (the empty-circumcircle / Delaunay
+ * property). It reuses the package's Bowyer–Watson kernel and returns a
+ * structured result whose `simplices` mirror `scipy.spatial.Delaunay.simplices`
+ * (triangles as triples of point indices).
+ *
+ * The triangulation is not unique on cocircular points, so it is pinned by
+ * implementation-independent invariants (every input point is a vertex, the
+ * triangles partition the convex hull, and the empty-circumcircle property) —
+ * see `functions/tests/geometry-delaunay-oracle.test.ts`.
+ *
+ * @packageDocumentation
+ */
+/** Structured Delaunay result (mirrors `scipy.spatial.Delaunay`). */
+export interface DelaunayResult {
+    /** Triangles as triples of indices into the input `points`. */
+    simplices: number[][];
+}
+/**
+ * Delaunay triangulation of a set of 2-D points.
+ *
+ * @param points - Array of `[x, y]` points (at least 3, not all collinear).
+ * @returns A {@link DelaunayResult}.
+ * @throws When given fewer than 3 points or a non-2-D point set.
+ *
+ * @example
+ * delaunay([[0,0],[1,0],[0,1],[1,1],[0.5,0.5]]).simplices.length // 4
+ */
+export declare function delaunay(points: number[][]): DelaunayResult;
+//# sourceMappingURL=delaunay.d.ts.map

package/dist/geometry/delaunay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"delaunay.d.ts","sourceRoot":"","sources":["../../src/geometry/delaunay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,qEAAqE;AACrE,MAAM,WAAW,cAAc;IAC7B,+DAA+D;IAC/D,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB;AAED;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,cAAc,CAQ3D"}

package/dist/geometry/hull.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Convex hull — the foundation of the computational-geometry engine.
+ *
+ * `convexHull` accepts a set of 2-D or 3-D points and returns a structured
+ * result (`vertices`, `simplices`, `area`, `volume`) whose fields mirror
+ * `scipy.spatial.ConvexHull`:
+ *
+ * - **2-D:** Andrew's monotone-chain algorithm (O(n log n)). `vertices` are the
+ *   indices of the hull points in counter-clockwise order; `simplices` are the
+ *   boundary edges (index pairs); `area` is the **perimeter** and `volume` is
+ *   the **enclosed area** (matching SciPy's `.area` / `.volume` convention in
+ *   2-D).
+ * - **3-D:** incremental QuickHull (reusing the package's `convexHull3D`
+ *   kernel). `simplices` are the triangular facets (index triples, oriented CCW
+ *   as seen from outside); `area` is the **surface area** and `volume` the
+ *   enclosed **volume**.
+ *
+ * Pinned against `scipy.spatial.ConvexHull` (vertex set + area/volume) in
+ * `functions/tests/geometry-hull-oracle.test.ts`.
+ *
+ * @packageDocumentation
+ */
+/** Structured convex-hull result (mirrors `scipy.spatial.ConvexHull`). */
+export interface ConvexHullResult {
+    /**
+     * Indices of the input points that lie on the hull. In 2-D these are in
+     * counter-clockwise order; in 3-D they are sorted ascending.
+     */
+    vertices: number[];
+    /**
+     * Hull facets as arrays of point indices: edges `[i, j]` in 2-D, triangles
+     * `[i, j, k]` in 3-D (CCW from outside).
+     */
+    simplices: number[][];
+    /** SciPy `.area`: **perimeter** in 2-D, **surface area** in 3-D. */
+    area: number;
+    /** SciPy `.volume`: **enclosed area** in 2-D, **enclosed volume** in 3-D. */
+    volume: number;
+}
+/**
+ * Convex hull of a set of 2-D or 3-D points.
+ *
+ * @param points - Array of points, all `[x, y]` (2-D) or all `[x, y, z]` (3-D).
+ * @returns A {@link ConvexHullResult}.
+ * @throws When fewer than 3 (2-D) / 4 (3-D) points are given, or the points are
+ *   not 2- or 3-dimensional.
+ *
+ * @example
+ * convexHull([[0,0],[2,0],[2,2],[0,2],[1,1]])
+ * // { vertices: [0,1,2,3], simplices: [[0,1],[1,2],[2,3],[3,0]], area: 8, volume: 4 }
+ */
+export declare function convexHull(points: number[][]): ConvexHullResult;
+//# sourceMappingURL=hull.d.ts.map

package/dist/geometry/hull.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hull.d.ts","sourceRoot":"","sources":["../../src/geometry/hull.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,0EAA0E;AAC1E,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB;;;OAGG;IACH,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;CAChB;AA+FD;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,gBAAgB,CAc/D"}

package/dist/geometry/spherical-voronoi.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Spherical Voronoi diagram — a consumer of the 3-D convex hull.
+ *
+ * For points on a sphere, the convex hull of the points IS the spherical
+ * Delaunay triangulation; the Voronoi vertices are the circumcenters of the
+ * hull facets projected onto the sphere (equivalently, the facet normals scaled
+ * to the sphere radius). `sphericalVoronoi` returns those vertices, each
+ * generator's region (as an ordered ring of vertex indices), and the geodesic
+ * area of each region.
+ *
+ * Pinned against `scipy.spatial.SphericalVoronoi` (vertex count `= 2N − 4` and
+ * region areas summing to `4πr²`) in
+ * `functions/tests/geometry-consumers-oracle.test.ts`.
+ *
+ * @packageDocumentation
+ */
+/** Structured spherical-Voronoi result (mirrors `scipy.spatial.SphericalVoronoi`). */
+export interface SphericalVoronoiResult {
+    /** Voronoi vertices on the sphere (the hull facets' circumcenters). */
+    vertices: number[][];
+    /**
+     * Per input point: the ordered ring of vertex indices (into
+     * {@link SphericalVoronoiResult.vertices}) bounding that generator's cell.
+     */
+    regions: number[][];
+    /** Per input point: the geodesic (surface) area of its Voronoi cell. */
+    areas: number[];
+}
+/**
+ * Spherical Voronoi diagram of points on a sphere.
+ *
+ * @param points - Array of `[x, y, z]` points on (or near) the sphere. At least
+ *   4 points, not all coplanar with the centre.
+ * @param radius - Sphere radius (default `1`).
+ * @param center - Sphere centre (default origin).
+ * @returns A {@link SphericalVoronoiResult}.
+ * @throws When given fewer than 4 points or a non-3-D point set.
+ */
+export declare function sphericalVoronoi(points: number[][], radius?: number, center?: number[]): SphericalVoronoiResult;
+//# sourceMappingURL=spherical-voronoi.d.ts.map

package/dist/geometry/spherical-voronoi.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spherical-voronoi.d.ts","sourceRoot":"","sources":["../../src/geometry/spherical-voronoi.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,sFAAsF;AACtF,MAAM,WAAW,sBAAsB;IACrC,uEAAuE;IACvE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB;;;OAGG;IACH,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;IACpB,wEAAwE;IACxE,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAqCD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,MAAM,SAAI,EACV,MAAM,GAAE,MAAM,EAAc,GAC3B,sBAAsB,CAwExB"}

package/dist/geometry/voronoi.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Voronoi diagram (2-D) — a consumer of the Delaunay triangulation.
+ *
+ * The Voronoi diagram is the dual of the Delaunay triangulation: each Delaunay
+ * triangle contributes one Voronoi vertex (its circumcenter), and two Voronoi
+ * vertices are joined by a ridge when their triangles share an edge. `voronoi`
+ * returns the (unbounded) Voronoi vertices, the Delaunay triangle each one came
+ * from, and the region (set of incident Voronoi vertices) of every generator.
+ *
+ * Pinned via implementation-independent invariants (Voronoi vertices are the
+ * Delaunay circumcenters; each vertex's three generators are its nearest
+ * generators — the dual empty-circumcircle property) in
+ * `functions/tests/geometry-consumers-oracle.test.ts`.
+ *
+ * @packageDocumentation
+ */
+/** Structured Voronoi result (dual of the Delaunay triangulation). */
+export interface VoronoiResult {
+    /** Voronoi vertices — the circumcenters of the Delaunay triangles. */
+    vertices: number[][];
+    /**
+     * The Delaunay triangle (triple of input-point indices) that produced each
+     * Voronoi vertex, parallel to {@link VoronoiResult.vertices}.
+     */
+    simplices: number[][];
+    /**
+     * Per input point: the indices (into `vertices`) of the Voronoi vertices on
+     * the boundary of that point's Voronoi cell (unordered). Bounded cells of
+     * interior points are closed; unbounded cells of hull points are open.
+     */
+    regions: number[][];
+}
+/**
+ * Voronoi diagram of a set of 2-D points (the dual of {@link delaunay}).
+ *
+ * @param points - Array of `[x, y]` points (at least 3, not all collinear).
+ * @returns A {@link VoronoiResult}.
+ * @throws When given fewer than 3 points or a non-2-D point set.
+ *
+ * @example
+ * voronoi([[0,0],[1,0],[0,1],[1,1],[0.5,0.5]]).vertices.length // == triangle count
+ */
+export declare function voronoi(points: number[][]): VoronoiResult;
+//# sourceMappingURL=voronoi.d.ts.map

package/dist/geometry/voronoi.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"voronoi.d.ts","sourceRoot":"","sources":["../../src/geometry/voronoi.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,sEAAsE;AACtE,MAAM,WAAW,aAAa;IAC5B,sEAAsE;IACtE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB;;;OAGG;IACH,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB;;;;OAIG;IACH,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;CACrB;AAcD;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,aAAa,CAczD"}

package/dist/index.d.ts

@@ -98,6 +98,16 @@ export { quaternionInverse, quaternionSlerp, quaternionToEuler, quaternionLog, q
 export type { ProcrustesResult } from './geometry/geometry-extra.js';
 export { rayTriangleIntersect, rayPlaneIntersect, segmentSegmentClosest, } from './geometry/intersect3d.js';
 export type { RayHit, SegmentClosestResult } from './geometry/intersect3d.js';
+export { convexHull } from './geometry/hull.js';
+export type { ConvexHullResult } from './geometry/hull.js';
+export { delaunay } from './geometry/delaunay.js';
+export type { DelaunayResult } from './geometry/delaunay.js';
+export { voronoi } from './geometry/voronoi.js';
+export type { VoronoiResult } from './geometry/voronoi.js';
+export { alphaShape } from './geometry/alpha-shape.js';
+export type { AlphaShapeResult } from './geometry/alpha-shape.js';
+export { sphericalVoronoi } from './geometry/spherical-voronoi.js';
+export type { SphericalVoronoiResult } from './geometry/spherical-voronoi.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';

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,YAAY,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACpG,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;AAKxF,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAOjE,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;AAOzD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/D,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAM5E,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,YAAY,EAAE,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAG3F,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;AAClE,YAAY,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAI5D,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,aAAa,EACb,aAAa,EACb,aAAa,EACb,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;AAGrE,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAU9E,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;AAIpE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAK9F,OAAO,EACL,OAAO,EACP,cAAc,EACd,QAAQ,EACR,kBAAkB,EAClB,QAAQ,GACT,MAAM,6BAA6B,CAAC;AAMrC,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;AAO3D,OAAO,EACL,aAAa,EACb,SAAS,EACT,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,+BAA+B,CAAC;AAKvC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAK7E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAI1E,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,YAAY,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAI1F,OAAO,EAAE,yBAAyB,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AACtF,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAI9F,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AAChG,YAAY,EAAE,iBAAiB,EAAE,MAAM,kCAAkC,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,YAAY,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACpG,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;AAKxF,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAOjE,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;AAOzD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/D,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAM5E,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,YAAY,EAAE,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAG3F,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;AAClE,YAAY,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAI5D,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,aAAa,EACb,aAAa,EACb,aAAa,EACb,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;AAGrE,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAK9E,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,YAAY,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,YAAY,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,YAAY,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,YAAY,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AACnE,YAAY,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAU9E,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;AAIpE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAK9F,OAAO,EACL,OAAO,EACP,cAAc,EACd,QAAQ,EACR,kBAAkB,EAClB,QAAQ,GACT,MAAM,6BAA6B,CAAC;AAMrC,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;AAO3D,OAAO,EACL,aAAa,EACb,SAAS,EACT,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,+BAA+B,CAAC;AAKvC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAK7E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAI1E,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,YAAY,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAI1F,OAAO,EAAE,yBAAyB,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AACtF,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAI9F,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AAChG,YAAY,EAAE,iBAAiB,EAAE,MAAM,kCAAkC,CAAC"}

package/dist/index.js

@@ -112,7 +112,7 @@ __export(typed_exports, {
   cond: () => cond,
   conj: () => conj,
   connectedComponents: () => connectedComponents,
-  convexHull: () => convexHull,
+  convexHull2D: () => convexHull2D,
   convexHull3D: () => convexHull3D,
   convolve: () => convolve,
   coordinateTransform: () => coordinateTransform,
@@ -2281,9 +2281,9 @@ var mean = mathTyped2("mean", {
     return result.result;
   }
 });
-function varianceFromM2(m2, n, norm4) {
+function varianceFromM2(m2, n, norm5) {
   if (n === 0) return NaN;
-  switch (norm4) {
+  switch (norm5) {
     case "biased":
       return m2 / (n + 1);
     case "uncorrected":
@@ -2298,31 +2298,31 @@ function m2OfArray(arr10) {
 }
 var variance = mathTyped2("variance", {
   Array: (arr10) => varianceFromM2(m2OfArray(arr10), arr10.length, "unbiased"),
-  "Array, string": (arr10, norm4) => varianceFromM2(m2OfArray(arr10), arr10.length, norm4),
+  "Array, string": (arr10, norm5) => varianceFromM2(m2OfArray(arr10), arr10.length, norm5),
   // Parallel Float64Array variance. computePool returns POPULATION variance
   // (sum2/n); recover sum2 = pop·n and renormalize for the requested convention.
   Float64Array: async (a) => {
     const result = await computePool.variance(a);
     return varianceFromM2(result.result.variance * a.length, a.length, "unbiased");
   },
-  "Float64Array, string": async (a, norm4) => {
+  "Float64Array, string": async (a, norm5) => {
     const result = await computePool.variance(a);
-    return varianceFromM2(result.result.variance * a.length, a.length, norm4);
+    return varianceFromM2(result.result.variance * a.length, a.length, norm5);
   }
 });
 var std = mathTyped2("std", {
   Array: (arr10) => Math.sqrt(varianceFromM2(m2OfArray(arr10), arr10.length, "unbiased")),
-  "Array, string": (arr10, norm4) => Math.sqrt(varianceFromM2(m2OfArray(arr10), arr10.length, norm4)),
+  "Array, string": (arr10, norm5) => Math.sqrt(varianceFromM2(m2OfArray(arr10), arr10.length, norm5)),
   // Parallel Float64Array std — derive from the (renormalized) variance so the
   // convention matches the Array path and parallelStatStd.
   Float64Array: async (a) => {
     const result = await computePool.variance(a);
     return Math.sqrt(varianceFromM2(result.result.variance * a.length, a.length, "unbiased"));
   },
-  "Float64Array, string": async (a, norm4) => {
+  "Float64Array, string": async (a, norm5) => {
     const result = await computePool.variance(a);
     return Math.sqrt(
-      varianceFromM2(result.result.variance * a.length, a.length, norm4)
+      varianceFromM2(result.result.variance * a.length, a.length, norm5)
     );
   }
 });
@@ -3589,8 +3589,8 @@ function welchPSDJS(samples, frameLength, overlap, windowType) {
     start += hop;
   }
   if (numFrames === 0) return new Float64Array(0);
-  const norm4 = numFrames * frameLength * winPower;
-  for (let k = 0; k < psdLen; k++) psd[k] /= norm4;
+  const norm5 = numFrames * frameLength * winPower;
+  for (let k = 0; k < psdLen; k++) psd[k] /= norm5;
   for (let k = 1; k < psdLen - 1; k++) psd[k] *= 2;
   return psd;
 }
@@ -8551,18 +8551,18 @@ import { computePool as computePool7 } from "@danielsimonjr/mathts-parallel";
 var GEOMETRY_WASM_THRESHOLD = 32;
 var HULL3D_WASM_THRESHOLD = 1024;
 function angle2D(v1, v2) {
-  const dot8 = v1[0] * v2[0] + v1[1] * v2[1];
+  const dot9 = v1[0] * v2[0] + v1[1] * v2[1];
   const mag1 = Math.sqrt(v1[0] ** 2 + v1[1] ** 2);
   const mag2 = Math.sqrt(v2[0] ** 2 + v2[1] ** 2);
   if (mag1 === 0 || mag2 === 0) return NaN;
-  return Math.acos(Math.max(-1, Math.min(1, dot8 / (mag1 * mag2))));
+  return Math.acos(Math.max(-1, Math.min(1, dot9 / (mag1 * mag2))));
 }
 function angle3D(v1, v2) {
-  const dot8 = v1[0] * v2[0] + v1[1] * v2[1] + v1[2] * v2[2];
+  const dot9 = v1[0] * v2[0] + v1[1] * v2[1] + v1[2] * v2[2];
   const mag1 = Math.sqrt(v1[0] ** 2 + v1[1] ** 2 + v1[2] ** 2);
   const mag2 = Math.sqrt(v2[0] ** 2 + v2[1] ** 2 + v2[2] ** 2);
   if (mag1 === 0 || mag2 === 0) return NaN;
-  return Math.acos(Math.max(-1, Math.min(1, dot8 / (mag1 * mag2))));
+  return Math.acos(Math.max(-1, Math.min(1, dot9 / (mag1 * mag2))));
 }
 function cross3D(a, b) {
   return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
@@ -8584,7 +8584,7 @@ function polygonArea(vertices) {
   }
   return Math.abs(area2) / 2;
 }
-function convexHull(points) {
+function convexHull2D(points) {
   const n = points.length;
   if (n <= 1) return points.slice();
   if (n === 2) return points.slice();
@@ -8606,12 +8606,12 @@ function convexHull(points) {
   } else {
     sorted = points.slice().sort((a, b) => a[0] - b[0] || a[1] - b[1]);
   }
-  function cross3(o, a, b) {
+  function cross4(o, a, b) {
     return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0]);
   }
   const lower = [];
   for (const p of sorted) {
-    while (lower.length >= 2 && cross3(lower[lower.length - 2], lower[lower.length - 1], p) <= 0) {
+    while (lower.length >= 2 && cross4(lower[lower.length - 2], lower[lower.length - 1], p) <= 0) {
       lower.pop();
     }
     lower.push(p);
@@ -8619,7 +8619,7 @@ function convexHull(points) {
   const upper = [];
   for (let i = sorted.length - 1; i >= 0; i--) {
     const p = sorted[i];
-    while (upper.length >= 2 && cross3(upper[upper.length - 2], upper[upper.length - 1], p) <= 0) {
+    while (upper.length >= 2 && cross4(upper[upper.length - 2], upper[upper.length - 1], p) <= 0) {
       upper.pop();
     }
     upper.push(p);
@@ -8667,14 +8667,14 @@ function reflectVector(v, normal) {
   const mag = Math.sqrt(normal.reduce((s, c) => s + c * c, 0));
   if (mag === 0) return v.slice();
   const n = normal.map((c) => c / mag);
-  const dot8 = v.reduce((s, c, i) => s + c * n[i], 0);
-  return v.map((c, i) => c - 2 * dot8 * n[i]);
+  const dot9 = v.reduce((s, c, i) => s + c * n[i], 0);
+  return v.map((c, i) => c - 2 * dot9 * n[i]);
 }
 function projectVector(v, onto) {
-  const dot8 = v.reduce((s, c, i) => s + c * onto[i], 0);
+  const dot9 = v.reduce((s, c, i) => s + c * onto[i], 0);
   const magSq = onto.reduce((s, c) => s + c * c, 0);
   if (magSq === 0) return onto.map(() => 0);
-  const scale4 = dot8 / magSq;
+  const scale4 = dot9 / magSq;
   return onto.map((c) => c * scale4);
 }
 function distance2D(a, b) {
@@ -8750,10 +8750,10 @@ function centroid(vertices) {
   let cy = 0;
   for (let i = 0; i < n; i++) {
     const j = (i + 1) % n;
-    const cross3 = vertices[i][0] * vertices[j][1] - vertices[j][0] * vertices[i][1];
-    signedArea += cross3;
-    cx += (vertices[i][0] + vertices[j][0]) * cross3;
-    cy += (vertices[i][1] + vertices[j][1]) * cross3;
+    const cross4 = vertices[i][0] * vertices[j][1] - vertices[j][0] * vertices[i][1];
+    signedArea += cross4;
+    cx += (vertices[i][0] + vertices[j][0]) * cross4;
+    cy += (vertices[i][1] + vertices[j][1]) * cross4;
   }
   signedArea /= 2;
   cx /= 6 * signedArea;
@@ -8840,37 +8840,6 @@ function minkowskiDistance(a, b, p) {
 function delaunayTriangulation(points) {
   const n = points.length;
   if (n < 3) return [];
-  if (n >= GEOMETRY_WASM_THRESHOLD) {
-    const wasm = wasmLoader.getModule();
-    if (wasm) {
-      try {
-        const flat = new Float64Array(n * 2);
-        for (let i = 0; i < n; i++) {
-          flat[i * 2] = points[i][0];
-          flat[i * 2 + 1] = points[i][1];
-        }
-        const ptsAlloc = wasmLoader.allocateFloat64Array(flat);
-        const maxTris = 2 * n;
-        const trisAlloc = wasmLoader.allocateInt32ArrayEmpty(maxTris * 3);
-        try {
-          const numTris = wasm.delaunay_wasm(ptsAlloc.ptr, n, trisAlloc.ptr);
-          const result = [];
-          for (let i = 0; i < numTris; i++) {
-            result.push([
-              trisAlloc.array[i * 3],
-              trisAlloc.array[i * 3 + 1],
-              trisAlloc.array[i * 3 + 2]
-            ]);
-          }
-          return result;
-        } finally {
-          wasmLoader.free(ptsAlloc.ptr);
-          wasmLoader.free(trisAlloc.ptr);
-        }
-      } catch {
-      }
-    }
-  }
   let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
   for (const p of points) {
     minX = Math.min(minX, p[0]);
@@ -15157,11 +15126,11 @@ function _eigenvectorOnce(adj, maxIter, tol, seed) {
         if (adj[j][i] > 0) next[i] += adj[j][i] * x[j];
       }
     }
-    let norm4 = 0;
-    for (let i = 0; i < n; i++) norm4 += next[i] * next[i];
-    norm4 = Math.sqrt(norm4);
-    if (norm4 < 1e-15) break;
-    for (let i = 0; i < n; i++) next[i] /= norm4;
+    let norm5 = 0;
+    for (let i = 0; i < n; i++) norm5 += next[i] * next[i];
+    norm5 = Math.sqrt(norm5);
+    if (norm5 < 1e-15) break;
+    for (let i = 0; i < n; i++) next[i] /= norm5;
     let delta = 0;
     for (let i = 0; i < n; i++) delta = Math.max(delta, Math.abs(next[i] - x[i]));
     x = next;
@@ -15174,9 +15143,9 @@ function _aggregateEigenvector(vectors, aggregation) {
   const count2 = vectors.length;
   const ref = vectors[0];
   const aligned = vectors.map((v) => {
-    let dot8 = 0;
-    for (let i = 0; i < n; i++) dot8 += v[i] * ref[i];
-    if (dot8 < 0) {
+    let dot9 = 0;
+    for (let i = 0; i < n; i++) dot9 += v[i] * ref[i];
+    if (dot9 < 0) {
       const flipped = new Float64Array(n);
       for (let i = 0; i < n; i++) flipped[i] = -v[i];
       return flipped;
@@ -15188,11 +15157,11 @@ function _aggregateEigenvector(vectors, aggregation) {
     for (let i = 0; i < n; i++) mean7[i] += v[i];
   }
   for (let i = 0; i < n; i++) mean7[i] /= count2;
-  let norm4 = 0;
-  for (let i = 0; i < n; i++) norm4 += mean7[i] * mean7[i];
-  norm4 = Math.sqrt(norm4);
-  if (norm4 > 1e-15) {
-    for (let i = 0; i < n; i++) mean7[i] /= norm4;
+  let norm5 = 0;
+  for (let i = 0; i < n; i++) norm5 += mean7[i] * mean7[i];
+  norm5 = Math.sqrt(norm5);
+  if (norm5 > 1e-15) {
+    for (let i = 0; i < n; i++) mean7[i] /= norm5;
   }
   if (aggregation === "mean") {
     return { centrality: mean7 };
@@ -17103,11 +17072,11 @@ function principalComponentAnalysis(data, k) {
           Av[i] += A[i][j] * v[j];
         }
       }
-      let norm4 = 0;
-      for (let i = 0; i < p; i++) norm4 += Av[i] * Av[i];
-      norm4 = Math.sqrt(norm4);
-      if (norm4 === 0) break;
-      const vNew = Av.map((x) => x / norm4);
+      let norm5 = 0;
+      for (let i = 0; i < p; i++) norm5 += Av[i] * Av[i];
+      norm5 = Math.sqrt(norm5);
+      if (norm5 === 0) break;
+      const vNew = Av.map((x) => x / norm5);
       let diff2 = 0;
       for (let i = 0; i < p; i++) diff2 += (vNew[i] - v[i]) ** 2;
       v = vNew;
@@ -17132,9 +17101,9 @@ function principalComponentAnalysis(data, k) {
   const explained = eigenvalues.map((ev) => totalVar > 0 ? Math.abs(ev) / totalVar : 0);
   const scores = centered.map((row2) => {
     return eigenvectors.map((ev) => {
-      let dot8 = 0;
-      for (let j = 0; j < p; j++) dot8 += row2[j] * ev[j];
-      return dot8;
+      let dot9 = 0;
+      for (let j = 0; j < p; j++) dot9 += row2[j] * ev[j];
+      return dot9;
     });
   });
   return { components: eigenvectors, explained, scores };
@@ -17733,30 +17702,30 @@ function hessenbergForm(A) {
     if (normV < 1e-30) continue;
     const beta2 = 2 / normV;
     for (let j = k; j < n; j++) {
-      let dot8 = 0;
+      let dot9 = 0;
       for (let i = 0; i < len; i++) {
-        dot8 += v[i] * H[k + 1 + i][j];
+        dot9 += v[i] * H[k + 1 + i][j];
       }
       for (let i = 0; i < len; i++) {
-        H[k + 1 + i][j] -= beta2 * v[i] * dot8;
+        H[k + 1 + i][j] -= beta2 * v[i] * dot9;
       }
     }
     for (let i = 0; i < n; i++) {
-      let dot8 = 0;
+      let dot9 = 0;
       for (let j = 0; j < len; j++) {
-        dot8 += H[i][k + 1 + j] * v[j];
+        dot9 += H[i][k + 1 + j] * v[j];
       }
       for (let j = 0; j < len; j++) {
-        H[i][k + 1 + j] -= beta2 * dot8 * v[j];
+        H[i][k + 1 + j] -= beta2 * dot9 * v[j];
       }
     }
     for (let i = 0; i < n; i++) {
-      let dot8 = 0;
+      let dot9 = 0;
       for (let j = 0; j < len; j++) {
-        dot8 += Q2[i][k + 1 + j] * v[j];
+        dot9 += Q2[i][k + 1 + j] * v[j];
       }
       for (let j = 0; j < len; j++) {
-        Q2[i][k + 1 + j] -= beta2 * dot8 * v[j];
+        Q2[i][k + 1 + j] -= beta2 * dot9 * v[j];
       }
     }
   }
@@ -18125,11 +18094,11 @@ function findKernelVector(A, n, tol) {
       }
     }
   }
-  let norm4 = 0;
-  for (let i = 0; i < n; i++) norm4 += v[i] * v[i];
-  norm4 = Math.sqrt(norm4);
-  if (norm4 > 1e-15) {
-    for (let i = 0; i < n; i++) v[i] /= norm4;
+  let norm5 = 0;
+  for (let i = 0; i < n; i++) norm5 += v[i] * v[i];
+  norm5 = Math.sqrt(norm5);
+  if (norm5 > 1e-15) {
+    for (let i = 0; i < n; i++) v[i] /= norm5;
   }
   return v;
 }
@@ -18166,11 +18135,11 @@ async function solveApprox(A, b, n) {
     }
   }
   const x = M.map((row2) => row2[n]);
-  let norm4 = 0;
-  for (let i = 0; i < n; i++) norm4 += x[i] * x[i];
-  norm4 = Math.sqrt(norm4);
-  if (norm4 > 1e-15) {
-    for (let i = 0; i < n; i++) x[i] /= norm4;
+  let norm5 = 0;
+  for (let i = 0; i < n; i++) norm5 += x[i] * x[i];
+  norm5 = Math.sqrt(norm5);
+  if (norm5 > 1e-15) {
+    for (let i = 0; i < n; i++) x[i] /= norm5;
   }
   return x;
 }
@@ -30180,7 +30149,7 @@ var createPinv = /* @__PURE__ */ factory(
     deepEqual: deepEqual3,
     equal: equal2,
     dotDivide: dotDivide2,
-    dot: dot8,
+    dot: dot9,
     ctranspose: ctranspose2,
     divideScalar: divideScalar2,
     multiply: multiply2,
@@ -30196,7 +30165,7 @@ var createPinv = /* @__PURE__ */ factory(
             if (size2[0] === 1) {
               return inv3(x);
             } else {
-              return dotDivide2(ctranspose2(x), dot8(x, x));
+              return dotDivide2(ctranspose2(x), dot9(x, x));
             }
           case 2: {
             if (_isZeros(x)) return ctranspose2(x);
@@ -30275,8 +30244,8 @@ var createPinv = /* @__PURE__ */ factory(
     }
     function _rankFact(mat, rows, cols) {
       const rref = _rref(mat, rows, cols);
-      const C = mat.map((row2) => row2.filter((_, j) => j < rows && !_isZero(dot8(rref[j], rref[j]))));
-      const F = rref.filter((_, i) => !_isZero(dot8(rref[i], rref[i])));
+      const C = mat.map((row2) => row2.filter((_, j) => j < rows && !_isZero(dot9(rref[j], rref[j]))));
+      const F = rref.filter((_, i) => !_isZero(dot9(rref[i], rref[i])));
       return { C, F };
     }
     function _isZero(x) {
@@ -37197,7 +37166,7 @@ function createComplexEigs({
   larger: larger2,
   smaller: smaller2,
   matrixFromColumns: _matrixFromColumns,
-  dot: dot8
+  dot: dot9
 }) {
   function complexEigs(arr10, N, prec, type, findVectors = true) {
     if (!findVectors && type === "number" && N * N >= WASM_EIGS_THRESHOLD) {
@@ -37568,11 +37537,11 @@ function createComplexEigs({
       M[i] = Array(N).fill(0);
     }
     let I2 = 0;
-    for (const sub2 of arr10) {
-      const n = sub2.length;
+    for (const sub3 of arr10) {
+      const n = sub3.length;
       for (let i = 0; i < n; i++) {
         for (let j = 0; j < n; j++) {
-          M[I2 + i][I2 + j] = sub2[i][j];
+          M[I2 + i][I2 + j] = sub3[i][j];
         }
       }
       I2 += n;
@@ -37598,7 +37567,7 @@ function createComplexEigs({
       } catch {
         continue;
       }
-      if (larger2(norm4(b), largeNum)) {
+      if (larger2(norm5(b), largeNum)) {
         break;
       }
     }
@@ -37608,13 +37577,13 @@ function createComplexEigs({
     i = 0;
     while (true) {
       const c = usolve2(A, b);
-      if (smaller2(norm4(orthogonalComplement(b, [c])), prec)) {
+      if (smaller2(norm5(orthogonalComplement(b, [c])), prec)) {
         break;
       }
       if (++i >= 10) {
         return null;
       }
-      b = normalize2(c, type);
+      b = normalize3(c, type);
     }
     return b;
   }
@@ -37629,7 +37598,7 @@ function createComplexEigs({
       v = v.map((n) => complex3(n));
     }
     v = orthogonalComplement(v, orthog);
-    return normalize2(v, type);
+    return normalize3(v, type);
   }
   function orthogonalComplement(v, orthog) {
     const vectorShape = size2(v);
@@ -37638,21 +37607,21 @@ function createComplexEigs({
       v = subtract3(
         v,
         multiply2(
-          divideScalar2(dot8(w, v), dot8(w, w)),
+          divideScalar2(dot9(w, v), dot9(w, w)),
           w
         )
       );
     }
     return v;
   }
-  function norm4(v) {
-    return abs2(sqrt2(dot8(v, v)));
+  function norm5(v) {
+    return abs2(sqrt2(dot9(v, v)));
   }
-  function normalize2(v, type) {
+  function normalize3(v, type) {
     const big = type === "BigNumber";
     const cplx = type === "Complex";
     const one = big ? bignumber2(1) : cplx ? complex3(1) : 1;
-    return multiply2(divideScalar2(one, norm4(v)), v);
+    return multiply2(divideScalar2(one, norm5(v)), v);
   }
   return complexEigs;
 }
@@ -38066,7 +38035,7 @@ var createEigs = /* @__PURE__ */ factory(
     re: re3,
     smaller: smaller2,
     matrixFromColumns: matrixFromColumns2,
-    dot: dot8
+    dot: dot9
   }) => {
     const doRealSymmetric = createRealSymmetric({
       config: config2,
@@ -38105,7 +38074,7 @@ var createEigs = /* @__PURE__ */ factory(
       larger: larger2,
       smaller: smaller2,
       matrixFromColumns: matrixFromColumns2,
-      dot: dot8
+      dot: dot9
     });
     return typed3("eigs", {
       // The conversion to matrix in the first two implementations,
@@ -40852,7 +40821,7 @@ var createRotationMatrix = /* @__PURE__ */ factory(
     multiplyScalar: multiplyScalar2,
     addScalar: addScalar2,
     unaryMinus: unaryMinus2,
-    norm: norm4,
+    norm: norm5,
     BigNumber: BigNumber9,
     matrix: matrix2,
     DenseMatrix: DenseMatrix7,
@@ -40926,7 +40895,7 @@ var createRotationMatrix = /* @__PURE__ */ factory(
       return data;
     }
     function _rotationMatrix3x3(theta, v, format4) {
-      const normV = norm4(v);
+      const normV = norm5(v);
       if (normV === 0) {
         throw new RangeError("Rotation around zero vector");
       }
@@ -42963,11 +42932,11 @@ function multivariateTaylor(expr, vars, x0, n = 1) {
         const fmp = evalWith(expr, s);
         s[vars[j]] = x0[j] - h;
         const fmm = evalWith(expr, s);
-        const cross3 = (fpp - fpm - fmp + fmm) / (4 * h * h);
-        if (Math.abs(cross3) < 1e-12) continue;
+        const cross4 = (fpp - fpm - fmp + fmm) / (4 * h * h);
+        if (Math.abs(cross4) < 1e-12) continue;
         const xi = x0[i] === 0 ? vars[i] : `(${vars[i]} - ${formatCoeff(x0[i])})`;
         const xj = x0[j] === 0 ? vars[j] : `(${vars[j]} - ${formatCoeff(x0[j])})`;
-        terms.push(`${formatCoeff(cross3)}*${xi}*${xj}`);
+        terms.push(`${formatCoeff(cross4)}*${xi}*${xj}`);
       }
     }
   }
@@ -45950,12 +45919,12 @@ function svds(A, k = 1, opts) {
 }
 
 // src/numeric/structured-solvers.ts
-function thomasSolve(sub2, diag2, sup, d) {
+function thomasSolve(sub3, diag2, sup, d) {
   const n = diag2.length;
   if (n === 0) return [];
-  if (sub2.length !== n - 1 || sup.length !== n - 1 || d.length !== n) {
+  if (sub3.length !== n - 1 || sup.length !== n - 1 || d.length !== n) {
     throw new Error(
-      `thomasSolve: expected sub/sup of length ${n - 1} and d of length ${n}, got sub=${sub2.length}, sup=${sup.length}, d=${d.length}`
+      `thomasSolve: expected sub/sup of length ${n - 1} and d of length ${n}, got sub=${sub3.length}, sup=${sup.length}, d=${d.length}`
     );
   }
   const cp = new Array(n).fill(0);
@@ -45964,12 +45933,12 @@ function thomasSolve(sub2, diag2, sup, d) {
   cp[0] = n > 1 ? sup[0] / diag2[0] : 0;
   dp[0] = d[0] / diag2[0];
   for (let i = 1; i < n; i++) {
-    const m = diag2[i] - sub2[i - 1] * cp[i - 1];
+    const m = diag2[i] - sub3[i - 1] * cp[i - 1];
     if (m === 0) {
       throw new Error(`thomasSolve: zero pivot at row ${i} (no pivoting is performed)`);
     }
     cp[i] = i < n - 1 ? sup[i] / m : 0;
-    dp[i] = (d[i] - sub2[i - 1] * dp[i - 1]) / m;
+    dp[i] = (d[i] - sub3[i - 1] * dp[i - 1]) / m;
   }
   const x = new Array(n);
   x[n - 1] = dp[n - 1];
@@ -47554,17 +47523,17 @@ function nelderMead(f, x0, opts = {}) {
     return c;
   };
   const add4 = (a, b, s) => a.map((v, i) => v + s * b[i]);
-  const sub2 = (a, b) => a.map((v, i) => v - b[i]);
+  const sub3 = (a, b) => a.map((v, i) => v - b[i]);
   for (; iter < maxIter; iter++) {
     const order = fv.map((_, i) => i).sort((i, j) => fv[i] - fv[j]);
     simplex = order.map((i) => simplex[i]);
     fv = order.map((i) => fv[i]);
     if (Math.abs(fv[n] - fv[0]) <= tol * (Math.abs(fv[0]) + tol)) break;
     const c = centroid2(simplex.slice(0, n));
-    const xr = add4(c, sub2(c, simplex[n]), alpha);
+    const xr = add4(c, sub3(c, simplex[n]), alpha);
     const fr = f(xr);
     if (fr < fv[0]) {
-      const xe = add4(c, sub2(c, simplex[n]), gamma2);
+      const xe = add4(c, sub3(c, simplex[n]), gamma2);
       const fe = f(xe);
       if (fe < fr) {
         simplex[n] = xe;
@@ -47577,14 +47546,14 @@ function nelderMead(f, x0, opts = {}) {
       simplex[n] = xr;
       fv[n] = fr;
     } else {
-      const xc = add4(c, sub2(simplex[n], c), rho);
+      const xc = add4(c, sub3(simplex[n], c), rho);
       const fc = f(xc);
       if (fc < fv[n]) {
         simplex[n] = xc;
         fv[n] = fc;
       } else {
         for (let i = 1; i <= n; i++) {
-          simplex[i] = add4(simplex[0], sub2(simplex[i], simplex[0]), sigma);
+          simplex[i] = add4(simplex[0], sub3(simplex[i], simplex[0]), sigma);
           fv[i] = f(simplex[i]);
         }
       }
@@ -50204,12 +50173,12 @@ function rickerWavelet(points, scale4) {
   return out;
 }
 function morletWavelet(points, scale4) {
-  const norm4 = 1 / (Math.sqrt(scale4) * Math.pow(Math.PI, 0.25));
+  const norm5 = 1 / (Math.sqrt(scale4) * Math.pow(Math.PI, 0.25));
   const out = new Array(points);
   const center3 = (points - 1) / 2;
   for (let i = 0; i < points; i++) {
     const t = (i - center3) / scale4;
-    out[i] = norm4 * Math.cos(5 * t) * Math.exp(-(t * t) / 2);
+    out[i] = norm5 * Math.cos(5 * t) * Math.exp(-(t * t) / 2);
   }
   return out;
 }
@@ -50756,6 +50725,264 @@ function segmentSegmentClosest(p1, p2, q1, q2) {
   return { point1, point2, distance: distance2 };
 }
 
+// src/geometry/hull.ts
+function hull2DIndices(points) {
+  const n = points.length;
+  const order = Array.from({ length: n }, (_, i) => i).sort(
+    (a, b) => points[a][0] - points[b][0] || points[a][1] - points[b][1]
+  );
+  const cross4 = (o, a, b) => (points[a][0] - points[o][0]) * (points[b][1] - points[o][1]) - (points[a][1] - points[o][1]) * (points[b][0] - points[o][0]);
+  const lower = [];
+  for (const i of order) {
+    while (lower.length >= 2 && cross4(lower[lower.length - 2], lower[lower.length - 1], i) <= 0) {
+      lower.pop();
+    }
+    lower.push(i);
+  }
+  const upper = [];
+  for (let k = order.length - 1; k >= 0; k--) {
+    const i = order[k];
+    while (upper.length >= 2 && cross4(upper[upper.length - 2], upper[upper.length - 1], i) <= 0) {
+      upper.pop();
+    }
+    upper.push(i);
+  }
+  lower.pop();
+  upper.pop();
+  return lower.concat(upper);
+}
+function convexHull2D2(points) {
+  const vertices = hull2DIndices(points);
+  const m = vertices.length;
+  const simplices = [];
+  let signedArea = 0;
+  let perimeter = 0;
+  for (let k = 0; k < m; k++) {
+    const i = vertices[k];
+    const j = vertices[(k + 1) % m];
+    simplices.push([i, j]);
+    const a = points[i];
+    const b = points[j];
+    signedArea += a[0] * b[1] - b[0] * a[1];
+    perimeter += Math.hypot(b[0] - a[0], b[1] - a[1]);
+  }
+  return { vertices, simplices, area: perimeter, volume: Math.abs(signedArea) / 2 };
+}
+function convexHull3DResult(points) {
+  const faces = convexHull3D(points);
+  const vertexSet = /* @__PURE__ */ new Set();
+  let volume6 = 0;
+  let surface = 0;
+  for (const [ia, ib, ic] of faces) {
+    vertexSet.add(ia);
+    vertexSet.add(ib);
+    vertexSet.add(ic);
+    const a = points[ia];
+    const b = points[ib];
+    const c = points[ic];
+    volume6 += a[0] * (b[1] * c[2] - b[2] * c[1]) - a[1] * (b[0] * c[2] - b[2] * c[0]) + a[2] * (b[0] * c[1] - b[1] * c[0]);
+    const ux = b[0] - a[0];
+    const uy = b[1] - a[1];
+    const uz = b[2] - a[2];
+    const vx = c[0] - a[0];
+    const vy = c[1] - a[1];
+    const vz = c[2] - a[2];
+    const cx = uy * vz - uz * vy;
+    const cy = uz * vx - ux * vz;
+    const cz = ux * vy - uy * vx;
+    surface += Math.hypot(cx, cy, cz) / 2;
+  }
+  return {
+    vertices: Array.from(vertexSet).sort((a, b) => a - b),
+    simplices: faces.map((f) => [...f]),
+    area: surface,
+    volume: Math.abs(volume6) / 6
+  };
+}
+function convexHull(points) {
+  if (!Array.isArray(points) || points.length === 0) {
+    throw new Error("convexHull: requires a non-empty array of points");
+  }
+  const dim = points[0].length;
+  if (dim === 2) {
+    if (points.length < 3) throw new Error("convexHull: 2-D hull requires at least 3 points");
+    return convexHull2D2(points);
+  }
+  if (dim === 3) {
+    if (points.length < 4) throw new Error("convexHull: 3-D hull requires at least 4 points");
+    return convexHull3DResult(points);
+  }
+  throw new Error(`convexHull: only 2-D and 3-D point sets are supported (got dimension ${dim})`);
+}
+
+// src/geometry/delaunay.ts
+function delaunay(points) {
+  if (!Array.isArray(points) || points.length < 3) {
+    throw new Error("delaunay: requires at least 3 points");
+  }
+  if (points[0].length !== 2) {
+    throw new Error("delaunay: only 2-D point sets are supported");
+  }
+  return { simplices: delaunayTriangulation(points).map((t) => [...t]) };
+}
+
+// src/geometry/voronoi.ts
+function circumcenter(a, b, c) {
+  const d = 2 * (a[0] * (b[1] - c[1]) + b[0] * (c[1] - a[1]) + c[0] * (a[1] - b[1]));
+  if (Math.abs(d) < 1e-15) return null;
+  const a2 = a[0] * a[0] + a[1] * a[1];
+  const b2 = b[0] * b[0] + b[1] * b[1];
+  const c2 = c[0] * c[0] + c[1] * c[1];
+  const ux = (a2 * (b[1] - c[1]) + b2 * (c[1] - a[1]) + c2 * (a[1] - b[1])) / d;
+  const uy = (a2 * (c[0] - b[0]) + b2 * (a[0] - c[0]) + c2 * (b[0] - a[0])) / d;
+  return [ux, uy];
+}
+function voronoi(points) {
+  const { simplices: tris } = delaunay(points);
+  const vertices = [];
+  const simplices = [];
+  const regions = Array.from({ length: points.length }, () => []);
+  for (const t of tris) {
+    const cc = circumcenter(points[t[0]], points[t[1]], points[t[2]]);
+    if (cc === null) continue;
+    const vIdx = vertices.length;
+    vertices.push(cc);
+    simplices.push([...t]);
+    for (const p of t) regions[p].push(vIdx);
+  }
+  return { vertices, simplices, regions };
+}
+
+// src/geometry/alpha-shape.ts
+function circumradius(a, b, c) {
+  const d = 2 * (a[0] * (b[1] - c[1]) + b[0] * (c[1] - a[1]) + c[0] * (a[1] - b[1]));
+  if (Math.abs(d) < 1e-15) return Infinity;
+  const a2 = a[0] * a[0] + a[1] * a[1];
+  const b2 = b[0] * b[0] + b[1] * b[1];
+  const c2 = c[0] * c[0] + c[1] * c[1];
+  const ux = (a2 * (b[1] - c[1]) + b2 * (c[1] - a[1]) + c2 * (a[1] - b[1])) / d;
+  const uy = (a2 * (c[0] - b[0]) + b2 * (a[0] - c[0]) + c2 * (b[0] - a[0])) / d;
+  return Math.hypot(a[0] - ux, a[1] - uy);
+}
+function alphaShape(points, alpha) {
+  if (!(alpha > 0)) throw new Error("alphaShape: alpha must be positive");
+  const { simplices: tris } = delaunay(points);
+  const threshold = 1 / alpha;
+  const triangles = [];
+  const edgeCount = /* @__PURE__ */ new Map();
+  for (const t of tris) {
+    if (circumradius(points[t[0]], points[t[1]], points[t[2]]) > threshold) continue;
+    triangles.push([...t]);
+    const es = [
+      [t[0], t[1]],
+      [t[1], t[2]],
+      [t[2], t[0]]
+    ];
+    for (const [u, v] of es) {
+      const key = `${Math.min(u, v)},${Math.max(u, v)}`;
+      edgeCount.set(key, (edgeCount.get(key) ?? 0) + 1);
+    }
+  }
+  const edges = [];
+  for (const [key, count2] of edgeCount) {
+    if (count2 === 1) {
+      const [lo, hi] = key.split(",").map(Number);
+      edges.push([lo, hi]);
+    }
+  }
+  return { triangles, edges };
+}
+
+// src/geometry/spherical-voronoi.ts
+function sub2(a, b) {
+  return [a[0] - b[0], a[1] - b[1], a[2] - b[2]];
+}
+function cross3(a, b) {
+  return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
+}
+function dot8(a, b) {
+  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+}
+function norm4(a) {
+  return Math.hypot(a[0], a[1], a[2]);
+}
+function normalize2(a) {
+  const n = norm4(a) || 1;
+  return [a[0] / n, a[1] / n, a[2] / n];
+}
+function geodesicAngle(u, v) {
+  return Math.atan2(norm4(cross3(u, v)), dot8(u, v));
+}
+function sphericalTriangleArea(a, b, c) {
+  const A = geodesicAngle(b, c);
+  const B = geodesicAngle(a, c);
+  const C = geodesicAngle(a, b);
+  const s = (A + B + C) / 2;
+  const t = Math.tan(s / 2) * Math.tan((s - A) / 2) * Math.tan((s - B) / 2) * Math.tan((s - C) / 2);
+  return 4 * Math.atan(Math.sqrt(Math.max(0, t)));
+}
+function sphericalVoronoi(points, radius = 1, center3 = [0, 0, 0]) {
+  if (!Array.isArray(points) || points.length < 4) {
+    throw new Error("sphericalVoronoi: requires at least 4 points");
+  }
+  if (points[0].length !== 3) {
+    throw new Error("sphericalVoronoi: only 3-D point sets are supported");
+  }
+  const gen = points.map((p) => normalize2(sub2(p, center3)));
+  const faces = convexHull3D(points);
+  const vertices = [];
+  const vertDir = [];
+  const incident = Array.from({ length: points.length }, () => []);
+  faces.forEach((f, fi) => {
+    const a = gen[f[0]];
+    const b = gen[f[1]];
+    const c = gen[f[2]];
+    let nrm = cross3(sub2(b, a), sub2(c, a));
+    if (dot8(nrm, a) < 0) nrm = [-nrm[0], -nrm[1], -nrm[2]];
+    const dir = normalize2(nrm);
+    vertDir.push(dir);
+    vertices.push([
+      center3[0] + radius * dir[0],
+      center3[1] + radius * dir[1],
+      center3[2] + radius * dir[2]
+    ]);
+    for (const p of f) incident[p].push(fi);
+  });
+  const regions = [];
+  const areas = [];
+  for (let g = 0; g < points.length; g++) {
+    const gdir = gen[g];
+    const facs = incident[g];
+    let ref = null;
+    const withAngle = facs.map((fi) => {
+      const d = vertDir[fi];
+      const tang = normalize2(
+        sub2(d, [gdir[0] * dot8(d, gdir), gdir[1] * dot8(d, gdir), gdir[2] * dot8(d, gdir)])
+      );
+      if (ref === null) {
+        ref = tang;
+        return { fi, ang: 0 };
+      }
+      const x = dot8(tang, ref);
+      const y = dot8(cross3(gdir, ref), tang);
+      let ang = Math.atan2(y, x);
+      if (ang < 0) ang += 2 * Math.PI;
+      return { fi, ang };
+    });
+    withAngle.sort((p, q) => p.ang - q.ang);
+    const ring = withAngle.map((w) => w.fi);
+    regions.push(ring);
+    let area2 = 0;
+    for (let k = 0; k < ring.length; k++) {
+      const v1 = vertDir[ring[k]];
+      const v2 = vertDir[ring[(k + 1) % ring.length]];
+      area2 += sphericalTriangleArea(gdir, v1, v2);
+    }
+    areas.push(area2 * radius * radius);
+  }
+  return { vertices, regions, areas };
+}
+
 // src/stats/inference-extra2.ts
 var TWO_PI = 2 * Math.PI;
 function noncentralChi2CDF(x, df, nc) {
@@ -51965,9 +52192,9 @@ function katzCentrality(adj, alpha, beta2 = 1) {
     sum3 += xi;
     sumSq += xi * xi;
   }
-  const norm4 = Math.sign(sum3) * Math.sqrt(sumSq);
-  if (norm4 === 0) return x;
-  return x.map((xi) => xi / norm4);
+  const norm5 = Math.sign(sum3) * Math.sqrt(sumSq);
+  if (norm5 === 0) return x;
+  return x.map((xi) => xi / norm5);
 }
 function isIsomorphic(graphA, graphB) {
   const n = graphA.length;
@@ -52522,6 +52749,7 @@ export {
   adjacencyMatrix,
   airyAi,
   airyBi,
+  alphaShape,
   and,
   andersonDarlingTest,
   angle2D,
@@ -52666,6 +52894,7 @@ export {
   connectedComponents,
   continuedFraction,
   convexHull,
+  convexHull2D,
   convexHull3D,
   convolve,
   coordinateTransform,
@@ -52717,6 +52946,7 @@ export {
   deconvolve,
   deepEqual,
   degree,
+  delaunay,
   delaunayTriangulation,
   derivative,
   derivativeAt,
@@ -53423,6 +53653,7 @@ export {
   spectralClustering,
   spectrogram,
   speedOfLight,
+  sphericalVoronoi,
   splitUnit,
   sqrt,
   sqrtm,
@@ -53526,6 +53757,7 @@ export {
   variance,
   variation,
   vonMisesPDF,
+  voronoi,
   voronoiDiagram,
   wavedec,
   waverec,

package/dist/typed/geometry.d.ts

@@ -61,12 +61,16 @@ export declare function triangleArea(a: number[], b: number[], c: number[]): f64
 export declare function polygonArea(vertices: number[][]): f64;
 /**
  * Compute the convex hull of a set of 2D points using Andrew's monotone chain algorithm.
- * Returns vertices in counter-clockwise order.
+ * Returns vertices (as coordinates) in counter-clockwise order.
+ *
+ * Internal, WASM-sort-accelerated 2-D hull. The public, structured hull API
+ * (indices + area/volume, 2-D and 3-D) is `convexHull` in
+ * `../geometry/hull.ts`.
  *
  * @param points - Array of [x, y] points
- * @returns Convex hull vertices in CCW order
+ * @returns Convex hull vertices (coordinates) in CCW order
  */
-export declare function convexHull(points: number[][]): number[][];
+export declare function convexHull2D(points: number[][]): number[][];
 /**
  * Determine if a 2D point lies inside a polygon using the ray casting algorithm.
  *

package/dist/typed/geometry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometry.d.ts","sourceRoot":"","sources":["../../src/typed/geometry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAUH,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAYlB;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,GAAG,CAMvD;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,GAAG,CAMvD;AAMD;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAE1D;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAEnD;AAMD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAEvE;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,GAAG,CAUrD;AAMD;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CA0DzD;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAkB5E;AAMD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,GAAG,MAAM,EAAE,CAIhE;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,GAAG,MAAM,EAAE,CAahF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAMrE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAMnE;AAMD;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAExD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAExD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAOxD;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,EAAE,MAAM,EAAE,GAChB,GAAG,CAgBL;AAMD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,GACX,MAAM,EAAE,GAAG,IAAI,CAOjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,GACX,MAAM,EAAE,GAAG,IAAI,CAiBjB;AAMD;;GAEG;AACH,MAAM,MAAM,KAAK,GACb;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,CAAC;AAEnD;;;;;;;;;GASG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAatC;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CA2BvD;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,aAAa,EACzD,EAAE,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,aAAa,GACtD,MAAM,EAAE,CAkDV;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,GAAG,CAS1D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAK/D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAK/D;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAQvE;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAuHpE;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAC3B;IAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAA;CAAE,CAqG/C;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,GAAG,CAAC;IACX,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IACxB,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IACzB,IAAI,EAAE,GAAG,CAAC;CACX;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,UAAU,GAAG,IAAI,CAuB5D;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,UAAU,GAAG,IAAI,EACvB,MAAM,EAAE,MAAM,EAAE,GACf;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,QAAQ,EAAE,GAAG,CAAA;CAAE,GAAG,IAAI,CAyBvD;AAQD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,KAAK,EAAE,MAAM,EAAE,GACd;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,QAAQ,EAAE,GAAG,CAAA;CAAE,GAAG,IAAI,CAmDvD;AAMD;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAEzC;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,UAAU,EAAE,CAoD7D;AAqJD;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CA0B5E"}
+{"version":3,"file":"geometry.d.ts","sourceRoot":"","sources":["../../src/typed/geometry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAUH,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAYlB;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,GAAG,CAMvD;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,GAAG,CAMvD;AAMD;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAE1D;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAEnD;AAMD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAEvE;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,GAAG,CAUrD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CA0D3D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAkB5E;AAMD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,GAAG,MAAM,EAAE,CAIhE;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,GAAG,MAAM,EAAE,CAahF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAMrE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAMnE;AAMD;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAExD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAExD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAOxD;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,EAAE,MAAM,EAAE,GAChB,GAAG,CAgBL;AAMD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,GACX,MAAM,EAAE,GAAG,IAAI,CAOjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,GACX,MAAM,EAAE,GAAG,IAAI,CAiBjB;AAMD;;GAEG;AACH,MAAM,MAAM,KAAK,GACb;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,CAAC;AAEnD;;;;;;;;;GASG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAatC;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CA2BvD;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,aAAa,EACzD,EAAE,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,aAAa,GACtD,MAAM,EAAE,CAkDV;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,GAAG,CAS1D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAK/D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAK/D;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAQvE;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CA4FpE;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAC3B;IAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAA;CAAE,CAqG/C;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,GAAG,CAAC;IACX,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IACxB,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IACzB,IAAI,EAAE,GAAG,CAAC;CACX;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,UAAU,GAAG,IAAI,CAuB5D;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,UAAU,GAAG,IAAI,EACvB,MAAM,EAAE,MAAM,EAAE,GACf;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,QAAQ,EAAE,GAAG,CAAA;CAAE,GAAG,IAAI,CAyBvD;AAQD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,KAAK,EAAE,MAAM,EAAE,GACd;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC;IAAC,QAAQ,EAAE,GAAG,CAAA;CAAE,GAAG,IAAI,CAmDvD;AAMD;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAEzC;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,UAAU,EAAE,CAoD7D;AAqJD;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CA0B5E"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-functions",
-  "version": "0.49.0",
+  "version": "0.50.0",
   "description": "Mathematical functions for MathTS - arithmetic, algebra, trigonometry, statistics, and more",
   "author": "Daniel Simon Jr.",
   "license": "MIT",