flo-mat 3.0.10 → 3.0.12

package/__tests__/jsog/to-jsog-breath-first.ts

@@ -0,0 +1,107 @@
+
+/*
+Copy/paste this into the Chrome console to serialize an object to JSOG
+and copy the result to clipboard. Replace `temp1` with your root object.
+*/
+// (() => {
+//     const encoded = toJsogBreathFirst(temp1);
+//     copy(JSON.stringify(encoded, null, 2));
+// })();
+
+
+function toJsogBreathFirst(v: any) {
+    const seen = new Map();
+    let nextId = 1;
+
+    type QueueItem =
+        | { kind: 'array'; source: any[]; target: any[] }
+        | { kind: 'map'; source: Map<any, any>; target: { '@id': string; '@type': 'Map'; entries: any[] } }
+        | { kind: 'set'; source: Set<any>; target: { '@id': string; '@type': 'Set'; values: any[] } }
+        | { kind: 'object'; source: Record<string, any>; target: Record<string, any> };
+
+    const queue: QueueItem[] = [];
+
+    function encodeValue(value: any): any {
+        if (value === null || typeof value !== 'object') return value;
+
+        if (seen.has(value)) {
+            return { '@ref': seen.get(value) };
+        }
+
+        // Arrays are encoded by value only because JSON drops custom array props
+        // like "@id" during stringify.
+        if (Array.isArray(value)) {
+            const result: any[] = new Array(value.length);
+            queue.push({ kind: 'array', source: value, target: result });
+            return result;
+        }
+
+        const id = String(nextId++);
+        seen.set(value, id);
+
+        if (value instanceof Map) {
+            const result = {
+                '@id': id,
+                '@type': 'Map' as const,
+                entries: [] as any[]
+            };
+            queue.push({ kind: 'map', source: value, target: result });
+            return result;
+        }
+
+        if (value instanceof Set) {
+            const result = {
+                '@id': id,
+                '@type': 'Set' as const,
+                values: [] as any[]
+            };
+            queue.push({ kind: 'set', source: value, target: result });
+            return result;
+        }
+
+        const result: Record<string, any> = { '@id': id };
+        queue.push({ kind: 'object', source: value, target: result });
+        return result;
+    }
+
+    const encoded = encodeValue(v);
+
+    while (queue.length > 0) {
+        const item = queue.shift()!;
+
+        if (item.kind === 'array') {
+            for (let i = 0; i < item.source.length; i++) {
+                item.target[i] = encodeValue(item.source[i]);
+            }
+            continue;
+        }
+
+        if (item.kind === 'map') {
+            for (const [k, val] of item.source.entries()) {
+                item.target.entries.push([encodeValue(k), encodeValue(val)]);
+            }
+            continue;
+        }
+
+        if (item.kind === 'set') {
+        for (const val of item.source.values()) {
+            item.target.values.push(encodeValue(val));
+        }
+        continue;
+        }
+
+        for (const [key, val] of Object.entries(item.source)) {
+            item.target[key] = encodeValue(val);
+        }
+    }
+
+    // `copy` below is only available in the Chrome console.
+    // If you want to run this in Node.js, replace it with `console.log`.
+    // copy(JSON.stringify(encoded, null, 2));
+    // console.log(JSON.stringify(encoded, null, 2));
+    // console.log('JSOG copied to clipboard.');
+    return encoded;
+}
+
+
+export { toJsogBreathFirst }

package/__tests__/jsog/to-jsog-depth-first.ts

@@ -0,0 +1,55 @@
+
+function toJsogDepthFirst(v: any) {
+    const seen = new Map();
+    let nextId = 1;
+
+    function encode(obj: any): any {
+      if (obj === null || typeof obj !== 'object') return obj;
+
+      if (seen.has(obj)) {
+        return { '@ref': seen.get(obj) };
+      }
+
+      // Arrays are encoded by value only because JSON drops custom array props
+      // like "@id" during stringify.
+      if (Array.isArray(obj)) {
+        return obj.map(encode);
+      }
+
+      const id = String(nextId++);
+      seen.set(obj, id);
+
+      if (obj instanceof Map) {
+        return {
+          '@id': id,
+          '@type': 'Map',
+          entries: [...obj.entries()].map(([k, v]) => [encode(k), encode(v)])
+        };
+      }
+
+      if (obj instanceof Set) {
+        return {
+          '@id': id,
+          '@type': 'Set',
+          values: [...obj.values()].map(value => encode(value))
+        };
+      }
+
+      const result: Record<string, any> = { '@id': id };
+      for (const [key, value] of Object.entries(obj)) {
+        result[key] = encode(value);
+      }
+      return result;
+    }
+
+    const encoded = encode(v);
+
+    // `copy` below is only available in the Chrome console.
+    // If you want to run this in Node.js, replace it with `console.log`.
+    // copy(JSON.stringify(encoded, null, 2));
+    console.log(JSON.stringify(encoded, null, 2));
+    // console.log('JSOG copied to clipboard.');
+}
+
+
+export { toJsogDepthFirst }

package/browser/index.js

@@ -892,48 +892,6 @@ function floydWarshall(graph) {
 // INF INF INF 0
 // floydWarshall(graph);//?
 
-;// ./src/point-on-shape/compare-poss.ts
-/**
- * Compares two `PointOnShape`s according to their cyclic ordering imposed
- * by their relative positions on the shape boundary.
- * @param a The first `PointOnShape`.
- * @param b The second `PointOnShape`.
- * @internal
- */
-function comparePoss(a, b) {
-    let res;
-    res = a.curve.idx - b.curve.idx;
-    if (res !== 0) {
-        return res;
-    }
-    res = a.t - b.t;
-    return res;
-}
-
-
-;// ./src/contact-point/contact-point.ts
-
-/**
- * Primarily for internal use.
- *
- * Compares the two contact points according to their order along the shape
- * boundary. Returns > 0 if a > b, < 0 if a < b or 0 if a === b.
- * @param a The first contact point.
- * @param b The second contact point.
- */
-function compareCps(a, b) {
-    let res = comparePoss(a.pointOnShape, b.pointOnShape);
-    if (res !== 0) {
-        return res;
-    }
-    res = a.order - b.order;
-    if (res !== 0) {
-        return res;
-    }
-    return a.order2 - b.order2;
-}
-
-
 ;// ./src/cp-node/fs/get-all-on-loop.ts
 function getAllOnLoop(cpNode) {
     const cpStart = cpNode;
@@ -7174,6 +7132,55 @@ function getAllVertices(cpNode) {
 }
 
 
+;// ./src/point-on-shape/compare-poss.ts
+/**
+ * Compares two `PointOnShape`s according to their cyclic ordering imposed
+ * by their relative positions on the shape boundary.
+ * @param a The first `PointOnShape`.
+ * @param b The second `PointOnShape`.
+ * @internal
+ */
+function comparePoss(a, b) {
+    let res;
+    res = a.curve.idx - b.curve.idx;
+    if (res !== 0) {
+        return res;
+    }
+    res = a.t - b.t;
+    return res;
+}
+
+
+;// ./src/contact-point/contact-point.ts
+
+/**
+ * Primarily for internal use.
+ *
+ * Compares the two contact points according to their order along the shape
+ * boundary. Returns > 0 if a > b, < 0 if a < b or 0 if a === b.
+ * @param a The first contact point.
+ * @param b The second contact point.
+ */
+function compareCps(a, b) {
+    let res = comparePoss(a.pointOnShape, b.pointOnShape);
+    if (res !== 0) {
+        return res;
+    }
+    res = a.order - b.order;
+    if (res !== 0) {
+        return res;
+    }
+    return a.order2 - b.order2;
+}
+
+
+;// ./src/cp-node/fs/cp-node-comparator.ts
+
+function cpNodeComparator(a, b) {
+    return compareCps(a.cp, b.cp);
+}
+
+
 ;// ./src/cp-node/cp-node-fs.ts
 
 
@@ -7210,7 +7217,6 @@ function getAllVertices(cpNode) {
 
 
 
-const cpNodeComparator = (a, b) => compareCps(a.cp, b.cp);
 const CpNodeFs = {
     /**
      * Returns the children of this `CpNode` when seen as a MAT edge. Only
@@ -7310,7 +7316,7 @@ const CpNodeFs = {
      * Compares the order of two `CpNode`s. The order is cyclic and depends
      * on a `CpNode`'s relative position along the shape boundary.
      */
-    cpNodeComparator,
+    cpNodeComparator: cpNodeComparator,
     /**
      * For debugging
      * @param cpNode
@@ -8798,18 +8804,18 @@ const eval_de_casteljau_error_abs = Math.abs;
  * ```
  * // for cubic bezier curves
  * return [
- * 	x_,  // <E> === 3T + 9
- * 	y_   // <E> === 3T + 9
+ *     x_,  // <E> === 3T + 9
+ *     y_   // <E> === 3T + 9
  * ];
  * // for quadratic bezier curves
  * return [
- * 	x_,  // <E> === 2T + 6
- * 	y_   // <E> === 2T + 6
+ *     x_,  // <E> === 2T + 6
+ *     y_   // <E> === 2T + 6
  * ];
  * // for linear bezier curves (i.e. lines)
  * return [
- * 	x_,  // <E> === T + 3
- * 	y_   // <E> === T + 3
+ *     x_,  // <E> === T + 3
+ *     y_   // <E> === T + 3
  * ];
  * ```
  *
@@ -19215,44 +19221,44 @@ const to_power_basis_error_counters_abs = Math.abs;
  * ```
  * // for cubic bezier curves
  * return [
- * 	[
- * 		x3,  // <E> === 3
- * 		x2,  // <E> === 3
- * 		x1,  // <E> === 2
- * 		0,
- * 	],
- * 	[
- * 		y3,  // <E> === 3
- * 		y2,  // <E> === 3
- * 		y1,  // <E> === 2
- * 		0,
- * 	]
+ *     [
+ *         x3,  // <E> === 3
+ *         x2,  // <E> === 3
+ *         x1,  // <E> === 2
+ *         0,
+ *     ],
+ *     [
+ *         y3,  // <E> === 3
+ *         y2,  // <E> === 3
+ *         y1,  // <E> === 2
+ *         0,
+ *     ]
  * ]
  *
  * // for quadratic bezier curves
  * return [
- * 	[
- * 		x2,  // <E> === 2
- * 		x1,  // <E> === 1
- * 		0,
- * 	],
- * 	[
- * 		y2,  // <E> === 2
- * 		y1,  // <E> === 1
- * 		0,
- * 	]
+ *     [
+ *         x2,  // <E> === 2
+ *         x1,  // <E> === 1
+ *         0,
+ *     ],
+ *     [
+ *         y2,  // <E> === 2
+ *         y1,  // <E> === 1
+ *         0,
+ *     ]
  * ];
  *
  * // for linear bezier curves (i.e. lines)
  * return [
- * 	[
- * 		x1_,  // <E> === 1
- * 		x0_   // <E> === 0
- * 	],
- * 	[
- * 		y1_,  // <E> === 1
- * 		y0_   // <E> === 0
- * 	]
+ *     [
+ *         x1_,  // <E> === 1
+ *         x0_   // <E> === 0
+ *     ],
+ *     [
+ *         y1_,  // <E> === 1
+ *         y0_   // <E> === 0
+ *     ]
  * ];
  * ```
  *
@@ -25793,7 +25799,7 @@ const matOptionRanges = {
         range: [1, Number.POSITIVE_INFINITY],
     },
     simplifyTolerance: {
-        range: [2 ** -10, 1024],
+        range: [2 ** -20, 2 ** 20],
         scaleByMaxCoordinate: true
     },
     minBezLength: {
@@ -28119,6 +28125,7 @@ const { ceil: find_2_prong_ceil, log2: find_2_prong_log2, max: find_2_prong_max,
  *    centered at an interior point x which contains two boundary portions c and
  *    d of dΩ as in Fig. 19."
  * In fact, we (and they) start by fixing one point on the boundary beforehand.
+ *
  * @param loops A shape represented by path loops
  * @param maxCoordinate The extreme coordinate value of the shape
  * @param squaredDiagonalLength The squared diagonal length of the shape
@@ -28202,7 +28209,7 @@ function find2Prong(meta, isHoleClosing, for1Prong, angle, y) {
                 return undefined;
             }
         }
-        // Find the point on the line connecting y with x that is  
+        // Find the point on the line connecting y with x that is
         // equidistant from y and z. This will be our next x.
         const nextX = findEquidistantPointOnLineDd(x, y.p, z.p);
         const error = find_2_prong_abs(find_2_prong_sqrt(xy) - find_2_prong_sqrt(xz));
@@ -30261,7 +30268,7 @@ function drawCpNode(g, cpNode, classes = 'blue thin2 nofill', delay = 0, scaleFa
     }
     const $cross = crossHair(g, c, 'orange thin10 nofill', 2 * scaleFactor, delay);
     // if (r === 0) {
-    // 	const $cross = crossHair(g, circle.center, 'red thin2 nofill', 0.02*scaleFactor, delay);
+    //     const $cross = crossHair(g, circle.center, 'red thin2 nofill', 0.02*scaleFactor, delay);
     // }
     return [...$cps, ...$ls, ...$circle, ...$cross];
 }
@@ -30724,6 +30731,41 @@ function holeCloserNext(pairs, holeCloser) {
 
 
 
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+// CpNodeFs functions
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
 
 
 
@@ -30740,4 +30782,4 @@ function holeCloserNext(pairs, holeCloser) {
 
 
 
-export { CpNodeFs, beziersToSvgPathStr, connectHoleClosers, createInitialCpTree, createPos, debugElemNames, drawBeziersAsSinglePath, drawBranch, drawElemFs, drawElemFsDetailed, drawMat, emptyDebugElems, enableDebugForMat, find2Prong, findAndAdd2Prong, findAndAddHoleClosing2Prongs, findMats, floydWarshall, getBoundaryBeziersToNext, getBoundaryPieceBeziers, getBranches, getCloseBoundaryPointsCertified, getClosestSquareDistanceToRect, getFor2ProngsOnLoop, getGraph, getImpliedBoundaryBezierBetween, getPartialMeta, getPathsFromStr, getPointToCpNode, getPotentialClosestPointsOnCurveCertified, getSatCulls, get_shape_bounds_getShapeBounds as getShapeBounds, getSharpCornersOnLoop, isVertexSpecial, loopFromBeziers, simplifyMat, sweep_line_sweepLine as sweepLine, toScaleAxis, trimMat };
+export { CpNodeFs, beziersToSvgPathStr, clone, connectHoleClosers, cpNodeComparator, createInitialCpTree, createPos, debugElemNames, drawBeziersAsSinglePath, drawBranch, drawElemFs, drawElemFsDetailed, drawMat, emptyDebugElems, enableDebugForMat, enhanceCpNode, find2Prong, findAndAdd2Prong, findAndAddHoleClosing2Prongs, findMats, floydWarshall, getAllOnCircle, getAllOnLoop, getAllVertices, getBoundaryBezierPartsToNext, getBoundaryBeziersBetween, getBoundaryBeziersToNext, getBoundaryPieceBeziers, getBranch, getBranchBeziers, getBranches, getChildren, getCloseBoundaryPointsCertified, getClosestSquareDistanceToRect, getEdgeDirection, getFirstExit, getFor2ProngsOnLoop, getGraph, getHoleClosers, getImpliedBoundaryBezierBetween, getInitialDegAngleBetweenMatCurves, getMatCurveBetween, getMatCurveToNext, getMatCurvesBetween, getPartialMeta, getPathsFromStr, getPointToCpNode, getPotentialClosestPointsOnCurveCertified, getProngCount, getRealProngCount, getSalience, getSatCulls, get_shape_bounds_getShapeBounds as getShapeBounds, getSharpCornersOnLoop, getSmoothedSpeed$, getSpeed, getVertexForwardChildren, isFullyTerminating, isOnSameCircle, isOneProng, isSharp, isTerminating, isTwoProng, isVertexSpecial, loopFromBeziers, removeVertex, simplifyMat, sweep_line_sweepLine as sweepLine, toScaleAxis, traverseCp, traverseEdges, traverseVertices, trimMat };