flo-mat 3.0.5 → 3.0.7

package/jest.config.cjs

@@ -0,0 +1,32 @@
+
+const esModules = [
+    'flo-bezier3',
+    'flo-graham-scan',
+    'flo-poly',
+    'flo-gauss-quadrature',
+    'flo-vector2d',
+    'big-float-ts',
+    'double-double',
+    'flo-boolean',
+    'flo-draw',
+    'flo-memoize',
+    'flo-ll-rb-tree',
+    'flo-lines-intersections',
+    'squares-rng'
+].join('|');
+
+/** @type {import('ts-jest').JestConfigWithTsJest} */
+module.exports = {
+    testEnvironment: 'node',
+    resolver: "jest-ts-webcompat-resolver",
+    testMatch: [ "**/__tests__/**/*.spec.ts"],
+    collectCoverage: false,  // Make true again!
+    coverageProvider: 'v8',
+    testTimeout: 15000,
+    transform: {
+        "^.+\\.(t|j)sx?$": "@swc/jest"
+    },
+    transformIgnorePatterns: [
+        `/node_modules/(?!${esModules})`
+    ]
+};

package/node/corner/get-interface-ccw.js

@@ -1,5 +1,4 @@
 import { eAdd, eEstimate, eMult, eNegativeOf, twoDiff } from 'big-float-ts';
-// import { dot } from "flo-vector2d";
 import { compareCurvaturesAtInterface } from "./compare-curvatures-at-interface.js";
 /**
  * Returns a positive value if the second bezier (of order 1, 2 or 3) curves

package/node/corner/get-interface-ccw.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../../src/corner/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAa,SAAS,EAAE,KAAK,EAAE,WAAW,EAAsB,OAAO,EAAE,MAAM,cAAc,CAAC;AAC3G,sCAAsC;AACtC,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,eAAe,CAChB,GAAe,EACf,GAAe;IAQnB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,8CAA8C;IAC9C,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACrB,yEAAyE;IACzE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,yCAAyC;IACzC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB,uDAAuD;IACvD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IAC5C,CAAC;IACD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IACvC,CAAC;IAED,MAAM,aAAa,GAAG,YAAY,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAE,uBAAuB;IAEtE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAC5D,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACtD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAEzD,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,aAAa,KAAK,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO;YACG,GAAG,EAAE,aAAa;YAClB,QAAQ;YACR,QAAQ;YACR,iBAAiB;YACjB,WAAW;SACd,CAAA;IACL,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IAEpB,QAAQ;IACR,gEAAgE;IAChE,6DAA6D;IAC7D,oEAAoE;IACpE,mEAAmE;IACnE,cAAc;IACd,OAAO;QACH,GAAG,EAAE,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC;QAC7D,QAAQ;QACR,QAAQ;QACR,iBAAiB;QACjB,WAAW;KACd,CAAA;AACL,CAAC;AAGD,SAAS,WAAW,CACZ,EAAY,EACZ,EAAY;IAEhB,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CACX,QAAoB,EACpB,QAAoB;IAExB,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IAE1B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAGD;;;;GAIG;AACH,SAAS,YAAY,CACb,EAAY,EACZ,EAAY,EACZ,EAAY;IAEhB,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
+{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../../src/corner/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAa,SAAS,EAAE,KAAK,EAAE,WAAW,EAAsB,OAAO,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,eAAe,CAChB,GAAe,EACf,GAAe;IAQnB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,8CAA8C;IAC9C,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACrB,yEAAyE;IACzE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,yCAAyC;IACzC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB,uDAAuD;IACvD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IAC5C,CAAC;IACD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IACvC,CAAC;IAED,MAAM,aAAa,GAAG,YAAY,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAE,uBAAuB;IAEtE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAC5D,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACtD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAEzD,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,aAAa,KAAK,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO;YACG,GAAG,EAAE,aAAa;YAClB,QAAQ;YACR,QAAQ;YACR,iBAAiB;YACjB,WAAW;SACd,CAAA;IACL,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IAEpB,QAAQ;IACR,gEAAgE;IAChE,6DAA6D;IAC7D,oEAAoE;IACpE,mEAAmE;IACnE,cAAc;IACd,OAAO;QACH,GAAG,EAAE,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC;QAC7D,QAAQ;QACR,QAAQ;QACR,iBAAiB;QACjB,WAAW;KACd,CAAA;AACL,CAAC;AAGD,SAAS,WAAW,CACZ,EAAY,EACZ,EAAY;IAEhB,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CACX,QAAoB,EACpB,QAAoB;IAExB,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IAE1B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAGD;;;;GAIG;AACH,SAAS,YAAY,CACb,EAAY,EACZ,EAAY,EACZ,EAAY;IAEhB,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/cp-node/cp-node-fs.d.ts

@@ -34,7 +34,7 @@ import { getInitialDegAngleBetweenMatCurves } from "./fs/get-angle-between-mat-c
 import { getAllVertices } from "./fs/get-all-vertices.js";
 declare const CpNodeFs: {
     /**
-     * Returns the children of this [[CpNode]] when seen as a MAT edge. Only
+     * Returns the children of this `CpNode` when seen as a MAT edge. Only
      * children in a 'forward' direction are returned. These include all edges
      * except the 'backward' edge given by [[prevOnCircle]], even terminating
      * edges.
@@ -42,7 +42,7 @@ declare const CpNodeFs: {
     getChildren: typeof getChildren;
     /**
      * Similar to [[getChildren]] but returns the child nodes of the tree when
-     * [[CpNode]] is seen as a MAT vertex point (as opposed to edge). In this
+     * `CpNode` is seen as a MAT vertex point (as opposed to edge). In this
      * way the dual graph of the tree can easily be traversed - see e.g.
      * [[traverseVertices]]. Generally, however, traversing the edges is
      * preferred as it returns the entire Medial Axis (by utilizing
@@ -50,7 +50,7 @@ declare const CpNodeFs: {
      */
     getVertexForwardChildren: typeof getVertexForwardChildren;
     /**
-     * Returns all [[CpNode]]s on the MAT that this [[CpNode]] is part of
+     * Returns all `CpNode`s on the MAT that this `CpNode` is part of
      * starting from the current one and going anti-clockwise around the shape.
      */
     getAllOnLoop: typeof getAllOnLoop;
@@ -58,18 +58,18 @@ declare const CpNodeFs: {
      * Return this (except if exclThis is truthy) and the the other CpNodes
      * around the maximal disk vertex circle in an anti-clockwise order.
      * @param exclThis If true the returned array does not include this
-     * [[CpNode]].
+     * `CpNode`.
      */
     getAllOnCircle: typeof getAllOnCircle;
     /**
-     * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
+     * Returns true if the 2 given `CpNode`s are on the same maximal disk
      * circle.
-     * @param cpNode1 A [[CpNode]].
-     * @param cpNode2 Another [[CpNode]]
+     * @param cpNode1 A `CpNode`.
+     * @param cpNode2 Another `CpNode`
      */
     isOnSameCircle: typeof isOnSameCircle;
     /**
-     * Returns true if this [[CpNode]] is terminating, i.e. implies a leaf MAT
+     * Returns true if this `CpNode` is terminating, i.e. implies a leaf MAT
      * vertex.
      *
      * This is always the case for sharp corners and maximal disks with
@@ -77,7 +77,7 @@ declare const CpNodeFs: {
      * two contact points stored (sitting 'on top' of each other) for the
      * maximal disk. It can be seen as a limiting case of a two-prong where the
      * distance between two of the contact points tend to zero. One point
-     * (represented by a [[CpNode]] of course) will be terminating with the
+     * (represented by a `CpNode` of course) will be terminating with the
      * other point being its [[next]], whereas the other point will *not* be
      * terminating and 'points' back into the shape.
      */
@@ -88,30 +88,30 @@ declare const CpNodeFs: {
      */
     isFullyTerminating: typeof isFullyTerminating;
     /**
-     * Returns the first [[CpNode]] (from this one by successively applying
+     * Returns the first `CpNode` (from this one by successively applying
      * .nextOnCircle) that exits the circle.
      */
     getFirstExit: typeof getFirstExit;
     /**
-     * Returns true if this [[CpNode]] represents a sharp corner, i.e. the
+     * Returns true if this `CpNode` represents a sharp corner, i.e. the
      * limiting case of a two-prong having zero radius.
      *
-     * Note that two [[CpNode]]s are stored for each sharp corner, one being
+     * Note that two `CpNode`s are stored for each sharp corner, one being
      * terminating and one not. See [[isTerminating]] for more details.
      */
     isSharp: typeof isSharp;
     /**
-     * Returns true if this [[CpNode]]'s maximal disk has only one contact point
+     * Returns true if this `CpNode`'s maximal disk has only one contact point
      * on the shape boundary (up to planar coordinates). These includes sharp
      * corners.
      *
-     * Note, however, that two [[CpNode]]s are stored for each such point to
+     * Note, however, that two `CpNode`s are stored for each such point to
      * preserve symmetry - see [[isTerminating]] for more details.
      */
     isOneProng: typeof isOneProng;
     /**
      * Returns the number of contact points on the maximal disk circle implied
-     * by this [[CpNode]].
+     * by this `CpNode`.
      *
      * Note, however, that even one-prongs and sharp corners will return 2 (see
      * [[isTerminating]] for more details); if this is not desired use
@@ -120,7 +120,7 @@ declare const CpNodeFs: {
     getProngCount: typeof getProngCount;
     /**
      * Returns the number of contact points (up to planar coordinates) on the
-     * maximal disk circle implied by this [[CpNode]].
+     * maximal disk circle implied by this `CpNode`.
      *
      * See also [[getProngCount]].
      */
@@ -128,8 +128,8 @@ declare const CpNodeFs: {
     /**
      * Primarily for internal use.
      *
-     * Compares the order of two [[CpNode]]s. The order is cyclic and depends
-     * on a [[CpNode]]'s relative position along the shape boundary.
+     * Compares the order of two `CpNode`s. The order is cyclic and depends
+     * on a `CpNode`'s relative position along the shape boundary.
      */
     cpNodeComparator: (a: CpNode, b: CpNode) => number;
     /**
@@ -149,26 +149,26 @@ declare const CpNodeFs: {
     traverseCp: typeof traverseCp;
     /**
      * Traverses all edges (depth first) of the given MAT tree starting at the given
-     * vertex (represented by a [[CpNode]]).
-     * @param cpNode Any [[CpNode]] representing the start vertex.
+     * vertex (represented by a `CpNode`).
+     * @param cpNode Any `CpNode` representing the start vertex.
      * @param traverseEdgesCallback A callback function for each CpNode representing the vertex at the
      * start of an edge.
      */
     traverseEdges: typeof traverseEdges;
     /**
      * Traverses the MAT tree and calls the given callback function for each vertex
-     * (represented by a [[CpNode]]) on the MAT.
+     * (represented by a `CpNode`) on the MAT.
      *
      * It is usually preferable to use [[traverseEdges]] as it allows for the
      * traversal of all the smooth curves representing the MAT.
-     * @param cpNode Any [[CpNode]] representing the start vertex.
-     * @param traverseVerticesCallback A callback function taking a single [[CpNode]] as parameter.
+     * @param cpNode Any `CpNode` representing the start vertex.
+     * @param traverseVerticesCallback A callback function taking a single `CpNode` as parameter.
      */
     traverseVertices: typeof traverseVertices;
     /**
-     * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
-     * since cloning a single [[CpNode]] necessarily implies cloning all
-     * [[CpNode]]s on the same MAT tree.
+     * Returns a deep clone of this `CpNode`. Can be used to copy the MAT
+     * since cloning a single `CpNode` necessarily implies cloning all
+     * `CpNode`s on the same MAT tree.
      */
     clone: typeof clone;
     /**
@@ -185,13 +185,13 @@ declare const CpNodeFs: {
     getBoundaryBeziersToNext: typeof getBoundaryBeziersToNext;
     /**
      * Removes a cpNode from the MAT.
-     * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
-     * @param cpNode The [[CpNode]] to remove.
+     * @param cpTree The tree graph holding the `CpNodes` of the MAT.
+     * @param cpNode The `CpNode` to remove.
      */
     removeVertex: typeof removeVertex;
     /**
-     * Returns the bezier curve from the maximal disk of the given [[CpNode]] to the
-     * next [[CpNode]]'s maximal disk and thus directly represents a piece of the
+     * Returns the bezier curve from the maximal disk of the given `CpNode` to the
+     * next `CpNode`'s maximal disk and thus directly represents a piece of the
      * medial axis.
      * @param cpNode
      */
@@ -201,8 +201,8 @@ declare const CpNodeFs: {
     getBranchBeziers: typeof getBranchBeziers;
     getSalience: typeof getSalience;
     /**
-     * Returns the bezier curve from the maximal disk of one [[CpNode]] to another
-     * [[CpNode]]'s maximal disk.
+     * Returns the bezier curve from the maximal disk of one `CpNode` to another
+     * `CpNode`'s maximal disk.
      * @param cpNodeFrom
      * @param cpNodeTo
      */

package/node/cp-node/cp-node-fs.js

@@ -36,7 +36,7 @@ import { getAllVertices } from "./fs/get-all-vertices.js";
 const cpNodeComparator = (a, b) => compareCps(a.cp, b.cp);
 const CpNodeFs = {
     /**
-     * Returns the children of this [[CpNode]] when seen as a MAT edge. Only
+     * Returns the children of this `CpNode` when seen as a MAT edge. Only
      * children in a 'forward' direction are returned. These include all edges
      * except the 'backward' edge given by [[prevOnCircle]], even terminating
      * edges.
@@ -44,7 +44,7 @@ const CpNodeFs = {
     getChildren,
     /**
      * Similar to [[getChildren]] but returns the child nodes of the tree when
-     * [[CpNode]] is seen as a MAT vertex point (as opposed to edge). In this
+     * `CpNode` is seen as a MAT vertex point (as opposed to edge). In this
      * way the dual graph of the tree can easily be traversed - see e.g.
      * [[traverseVertices]]. Generally, however, traversing the edges is
      * preferred as it returns the entire Medial Axis (by utilizing
@@ -52,7 +52,7 @@ const CpNodeFs = {
      */
     getVertexForwardChildren,
     /**
-     * Returns all [[CpNode]]s on the MAT that this [[CpNode]] is part of
+     * Returns all `CpNode`s on the MAT that this `CpNode` is part of
      * starting from the current one and going anti-clockwise around the shape.
      */
     getAllOnLoop,
@@ -60,18 +60,18 @@ const CpNodeFs = {
      * Return this (except if exclThis is truthy) and the the other CpNodes
      * around the maximal disk vertex circle in an anti-clockwise order.
      * @param exclThis If true the returned array does not include this
-     * [[CpNode]].
+     * `CpNode`.
      */
     getAllOnCircle,
     /**
-     * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
+     * Returns true if the 2 given `CpNode`s are on the same maximal disk
      * circle.
-     * @param cpNode1 A [[CpNode]].
-     * @param cpNode2 Another [[CpNode]]
+     * @param cpNode1 A `CpNode`.
+     * @param cpNode2 Another `CpNode`
      */
     isOnSameCircle,
     /**
-     * Returns true if this [[CpNode]] is terminating, i.e. implies a leaf MAT
+     * Returns true if this `CpNode` is terminating, i.e. implies a leaf MAT
      * vertex.
      *
      * This is always the case for sharp corners and maximal disks with
@@ -79,7 +79,7 @@ const CpNodeFs = {
      * two contact points stored (sitting 'on top' of each other) for the
      * maximal disk. It can be seen as a limiting case of a two-prong where the
      * distance between two of the contact points tend to zero. One point
-     * (represented by a [[CpNode]] of course) will be terminating with the
+     * (represented by a `CpNode` of course) will be terminating with the
      * other point being its [[next]], whereas the other point will *not* be
      * terminating and 'points' back into the shape.
      */
@@ -90,30 +90,30 @@ const CpNodeFs = {
      */
     isFullyTerminating,
     /**
-     * Returns the first [[CpNode]] (from this one by successively applying
+     * Returns the first `CpNode` (from this one by successively applying
      * .nextOnCircle) that exits the circle.
      */
     getFirstExit,
     /**
-     * Returns true if this [[CpNode]] represents a sharp corner, i.e. the
+     * Returns true if this `CpNode` represents a sharp corner, i.e. the
      * limiting case of a two-prong having zero radius.
      *
-     * Note that two [[CpNode]]s are stored for each sharp corner, one being
+     * Note that two `CpNode`s are stored for each sharp corner, one being
      * terminating and one not. See [[isTerminating]] for more details.
      */
     isSharp,
     /**
-     * Returns true if this [[CpNode]]'s maximal disk has only one contact point
+     * Returns true if this `CpNode`'s maximal disk has only one contact point
      * on the shape boundary (up to planar coordinates). These includes sharp
      * corners.
      *
-     * Note, however, that two [[CpNode]]s are stored for each such point to
+     * Note, however, that two `CpNode`s are stored for each such point to
      * preserve symmetry - see [[isTerminating]] for more details.
      */
     isOneProng,
     /**
      * Returns the number of contact points on the maximal disk circle implied
-     * by this [[CpNode]].
+     * by this `CpNode`.
      *
      * Note, however, that even one-prongs and sharp corners will return 2 (see
      * [[isTerminating]] for more details); if this is not desired use
@@ -122,7 +122,7 @@ const CpNodeFs = {
     getProngCount,
     /**
      * Returns the number of contact points (up to planar coordinates) on the
-     * maximal disk circle implied by this [[CpNode]].
+     * maximal disk circle implied by this `CpNode`.
      *
      * See also [[getProngCount]].
      */
@@ -130,8 +130,8 @@ const CpNodeFs = {
     /**
      * Primarily for internal use.
      *
-     * Compares the order of two [[CpNode]]s. The order is cyclic and depends
-     * on a [[CpNode]]'s relative position along the shape boundary.
+     * Compares the order of two `CpNode`s. The order is cyclic and depends
+     * on a `CpNode`'s relative position along the shape boundary.
      */
     cpNodeComparator,
     /**
@@ -151,26 +151,26 @@ const CpNodeFs = {
     traverseCp,
     /**
      * Traverses all edges (depth first) of the given MAT tree starting at the given
-     * vertex (represented by a [[CpNode]]).
-     * @param cpNode Any [[CpNode]] representing the start vertex.
+     * vertex (represented by a `CpNode`).
+     * @param cpNode Any `CpNode` representing the start vertex.
      * @param traverseEdgesCallback A callback function for each CpNode representing the vertex at the
      * start of an edge.
      */
     traverseEdges,
     /**
      * Traverses the MAT tree and calls the given callback function for each vertex
-     * (represented by a [[CpNode]]) on the MAT.
+     * (represented by a `CpNode`) on the MAT.
      *
      * It is usually preferable to use [[traverseEdges]] as it allows for the
      * traversal of all the smooth curves representing the MAT.
-     * @param cpNode Any [[CpNode]] representing the start vertex.
-     * @param traverseVerticesCallback A callback function taking a single [[CpNode]] as parameter.
+     * @param cpNode Any `CpNode` representing the start vertex.
+     * @param traverseVerticesCallback A callback function taking a single `CpNode` as parameter.
      */
     traverseVertices,
     /**
-     * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
-     * since cloning a single [[CpNode]] necessarily implies cloning all
-     * [[CpNode]]s on the same MAT tree.
+     * Returns a deep clone of this `CpNode`. Can be used to copy the MAT
+     * since cloning a single `CpNode` necessarily implies cloning all
+     * `CpNode`s on the same MAT tree.
      */
     clone,
     /**
@@ -187,13 +187,13 @@ const CpNodeFs = {
     getBoundaryBeziersToNext,
     /**
      * Removes a cpNode from the MAT.
-     * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
-     * @param cpNode The [[CpNode]] to remove.
+     * @param cpTree The tree graph holding the `CpNodes` of the MAT.
+     * @param cpNode The `CpNode` to remove.
      */
     removeVertex,
     /**
-     * Returns the bezier curve from the maximal disk of the given [[CpNode]] to the
-     * next [[CpNode]]'s maximal disk and thus directly represents a piece of the
+     * Returns the bezier curve from the maximal disk of the given `CpNode` to the
+     * next `CpNode`'s maximal disk and thus directly represents a piece of the
      * medial axis.
      * @param cpNode
      */
@@ -203,8 +203,8 @@ const CpNodeFs = {
     getBranchBeziers,
     getSalience,
     /**
-     * Returns the bezier curve from the maximal disk of one [[CpNode]] to another
-     * [[CpNode]]'s maximal disk.
+     * Returns the bezier curve from the maximal disk of one `CpNode` to another
+     * `CpNode`'s maximal disk.
      * @param cpNodeFrom
      * @param cpNodeTo
      */

package/node/cp-node/cp-node.d.ts

@@ -5,7 +5,7 @@ import { ContactPoint } from '../contact-point/contact-point.js';
  * Since the MAT is a full representation of the shape boundary an instance of
  * this class contains both the information of a boundary point and a medial
  * axis point (and edge to the next point(s)). It also contains edges to other
- * [[CpNode]]s which allows for traversal of the MAT and thus implictly
+ * `CpNode`s which allows for traversal of the MAT and thus implictly
  * represents the entire MAT.
  *
  * To get the maximal disk circle (of which the center is on the medial axis)
@@ -14,7 +14,7 @@ import { ContactPoint } from '../contact-point/contact-point.js';
  * To get the boundary point, use [[cp]].pointOnShape.
  *
  * The edge [[next]] (resp. [[prev]]) allows one to move anti-clockwise (resp.
- * clockwise) on the shape boundary to the next [[CpNode]]. This also imposes a
+ * clockwise) on the shape boundary to the next `CpNode`. This also imposes a
  * direction of traversal of the MAT edges and vertices.
  *
  * The edge [[nextOnCircle]] (resp. [[prevOnCircle]]) allows one to go
@@ -24,19 +24,19 @@ import { ContactPoint } from '../contact-point/contact-point.js';
  *
  * Call [[getMatCurveBetween]](cpNodeFrom, cpNodeTo) or getMatCurveToNext(cpNode)
  * (replacing the older CpNode.[[matCurveToNextVertex]]) to get a bezier curve
- * from the maximal disk of this [[CpNode]] to the next [[CpNode]]'s
+ * from the maximal disk of this `CpNode` to the next `CpNode`'s
  * maximal disk and thus directly representing a piece of the medial axis.
  *
- * The function, [[getChildren]], returns the children of this [[CpNode]] when
+ * The function, [[getChildren]], returns the children of this `CpNode` when
  * seen as a MAT edge. Only children in a 'forward' direction are returned. These
  * include all edges except the 'backward' edge given by [[prevOnCircle]]. For
- * [[CpNode]]s having a maximal disk with 2 contact points (a 2-prong, the usual
+ * `CpNode`s having a maximal disk with 2 contact points (a 2-prong, the usual
  * case) the children will be the single edge [[next]]. For a 3-prong this will
  * be the edges [[next]] and [[nextOnCircle]], etc. [[getChildren]] allows one to
  * easily traverse the MAT tree - see e.g. the implementation of [[traverseEdges]].
  *
  * The getter, [[getVertexForwardChildren]], is similar to [[getChildren]] but returns the
- * child nodes of the tree when [[CpNode]] is seen as a MAT vertex point (as
+ * child nodes of the tree when `CpNode` is seen as a MAT vertex point (as
  * opposed to edge). In this way the dual graph of the tree can easily be
  * traversed - see e.g. [[traverseVertices]]. Generally, however, traversing the
  * edges is preferred as it returns the entire Medial Axis (by utilizing
@@ -48,23 +48,23 @@ import { ContactPoint } from '../contact-point/contact-point.js';
  * in opposite directions.
  */
 interface CpNode {
-    /** The shape boundary contact point, i.e. a [[CpNode]] without its edges. */
+    /** The shape boundary contact point, i.e. a `CpNode` without its edges. */
     cp: ContactPoint;
-    /** If true, this [[CpNode]] belongs to a hole-closing maximal disk. */
+    /** If true, this `CpNode` belongs to a hole-closing maximal disk. */
     isHoleClosing: boolean;
     /** true if this cpNode is at a shape boundary intersection point, false otherwise */
     isIntersection: boolean;
-    /** The previous (going clockwise around the boundary) contact point ([[CpNode]]).*/
+    /** The previous (going clockwise around the boundary) contact point (`CpNode`).*/
     prev: CpNode;
-    /** The next (going anti-clockwise around the boundary) contact point ([[CpNode]]). */
+    /** The next (going anti-clockwise around the boundary) contact point (`CpNode`). */
     next: CpNode;
     /**
-     * The previous [[CpNode]] (going clockwise around the inscribed circle
+     * The previous `CpNode` (going clockwise around the inscribed circle
      * defined by the maximal disk).
      */
     prevOnCircle: CpNode;
     /**
-     * The next [[CpNode]] (going anti-clockwise around
+     * The next `CpNode` (going anti-clockwise around
      * the inscribed circle defined by the maximal disk).
      */
     nextOnCircle: CpNode;
@@ -77,14 +77,6 @@ interface CpNode {
      */
     holeCloserPrev?: CpNode | undefined;
     /** Only used in export */
-    id?: number;
-    /** Only used in export */
-    children?: number[];
-    /** Only used in export */
-    isRoot?: boolean;
-    /** Only used in export */
-    parentId?: number;
-    /** Only used in export */
-    childId?: number;
+    id: number;
 }
 export { CpNode };

package/node/cp-node/fs/clone.d.ts

@@ -1,8 +1,8 @@
 import { CpNode } from "../cp-node.js";
 /**
- * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
- * since cloning a single [[CpNode]] necessarily implies cloning all
- * [[CpNode]]s on the same MAT tree.
+ * Returns a deep clone of this `CpNode`. Can be used to copy the MAT
+ * since cloning a single `CpNode` necessarily implies cloning all
+ * `CpNode`s on the same MAT tree.
  */
 declare function clone(cpNode: CpNode): CpNode;
 export { clone };

package/node/cp-node/fs/clone.js

@@ -1,9 +1,9 @@
 /** @internal */
 const EDGES = ['prev', 'next', 'prevOnCircle', 'nextOnCircle'];
 /**
- * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
- * since cloning a single [[CpNode]] necessarily implies cloning all
- * [[CpNode]]s on the same MAT tree.
+ * Returns a deep clone of this `CpNode`. Can be used to copy the MAT
+ * since cloning a single `CpNode` necessarily implies cloning all
+ * `CpNode`s on the same MAT tree.
  */
 function clone(cpNode) {
     // Don't change this function to be recursive, the call stack may 

package/node/cp-node/fs/enhance-cp-node.d.ts

@@ -25,10 +25,6 @@ declare function enhanceCpNode(cpNode: CpNode): {
     nextOnCircle: CpNode;
     holeCloserNext?: CpNode | undefined;
     holeCloserPrev?: CpNode | undefined;
-    id?: number;
-    children?: number[];
-    isRoot?: boolean;
-    parentId?: number;
-    childId?: number;
+    id: number;
 };
 export { enhanceCpNode };

package/node/cp-node/fs/enhance-cp-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"enhance-cp-node.js","sourceRoot":"","sources":["../../../src/cp-node/fs/enhance-cp-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAGpD,SAAS,aAAa,CAAC,MAAc;IACjC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC;IAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IAExB,OAAO;QACH,GAAG,MAAM;QACT,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY;QAC3B,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,aAAa,EAAE,aAAa,CAAC,MAAM,CAAC;QACpC,kBAAkB,EAAE,kBAAkB,CAAC,MAAM,CAAC;QAC9C,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC;QACxB,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC;QACjC,iBAAiB,EAAE,iBAAiB,CAAC,MAAM,CAAC;QAC5C,QAAQ,EAAE,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK;QACL,IAAI,EAAE,KAAK,CAAC,IAAI;KACnB,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"enhance-cp-node.js","sourceRoot":"","sources":["../../../src/cp-node/fs/enhance-cp-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAGpD,SAAS,aAAa,CAAC,MAAc;IACjC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC;IAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IAExB,OAAO;QACH,GAAG,MAAM;QACT,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY;QAC3B,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,aAAa,EAAE,aAAa,CAAC,MAAM,CAAC;QACpC,kBAAkB,EAAE,kBAAkB,CAAC,MAAM,CAAC;QAC9C,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC;QACxB,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC;QACjC,iBAAiB,EAAE,iBAAiB,CAAC,MAAM,CAAC;QAC5C,QAAQ,EAAE,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK;QACL,IAAI,EAAE,KAAK,CAAC,IAAI;KACnB,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/cp-node/fs/get-all-between.d.ts

@@ -1,12 +1,12 @@
 import { CpNode } from "../cp-node.js";
 /**
- * Returns all `CpNode`s between the two given ones (exclisive the last one).
+ * Returns all `CpNode`s between the two given ones (excluding the last one).
  *
  * * If the second `CpNode` is never encountered all on the loop will be
  * returned.
  *
- * @param cpNodeS
- * @param cpNodeE
+ * @param cpNodeS start `CpNode`
+ * @param cpNodeE end `CpNode`
  * @param inclAllIfEqual if `true` and first and last `CpNode`s are equal then
  * include all `CpNode`s around the loop, otherwise include none.
  */

package/node/cp-node/fs/get-all-between.js

@@ -1,11 +1,11 @@
 /**
- * Returns all `CpNode`s between the two given ones (exclisive the last one).
+ * Returns all `CpNode`s between the two given ones (excluding the last one).
  *
  * * If the second `CpNode` is never encountered all on the loop will be
  * returned.
  *
- * @param cpNodeS
- * @param cpNodeE
+ * @param cpNodeS start `CpNode`
+ * @param cpNodeE end `CpNode`
  * @param inclAllIfEqual if `true` and first and last `CpNode`s are equal then
  * include all `CpNode`s around the loop, otherwise include none.
  */

package/node/cp-node/fs/get-all-between.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-all-between.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-between.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,SAAS,aAAa,CACpB,OAAe,EACf,OAAe,EACf,cAAc,GAAG,IAAI;IAEtB,IAAI,CAAC,cAAc,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QAC5C,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,CAAA;IAC7C,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC;IACxB,MAAM,OAAO,GAAa,CAAC,OAAO,CAAC,CAAC;IAEpC,IAAI,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAC3B,IAAI,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;IAE1C,OAAO,OAAO,KAAK,OAAO;QACtB,OAAO,KAAK,OAAO,EAAE,CAAC;QAEzB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAC3B,aAAa,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;AACnC,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"get-all-between.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-between.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,SAAS,aAAa,CACd,OAAe,EACf,OAAe,EACf,cAAc,GAAG,IAAI;IAKzB,IAAI,CAAC,cAAc,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QACzC,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,CAAA;IAChD,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC;IACxB,MAAM,OAAO,GAAa,CAAC,OAAO,CAAC,CAAC;IAEpC,IAAI,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAC3B,IAAI,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;IAE1C,OAAO,OAAO,KAAK,OAAO;QACnB,OAAO,KAAK,OAAO,EAAE,CAAC;QAEzB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YACxB,aAAa,GAAG,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;AACtC,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/cp-node/fs/get-all-on-circle.d.ts

@@ -1,3 +1,9 @@
-import { CpNode } from "../cp-node.js";
+import type { CpNode } from "../cp-node.js";
+/**
+ * Returns all the `CpNode`s on the same circle.
+ *
+ * @param cpNode
+ * @param exclThis
+ */
 declare function getAllOnCircle(cpNode: CpNode, exclThis?: boolean): CpNode[];
 export { getAllOnCircle };

package/node/cp-node/fs/get-all-on-circle.js

@@ -1,13 +1,17 @@
+/**
+ * Returns all the `CpNode`s on the same circle.
+ *
+ * @param cpNode
+ * @param exclThis
+ */
 function getAllOnCircle(cpNode, exclThis = false) {
     const startCpNode = cpNode;
-    let cpNode_ = startCpNode;
-    const cpNodes = [];
-    do {
-        if (!(exclThis && cpNode_ === startCpNode)) {
-            cpNodes.push(cpNode_);
-        }
+    const cpNodes = exclThis ? [] : [cpNode];
+    let cpNode_ = cpNode.nextOnCircle;
+    while (cpNode_ !== startCpNode) {
+        cpNodes.push(cpNode_);
         cpNode_ = cpNode_.nextOnCircle;
-    } while (cpNode_ !== startCpNode);
+    }
     return cpNodes;
 }
 export { getAllOnCircle };

package/node/cp-node/fs/get-all-on-circle.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-all-on-circle.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-on-circle.ts"],"names":[],"mappings":"AAGA,SAAS,cAAc,CACf,MAAc,EACd,QAAQ,GAAG,KAAK;IAEpB,MAAM,WAAW,GAAG,MAAM,CAAC;IAC3B,IAAI,OAAO,GAAG,WAAW,CAAC;IAE1B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,GAAG,CAAC;QACA,IAAI,CAAC,CAAC,QAAQ,IAAI,OAAO,KAAK,WAAW,CAAC,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;IACnC,CAAC,QAAQ,OAAO,KAAK,WAAW,EAAC;IAEjC,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA"}
+{"version":3,"file":"get-all-on-circle.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-on-circle.ts"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,SAAS,cAAc,CACf,MAAc,EACd,QAAQ,GAAG,KAAK;IAEpB,MAAM,WAAW,GAAG,MAAM,CAAC;IAE3B,MAAM,OAAO,GAAa,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAEnD,IAAI,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC;IAClC,OAAO,OAAO,KAAK,WAAW,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;IACnC,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA"}

package/node/cp-node/fs/get-all-on-loop.d.ts

@@ -1,3 +1,3 @@
-import { CpNode } from "../cp-node.js";
+import type { CpNode } from "../cp-node.js";
 declare function getAllOnLoop(cpNode: CpNode): CpNode[];
 export { getAllOnLoop };