flo-mat 2.0.4 → 3.0.0

package/tsconfig.json

@@ -1,12 +1,8 @@
 {
     "compilerOptions": {
-        "noImplicitAny": true, 
-        "noImplicitThis": true,
-        "alwaysStrict": true,
-        "strictBindCallApply": true,
-        "strictFunctionTypes": true,
-        "module": "es2020",
-        "target": "es2020",
+        "strict": true,
+        "module": "es2022",
+        "target": "es2022",
         "declaration": true,
         "noEmitOnError": true,
         "sourceMap": true,

package/wallaby.mjs

@@ -0,0 +1,32 @@
+
+export default function(wallaby) {
+    return {
+        files: [
+            'package.json',
+            'src/**/*.ts',
+            'test/helpers/*.ts'
+        ],
+        tests: [
+            'test/**/*.spec.ts'
+        ],
+
+        testFramework: 'mocha',
+
+        compilers: {
+            "**/*.+(t)s?": wallaby.compilers.typeScript()
+        },
+
+        env: {
+            type: 'node'
+        },
+
+        setup: function () {
+            // globalThis.expect = chai.expect;
+            // var should = chai.should();
+        },
+
+        workers: { restart: true },
+
+        maxConsoleMessagesPerTest: 250
+    };
+};

package/node/circle.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"circle.js","sourceRoot":"","sources":["../src/circle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAYtD;;;;GAIG;AACH,SAAS,WAAW,CAAC,MAAc,EAAE,CAAS;IAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;AAChE,CAAC;AAGD;;;;GAIG;AACH,SAAS,aAAa,CAAC,EAAU,EAAE,EAAU;IACzC,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE;QACxB,OAAO,KAAK,CAAC;KAChB;IAED,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;IACjC,MAAM,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC;IAEhB,OAAO,CAAC,GAAG,CAAC,CAAC;AACjB,CAAC;AAGD;;;GAGG;AACH,SAAS,QAAQ,CAAC,MAAc;IAC5B,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AAC1D,CAAC;AAED,OAAO,EAAU,WAAW,EAAE,aAAa,EAAE,CAAA"}

package/node/compare-curvatures-at-interface.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compare-curvatures-at-interface.js","sourceRoot":"","sources":["../src/compare-curvatures-at-interface.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC5G,OAAO,EAAE,UAAU,EAAE,wBAAwB,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AAG/F;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,4BAA4B,CAC7B,GAAe,EACf,GAAe;IAEnB,kDAAkD;IAClD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAC/E,oDAAoD;IACpD,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAE/F,kDAAkD;IAClD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAC/E,oDAAoD;IACpD,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAE/F,iCAAiC;IACjC,iCAAiC;IAEjC,uEAAuE;IACvE,uCAAuC;IACvC,uCAAuC;IAEvC,yDAAyD;IACzD,4EAA4E;IAC5E,mCAAmC;IACnC,6BAA6B;IAC7B,+EAA+E;IAC/E,mBAAmB;IACnB,yBAAyB;IAEzB,mEAAmE;IACnE,uFAAuF;IACvF,mCAAmC;IACnC,mCAAmC;IACnC,mCAAmC;IACnC,yCAAyC;IACzC,mCAAmC;IACnC,mCAAmC;IACnC,mCAAmC;IAEnC,qEAAqE;IACrE,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IACF,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,0BAA0B;QAC1B,OAAO,KAAK,GAAG,KAAK,CAAC;KACxB;IAED,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EACpB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;IACF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EACpB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;IAEF,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEnC,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QAC5B,0BAA0B;QAC1B,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAElC,mEAAmE;QACnE,+DAA+D;QAC/D,wEAAwE;QACxE,wEAAwE;QACxE,mEAAmE;QAGnE,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAEhC,IAAI,EAAE,KAAK,CAAC,EAAE;YACV,0BAA0B;YAC1B,qDAAqD;YACrD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/B;KACJ;IAED,0DAA0D;IAE1D,yEAAyE;IACzE,QAAQ;IACR,kFAAkF;IAClF,2FAA2F;IAC3F,0BAA0B;IAC1B,4FAA4F;IAC5F,0FAA0F;IAC1F,oCAAoC;IACpC,kBAAkB;IAElB,sDAAsD;IACtD,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC,CAAC,6CAA6C;IACrG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC,CAAC,6CAA6C;IAErG,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,EACtB,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CACzB,CAAC;IAEF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,EACtB,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CACzB,CAAC;IAEF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,gCAAgC;IAChC,cAAc;IACd,MAAM,CAAC,GAAG,KAAK,CACX,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,cAAc,CACV,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,CAAC,CACJ,CACJ,CAAC;IAEF,MAAM,CAAC,GAAG,KAAK,CACX,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,cAAc,CACV,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,CAAC,CACJ,CACJ,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,OAAO,KAAK,GAAG,KAAK,CAAC;KACxB;IAED,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QAC5B,iEAAiE;QACjE,OAAO,CAAC,CAAC;KACZ;IAED,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAEpC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAEnC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAE9B,2EAA2E;IAC3E,2CAA2C;AAC/C,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/contact-point.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"contact-point.js","sourceRoot":"","sources":["../src/contact-point.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAiB,MAAM,qBAAqB,CAAC;AAoBjE;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,CAAe,EAAE,CAAe;IACnD,iEAAiE;IACjE,IAAI,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;IAEtD,IAAI,GAAG,KAAK,SAAS,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAE5C,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IACxB,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAgB,UAAU,EAAE,CAAA"}

package/node/cp-node.d.ts

@@ -1,202 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { ContactPoint } from './contact-point.js';
-import { removeCpNode } from './cp-node/remove.js';
-/**
- * The primary class of the library.
- *
- * 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
- * represents the entire MAT.
- *
- * To get the maximal disk circle (of which the center is on the medial axis)
- * use [[cp]].circle.
- *
- * 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
- * direction of traversal of the MAT edges and vertices.
- *
- * The edge [[nextOnCircle]] (resp. [[prevOnCircle]]) allows one to go
- * anti-clockwise (resp. clockwise) around the maximal disks implied by
- * 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)
- * (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.
- *
- * 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
- * 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, [[vertexChildren]], 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).
- *
- * 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
- * to 'go around' the shape boundary and at the same time traverse the MAT twice
- * in opposite directions.
- */
-declare class CpNode {
-    readonly cp: ContactPoint;
-    isHoleClosing: boolean;
-    isIntersection: boolean;
-    prev: CpNode;
-    next: CpNode;
-    prevOnCircle: CpNode;
-    nextOnCircle: CpNode;
-    /**
-     * Primarily for internal use.
-     * @param cp The shape boundary contact point, i.e. a [[CpNode]] without its
-     * edges.
-     * @param isHoleClosing If true, this [[CpNode]] belongs to a hole-closing
-     * maximal disk.
-     * @param isIntersection true if this cpNode is at a shape boundary
-     * intersection point, false otherwise
-     * @param prev The previous (going clockwise around the boundary) contact
-     * point ([[CpNode]]).
-     * @param next The next (going anti-clockwise around the boundary) contact
-     * point ([[CpNode]]).
-     * @param prevOnCircle The previous [[CpNode]] (going clockwise around
-     * the inscribed circle defined by the maximal disk).
-     * @param nextOnCircle The next [[CpNode]] (going anti-clockwise around
-     * the inscribed circle defined by the maximal disk).
-     */
-    constructor(cp: ContactPoint, isHoleClosing: boolean, isIntersection: boolean, prev?: CpNode, next?: CpNode, prevOnCircle?: CpNode, nextOnCircle?: CpNode);
-    /**
-     * 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
-     */
-    get matCurveToNextVertex(): 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.
-     */
-    static comparator: (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.
-     */
-    getChildren(): CpNode[];
-    static remove: typeof removeCpNode;
-    /**
-     * 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).
-     */
-    get vertexChildren(): 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.
-     */
-    getAllOnLoop(): 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.
-     */
-    static insert(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]].
-     */
-    getCpNodesOnCircle(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]]
-     */
-    static 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.
-     */
-    isTerminating(): boolean;
-    /**
-     * Like isTerminating() but only returns true if all cpNodes on the circle
-     * (except this.prevOnCircle) is terminating.
-     */
-    isFullyTerminating(): boolean;
-    /**
-     * Returns the first [[CpNode]] (from this one by successively applying
-     * .nextOnCircle) that exits the circle.
-     */
-    getFirstExit(): 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.
-     */
-    isSharp(): boolean;
-    /**
-     * 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.
-     */
-    isOneProng(): 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.
-     */
-    getProngCount(): number;
-    /**
-     * Returns the number of contact points (up to planar coordinates) on the
-     * maximal disk circle implied by this [[CpNode]].
-     *
-     * See also [[getProngCount]].
-     */
-    getRealProngCount(): number;
-}
-export { CpNode };

package/node/cp-node.js

@@ -1,321 +0,0 @@
-import { compareCps } from './contact-point.js';
-import { removeCpNode } from './cp-node/remove.js';
-import { getCurveToNext } from './get-curve-to-next.js';
-/**
- * The primary class of the library.
- *
- * 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
- * represents the entire MAT.
- *
- * To get the maximal disk circle (of which the center is on the medial axis)
- * use [[cp]].circle.
- *
- * 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
- * direction of traversal of the MAT edges and vertices.
- *
- * The edge [[nextOnCircle]] (resp. [[prevOnCircle]]) allows one to go
- * anti-clockwise (resp. clockwise) around the maximal disks implied by
- * 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)
- * (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.
- *
- * 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
- * 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, [[vertexChildren]], 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).
- *
- * 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
- * to 'go around' the shape boundary and at the same time traverse the MAT twice
- * in opposite directions.
- */
-class CpNode {
-    /**
-     * Primarily for internal use.
-     * @param cp The shape boundary contact point, i.e. a [[CpNode]] without its
-     * edges.
-     * @param isHoleClosing If true, this [[CpNode]] belongs to a hole-closing
-     * maximal disk.
-     * @param isIntersection true if this cpNode is at a shape boundary
-     * intersection point, false otherwise
-     * @param prev The previous (going clockwise around the boundary) contact
-     * point ([[CpNode]]).
-     * @param next The next (going anti-clockwise around the boundary) contact
-     * point ([[CpNode]]).
-     * @param prevOnCircle The previous [[CpNode]] (going clockwise around
-     * the inscribed circle defined by the maximal disk).
-     * @param nextOnCircle The next [[CpNode]] (going anti-clockwise around
-     * the inscribed circle defined by the maximal disk).
-     */
-    constructor(cp, isHoleClosing, isIntersection, prev = undefined, next = undefined, prevOnCircle = undefined, nextOnCircle = undefined) {
-        this.cp = cp;
-        this.isHoleClosing = isHoleClosing;
-        this.isIntersection = isIntersection;
-        this.prev = prev;
-        this.next = next;
-        this.prevOnCircle = prevOnCircle;
-        this.nextOnCircle = nextOnCircle;
-    }
-    /**
-     * 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
-     */
-    get matCurveToNextVertex() {
-        return getCurveToNext(this);
-    }
-    /**
-     * 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.
-     */
-    getChildren() {
-        const children = [];
-        const cp = this.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).
-     */
-    get vertexChildren() {
-        if (this.isTerminating()) {
-            return [];
-        }
-        const cp = this;
-        const children = [];
-        let cp_ = cp;
-        while (cp_ !== cp.prevOnCircle) {
-            if (!cp_.isTerminating()) {
-                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.
-     */
-    getAllOnLoop() {
-        const cpStart = this;
-        const cps = [cpStart];
-        let cp = this.next;
-        while (cp !== cpStart) {
-            cps.push(cp);
-            cp = cp.next;
-        }
-        return cps;
-    }
-    /**
-     * 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.
-     */
-    static insert(isHoleClosing, isIntersection, cpTree, cp, prev_) {
-        const cpNode = new CpNode(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]].
-     */
-    getCpNodesOnCircle(exclThis = false) {
-        const startCp = this;
-        let cp = startCp;
-        const cps = [];
-        do {
-            if (exclThis) {
-                exclThis = false;
-            }
-            else {
-                cps.push(cp);
-            }
-            cp = cp.nextOnCircle;
-        } while (cp !== startCp);
-        return cps;
-    }
-    /**
-     * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
-     * circle.
-     * @param cpNode1 A [[CpNode]].
-     * @param cpNode2 Another [[CpNode]]
-     */
-    static isOnSameCircle(cpNode1, cpNode2) {
-        const cpNodes = cpNode1.getCpNodesOnCircle(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.
-     */
-    isTerminating() {
-        return this === this.next.prevOnCircle;
-    }
-    /**
-     * Like isTerminating() but only returns true if all cpNodes on the circle
-     * (except this.prevOnCircle) is terminating.
-     */
-    isFullyTerminating() {
-        const otherOnCircle = this.prevOnCircle.getCpNodesOnCircle(true);
-        const isFullyTerminating = otherOnCircle.every(cpNode => cpNode.isTerminating());
-        return isFullyTerminating;
-    }
-    /**
-     * Returns the first [[CpNode]] (from this one by successively applying
-     * .nextOnCircle) that exits the circle.
-     */
-    getFirstExit() {
-        const startNode = this;
-        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.
-     */
-    isSharp() {
-        return this.cp.circle.radius === 0;
-    }
-    /**
-     * 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.
-     */
-    isOneProng() {
-        const cp1 = this;
-        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]);
-    }
-    /**
-     * 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.
-     */
-    getProngCount() {
-        const startCp = this;
-        let cp = startCp;
-        let i = 0;
-        do {
-            i++;
-            cp = cp.nextOnCircle;
-        } while (cp !== startCp);
-        return i;
-    }
-    /**
-     * Returns the number of contact points (up to planar coordinates) on the
-     * maximal disk circle implied by this [[CpNode]].
-     *
-     * See also [[getProngCount]].
-     */
-    getRealProngCount() {
-        if (this.isOneProng()) {
-            return 1;
-        }
-        return this.getProngCount();
-    }
-}
-/**
- * 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.
- */
-CpNode.comparator = (a, b) => compareCps(a.cp, b.cp);
-CpNode.remove = removeCpNode;
-export { CpNode };
-//# sourceMappingURL=cp-node.js.map

package/node/cp-node.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cp-node.js","sourceRoot":"","sources":["../src/cp-node.ts"],"names":[],"mappings":"AAKA,OAAO,EAAgB,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAGxD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AACH,MAAM,MAAM;IAEX;;;;;;;;;;;;;;;;OAgBG;IACA,YACe,EAAoB,EAC7B,aAAwB,EACxB,cAAwB,EACxB,OAA0B,SAAS,EACnC,OAA0B,SAAS,EACnC,eAA0B,SAAS,EACnC,eAA0B,SAAS;QAN1B,OAAE,GAAF,EAAE,CAAkB;QAC7B,kBAAa,GAAb,aAAa,CAAW;QACxB,mBAAc,GAAd,cAAc,CAAU;QACxB,SAAI,GAAJ,IAAI,CAA+B;QACnC,SAAI,GAAJ,IAAI,CAA+B;QACnC,iBAAY,GAAZ,YAAY,CAAuB;QACnC,iBAAY,GAAZ,YAAY,CAAuB;IAC5C,CAAC;IAGD;;;;;;OAMG;IACH,IAAI,oBAAoB;QACvB,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAaD;;;;;OAKG;IACH,WAAW;QACV,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,GAAG;YACF,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;SACvB,QAAQ,GAAG,CAAC,YAAY,KAAK,EAAE,EAAE;QAElC,OAAO,QAAQ,CAAC;IACjB,CAAC;IAKD;;;;;;;OAOG;IACH,IAAI,cAAc;QACjB,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;YAAE,OAAO,EAAE,CAAC;SAAE;QAExC,MAAM,EAAE,GAAW,IAAI,CAAC;QACxB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,OAAO,GAAG,KAAK,EAAE,CAAC,YAAY,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE;gBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aAAE;YACtD,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;SACvB;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;IAGD;;;OAGG;IACI,YAAY;QAClB,MAAM,OAAO,GAAW,IAAI,CAAC;QAC7B,MAAM,GAAG,GAAa,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,EAAE,GAAW,IAAI,CAAC,IAAI,CAAC;QAE3B,OAAO,EAAE,KAAK,OAAO,EAAE;YACtB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;SACb;QAED,OAAO,GAAG,CAAC;IACZ,CAAC;IAGD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,MAAM,CAClB,aAAsB,EACtB,cAAuB,EACvB,MAAwB,EACxB,EAAgB,EAChB,KAAa;QAEd,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,EAAE,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QAC7D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC;gBACnC,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,MAAM;aACN,CAAC,CAAC;SACH;QAED,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QAET,IAAI,CAAC,KAAK,EAAE;YACX,IAAI,GAAG,MAAM,CAAC;YACd,IAAI,GAAG,MAAM,CAAC;SACd;aAAM;YACN,IAAI,GAAG,KAAK,CAAC;YACb,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;SACjB;QAED,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;QAEnB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;QAEnB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAEtB,OAAO,MAAM,CAAC;IACf,CAAC;IAGD;;;;;OAKG;IACI,kBAAkB,CAAC,QAAQ,GAAG,KAAK;QACzC,MAAM,OAAO,GAAG,IAAc,CAAC;QAC/B,IAAI,EAAE,GAAG,OAAO,CAAC;QAEjB,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,GAAG;YACF,IAAI,QAAQ,EAAE;gBACb,QAAQ,GAAG,KAAK,CAAC;aACjB;iBAAM;gBACN,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACb;YACD,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC;SACrB,QAAQ,EAAE,KAAK,OAAO,EAAC;QAExB,OAAO,GAAG,CAAC;IACZ,CAAC;IAGD;;;;;OAKG;IACH,MAAM,CAAC,cAAc,CAAC,OAAe,EAAE,OAAe;QACrD,MAAM,OAAO,GAAG,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAEjD,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAGD;;;;;;;;;;;;OAYG;IACI,aAAa;QACnB,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;IACxC,CAAC;IAGD;;;OAGG;IACI,kBAAkB;QACxB,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QACjE,MAAM,kBAAkB,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC;QAEjF,OAAO,kBAAkB,CAAC;IAC3B,CAAC;IAGD;;;OAGG;IACI,YAAY;QAClB,MAAM,SAAS,GAAG,IAAc,CAAC;QACjC,IAAI,MAAM,GAAG,SAAS,CAAC;QAEvB,OAAO,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,YAAY,EAAE;YAC3C,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YAErB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,mDAAmD;gBACnD,OAAO,SAAS,CAAC;aACjB;SACD;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAGD;;;;;;OAMG;IACI,OAAO;QACb,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IACpC,CAAC;IAGD;;;;;;;OAOG;IACI,UAAU;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC;QAEjB,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,OAAO,IAAI,CAAC;SACZ;QAED,MAAM,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC;QAE7B,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAEjC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAGD;;;;;;;OAOG;IACI,aAAa;QACnB,MAAM,OAAO,GAAG,IAAc,CAAC;QAC/B,IAAI,EAAE,GAAG,OAAO,CAAC;QAEjB,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,GAAG;YACF,CAAC,EAAE,CAAC;YACJ,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC;SACrB,QAAQ,EAAE,KAAK,OAAO,EAAC;QAExB,OAAO,CAAC,CAAC;IACV,CAAC;IAGD;;;;;OAKG;IACI,iBAAiB;QACvB,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YAAE,OAAO,CAAC,CAAC;SAAE;QAEpC,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7B,CAAC;;AA3RD;;;;;GAKG;AACI,iBAAU,GAChB,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AAsB3C,aAAM,GAAG,YAAY,CAAC;AAkQ9B,OAAO,EAAE,MAAM,EAAE,CAAA"}

package/node/curve.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"curve.js","sourceRoot":"","sources":["../src/curve.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAgCzD;;;GAGG;AACH,MAAM,OAAO,GAAG;IACf,kBAAkB;IAClB,IAAI,EAAG,MAAM;IACb,CAAC,EAAM,MAAM;IACb,CAAC,EAAM,MAAM;IACb,EAAE,EAAK,MAAM;CACb,CAAC;AAGF,cAAc;AACd,kCAAkC;AAClC,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAChC,oCAAoC;AAGpC;;;;;;;;;;;GAWG;AACH,SAAS,SAAS,CAAC,GAAe,EAAE,GAAe;IAClD,wEAAwE;IACxE,qDAAqD;IACrD,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAI,GAAG,GAAG,CAAC,CAAC;IAExB,uDAAuD;IACvD,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE7B,4DAA4D;IAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,cAAc,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE/B,+CAA+C;IAC/C,MAAM,SAAS,GAAG;QACjB,YAAY,CAAC,YAAY,CAAC;QAC1B,YAAY,CAAC,cAAc,CAAC;KAC5B,CAAC;IAEF,wEAAwE;IACxE,cAAc;IACd,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,IAAI,YAAqB,CAAC;IAC1B,IAAI,WAAoB,CAAC;IACzB,MAAM,WAAW,GAAG,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,WAAW,GAAG,CAAC,EAAE;QACpB,8BAA8B;QAC9B,YAAY,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;QAC7C,WAAW,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;KAC5C;SAAM;QACN,YAAY,GAAG,OAAO,CAAC;QACvB,WAAW,GAAI,MAAM,CAAC;KACtB;IAED,OAAO;QACN,QAAQ,EAAE,SAAS;QACnB,aAAa;QACb,OAAO;QACP,MAAM;QACN,YAAY;QACZ,WAAW;KACX,CAAC;AACH,CAAC;AAGD;;;;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"}