flo-mat 2.0.1 → 2.0.3

package/node/simplify-mat.js

@@ -1,72 +1,72 @@
-import { hausdorffDistance } from 'flo-bezier3';
-import { CpNode } from './cp-node.js';
-import { getBranches } from './get-branches.js';
-import { getCurveToNext } from './get-curve-to-next.js';
-import { getCurveBetween } from './get-curve/get-curve-between.js';
-/**
- * Simplifies the given MAT by replacing the piecewise quad beziers composing
- * the MAT with fewer ones to within a given tolerance.
- * @param cpNode A representation of the MAT
- * @param anlgeTolerance Tolerance given as the degrees difference of the unit
- * direction vectors at the interface between curves. A tolerance of zero means
- * perfect smoothness is required - defaults to 15.
- * TODO - the next two params are wrong??
- * @param hausdorffTolerance The approximate maximum Hausdorff Distance tolerance -
- * defaults to 0.1
- * @param maxIterations The spacing on the curves used to calculate the Hausdorff
- * Distance - defaults to 1
- */
-function simplifyMat(mat, anlgeTolerance = 15, hausdorffTolerance = 2 ** -3, maxIterations = 50) {
-    let cpNode = mat.cpNode;
-    // Start from a leaf
-    while (!cpNode.isTerminating()) {
-        cpNode = cpNode.next;
-    }
-    let branches = getBranches(cpNode, anlgeTolerance);
-    let canDeletes = [];
-    for (let k = 0; k < branches.length; k++) {
-        let branch = branches[k];
-        // Try to remove some
-        let j = 0;
-        while (j < branch.length) {
-            let i = j;
-            while (true) {
-                j++;
-                if (j === branch.length) {
-                    break;
-                }
-                let hd = getTotalHausdorffDistance(i, j, branch, maxIterations);
-                if (hd > hausdorffTolerance) {
-                    break;
-                }
-                else {
-                    canDeletes.push(branch[j]);
-                }
-            }
-            if (i + 1 === j) {
-                // no simplification occured
-                break;
-            }
-        }
-    }
-    for (let cpNode of canDeletes) {
-        let isTerminating = cpNode.isTerminating();
-        let onCircleCount = cpNode.getCpNodesOnCircle().length;
-        if (isTerminating || onCircleCount !== 2) {
-            continue;
-        }
-        CpNode.remove(cpNode);
-    }
-    //return { cpNode, cpTrees: createNewCpTree(cpNode) }; 
-    return { cpNode, cpTrees: undefined };
-}
-function getTotalHausdorffDistance(i, j, branch, hausdorffSpacing) {
-    let hds = [];
-    let longCurve = getCurveBetween(branch[i], branch[j].next);
-    for (; i < j + 1; i++) {
-        hds.push(hausdorffDistance(getCurveToNext(branch[i]), longCurve, hausdorffSpacing));
-    }
-    return Math.max(...hds);
-}
-export { simplifyMat };
+import { hausdorffDistance } from 'flo-bezier3';
+import { CpNode } from './cp-node.js';
+import { getBranches } from './get-branches.js';
+import { getCurveToNext } from './get-curve-to-next.js';
+import { getCurveBetween } from './get-curve/get-curve-between.js';
+/**
+ * Simplifies the given MAT by replacing the piecewise quad beziers composing
+ * the MAT with fewer ones to within a given tolerance.
+ * @param cpNode A representation of the MAT
+ * @param anlgeTolerance Tolerance given as the degrees difference of the unit
+ * direction vectors at the interface between curves. A tolerance of zero means
+ * perfect smoothness is required - defaults to 15.
+ * TODO - the next two params are wrong??
+ * @param hausdorffTolerance The approximate maximum Hausdorff Distance tolerance -
+ * defaults to 0.1
+ * @param maxIterations The spacing on the curves used to calculate the Hausdorff
+ * Distance - defaults to 1
+ */
+function simplifyMat(mat, anlgeTolerance = 15, hausdorffTolerance = 2 ** -3, maxIterations = 50) {
+    let cpNode = mat.cpNode;
+    // Start from a leaf
+    while (!cpNode.isTerminating()) {
+        cpNode = cpNode.next;
+    }
+    const branches = getBranches(cpNode, anlgeTolerance);
+    const canDeletes = [];
+    for (let k = 0; k < branches.length; k++) {
+        const branch = branches[k];
+        // Try to remove some
+        let j = 0;
+        while (j < branch.length) {
+            const i = j;
+            while (true) {
+                j++;
+                if (j === branch.length) {
+                    break;
+                }
+                const hd = getTotalHausdorffDistance(i, j, branch, maxIterations);
+                if (hd > hausdorffTolerance) {
+                    break;
+                }
+                else {
+                    canDeletes.push(branch[j]);
+                }
+            }
+            if (i + 1 === j) {
+                // no simplification occured
+                break;
+            }
+        }
+    }
+    for (const cpNode of canDeletes) {
+        const isTerminating = cpNode.isTerminating();
+        const onCircleCount = cpNode.getCpNodesOnCircle().length;
+        if (isTerminating || onCircleCount !== 2) {
+            continue;
+        }
+        CpNode.remove(cpNode);
+    }
+    //return { cpNode, cpTrees: createNewCpTree(cpNode) }; 
+    return { cpNode, cpTrees: undefined };
+}
+function getTotalHausdorffDistance(i, j, branch, hausdorffSpacing) {
+    const hds = [];
+    const longCurve = getCurveBetween(branch[i], branch[j].next);
+    for (; i < j + 1; i++) {
+        hds.push(hausdorffDistance(getCurveToNext(branch[i]), longCurve, hausdorffSpacing));
+    }
+    return Math.max(...hds);
+}
+export { simplifyMat };
 //# sourceMappingURL=simplify-mat.js.map

package/node/simplify-mat.js.map

@@ -1 +1 @@
-{"version":3,"file":"simplify-mat.js","sourceRoot":"","sources":["../src/simplify-mat.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAInE;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CACZ,GAAQ,EACR,cAAc,GAAG,EAAE,EACnB,kBAAkB,GAAG,CAAC,IAAE,CAAC,CAAC,EAC1B,aAAa,GAAG,EAAE;IAEtB,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,oBAAoB;IACpB,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE;QAAE,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KAAE;IAEzD,IAAI,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAEnD,IAAI,UAAU,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEzB,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE;YACtB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,IAAI,EAAE;gBACT,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;oBAAE,MAAM;iBAAE;gBAEnC,IAAI,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;gBAEhE,IAAI,EAAE,GAAG,kBAAkB,EAAE;oBACzB,MAAM;iBACT;qBAAM;oBACH,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9B;aACJ;YAED,IAAI,CAAC,GAAC,CAAC,KAAK,CAAC,EAAE;gBACX,4BAA4B;gBAC5B,MAAM;aACT;SACJ;KACJ;IAED,KAAK,IAAI,MAAM,IAAI,UAAU,EAAE;QAC3B,IAAI,aAAa,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC,MAAM,CAAC;QACvD,IAAI,aAAa,IAAI,aAAa,KAAK,CAAC,EAAE;YACtC,SAAS;SACZ;QAED,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;KACzB;IAED,uDAAuD;IACvD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAC1C,CAAC;AAGD,SAAS,yBAAyB,CAC1B,CAAS,EACT,CAAS,EACT,MAAgB,EAChB,gBAAwB;IAE5B,IAAI,GAAG,GAAa,EAAE,CAAC;IACvB,IAAI,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,OAAO,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACf,GAAG,CAAC,IAAI,CAAC,iBAAiB,CACtB,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACzB,SAAS,EACT,gBAAgB,CACnB,CAAC,CAAC;KACN;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
+{"version":3,"file":"simplify-mat.js","sourceRoot":"","sources":["../src/simplify-mat.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAInE;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CACZ,GAAQ,EACR,cAAc,GAAG,EAAE,EACnB,kBAAkB,GAAG,CAAC,IAAE,CAAC,CAAC,EAC1B,aAAa,GAAG,EAAE;IAEtB,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,oBAAoB;IACpB,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE;QAAE,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KAAE;IAEzD,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAErD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE3B,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC;YACZ,OAAO,IAAI,EAAE;gBACT,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;oBAAE,MAAM;iBAAE;gBAEnC,MAAM,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;gBAElE,IAAI,EAAE,GAAG,kBAAkB,EAAE;oBACzB,MAAM;iBACT;qBAAM;oBACH,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9B;aACJ;YAED,IAAI,CAAC,GAAC,CAAC,KAAK,CAAC,EAAE;gBACX,4BAA4B;gBAC5B,MAAM;aACT;SACJ;KACJ;IAED,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE;QAC7B,MAAM,aAAa,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,aAAa,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC,MAAM,CAAC;QACzD,IAAI,aAAa,IAAI,aAAa,KAAK,CAAC,EAAE;YACtC,SAAS;SACZ;QAED,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;KACzB;IAED,uDAAuD;IACvD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAC1C,CAAC;AAGD,SAAS,yBAAyB,CAC1B,CAAS,EACT,CAAS,EACT,MAAgB,EAChB,gBAAwB;IAE5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACf,GAAG,CAAC,IAAI,CAAC,iBAAiB,CACtB,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACzB,SAAS,EACT,gBAAgB,CACnB,CAAC,CAAC;KACN;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/svg/get-loop-bounds.d.ts

@@ -1,12 +1,12 @@
-import { Loop } from '../loop.js';
-import { IPointOnShape } from '../point-on-shape.js';
-/**
- * @hidden
- */
-declare let getLoopBounds: (a: Loop) => {
-    minX: IPointOnShape;
-    minY: IPointOnShape;
-    maxX: IPointOnShape;
-    maxY: IPointOnShape;
-};
-export { getLoopBounds };
+import { Loop } from '../loop.js';
+import { IPointOnShape } from '../point-on-shape.js';
+/**
+ * @hidden
+ */
+declare const getLoopBounds: (a: Loop) => {
+    minX: IPointOnShape;
+    minY: IPointOnShape;
+    maxX: IPointOnShape;
+    maxY: IPointOnShape;
+};
+export { getLoopBounds };

package/node/svg/get-loop-bounds.js

@@ -1,81 +1,81 @@
-import { getBounds } from 'flo-bezier3';
-import { memoize } from 'flo-memoize';
-import { PointOnShape } from '../point-on-shape.js';
-/** @hidden */
-const INF = Number.POSITIVE_INFINITY;
-/**
- * @hidden
- */
-let getLoopBounds = memoize(function (loop) {
-    let extremes = [
-        [
-            { bezier: undefined, t: undefined, val: INF },
-            { bezier: undefined, t: undefined, val: INF }
-        ],
-        [
-            { bezier: undefined, t: undefined, val: -INF },
-            { bezier: undefined, t: undefined, val: -INF }
-        ]
-    ];
-    loop.curves.forEach(function (curve) {
-        let ps = curve.ps;
-        // let bounds = getBounds_(ps);
-        let bounds = getBounds(ps);
-        {
-            {
-                let v = bounds.box[0][0];
-                let x = extremes[0][0].val;
-                if (v < x || (v === x && bounds.ts[0][0] > extremes[0][0].t)) {
-                    extremes[0][0] = {
-                        bezier: curve,
-                        t: bounds.ts[0][0],
-                        val: v
-                    };
-                }
-            }
-            {
-                let v = bounds.box[0][1];
-                let x = extremes[0][1].val;
-                if (v < x || (v === x && bounds.ts[0][1] > extremes[0][1].t)) {
-                    extremes[0][1] = {
-                        bezier: curve,
-                        t: bounds.ts[0][1],
-                        val: v
-                    };
-                }
-            }
-        }
-        {
-            {
-                let v = bounds.box[1][0];
-                let x = extremes[1][0].val;
-                if (v > x || (v === x && bounds.ts[1][0] > extremes[1][0].t)) {
-                    extremes[1][0] = {
-                        bezier: curve,
-                        t: bounds.ts[1][0],
-                        val: v
-                    };
-                }
-            }
-            {
-                let v = bounds.box[1][1];
-                let x = extremes[1][1].val;
-                if (v > x || (v === x && bounds.ts[1][1] > extremes[1][1].t)) {
-                    extremes[1][1] = {
-                        bezier: curve,
-                        t: bounds.ts[1][1],
-                        val: v
-                    };
-                }
-            }
-        }
-    });
-    return {
-        minX: new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
-        minY: new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
-        maxX: new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
-        maxY: new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
-    };
-});
-export { getLoopBounds };
+import { getBounds } from 'flo-bezier3';
+import { memoize } from 'flo-memoize';
+import { PointOnShape } from '../point-on-shape.js';
+/** @hidden */
+const INF = Number.POSITIVE_INFINITY;
+/**
+ * @hidden
+ */
+const getLoopBounds = memoize(function (loop) {
+    const extremes = [
+        [
+            { bezier: undefined, t: undefined, val: INF },
+            { bezier: undefined, t: undefined, val: INF }
+        ],
+        [
+            { bezier: undefined, t: undefined, val: -INF },
+            { bezier: undefined, t: undefined, val: -INF }
+        ]
+    ];
+    loop.curves.forEach(function (curve) {
+        const ps = curve.ps;
+        // const bounds = getBounds_(ps);
+        const bounds = getBounds(ps);
+        {
+            {
+                const v = bounds.box[0][0];
+                const x = extremes[0][0].val;
+                if (v < x || (v === x && bounds.ts[0][0] > extremes[0][0].t)) {
+                    extremes[0][0] = {
+                        bezier: curve,
+                        t: bounds.ts[0][0],
+                        val: v
+                    };
+                }
+            }
+            {
+                const v = bounds.box[0][1];
+                const x = extremes[0][1].val;
+                if (v < x || (v === x && bounds.ts[0][1] > extremes[0][1].t)) {
+                    extremes[0][1] = {
+                        bezier: curve,
+                        t: bounds.ts[0][1],
+                        val: v
+                    };
+                }
+            }
+        }
+        {
+            {
+                const v = bounds.box[1][0];
+                const x = extremes[1][0].val;
+                if (v > x || (v === x && bounds.ts[1][0] > extremes[1][0].t)) {
+                    extremes[1][0] = {
+                        bezier: curve,
+                        t: bounds.ts[1][0],
+                        val: v
+                    };
+                }
+            }
+            {
+                const v = bounds.box[1][1];
+                const x = extremes[1][1].val;
+                if (v > x || (v === x && bounds.ts[1][1] > extremes[1][1].t)) {
+                    extremes[1][1] = {
+                        bezier: curve,
+                        t: bounds.ts[1][1],
+                        val: v
+                    };
+                }
+            }
+        }
+    });
+    return {
+        minX: new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
+        minY: new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
+        maxX: new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
+        maxY: new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
+    };
+});
+export { getLoopBounds };
 //# sourceMappingURL=get-loop-bounds.js.map

package/node/svg/get-loop-bounds.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-loop-bounds.js","sourceRoot":"","sources":["../../src/svg/get-loop-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,OAAO,EAAE,YAAY,EAAiB,MAAM,sBAAsB,CAAC;AAGnE,cAAc;AACd,MAAM,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAGrC;;GAEG;AACH,IAAI,aAAa,GAAG,OAAO,CAAC,UAAS,IAAU;IAM9C,IAAI,QAAQ,GAIJ;QACP;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;YAC5C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;SAC5C;QACD;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;YAC7C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;SAC7C;KACD,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAS,KAAY;QACxC,IAAI,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QAClB,+BAA+B;QAC/B,IAAI,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QAG3B;YACC;gBACC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;QAED;YACC;gBACC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAChE,CAAC;AACH,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"get-loop-bounds.js","sourceRoot":"","sources":["../../src/svg/get-loop-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,OAAO,EAAE,YAAY,EAAiB,MAAM,sBAAsB,CAAC;AAGnE,cAAc;AACd,MAAM,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAGrC;;GAEG;AACH,MAAM,aAAa,GAAG,OAAO,CAAC,UAAS,IAAU;IAMhD,MAAM,QAAQ,GAIN;QACP;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;YAC5C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;SAC5C;QACD;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;YAC7C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;SAC7C;KACD,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAS,KAAY;QACxC,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACpB,iCAAiC;QACjC,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QAG7B;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;QAED;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAChE,CAAC;AACH,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/svg/get-min-y-pos.d.ts

@@ -1,8 +1,8 @@
-/** @hidden */
-import { Loop } from '../loop.js';
-/**
- * @hidden
- * Get topmost PointOnShape of the given loop.
- */
-declare function getMinYPos(loop: Loop): import("../point-on-shape.js").IPointOnShape;
-export { getMinYPos };
+/** @hidden */
+import { Loop } from '../loop.js';
+/**
+ * @hidden
+ * Get topmost PointOnShape of the given loop.
+ */
+declare function getMinYPos(loop: Loop): import("../point-on-shape.js").IPointOnShape;
+export { getMinYPos };

package/node/svg/get-min-y-pos.js

@@ -1,10 +1,10 @@
-import { getLoopBounds } from './get-loop-bounds.js';
-/**
- * @hidden
- * Get topmost PointOnShape of the given loop.
- */
-function getMinYPos(loop) {
-    return getLoopBounds(loop).minY;
-}
-export { getMinYPos };
+import { getLoopBounds } from './get-loop-bounds.js';
+/**
+ * @hidden
+ * Get topmost PointOnShape of the given loop.
+ */
+function getMinYPos(loop) {
+    return getLoopBounds(loop).minY;
+}
+export { getMinYPos };
 //# sourceMappingURL=get-min-y-pos.js.map

package/node/svg/get-shape-bounds.d.ts

@@ -1,9 +1,9 @@
-import { Loop } from '../loop.js';
-/** @hidden */
-declare let getShapeBounds: (a: Loop[]) => {
-    minX: import("../point-on-shape.js").IPointOnShape;
-    minY: import("../point-on-shape.js").IPointOnShape;
-    maxX: import("../point-on-shape.js").IPointOnShape;
-    maxY: import("../point-on-shape.js").IPointOnShape;
-};
-export { getShapeBounds };
+import { Loop } from '../loop.js';
+/** @internal */
+declare const getShapeBounds: (a: Loop[]) => {
+    minX: import("../point-on-shape.js").IPointOnShape;
+    minY: import("../point-on-shape.js").IPointOnShape;
+    maxX: import("../point-on-shape.js").IPointOnShape;
+    maxY: import("../point-on-shape.js").IPointOnShape;
+};
+export { getShapeBounds };

package/node/svg/get-shape-bounds.js

@@ -1,36 +1,36 @@
-import { memoize } from 'flo-memoize';
-import { getLoopBounds } from './get-loop-bounds.js';
-// TODO - move to another library
-/** @hidden */
-let getShapeBounds = memoize(function (loops) {
-    let minX_ = Number.POSITIVE_INFINITY;
-    let maxX_ = Number.NEGATIVE_INFINITY;
-    let minY_ = Number.POSITIVE_INFINITY;
-    let maxY_ = Number.NEGATIVE_INFINITY;
-    let minX;
-    let maxX;
-    let minY;
-    let maxY;
-    for (let loop of loops) {
-        let bounds = getLoopBounds(loop);
-        if (bounds.minX.p[0] < minX_) {
-            minX = bounds.minX;
-            minX_ = bounds.minX.p[0];
-        }
-        if (bounds.maxX.p[0] > maxX_) {
-            maxX = bounds.maxX;
-            maxX_ = bounds.maxX.p[0];
-        }
-        if (bounds.minY.p[1] < minY_) {
-            minY = bounds.minY;
-            minY_ = bounds.minY.p[1];
-        }
-        if (bounds.maxY.p[1] > maxY_) {
-            maxY = bounds.maxY;
-            maxY_ = bounds.maxY.p[1];
-        }
-    }
-    return { minX, minY, maxX, maxY };
-});
-export { getShapeBounds };
+import { memoize } from 'flo-memoize';
+import { getLoopBounds } from './get-loop-bounds.js';
+// TODO - move to another library
+/** @internal */
+const getShapeBounds = memoize(function (loops) {
+    let minX_ = Number.POSITIVE_INFINITY;
+    let maxX_ = Number.NEGATIVE_INFINITY;
+    let minY_ = Number.POSITIVE_INFINITY;
+    let maxY_ = Number.NEGATIVE_INFINITY;
+    let minX;
+    let maxX;
+    let minY;
+    let maxY;
+    for (const loop of loops) {
+        const bounds = getLoopBounds(loop);
+        if (bounds.minX.p[0] < minX_) {
+            minX = bounds.minX;
+            minX_ = bounds.minX.p[0];
+        }
+        if (bounds.maxX.p[0] > maxX_) {
+            maxX = bounds.maxX;
+            maxX_ = bounds.maxX.p[0];
+        }
+        if (bounds.minY.p[1] < minY_) {
+            minY = bounds.minY;
+            minY_ = bounds.minY.p[1];
+        }
+        if (bounds.maxY.p[1] > maxY_) {
+            maxY = bounds.maxY;
+            maxY_ = bounds.maxY.p[1];
+        }
+    }
+    return { minX, minY, maxX, maxY };
+});
+export { getShapeBounds };
 //# sourceMappingURL=get-shape-bounds.js.map

package/node/svg/get-shape-bounds.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-shape-bounds.js","sourceRoot":"","sources":["../../src/svg/get-shape-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,iCAAiC;AAGjC,cAAc;AACd,IAAI,cAAc,GAAG,OAAO,CAAC,UAAS,KAAa;IAC/C,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAErC,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IAET,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QACpB,IAAI,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;KACJ;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACtC,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,cAAc,EAAE,CAAA"}
+{"version":3,"file":"get-shape-bounds.js","sourceRoot":"","sources":["../../src/svg/get-shape-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,iCAAiC;AAGjC,gBAAgB;AAChB,MAAM,cAAc,GAAG,OAAO,CAAC,UAAS,KAAa;IACjD,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAErC,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IAET,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACtB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;KACJ;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACtC,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,cAAc,EAAE,CAAA"}

package/node/sweep-line/sweep-line.d.ts

@@ -1,18 +1,18 @@
-/**
- * @hidden
- * Generalized sweepline algorithm.
- *
- * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.
- *
- * @param items An array of items that are to be compared. Items should
- * typically be geometric objects in 2d space with well-defined left and right
- * endpoints.
- * @param getLeftmostPoint A function that returns the leftmost point of the
- * geometric object of interest.
- * @param getRightmostPoint A function that returns the rightmost point of the
- * geometric object of interest.
- * @param predicate A predicate that takes two geometric objects and returns
- * true if they are of interest or false otherwise.
- */
-declare function sweepLine<T>(items: T[], getLeftmost: (item: T) => number, getRightmost: (item: T) => number, predicate: (item1: T, item2: T) => boolean): [T, T][];
-export { sweepLine };
+/**
+ * @hidden
+ * Generalized sweepline algorithm.
+ *
+ * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.
+ *
+ * @param items An array of items that are to be compared. Items should
+ * typically be geometric objects in 2d space with well-defined left and right
+ * endpoints.
+ * @param getLeftmostPoint A function that returns the leftmost point of the
+ * geometric object of interest.
+ * @param getRightmostPoint A function that returns the rightmost point of the
+ * geometric object of interest.
+ * @param predicate A predicate that takes two geometric objects and returns
+ * true if they are of interest or false otherwise.
+ */
+declare function sweepLine<T>(items: T[], getLeftmost: (item: T) => number, getRightmost: (item: T) => number, predicate: (item1: T, item2: T) => boolean): [T, T][];
+export { sweepLine };