flo-mat 3.0.1 → 3.0.2

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

@@ -1,6 +1,4 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
 import { ContactPoint } from '../contact-point/contact-point.js';
-import { removeCpNode } from './remove.js';
 /**
  * The primary interface of the library.
  *
@@ -24,7 +22,7 @@ import { removeCpNode } from './remove.js';
  * the CpNode to the next maximal disk contact point. This is equivalent to
  * following other branches on the MAT.
  *
- * Call [[getCurveBetween]](cpNodeFrom, cpNodeTo) or getCurveToNext(cpNode)
+ * 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
  * maximal disk and thus directly representing a piece of the medial axis.
@@ -37,12 +35,12 @@ import { removeCpNode } from './remove.js';
  * 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, [[vertexChildren]], is similar to [[getChildren]] but returns the
+ * 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
  * 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).
+ * [[getMatCurveToNext]] on each returned edge).
  *
  * It may be worth mentioning that by traversing from the CpNode by following
  * [[next]] repeatedly until one is back at the same CpNode allows one
@@ -70,127 +68,23 @@ interface CpNode {
      * the inscribed circle defined by the maximal disk).
      */
     nextOnCircle: CpNode;
+    /**
+     * For hole closers only - the next `CpNode` ignoring the hole closer
+     */
+    holeCloserNext?: CpNode | undefined;
+    /**
+     * For hole closers only - the prev `CpNode` ignoring the hole closer
+     */
+    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;
 }
-/**
- * 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
- */
-declare function matCurveToNextVertex(cpNode: CpNode): number[][];
-/**
- * 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.
- */
-declare const cpNodeComparator: (a: CpNode, b: CpNode) => number;
-/**
- * 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.
- */
-declare function getChildren(cpNode: CpNode): CpNode[];
-/**
- * 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).
- */
-declare function vertexChildren(cpNode: CpNode): CpNode[];
-/**
- * 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.
- */
-declare function getAllOnLoop(cpNode: CpNode): CpNode[];
-/**
- * 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.
- */
-declare function insertCpNode(isHoleClosing: boolean, isIntersection: boolean, cpTree: LlRbTree<CpNode>, cp: ContactPoint, prev_: CpNode): 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]].
- */
-declare function getCpNodesOnCircle(cpNode: CpNode, exclThis?: boolean): CpNode[];
-/**
- * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
- * circle.
- * @param cpNode1 A [[CpNode]].
- * @param cpNode2 Another [[CpNode]]
- */
-declare function isOnSameCircle(cpNode1: CpNode, cpNode2: CpNode): boolean;
-/**
- * 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.
- */
-declare function isTerminating(cpNode: CpNode): boolean;
-/**
- * Like isTerminating() but only returns true if all cpNodes on the circle
- * (except this.prevOnCircle) is terminating.
- */
-declare function isFullyTerminating(cpNode: CpNode): boolean;
-/**
- * Returns the first [[CpNode]] (from this one by successively applying
- * .nextOnCircle) that exits the circle.
- */
-declare function getFirstExit(cpNode: CpNode): CpNode | undefined;
-/**
- * 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.
- */
-declare function isSharp(cpNode: CpNode): boolean;
-/**
- * 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.
- */
-declare function getProngCount(cpNode: CpNode): number;
-/**
- * Returns the number of contact points (up to planar coordinates) on the
- * maximal disk circle implied by this [[CpNode]].
- *
- * See also [[getProngCount]].
- */
-declare function getRealProngCount(cpNode: CpNode): number;
-/**
- * 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.
- */
-declare function isOneProng(cpNode: CpNode): boolean;
-export { CpNode, matCurveToNextVertex, getChildren, vertexChildren, getAllOnLoop, insertCpNode, getCpNodesOnCircle, isOnSameCircle, isTerminating, isFullyTerminating, getFirstExit, isSharp, isOneProng, getProngCount, getRealProngCount, cpNodeComparator, removeCpNode };
+export { CpNode };

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

@@ -1,249 +1,2 @@
-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 };
+export {};
 //# sourceMappingURL=cp-node.js.map

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

@@ -1 +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"}
+{"version":3,"file":"cp-node.js","sourceRoot":"","sources":["../../src/cp-node/cp-node.ts"],"names":[],"mappings":""}

package/node/cp-node/{clone.d.ts → fs/clone.d.ts}

@@ -1,4 +1,4 @@
-import { CpNode } from "./cp-node.js";
+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

package/node/cp-node/{clone.js → fs/clone.js}

@@ -1,4 +1,3 @@
-import { createCpNode } from "./create-cp-node.js";
 /** @internal */
 const EDGES = ['prev', 'next', 'prevOnCircle', 'nextOnCircle'];
 /**
@@ -10,8 +9,7 @@ function clone(cpNode) {
     // Don't change this function to be recursive, the call stack may 
     // overflow if there are too many CpNodes.
     const nodeMap = new Map();
-    // const newCpNode = new CpNode(cpNode.cp, cpNode.isHoleClosing, cpNode.isIntersection);
-    const newCpNode = createCpNode(cpNode.cp, cpNode.isHoleClosing, cpNode.isIntersection);
+    const newCpNode = cloneWithoutLinks(cpNode);
     nodeMap.set(cpNode, newCpNode);
     const cpStack = [{ cpNode, newCpNode }];
     while (cpStack.length) {
@@ -20,8 +18,7 @@ function clone(cpNode) {
             const node = cpNode[edge];
             let newNode = nodeMap.get(node);
             if (!newNode) {
-                // newNode = new CpNode(node.cp, node.isHoleClosing, node.isIntersection);
-                newNode = createCpNode(node.cp, node.isHoleClosing, node.isIntersection);
+                newNode = cloneWithoutLinks(node);
                 nodeMap.set(node, newNode);
                 cpStack.push({ cpNode: node, newCpNode: newNode });
             }
@@ -30,5 +27,17 @@ function clone(cpNode) {
     }
     return newCpNode;
 }
+function cloneWithoutLinks(cpNode) {
+    const newNode = {
+        ...cpNode,
+        ...{
+            prev: undefined,
+            next: undefined,
+            prevOnCircle: undefined,
+            nextOnCircle: undefined
+        }
+    };
+    return newNode;
+}
 export { clone };
 //# sourceMappingURL=clone.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"clone.js","sourceRoot":"","sources":["../../../src/cp-node/fs/clone.ts"],"names":[],"mappings":"AAUA,gBAAgB;AAChB,MAAM,KAAK,GAAW,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;AAOvE;;;;GAIG;AACH,SAAS,KAAK,CAAC,MAAc;IACzB,kEAAkE;IAClE,0CAA0C;IAE1C,MAAM,OAAO,GAAoC,IAAI,GAAG,EAAE,CAAC;IAE3D,MAAM,SAAS,GAAuB,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAEhE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAExC,OAAO,OAAO,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAElC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;YACtD,CAAC;YACA,SAAoB,CAAC,IAAI,CAAC,GAAG,OAAiB,CAAC;QACpD,CAAC;IACL,CAAC;IAED,OAAO,SAAmB,CAAC;AAC/B,CAAC;AAGD,SAAS,iBAAiB,CAAC,MAAc;IACrC,MAAM,OAAO,GAAG;QACZ,GAAG,MAAM;QACT,GAAG;YACC,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,SAAS;YACf,YAAY,EAAE,SAAS;YACvB,YAAY,EAAE,SAAS;SAC1B;KACJ,CAAC;IAEF,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,KAAK,EAAE,CAAA"}

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.d.ts

@@ -0,0 +1,3 @@
+import { CpNode } from "../cp-node.js";
+declare function cpNodesToBoundaryBeziers(cpNodes: CpNode[]): number[][][];
+export { cpNodesToBoundaryBeziers };

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.js

@@ -0,0 +1,6 @@
+import { getBoundaryBeziersToNext } from "./get-boundary-beziers-to-next.js";
+function cpNodesToBoundaryBeziers(cpNodes) {
+    return cpNodes.flatMap(getBoundaryBeziersToNext);
+}
+export { cpNodesToBoundaryBeziers };
+//# sourceMappingURL=cp-nodes-to-boundary-beziers.js.map

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cp-nodes-to-boundary-beziers.js","sourceRoot":"","sources":["../../../src/cp-node/fs/cp-nodes-to-boundary-beziers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,wBAAwB,EAAE,MAAM,mCAAmC,CAAC;AAG7E,SAAS,wBAAwB,CAAC,OAAiB;IAC/C,OAAO,OAAO,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACpD,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}

package/node/cp-node/{enhance-cp-node.d.ts → fs/enhance-cp-node.d.ts}

@@ -1,5 +1,8 @@
-import { CpNode } from "./cp-node.js";
+import { CpNode } from "../cp-node.js";
 declare function enhanceCpNode(cpNode: CpNode): {
+    pos: import("../../index.js").PointOnShape;
+    p: number[];
+    t: number;
     isTerminating: boolean;
     isFullyTerminating: boolean;
     isSharp: boolean;
@@ -11,14 +14,21 @@ declare function enhanceCpNode(cpNode: CpNode): {
         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;
+    curve: import("../../index.js").Curve;
+    loop: import("flo-boolean").Loop;
+    cp: import("../../index.js").ContactPoint;
     isHoleClosing: boolean;
     isIntersection: boolean;
     prev: CpNode;
     next: CpNode;
     prevOnCircle: CpNode;
     nextOnCircle: CpNode;
+    holeCloserNext?: CpNode | undefined;
+    holeCloserPrev?: CpNode | undefined;
+    id?: number;
+    children?: number[];
+    isRoot?: boolean;
+    parentId?: number;
+    childId?: number;
 };
 export { enhanceCpNode };

package/node/cp-node/{enhance-cp-node.js → fs/enhance-cp-node.js}

@@ -1,11 +1,18 @@
-import { getProngCount, getRealProngCount, isFullyTerminating, isSharp, isTerminating } from "./cp-node.js";
 import { getCpNodeOrdering } from './get-cp-node-ordering.js';
+import { getProngCount } from './get-prong-count.js';
+import { getRealProngCount } from "./get-real-prong-count.js";
+import { isFullyTerminating } from "./is-fully-terminating.js";
+import { isSharp } from "./is-sharp.js";
+import { isTerminating } from "./is-terminating.js";
 function enhanceCpNode(cpNode) {
     const cp = cpNode.cp;
     const pos = cp.pointOnShape;
     const curve = pos.curve;
     return {
         ...cpNode,
+        pos: cpNode.cp.pointOnShape,
+        p: cpNode.cp.pointOnShape.p,
+        t: cpNode.cp.pointOnShape.t,
         isTerminating: isTerminating(cpNode),
         isFullyTerminating: isFullyTerminating(cpNode),
         isSharp: isSharp(cpNode),

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

@@ -0,0 +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"}

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

@@ -0,0 +1,3 @@
+import { CpNode } from "../cp-node.js";
+declare function findFirst(f: (cpNode: CpNode) => CpNode | undefined, cpNode: CpNode): CpNode | undefined;
+export { findFirst };

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

@@ -0,0 +1,16 @@
+function findFirst(f, cpNode) {
+    const cpStart = cpNode;
+    if (f(cpStart)) {
+        return cpStart;
+    }
+    let cpNode_ = cpNode.next;
+    while (cpNode_ !== cpStart) {
+        if (f(cpNode_)) {
+            return cpNode_;
+        }
+        cpNode_ = cpNode_.next;
+    }
+    return undefined;
+}
+export { findFirst };
+//# sourceMappingURL=find-first.js.map

package/node/cp-node/fs/find-first.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-first.js","sourceRoot":"","sources":["../../../src/cp-node/fs/find-first.ts"],"names":[],"mappings":"AAIA,SAAS,SAAS,CACV,CAAyC,EACzC,MAAc;IAElB,MAAM,OAAO,GAAG,MAAM,CAAC;IAEvB,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;QAAC,OAAO,OAAO,CAAC;IAAC,CAAC;IAEtC,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;IAC1B,OAAO,OAAO,KAAK,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YACP,OAAO,OAAO,CAAC;QACnB,CAAC;QACP,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

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

@@ -0,0 +1,17 @@
+import { CpNode } from "../cp-node.js";
+/**
+ * Returns all `CpNode`s between the two given ones (exclisive the last one).
+ *
+ * * If the second `CpNode` is never encountered all on the loop will be
+ * returned.
+ *
+ * @param cpNodeS
+ * @param cpNodeE
+ * @param inclAllIfEqual if `true` and first and last `CpNode`s are equal then
+ * include all `CpNode`s around the loop, otherwise include none.
+ */
+declare function getAllBetween(cpNodeS: CpNode, cpNodeE: CpNode, inclAllIfEqual?: boolean): {
+    cpNodes: CpNode[];
+    hasHoleCloser: boolean;
+};
+export { getAllBetween };

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

@@ -0,0 +1,31 @@
+/**
+ * Returns all `CpNode`s between the two given ones (exclisive the last one).
+ *
+ * * If the second `CpNode` is never encountered all on the loop will be
+ * returned.
+ *
+ * @param cpNodeS
+ * @param cpNodeE
+ * @param inclAllIfEqual if `true` and first and last `CpNode`s are equal then
+ * include all `CpNode`s around the loop, otherwise include none.
+ */
+function getAllBetween(cpNodeS, cpNodeE, inclAllIfEqual = true) {
+    if (!inclAllIfEqual && cpNodeS === cpNodeE) {
+        return { cpNodes: [], hasHoleCloser: false };
+    }
+    const cpStart = cpNodeS;
+    const cpNodes = [cpStart];
+    let cpNode_ = cpNodeS.next;
+    let hasHoleCloser = cpStart.isHoleClosing;
+    while (cpNode_ !== cpNodeE &&
+        cpNode_ !== cpStart) {
+        if (cpNode_.isHoleClosing) {
+            hasHoleCloser = true;
+        }
+        cpNodes.push(cpNode_);
+        cpNode_ = cpNode_.next;
+    }
+    return { cpNodes, hasHoleCloser };
+}
+export { getAllBetween };
+//# sourceMappingURL=get-all-between.js.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,3 @@
+import { CpNode } from "../cp-node.js";
+declare function getAllOnCircle(cpNode: CpNode, exclThis?: boolean): CpNode[];
+export { getAllOnCircle };

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

@@ -0,0 +1,14 @@
+function getAllOnCircle(cpNode, exclThis = false) {
+    const startCpNode = cpNode;
+    let cpNode_ = startCpNode;
+    const cpNodes = [];
+    do {
+        if (!(exclThis && cpNode_ === startCpNode)) {
+            cpNodes.push(cpNode_);
+        }
+        cpNode_ = cpNode_.nextOnCircle;
+    } while (cpNode_ !== startCpNode);
+    return cpNodes;
+}
+export { getAllOnCircle };
+//# sourceMappingURL=get-all-on-circle.js.map