flo-mat 2.0.4 → 3.0.0

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

@@ -0,0 +1,249 @@
+import { compareCps } from '../contact-point/contact-point.js';
+import { removeCpNode } from './remove.js';
+import { getCurveToNext } from './get-curve-to-next.js';
+import { createCpNode } from './create-cp-node.js';
+/**
+ * Returns the bezier curve from the maximal disk of this [[CpNode]] to the
+ * next [[CpNode]]'s maximal disk and thus directly represents a piece of the
+ * medial axis.
+ * @deprecated Use [[getCurveToNext]] instead
+ * @param cpNode
+ */
+function matCurveToNextVertex(cpNode) {
+    return getCurveToNext(cpNode);
+}
+/**
+ * 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.
+ */
+const cpNodeComparator = (a, b) => compareCps(a.cp, b.cp);
+/**
+ * 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.
+ */
+function getChildren(cpNode) {
+    const children = [];
+    const cp = cpNode.next;
+    let cp_ = cp;
+    do {
+        children.push(cp_);
+        cp_ = cp_.nextOnCircle;
+    } while (cp_.nextOnCircle !== cp);
+    return children;
+}
+/**
+ * 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
+ * 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
+ * [[getCurveToNext]] on each returned edge).
+ */
+function vertexChildren(cpNode) {
+    if (isTerminating(cpNode)) {
+        return [];
+    }
+    const children = [];
+    let cp_ = cpNode;
+    while (cp_ !== cpNode.prevOnCircle) {
+        if (!isTerminating(cp_)) {
+            children.push(cp_.next);
+        }
+        cp_ = cp_.nextOnCircle;
+    }
+    return children;
+}
+/**
+ * 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.
+ */
+function getAllOnLoop(cpNode) {
+    const cpStart = cpNode;
+    const cpNodes = [cpStart];
+    let cpNode_ = cpNode.next;
+    while (cpNode_ !== cpStart) {
+        cpNodes.push(cpNode_);
+        cpNode_ = cpNode_.next;
+    }
+    return cpNodes;
+}
+/**
+ * Primarily for internal use.
+ *
+ * Insert a [[CpNode]] into the MAT tree graph after the specified point
+ * and returns the freshly inserted [[CpNode]].
+ * @param isHoleClosing True if this is a hole closing contact point.
+ * @param isIntersection True if this is a contact point at a shape boundary
+ * intersection point.
+ * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
+ * @param cp [[ContactPoint]] defining the [[CpNode]].
+ * @param prev_ Inserts the new [[CpNode]] right after this item if the
+ * loop is not empty, else insert the new [[CpNode]] as the only item in the
+ * loop.
+ */
+function insertCpNode(isHoleClosing, isIntersection, cpTree, cp, prev_) {
+    // const cpNode = new CpNode(cp, isHoleClosing, isIntersection);
+    const cpNode = createCpNode(cp, isHoleClosing, isIntersection);
+    if (typeof _debug_ !== 'undefined') {
+        _debug_.generated.elems.cpNode.push({
+            generated: _debug_.generated,
+            cpNode
+        });
+    }
+    let prev;
+    let next;
+    if (!prev_) {
+        prev = cpNode;
+        next = cpNode;
+    }
+    else {
+        prev = prev_;
+        next = prev.next;
+    }
+    next.prev = cpNode;
+    prev.next = cpNode;
+    cpNode.prev = prev;
+    cpNode.next = next;
+    cpTree.insert(cpNode);
+    return cpNode;
+}
+/**
+ * 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]].
+ */
+function getCpNodesOnCircle(cpNode, exclThis = false) {
+    // const startCp = this as CpNode;
+    const startCpNode = cpNode;
+    let cpNode_ = startCpNode;
+    const cpNodes = [];
+    do {
+        if (exclThis) {
+            exclThis = false;
+        }
+        else {
+            cpNodes.push(cpNode_);
+        }
+        cpNode_ = cpNode_.nextOnCircle;
+    } while (cpNode_ !== startCpNode);
+    return cpNodes;
+}
+/**
+ * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
+ * circle.
+ * @param cpNode1 A [[CpNode]].
+ * @param cpNode2 Another [[CpNode]]
+ */
+function isOnSameCircle(cpNode1, cpNode2) {
+    const cpNodes = getCpNodesOnCircle(cpNode1, true);
+    return cpNodes.indexOf(cpNode2) >= 0;
+}
+/**
+ * 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
+ * a single contact point. Note, however, that even in these cases there are
+ * 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
+ * other point being its [[next]], whereas the other point will *not* be
+ * terminating and 'points' back into the shape.
+ */
+function isTerminating(cpNode) {
+    // return this === this.next.prevOnCircle;
+    return cpNode === cpNode.next.prevOnCircle;
+}
+/**
+ * Like isTerminating() but only returns true if all cpNodes on the circle
+ * (except this.prevOnCircle) is terminating.
+ */
+function isFullyTerminating(cpNode) {
+    const otherOnCircle = getCpNodesOnCircle(cpNode.prevOnCircle, true);
+    const isFullyTerminating = otherOnCircle.every(cpn => isTerminating(cpn));
+    return isFullyTerminating;
+}
+/**
+ * Returns the first [[CpNode]] (from this one by successively applying
+ * .nextOnCircle) that exits the circle.
+ */
+function getFirstExit(cpNode) {
+    // const startNode = this as CpNode;
+    const startNode = cpNode;
+    let cpNode_ = startNode;
+    while (cpNode_.next === cpNode_.prevOnCircle) {
+        cpNode_ = cpNode_.next;
+        if (cpNode_ === startNode) {
+            // The very special case the MAT is a single point.
+            return undefined;
+        }
+    }
+    return cpNode_;
+}
+/**
+ * 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
+ * terminating and one not. See [[isTerminating]] for more details.
+ */
+function isSharp(cpNode) {
+    return cpNode.cp.circle.radius === 0;
+}
+/**
+ * Returns the number of contact points on the maximal disk circle implied
+ * 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
+ * [[getRealProngCount]] instead which will return 1 in these cases.
+ */
+function getProngCount(cpNode) {
+    // const startCp = this as CpNode;
+    const startCpNode = cpNode;
+    let cpNode_ = startCpNode;
+    let i = 0;
+    do {
+        i++;
+        cpNode_ = cpNode_.nextOnCircle;
+    } while (cpNode_ !== startCpNode);
+    return i;
+}
+/**
+ * Returns the number of contact points (up to planar coordinates) on the
+ * maximal disk circle implied by this [[CpNode]].
+ *
+ * See also [[getProngCount]].
+ */
+function getRealProngCount(cpNode) {
+    if (isOneProng(cpNode)) {
+        return 1;
+    }
+    return getProngCount(cpNode);
+}
+/**
+ * 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
+ * preserve symmetry - see [[isTerminating]] for more details.
+ */
+function isOneProng(cpNode) {
+    const cp1 = cpNode;
+    if (cp1.cp.circle.radius === 0) {
+        return true;
+    }
+    const cp2 = cp1.nextOnCircle;
+    const p1 = cp1.cp.pointOnShape.p;
+    const p2 = cp2.cp.pointOnShape.p;
+    return (p1[0] === p2[0] && p1[1] === p2[1]);
+}
+export { matCurveToNextVertex, getChildren, vertexChildren, getAllOnLoop, insertCpNode, getCpNodesOnCircle, isOnSameCircle, isTerminating, isFullyTerminating, getFirstExit, isSharp, isOneProng, getProngCount, getRealProngCount, cpNodeComparator, removeCpNode };
+//# sourceMappingURL=cp-node.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cp-node.js","sourceRoot":"","sources":["../../src/cp-node/cp-node.ts"],"names":[],"mappings":"AAKA,OAAO,EAAgB,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AA6FnD;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,MAAc;IAC3C,OAAO,cAAc,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAGD;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AAG1E;;;;;GAKG;AACH,SAAS,WAAW,CAAC,MAAc;IAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IACvB,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,GAAG;QACF,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;KACvB,QAAQ,GAAG,CAAC,YAAY,KAAK,EAAE,EAAE;IAElC,OAAO,QAAQ,CAAC;AACjB,CAAC;AAGD;;;;;;;GAOG;AACH,SAAS,cAAc,CAAC,MAAc;IACrC,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,EAAE,CAAC;KAAE;IAEzC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,OAAO,GAAG,KAAK,MAAM,CAAC,YAAY,EAAE;QACnC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;YAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SAAE;QACrD,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;KACvB;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAGD;;;GAGG;AACH,SAAS,YAAY,CAAC,MAAc;IACnC,MAAM,OAAO,GAAG,MAAM,CAAC;IACvB,MAAM,OAAO,GAAa,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;IAE1B,OAAO,OAAO,KAAK,OAAO,EAAE;QAC3B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;KACvB;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAGD;;;;;;;;;;;;;GAaG;AACH,SAAS,YAAY,CACnB,aAAsB,EACtB,cAAuB,EACvB,MAAwB,EACxB,EAAgB,EAChB,KAAa;IAEd,gEAAgE;IAChE,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;IAC/D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC;YACnC,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,MAAM;SACN,CAAC,CAAC;KACH;IAED,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IAET,IAAI,CAAC,KAAK,EAAE;QACX,IAAI,GAAG,MAAM,CAAC;QACd,IAAI,GAAG,MAAM,CAAC;KACd;SAAM;QACN,IAAI,GAAG,KAAK,CAAC;QACb,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;KACjB;IAED,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;IACnB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;IAEnB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IAEnB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAEtB,OAAO,MAAM,CAAC;AACf,CAAC;AAGD;;;;;GAKG;AACH,SAAS,kBAAkB,CACzB,MAAc,EACd,QAAQ,GAAG,KAAK;IAEjB,kCAAkC;IAClC,MAAM,WAAW,GAAG,MAAM,CAAC;IAC3B,IAAI,OAAO,GAAG,WAAW,CAAC;IAE1B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,GAAG;QACF,IAAI,QAAQ,EAAE;YACb,QAAQ,GAAG,KAAK,CAAC;SACjB;aAAM;YACN,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACtB;QACD,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;KAC/B,QAAQ,OAAO,KAAK,WAAW,EAAC;IAEjC,OAAO,OAAO,CAAC;AAChB,CAAC;AAGD;;;;;GAKG;AACH,SAAS,cAAc,CAAC,OAAe,EAAE,OAAe;IACvD,MAAM,OAAO,GAAG,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAElD,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAGD;;;;;;;;;;;;GAYG;AACH,SAAS,aAAa,CAAC,MAAc;IACpC,0CAA0C;IAC1C,OAAO,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;AAC5C,CAAC;AAGD;;;GAGG;AACH,SAAS,kBAAkB,CAAC,MAAa;IACxC,MAAM,aAAa,GAAG,kBAAkB,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACpE,MAAM,kBAAkB,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1E,OAAO,kBAAkB,CAAC;AAC3B,CAAC;AAGD;;;GAGG;AACH,SAAS,YAAY,CAAC,MAAc;IACnC,oCAAoC;IACpC,MAAM,SAAS,GAAG,MAAM,CAAC;IACzB,IAAI,OAAO,GAAG,SAAS,CAAC;IAExB,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,YAAY,EAAE;QAC7C,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QAEvB,IAAI,OAAO,KAAK,SAAS,EAAE;YAC1B,mDAAmD;YACnD,OAAO,SAAS,CAAC;SACjB;KACD;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,MAAc;IAC9B,OAAO,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;AACtC,CAAC;AAGD;;;;;;;GAOG;AACH,SAAS,aAAa,CAAC,MAAc;IACpC,kCAAkC;IAClC,MAAM,WAAW,GAAG,MAAM,CAAC;IAC3B,IAAI,OAAO,GAAG,WAAW,CAAC;IAE1B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,GAAG;QACF,CAAC,EAAE,CAAC;QACJ,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;KAC/B,QAAQ,OAAO,KAAK,WAAW,EAAC;IAEjC,OAAO,CAAC,CAAC;AACV,CAAC;AAGD;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,MAAc;IACxC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC;KAAE;IAErC,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAGD;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,MAAc;IACjC,MAAM,GAAG,GAAG,MAAM,CAAC;IAEnB,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;IAE7B,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IAEjC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAGD,OAAO,EAEN,oBAAoB,EACpB,WAAW,EACX,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,kBAAkB,EAClB,cAAc,EACd,aAAa,EACb,kBAAkB,EAClB,YAAY,EACZ,OAAO,EACP,UAAU,EACV,aAAa,EACb,iBAAiB,EACjB,gBAAgB,EAChB,YAAY,EACZ,CAAA"}

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

@@ -0,0 +1,4 @@
+import { ContactPoint } from '../contact-point/contact-point.js';
+import { CpNode } from './cp-node.js';
+declare function createCpNode(cp: ContactPoint, isHoleClosing: boolean, isIntersection: boolean, prev?: CpNode, next?: CpNode, prevOnCircle?: CpNode, nextOnCircle?: CpNode): CpNode;
+export { createCpNode };

package/node/cp-node/create-cp-node.js

@@ -0,0 +1,8 @@
+function createCpNode(cp, isHoleClosing, isIntersection, prev = undefined, next = undefined, prevOnCircle = undefined, nextOnCircle = undefined) {
+    return {
+        cp, isHoleClosing, isIntersection,
+        prev, next, prevOnCircle, nextOnCircle
+    };
+}
+export { createCpNode };
+//# sourceMappingURL=create-cp-node.js.map

package/node/cp-node/create-cp-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-cp-node.js","sourceRoot":"","sources":["../../src/cp-node/create-cp-node.ts"],"names":[],"mappings":"AAIA,SAAS,YAAY,CACb,EAAgB,EAChB,aAAwB,EACxB,cAAwB,EACxB,OAA0B,SAAU,EACpC,OAA0B,SAAU,EACpC,eAA0B,SAAU,EACpC,eAA0B,SAAU;IAExC,OAAO;QACH,EAAE,EAAE,aAAa,EAAE,cAAc;QACjC,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,YAAY;KACzC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

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

@@ -0,0 +1,24 @@
+import { CpNode } from "./cp-node.js";
+declare function enhanceCpNode(cpNode: CpNode): {
+    isTerminating: boolean;
+    isFullyTerminating: boolean;
+    isSharp: boolean;
+    prongCount: number;
+    getRealProngCount: number;
+    ordering: {
+        idx: number;
+        t: number;
+        order: number;
+        order2: number;
+    };
+    curve: import("../curve/curve.js").Curve;
+    loop: import("flo-boolean/node/loop/loop.js").Loop;
+    cp: import("../contact-point/contact-point.js").ContactPoint;
+    isHoleClosing: boolean;
+    isIntersection: boolean;
+    prev: CpNode;
+    next: CpNode;
+    prevOnCircle: CpNode;
+    nextOnCircle: CpNode;
+};
+export { enhanceCpNode };

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

@@ -0,0 +1,20 @@
+import { getProngCount, getRealProngCount, isFullyTerminating, isSharp, isTerminating } from "./cp-node.js";
+import { getCpNodeOrdering } from './get-cp-node-ordering.js';
+function enhanceCpNode(cpNode) {
+    const cp = cpNode.cp;
+    const pos = cp.pointOnShape;
+    const curve = pos.curve;
+    return {
+        ...cpNode,
+        isTerminating: isTerminating(cpNode),
+        isFullyTerminating: isFullyTerminating(cpNode),
+        isSharp: isSharp(cpNode),
+        prongCount: getProngCount(cpNode),
+        getRealProngCount: getRealProngCount(cpNode),
+        ordering: getCpNodeOrdering(cpNode),
+        curve,
+        loop: curve.loop
+    };
+}
+export { enhanceCpNode };
+//# sourceMappingURL=enhance-cp-node.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"enhance-cp-node.js","sourceRoot":"","sources":["../../src/cp-node/enhance-cp-node.ts"],"names":[],"mappings":"AAAA,OAAO,EACK,aAAa,EAAE,iBAAiB,EAAE,kBAAkB,EAC5D,OAAO,EAAE,aAAa,EACzB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAG9D,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,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/{get-boundary-bezier-parts-to-next.js → cp-node/get-boundary-bezier-parts-to-next.js}

@@ -26,7 +26,7 @@ function getBoundaryBezierPartsToNext(cpNode) {
     return bezierParts;
 }
 /**
- * @hidden
+ * @internal
  * Adds pieces of skipped beziers.
  */
 function addSkippedBeziers(bezierParts, curveStart, curveEnd, t1) {

package/node/cp-node/get-boundary-bezier-parts-to-next.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-boundary-bezier-parts-to-next.js","sourceRoot":"","sources":["../../src/cp-node/get-boundary-bezier-parts-to-next.ts"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,MAAc;IAChD,MAAM,MAAM,GAAG,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAE3B,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAEvC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAEhC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAU,CAAC;KACrB;IAED,MAAM,WAAW,GAAkB,EAAE,CAAC;IAEtC,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;KACL;SAAM;QACH,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;QAEF,iBAAiB,CACT,WAAW,EACX,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,WAA+C,EAC/C,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,UAAU,GAAG,SAAS,KAAK,QAAQ;YACrC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;YACnC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAA;QAEtC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KAChC,QAAQ,SAAS,KAAK,QAAQ,EAAE;AAGrC,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/{get-boundary-beziers-to-next.d.ts → cp-node/get-boundary-beziers-to-next.d.ts}

@@ -4,5 +4,5 @@ import { CpNode } from './cp-node.js';
  * on the boundary.
  * @param cpNode
  */
-declare function getBoundaryBeziersToNext(cpNode: CpNode): number[][][];
+declare function getBoundaryBeziersToNext(cpNode: CpNode): number[][][] | undefined;
 export { getBoundaryBeziersToNext };

package/node/{get-boundary-beziers-to-next.js → cp-node/get-boundary-beziers-to-next.js}

@@ -29,7 +29,7 @@ function getBoundaryBeziersToNext(cpNode) {
 }
 /**
  * Adds pieces of skipped beziers.
- * @hidden
+ * @internal
  */
 function addSkippedBeziers(beziers, curveStart, curveEnd, t1) {
     let curveThis = curveStart;

package/node/cp-node/get-boundary-beziers-to-next.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-boundary-beziers-to-next.js","sourceRoot":"","sources":["../../src/cp-node/get-boundary-beziers-to-next.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,MAAc;IAC5C,MAAM,MAAM,GAAG,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAE3B,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAEvC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAEhC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CACjD,CAAC;KACL;SAAM;QACH,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CACzC,CAAC;QAEF,iBAAiB,CACT,OAAO,EACP,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,OAAyB,EACzB,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI;QACR,oCAAoC;QACpC,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAChC,CAAC;KACL,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}

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

@@ -0,0 +1,8 @@
+import { CpNode } from './cp-node.js';
+declare function getCpNodeOrdering(cpNode: CpNode): {
+    idx: number;
+    t: number;
+    order: number;
+    order2: number;
+};
+export { getCpNodeOrdering };

package/node/cp-node/get-cp-node-ordering.js

@@ -0,0 +1,12 @@
+function getCpNodeOrdering(cpNode) {
+    const cp = cpNode.cp;
+    const pos = cp.pointOnShape;
+    return {
+        'idx': pos.curve.idx,
+        't': pos.t,
+        'order': cp.order,
+        'order2': cp.order2
+    };
+}
+export { getCpNodeOrdering };
+//# sourceMappingURL=get-cp-node-ordering.js.map

package/node/cp-node/get-cp-node-ordering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-cp-node-ordering.js","sourceRoot":"","sources":["../../src/cp-node/get-cp-node-ordering.ts"],"names":[],"mappings":"AAGA,SAAS,iBAAiB,CAAC,MAAc;IACrC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC;IAE5B,OAAO;QACH,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG;QACpB,GAAG,EAAE,GAAG,CAAC,CAAC;QACV,OAAO,EAAE,EAAE,CAAC,KAAK;QACjB,QAAQ,EAAE,EAAE,CAAC,MAAM;KACtB,CAAC;AACN,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA"}

package/node/{get-curve-to-next.js → cp-node/get-curve-to-next.js}

@@ -1,4 +1,4 @@
-import { getCurveBetween } from './get-curve/get-curve-between.js';
+import { getCurveBetween } from '../get-curve/get-curve-between.js';
 /**
  * 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

package/node/cp-node/get-curve-to-next.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-curve-to-next.js","sourceRoot":"","sources":["../../src/cp-node/get-curve-to-next.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAC;AAGpE;;;;;GAKG;AACH,SAAS,cAAc,CAAC,MAAc;IACrC,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA"}

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

@@ -1,5 +1,5 @@
 import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from "../cp-node.js";
+import { CpNode } from "./cp-node.js";
 /**
  * Removes a cpNode from the MAT.
  * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.

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

@@ -0,0 +1,12 @@
+import { CpNode } from "./cp-node";
+/**
+ * @internal
+ *
+ * Traverses the shape from the given `CpNode` going around the shortest path
+ * so that only a piece of the shape is traversed and returns the visited
+ * `CpNode`s (starting from the given `CpNode`).
+ *
+ * @param cpStart The `CpNode` from where to start the traversal.
+ */
+declare function traverseCp(cpStart: CpNode): CpNode[];
+export { traverseCp };

package/node/cp-node/traverse-cp.js

@@ -0,0 +1,26 @@
+/**
+ * @internal
+ *
+ * Traverses the shape from the given `CpNode` going around the shortest path
+ * so that only a piece of the shape is traversed and returns the visited
+ * `CpNode`s (starting from the given `CpNode`).
+ *
+ * @param cpStart The `CpNode` from where to start the traversal.
+ */
+function traverseCp(cpStart) {
+    let cpNode = cpStart;
+    if (cpNode === cpNode.next.prevOnCircle) {
+        return [cpNode]; // one-sharp corner
+    }
+    const visitedCps = [];
+    do {
+        visitedCps.push(cpNode);
+        const next = cpNode.next.prevOnCircle;
+        cpNode = cpNode === next
+            ? cpNode = cpNode.next.next // Terminal vertex
+            : cpNode = next; // Take last exit
+    } while (cpNode !== cpStart);
+    return visitedCps;
+}
+export { traverseCp };
+//# sourceMappingURL=traverse-cp.js.map

package/node/cp-node/traverse-cp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse-cp.js","sourceRoot":"","sources":["../../src/cp-node/traverse-cp.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,OAAe;IAClC,IAAI,MAAM,GAAG,OAAO,CAAC;IAErB,IAAI,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE;QACxC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,mBAAmB;KACrC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,GAAG;QACF,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAExB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;QACtC,MAAM,GAAG,MAAM,KAAK,IAAI;YACtB,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB;YAC9C,CAAC,CAAC,MAAM,GAAG,IAAI,CAAA,CAAS,iBAAiB;KAE3C,QAAQ,MAAM,KAAK,OAAO,EAAE;IAE7B,OAAO,UAAU,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,UAAU,EAAE,CAAA"}

package/node/{traverse-edges.js → cp-node/traverse-edges.js}

@@ -1,3 +1,4 @@
+import { getChildren, getCpNodesOnCircle, isTerminating } from './cp-node.js';
 /**
  * Traverses all edges (depth first) of the given MAT tree starting at the given
  * vertex (represented by a [[CpNode]]).
@@ -8,14 +9,14 @@
 function traverseEdges(cpNode, f) {
     // Since the tree is unrooted we must iterate in all directions from the
     // given vertex.
-    const cps = cpNode.getCpNodesOnCircle();
+    const cps = getCpNodesOnCircle(cpNode);
     while (cps.length) {
         const cp = cps.pop();
         f(cp);
-        if (cp.isTerminating()) {
+        if (isTerminating(cp)) {
             continue;
         }
-        cps.push(...cp.getChildren());
+        cps.push(...getChildren(cp));
     }
 }
 export { traverseEdges };

package/node/cp-node/traverse-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse-edges.js","sourceRoot":"","sources":["../../src/cp-node/traverse-edges.ts"],"names":[],"mappings":"AAAA,OAAO,EAAU,WAAW,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAGtF;;;;;;IAMI;AACJ,SAAS,aAAa,CACpB,MAAc,EACd,CAA2B;IAE5B,wEAAwE;IACxE,gBAAgB;IAChB,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAEvC,OAAO,GAAG,CAAC,MAAM,EAAE;QAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAG,CAAC;QACtB,CAAC,CAAC,EAAE,CAAC,CAAC;QAEN,IAAI,aAAa,CAAC,EAAE,CAAC,EAAE;YAAE,SAAS;SAAE;QACpC,GAAG,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;KAC7B;AACF,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/{traverse-vertices.js → cp-node/traverse-vertices.js}

@@ -1,3 +1,4 @@
+import { getCpNodesOnCircle, isTerminating, vertexChildren } from './cp-node.js';
 /**
  * Traverses the MAT tree and calls the given callback function for each vertex
  * (represented by a [[CpNode]]) on the MAT.
@@ -11,8 +12,8 @@ function traverseVertices(cpNode, f) {
     f(cpNode);
     // Since the tree is unrooted we must iterate in all directions from the
     // given cpNode.	
-    cpNode.getCpNodesOnCircle()
-        .filter(cpNode => !cpNode.isTerminating())
+    getCpNodesOnCircle(cpNode)
+        .filter(cpNode => !isTerminating(cpNode))
         .map(cpNode => cpNode.next)
         .forEach(f_);
     function f_(cpNode) {
@@ -20,7 +21,7 @@ function traverseVertices(cpNode, f) {
         while (cps.length) {
             const cp = cps.pop();
             f(cp);
-            cps.push(...cp.vertexChildren);
+            cps.push(...vertexChildren(cp));
         }
     }
 }

package/node/cp-node/traverse-vertices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse-vertices.js","sourceRoot":"","sources":["../../src/cp-node/traverse-vertices.ts"],"names":[],"mappings":"AAAA,OAAO,EAAU,kBAAkB,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAGzF;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,MAAc,EACd,CAA2B;IAE5B,CAAC,CAAC,MAAM,CAAC,CAAC;IAEV,wEAAwE;IACxE,iBAAiB;IACjB,kBAAkB,CAAC,MAAM,CAAC;SACxB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;SACxC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;SAC1B,OAAO,CAAC,EAAE,CAAC,CAAC;IAEd,SAAS,EAAE,CAAC,MAAc;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC,MAAM,EAAE;YAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAG,CAAC;YACtB,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;SAChC;IACF,CAAC;AACF,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/node/{curve.d.ts → curve/curve.d.ts}

@@ -1,5 +1,5 @@
-import { Loop } from './loop.js';
-import { Corner } from './mat/corner.js';
+import { Loop } from 'flo-boolean';
+import { getCorner } from '../corner/get-corner.js';
 /**
  * Represents a bezier curve on the shape boundary / loop.
  */
@@ -25,22 +25,9 @@ interface Curve {
     idx: number;
 }
 /**
- * @hidden
- * Returns a new corner with properties.
- *
- * PRECONDITION: The beziers has control points with max bit-length of 26 and
- * aligned to a 'grid' to have the same exponent. This is so the vectors between
- * control points can be calculated exactly without resorting to adaptive
- * infinite precision floating point operations.
- *
- * @param psI The incoming bezier that ends in the corner
- * @param psO The outgoing bezier that starts at the corner
- */
-declare function getCorner(psI: number[][], psO: number[][]): Corner;
-/**
- * @hidden
+ * @internal
  * Returns information about the corner created at the end of this curve
  * (at t === 1) and the start of the next curve (at t === 0).
  */
-declare const getCornerAtEnd: (a: Curve) => Corner;
+declare const getCornerAtEnd: (a: Curve) => import("../corner/corner.js").Corner;
 export { Curve, getCorner, getCornerAtEnd };

package/node/curve/curve.js

@@ -0,0 +1,14 @@
+import { memoize } from 'flo-memoize';
+import { getCorner } from '../corner/get-corner.js';
+/**
+ * @internal
+ * Returns information about the corner created at the end of this curve
+ * (at t === 1) and the start of the next curve (at t === 0).
+ */
+const getCornerAtEnd = memoize(function (curve) {
+    const psE = curve.ps;
+    const psS = curve.next.ps;
+    return getCorner(psE, psS);
+});
+export { getCorner, getCornerAtEnd };
+//# sourceMappingURL=curve.js.map

package/node/curve/curve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve.js","sourceRoot":"","sources":["../../src/curve/curve.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AA8BpD;;;;GAIG;AACH,MAAM,cAAc,GAAG,OAAO,CAAC,UAAS,KAAY;IACnD,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;IAE1B,OAAO,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5B,CAAC,CAAC,CAAC;AAGH,OAAO,EAAS,SAAS,EAAE,cAAc,EAAE,CAAA"}

package/node/debug/cp-node-for-debugging.d.ts

@@ -1,7 +1,7 @@
-import { CpNode } from '../cp-node.js';
+import { CpNode } from '../cp-node/cp-node.js';
 import { Generated } from './debug.js';
 /**
- * @hidden
+ * @internal
  * Used for debugging only.
  */
 interface ICpNodeForDebugging {

package/node/debug/debug-elem-types.d.ts

@@ -1,15 +1,15 @@
-import { IPointOnShape } from '../point-on-shape.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
 import { TwoProngForDebugging } from './two-prong-for-debugging.js';
 import { ThreeProngForDebugging } from './three-prong-for-debugging.js';
-import { Curve } from '../curve.js';
-import { Mat } from '../mat.js';
-import { CpNode } from '../cp-node.js';
-import { Circle } from '../circle.js';
+import { Curve } from '../curve/curve.js';
+import { Mat } from '../mat/mat.js';
+import { CpNode } from '../cp-node/cp-node.js';
+import { Circle } from '../geometry/circle.js';
 import { ICpNodeForDebugging } from './cp-node-for-debugging.js';
-/** @hidden */
+/** @internal */
 interface IDebugElems {
-    oneProng: IPointOnShape;
-    oneProngAtDullCorner: IPointOnShape;
+    oneProng: CpNode[];
+    oneProngAtDullCorner: PointOnShape;
     twoProng_regular: TwoProngForDebugging;
     twoProng_failed: TwoProngForDebugging;
     twoProng_notAdded: TwoProngForDebugging;

package/node/debug/debug.d.ts

@@ -3,7 +3,7 @@ import { ITwoProngDebugFunctions } from './functions/two-prong.js';
 import { IThreeProngDebugFunctions } from './functions/three-prong.js';
 import { TDrawElemFunctions } from './functions/draw-elem/draw-elem.js';
 import { IDebugElems } from './debug-elem-types.js';
-/** @hidden */
+/** @internal */
 interface Debug {
     /** Generated by debug object for later inspection */
     generated: Generated;
@@ -14,11 +14,11 @@ interface Debug {
     fs: IDebugFunctions;
     directives: IDirectives;
 }
-/** @hidden */
+/** @internal */
 type GeneratedElems = {
     [T in keyof IDebugElems]: IDebugElems[T][];
 };
-/** @hidden */
+/** @internal */
 interface ITiming {
     holeClosers: number;
     oneAnd2Prongs: number;
@@ -26,18 +26,18 @@ interface ITiming {
     sats: number;
     simplifyMat: number;
 }
-/** @hidden */
+/** @internal */
 interface Generated {
     elems: GeneratedElems;
     timing: ITiming;
 }
-/** @hidden */
+/** @internal */
 interface IDebugFunctions extends IGeneralDebugFunctions {
     twoProng: ITwoProngDebugFunctions;
     threeProng: IThreeProngDebugFunctions;
     drawElem: TDrawElemFunctions;
 }
-/** @hidden */
+/** @internal */
 interface IDirectives {
     stopAfterHoleClosers: boolean;
     stopAfterHoleClosersNum: number;