node-red-contrib-tak-registration 0.16.3 → 0.16.7

package/node_modules/@turf/polygon-smooth/dist/cjs/index.cjs

@@ -1,114 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _helpers = require('@turf/helpers');
-var _meta = require('@turf/meta');
-function polygonSmooth(inputPolys, options) {
-  options = options || {};
-  options.iterations = options.iterations || 1;
-  const { iterations } = options;
-  const outPolys = [];
-  if (!inputPolys) throw new Error("inputPolys is required");
-  _meta.geomEach.call(void 0, inputPolys, function(geom, geomIndex, properties) {
-    if (geom.type === "Polygon") {
-      let outCoords = [[]];
-      for (let i = 0; i < iterations; i++) {
-        let tempOutput = [];
-        let poly = geom;
-        if (i > 0) {
-          poly = _helpers.polygon.call(void 0, outCoords).geometry;
-        }
-        processPolygon(poly, tempOutput);
-        outCoords = tempOutput.slice(0);
-      }
-      outPolys.push(_helpers.polygon.call(void 0, outCoords, properties));
-    } else if (geom.type === "MultiPolygon") {
-      let outCoords = [[[]]];
-      for (let y = 0; y < iterations; y++) {
-        let tempOutput = [];
-        let poly = geom;
-        if (y > 0) {
-          poly = _helpers.multiPolygon.call(void 0, outCoords).geometry;
-        }
-        processMultiPolygon(poly, tempOutput);
-        outCoords = tempOutput.slice(0);
-      }
-      outPolys.push(_helpers.multiPolygon.call(void 0, outCoords, properties));
-    } else {
-      throw new Error("geometry is invalid, must be Polygon or MultiPolygon");
-    }
-  });
-  return _helpers.featureCollection.call(void 0, outPolys);
-}
-function processPolygon(poly, tempOutput) {
-  var previousCoord;
-  var previousGeometryIndex;
-  _meta.coordEach.call(void 0, 
-    poly,
-    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
-      if (previousGeometryIndex !== geometryIndex) {
-        tempOutput.push([]);
-      } else {
-        var p0x = previousCoord[0];
-        var p0y = previousCoord[1];
-        var p1x = currentCoord[0];
-        var p1y = currentCoord[1];
-        tempOutput[geometryIndex].push([
-          0.75 * p0x + 0.25 * p1x,
-          0.75 * p0y + 0.25 * p1y
-        ]);
-        tempOutput[geometryIndex].push([
-          0.25 * p0x + 0.75 * p1x,
-          0.25 * p0y + 0.75 * p1y
-        ]);
-      }
-      previousCoord = currentCoord;
-      previousGeometryIndex = geometryIndex;
-    },
-    false
-  );
-  tempOutput.forEach(function(ring) {
-    ring.push(ring[0]);
-  });
-}
-function processMultiPolygon(poly, tempOutput) {
-  let previousCoord;
-  let previousMultiFeatureIndex;
-  let previousGeometryIndex;
-  _meta.coordEach.call(void 0, 
-    poly,
-    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
-      if (previousMultiFeatureIndex !== multiFeatureIndex) {
-        tempOutput.push([[]]);
-      } else if (previousGeometryIndex !== geometryIndex) {
-        tempOutput[multiFeatureIndex].push([]);
-      } else {
-        var p0x = previousCoord[0];
-        var p0y = previousCoord[1];
-        var p1x = currentCoord[0];
-        var p1y = currentCoord[1];
-        tempOutput[multiFeatureIndex][geometryIndex].push([
-          0.75 * p0x + 0.25 * p1x,
-          0.75 * p0y + 0.25 * p1y
-        ]);
-        tempOutput[multiFeatureIndex][geometryIndex].push([
-          0.25 * p0x + 0.75 * p1x,
-          0.25 * p0y + 0.75 * p1y
-        ]);
-      }
-      previousCoord = currentCoord;
-      previousMultiFeatureIndex = multiFeatureIndex;
-      previousGeometryIndex = geometryIndex;
-    },
-    false
-  );
-  tempOutput.forEach(function(poly2) {
-    poly2.forEach(function(ring) {
-      ring.push(ring[0]);
-    });
-  });
-}
-var index_default = polygonSmooth;
-
-
-
-exports.default = index_default; exports.polygonSmooth = polygonSmooth;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/polygon-smooth/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-polygon-smooth/dist/cjs/index.cjs","../../index.ts"],"names":["poly"],"mappings":"AAAA;ACOA,wCAAyD;AACzD,kCAAoC;AAmBpC,SAAS,aAAA,CACP,UAAA,EAKA,OAAA,EAG2C;AAE3C,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,OAAA,CAAQ,WAAA,EAAa,OAAA,CAAQ,WAAA,GAAc,CAAA;AAE3C,EAAA,MAAM,EAAE,WAAW,EAAA,EAAI,OAAA;AAEvB,EAAA,MAAM,SAAA,EAA8C,CAAC,CAAA;AACrD,EAAA,GAAA,CAAI,CAAC,UAAA,EAAY,MAAM,IAAI,KAAA,CAAM,wBAAwB,CAAA;AAEzD,EAAA,4BAAA,UAAS,EAAY,QAAA,CAAU,IAAA,EAAM,SAAA,EAAW,UAAA,EAAY;AAC1D,IAAA,GAAA,CAAI,IAAA,CAAK,KAAA,IAAS,SAAA,EAAW;AAC3B,MAAA,IAAI,UAAA,EAA0B,CAAC,CAAC,CAAC,CAAA;AACjC,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,UAAA,EAAY,CAAA,EAAA,EAAK;AACnC,QAAA,IAAI,WAAA,EAA2B,CAAC,CAAA;AAChC,QAAA,IAAI,KAAA,EAAO,IAAA;AACX,QAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACT,UAAA,KAAA,EAAO,8BAAA,SAAiB,CAAA,CAAE,QAAA;AAAA,QAC5B;AACA,QAAA,cAAA,CAAe,IAAA,EAAM,UAAU,CAAA;AAC/B,QAAA,UAAA,EAAY,UAAA,CAAW,KAAA,CAAM,CAAC,CAAA;AAAA,MAChC;AACA,MAAA,QAAA,CAAS,IAAA,CAAK,8BAAA,SAAQ,EAAW,UAAU,CAAC,CAAA;AAAA,IAC9C,EAAA,KAAA,GAAA,CAAW,IAAA,CAAK,KAAA,IAAS,cAAA,EAAgB;AACvC,MAAA,IAAI,UAAA,EAA4B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrC,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,UAAA,EAAY,CAAA,EAAA,EAAK;AACnC,QAAA,IAAI,WAAA,EAA6B,CAAC,CAAA;AAClC,QAAA,IAAI,KAAA,EAAO,IAAA;AACX,QAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACT,UAAA,KAAA,EAAO,mCAAA,SAAsB,CAAA,CAAE,QAAA;AAAA,QACjC;AACA,QAAA,mBAAA,CAAoB,IAAA,EAAM,UAAU,CAAA;AACpC,QAAA,UAAA,EAAY,UAAA,CAAW,KAAA,CAAM,CAAC,CAAA;AAAA,MAChC;AACA,MAAA,QAAA,CAAS,IAAA,CAAK,mCAAA,SAAa,EAAW,UAAU,CAAC,CAAA;AAAA,IACnD,EAAA,KAAO;AACL,MAAA,MAAM,IAAI,KAAA,CAAM,sDAAsD,CAAA;AAAA,IACxE;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,wCAAA,QAA0B,CAAA;AACnC;AAOA,SAAS,cAAA,CAAe,IAAA,EAAe,UAAA,EAA0B;AAC/D,EAAA,IAAI,aAAA;AACJ,EAAA,IAAI,qBAAA;AAEJ,EAAA,6BAAA;AAAA,IACE,IAAA;AAAA,IACA,QAAA,CACE,YAAA,EACA,UAAA,EACA,YAAA,EACA,iBAAA,EACA,aAAA,EACA;AACA,MAAA,GAAA,CAAI,sBAAA,IAA0B,aAAA,EAAe;AAC3C,QAAA,UAAA,CAAW,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,MACpB,EAAA,KAAO;AACL,QAAA,IAAI,IAAA,EAAM,aAAA,CAAc,CAAC,CAAA;AACzB,QAAA,IAAI,IAAA,EAAM,aAAA,CAAc,CAAC,CAAA;AACzB,QAAA,IAAI,IAAA,EAAM,YAAA,CAAa,CAAC,CAAA;AACxB,QAAA,IAAI,IAAA,EAAM,YAAA,CAAa,CAAC,CAAA;AACxB,QAAA,UAAA,CAAW,aAAa,CAAA,CAAE,IAAA,CAAK;AAAA,UAC7B,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,GAAA;AAAA,UACpB,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO;AAAA,QACtB,CAAC,CAAA;AACD,QAAA,UAAA,CAAW,aAAa,CAAA,CAAE,IAAA,CAAK;AAAA,UAC7B,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,GAAA;AAAA,UACpB,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO;AAAA,QACtB,CAAC,CAAA;AAAA,MACH;AACA,MAAA,cAAA,EAAgB,YAAA;AAChB,MAAA,sBAAA,EAAwB,aAAA;AAAA,IAC1B,CAAA;AAAA,IACA;AAAA,EACF,CAAA;AACA,EAAA,UAAA,CAAW,OAAA,CAAQ,QAAA,CAAU,IAAA,EAAM;AACjC,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EACnB,CAAC,CAAA;AACH;AAOA,SAAS,mBAAA,CAAoB,IAAA,EAAoB,UAAA,EAA4B;AAC3E,EAAA,IAAI,aAAA;AACJ,EAAA,IAAI,yBAAA;AACJ,EAAA,IAAI,qBAAA;AAEJ,EAAA,6BAAA;AAAA,IACE,IAAA;AAAA,IACA,QAAA,CACE,YAAA,EACA,UAAA,EACA,YAAA,EACA,iBAAA,EACA,aAAA,EACA;AACA,MAAA,GAAA,CAAI,0BAAA,IAA8B,iBAAA,EAAmB;AACnD,QAAA,UAAA,CAAW,IAAA,CAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAAA,MACtB,EAAA,KAAA,GAAA,CAAW,sBAAA,IAA0B,aAAA,EAAe;AAClD,QAAA,UAAA,CAAW,iBAAiB,CAAA,CAAE,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,MACvC,EAAA,KAAO;AACL,QAAA,IAAI,IAAA,EAAM,aAAA,CAAc,CAAC,CAAA;AACzB,QAAA,IAAI,IAAA,EAAM,aAAA,CAAc,CAAC,CAAA;AACzB,QAAA,IAAI,IAAA,EAAM,YAAA,CAAa,CAAC,CAAA;AACxB,QAAA,IAAI,IAAA,EAAM,YAAA,CAAa,CAAC,CAAA;AACxB,QAAA,UAAA,CAAW,iBAAiB,CAAA,CAAE,aAAa,CAAA,CAAE,IAAA,CAAK;AAAA,UAChD,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,GAAA;AAAA,UACpB,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO;AAAA,QACtB,CAAC,CAAA;AACD,QAAA,UAAA,CAAW,iBAAiB,CAAA,CAAE,aAAa,CAAA,CAAE,IAAA,CAAK;AAAA,UAChD,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,GAAA;AAAA,UACpB,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO;AAAA,QACtB,CAAC,CAAA;AAAA,MACH;AACA,MAAA,cAAA,EAAgB,YAAA;AAChB,MAAA,0BAAA,EAA4B,iBAAA;AAC5B,MAAA,sBAAA,EAAwB,aAAA;AAAA,IAC1B,CAAA;AAAA,IACA;AAAA,EACF,CAAA;AACA,EAAA,UAAA,CAAW,OAAA,CAAQ,QAAA,CAAUA,KAAAA,EAAM;AACjC,IAAAA,KAAAA,CAAK,OAAA,CAAQ,QAAA,CAAU,IAAA,EAAM;AAC3B,MAAA,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,IACnB,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACH;AAGA,IAAO,cAAA,EAAQ,aAAA;ADjEf;AACE;AACA;AACF,uEAAC","file":"/home/runner/work/turf/turf/packages/turf-polygon-smooth/dist/cjs/index.cjs","sourcesContent":[null,"import type {\n  Feature,\n  FeatureCollection,\n  Polygon,\n  Position,\n  MultiPolygon,\n} from \"geojson\";\nimport { featureCollection, multiPolygon, polygon } from \"@turf/helpers\";\nimport { coordEach, geomEach } from \"@turf/meta\";\n\n/**\n * Smooths a {@link Polygon} or {@link MultiPolygon}. Based on [Chaikin's algorithm](https://www.cs.unc.edu/~dm/UNC/COMP258/LECTURES/Chaikins-Algorithm.pdf).\n * Warning: may create degenerate polygons.\n *\n * @function\n * @param {FeatureCollection<Polygon|MultiPolygon>|Feature<Polygon|MultiPolygon>|Polygon|MultiPolygon} inputPolys (Multi)Polygon(s) to smooth\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.iterations=1] The number of times to smooth the polygon. A higher value means a smoother polygon.\n * @returns {FeatureCollection<Polygon|MultiPolygon>} FeatureCollection containing the smoothed polygon/multipoylgons\n * @example\n * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n *\n * var smoothed = turf.polygonSmooth(polygon, {iterations: 3})\n *\n * //addToMap\n * var addToMap = [smoothed, polygon];\n */\nfunction polygonSmooth(\n  inputPolys:\n    | FeatureCollection<Polygon | MultiPolygon>\n    | Feature<Polygon | MultiPolygon>\n    | Polygon\n    | MultiPolygon,\n  options?: {\n    iterations?: number;\n  }\n): FeatureCollection<Polygon | MultiPolygon> {\n  // Optional parameters\n  options = options || {};\n  options.iterations = options.iterations || 1;\n\n  const { iterations } = options;\n\n  const outPolys: Feature<Polygon | MultiPolygon>[] = [];\n  if (!inputPolys) throw new Error(\"inputPolys is required\");\n\n  geomEach(inputPolys, function (geom, geomIndex, properties) {\n    if (geom.type === \"Polygon\") {\n      let outCoords: Position[][] = [[]];\n      for (let i = 0; i < iterations; i++) {\n        let tempOutput: Position[][] = [];\n        let poly = geom;\n        if (i > 0) {\n          poly = polygon(outCoords).geometry;\n        }\n        processPolygon(poly, tempOutput);\n        outCoords = tempOutput.slice(0);\n      }\n      outPolys.push(polygon(outCoords, properties));\n    } else if (geom.type === \"MultiPolygon\") {\n      let outCoords: Position[][][] = [[[]]];\n      for (let y = 0; y < iterations; y++) {\n        let tempOutput: Position[][][] = [];\n        let poly = geom;\n        if (y > 0) {\n          poly = multiPolygon(outCoords).geometry;\n        }\n        processMultiPolygon(poly, tempOutput);\n        outCoords = tempOutput.slice(0);\n      }\n      outPolys.push(multiPolygon(outCoords, properties));\n    } else {\n      throw new Error(\"geometry is invalid, must be Polygon or MultiPolygon\");\n    }\n  });\n\n  return featureCollection(outPolys);\n}\n\n/**\n * @param {poly} poly to process\n * @param {poly} tempOutput to place the results in\n * @private\n */\nfunction processPolygon(poly: Polygon, tempOutput: Position[][]) {\n  var previousCoord: Position;\n  var previousGeometryIndex: number;\n\n  coordEach(\n    poly,\n    function (\n      currentCoord,\n      coordIndex,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex\n    ) {\n      if (previousGeometryIndex !== geometryIndex) {\n        tempOutput.push([]);\n      } else {\n        var p0x = previousCoord[0];\n        var p0y = previousCoord[1];\n        var p1x = currentCoord[0];\n        var p1y = currentCoord[1];\n        tempOutput[geometryIndex].push([\n          0.75 * p0x + 0.25 * p1x,\n          0.75 * p0y + 0.25 * p1y,\n        ]);\n        tempOutput[geometryIndex].push([\n          0.25 * p0x + 0.75 * p1x,\n          0.25 * p0y + 0.75 * p1y,\n        ]);\n      }\n      previousCoord = currentCoord;\n      previousGeometryIndex = geometryIndex;\n    },\n    false\n  );\n  tempOutput.forEach(function (ring) {\n    ring.push(ring[0]);\n  });\n}\n\n/**\n * @param {poly} poly to process\n * @param {poly} tempOutput to place the results in\n * @private\n */\nfunction processMultiPolygon(poly: MultiPolygon, tempOutput: Position[][][]) {\n  let previousCoord: Position;\n  let previousMultiFeatureIndex: number;\n  let previousGeometryIndex: number;\n\n  coordEach(\n    poly,\n    function (\n      currentCoord,\n      coordIndex,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex\n    ) {\n      if (previousMultiFeatureIndex !== multiFeatureIndex) {\n        tempOutput.push([[]]);\n      } else if (previousGeometryIndex !== geometryIndex) {\n        tempOutput[multiFeatureIndex].push([]);\n      } else {\n        var p0x = previousCoord[0];\n        var p0y = previousCoord[1];\n        var p1x = currentCoord[0];\n        var p1y = currentCoord[1];\n        tempOutput[multiFeatureIndex][geometryIndex].push([\n          0.75 * p0x + 0.25 * p1x,\n          0.75 * p0y + 0.25 * p1y,\n        ]);\n        tempOutput[multiFeatureIndex][geometryIndex].push([\n          0.25 * p0x + 0.75 * p1x,\n          0.25 * p0y + 0.75 * p1y,\n        ]);\n      }\n      previousCoord = currentCoord;\n      previousMultiFeatureIndex = multiFeatureIndex;\n      previousGeometryIndex = geometryIndex;\n    },\n    false\n  );\n  tempOutput.forEach(function (poly) {\n    poly.forEach(function (ring) {\n      ring.push(ring[0]);\n    });\n  });\n}\n\nexport { polygonSmooth };\nexport default polygonSmooth;\n"]}

package/node_modules/@turf/polygon-smooth/dist/cjs/index.d.cts

@@ -1,24 +0,0 @@
-import { FeatureCollection, Polygon, MultiPolygon, Feature } from 'geojson';
-
-/**
- * Smooths a {@link Polygon} or {@link MultiPolygon}. Based on [Chaikin's algorithm](https://www.cs.unc.edu/~dm/UNC/COMP258/LECTURES/Chaikins-Algorithm.pdf).
- * Warning: may create degenerate polygons.
- *
- * @function
- * @param {FeatureCollection<Polygon|MultiPolygon>|Feature<Polygon|MultiPolygon>|Polygon|MultiPolygon} inputPolys (Multi)Polygon(s) to smooth
- * @param {Object} [options={}] Optional parameters
- * @param {string} [options.iterations=1] The number of times to smooth the polygon. A higher value means a smoother polygon.
- * @returns {FeatureCollection<Polygon|MultiPolygon>} FeatureCollection containing the smoothed polygon/multipoylgons
- * @example
- * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- *
- * var smoothed = turf.polygonSmooth(polygon, {iterations: 3})
- *
- * //addToMap
- * var addToMap = [smoothed, polygon];
- */
-declare function polygonSmooth(inputPolys: FeatureCollection<Polygon | MultiPolygon> | Feature<Polygon | MultiPolygon> | Polygon | MultiPolygon, options?: {
-    iterations?: number;
-}): FeatureCollection<Polygon | MultiPolygon>;
-
-export { polygonSmooth as default, polygonSmooth };

package/node_modules/@turf/polygon-smooth/dist/esm/index.d.ts

@@ -1,24 +0,0 @@
-import { FeatureCollection, Polygon, MultiPolygon, Feature } from 'geojson';
-
-/**
- * Smooths a {@link Polygon} or {@link MultiPolygon}. Based on [Chaikin's algorithm](https://www.cs.unc.edu/~dm/UNC/COMP258/LECTURES/Chaikins-Algorithm.pdf).
- * Warning: may create degenerate polygons.
- *
- * @function
- * @param {FeatureCollection<Polygon|MultiPolygon>|Feature<Polygon|MultiPolygon>|Polygon|MultiPolygon} inputPolys (Multi)Polygon(s) to smooth
- * @param {Object} [options={}] Optional parameters
- * @param {string} [options.iterations=1] The number of times to smooth the polygon. A higher value means a smoother polygon.
- * @returns {FeatureCollection<Polygon|MultiPolygon>} FeatureCollection containing the smoothed polygon/multipoylgons
- * @example
- * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- *
- * var smoothed = turf.polygonSmooth(polygon, {iterations: 3})
- *
- * //addToMap
- * var addToMap = [smoothed, polygon];
- */
-declare function polygonSmooth(inputPolys: FeatureCollection<Polygon | MultiPolygon> | Feature<Polygon | MultiPolygon> | Polygon | MultiPolygon, options?: {
-    iterations?: number;
-}): FeatureCollection<Polygon | MultiPolygon>;
-
-export { polygonSmooth as default, polygonSmooth };

package/node_modules/@turf/polygon-smooth/dist/esm/index.js

@@ -1,114 +0,0 @@
-// index.ts
-import { featureCollection, multiPolygon, polygon } from "@turf/helpers";
-import { coordEach, geomEach } from "@turf/meta";
-function polygonSmooth(inputPolys, options) {
-  options = options || {};
-  options.iterations = options.iterations || 1;
-  const { iterations } = options;
-  const outPolys = [];
-  if (!inputPolys) throw new Error("inputPolys is required");
-  geomEach(inputPolys, function(geom, geomIndex, properties) {
-    if (geom.type === "Polygon") {
-      let outCoords = [[]];
-      for (let i = 0; i < iterations; i++) {
-        let tempOutput = [];
-        let poly = geom;
-        if (i > 0) {
-          poly = polygon(outCoords).geometry;
-        }
-        processPolygon(poly, tempOutput);
-        outCoords = tempOutput.slice(0);
-      }
-      outPolys.push(polygon(outCoords, properties));
-    } else if (geom.type === "MultiPolygon") {
-      let outCoords = [[[]]];
-      for (let y = 0; y < iterations; y++) {
-        let tempOutput = [];
-        let poly = geom;
-        if (y > 0) {
-          poly = multiPolygon(outCoords).geometry;
-        }
-        processMultiPolygon(poly, tempOutput);
-        outCoords = tempOutput.slice(0);
-      }
-      outPolys.push(multiPolygon(outCoords, properties));
-    } else {
-      throw new Error("geometry is invalid, must be Polygon or MultiPolygon");
-    }
-  });
-  return featureCollection(outPolys);
-}
-function processPolygon(poly, tempOutput) {
-  var previousCoord;
-  var previousGeometryIndex;
-  coordEach(
-    poly,
-    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
-      if (previousGeometryIndex !== geometryIndex) {
-        tempOutput.push([]);
-      } else {
-        var p0x = previousCoord[0];
-        var p0y = previousCoord[1];
-        var p1x = currentCoord[0];
-        var p1y = currentCoord[1];
-        tempOutput[geometryIndex].push([
-          0.75 * p0x + 0.25 * p1x,
-          0.75 * p0y + 0.25 * p1y
-        ]);
-        tempOutput[geometryIndex].push([
-          0.25 * p0x + 0.75 * p1x,
-          0.25 * p0y + 0.75 * p1y
-        ]);
-      }
-      previousCoord = currentCoord;
-      previousGeometryIndex = geometryIndex;
-    },
-    false
-  );
-  tempOutput.forEach(function(ring) {
-    ring.push(ring[0]);
-  });
-}
-function processMultiPolygon(poly, tempOutput) {
-  let previousCoord;
-  let previousMultiFeatureIndex;
-  let previousGeometryIndex;
-  coordEach(
-    poly,
-    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
-      if (previousMultiFeatureIndex !== multiFeatureIndex) {
-        tempOutput.push([[]]);
-      } else if (previousGeometryIndex !== geometryIndex) {
-        tempOutput[multiFeatureIndex].push([]);
-      } else {
-        var p0x = previousCoord[0];
-        var p0y = previousCoord[1];
-        var p1x = currentCoord[0];
-        var p1y = currentCoord[1];
-        tempOutput[multiFeatureIndex][geometryIndex].push([
-          0.75 * p0x + 0.25 * p1x,
-          0.75 * p0y + 0.25 * p1y
-        ]);
-        tempOutput[multiFeatureIndex][geometryIndex].push([
-          0.25 * p0x + 0.75 * p1x,
-          0.25 * p0y + 0.75 * p1y
-        ]);
-      }
-      previousCoord = currentCoord;
-      previousMultiFeatureIndex = multiFeatureIndex;
-      previousGeometryIndex = geometryIndex;
-    },
-    false
-  );
-  tempOutput.forEach(function(poly2) {
-    poly2.forEach(function(ring) {
-      ring.push(ring[0]);
-    });
-  });
-}
-var index_default = polygonSmooth;
-export {
-  index_default as default,
-  polygonSmooth
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/polygon-smooth/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import type {\n  Feature,\n  FeatureCollection,\n  Polygon,\n  Position,\n  MultiPolygon,\n} from \"geojson\";\nimport { featureCollection, multiPolygon, polygon } from \"@turf/helpers\";\nimport { coordEach, geomEach } from \"@turf/meta\";\n\n/**\n * Smooths a {@link Polygon} or {@link MultiPolygon}. Based on [Chaikin's algorithm](https://www.cs.unc.edu/~dm/UNC/COMP258/LECTURES/Chaikins-Algorithm.pdf).\n * Warning: may create degenerate polygons.\n *\n * @function\n * @param {FeatureCollection<Polygon|MultiPolygon>|Feature<Polygon|MultiPolygon>|Polygon|MultiPolygon} inputPolys (Multi)Polygon(s) to smooth\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.iterations=1] The number of times to smooth the polygon. A higher value means a smoother polygon.\n * @returns {FeatureCollection<Polygon|MultiPolygon>} FeatureCollection containing the smoothed polygon/multipoylgons\n * @example\n * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n *\n * var smoothed = turf.polygonSmooth(polygon, {iterations: 3})\n *\n * //addToMap\n * var addToMap = [smoothed, polygon];\n */\nfunction polygonSmooth(\n  inputPolys:\n    | FeatureCollection<Polygon | MultiPolygon>\n    | Feature<Polygon | MultiPolygon>\n    | Polygon\n    | MultiPolygon,\n  options?: {\n    iterations?: number;\n  }\n): FeatureCollection<Polygon | MultiPolygon> {\n  // Optional parameters\n  options = options || {};\n  options.iterations = options.iterations || 1;\n\n  const { iterations } = options;\n\n  const outPolys: Feature<Polygon | MultiPolygon>[] = [];\n  if (!inputPolys) throw new Error(\"inputPolys is required\");\n\n  geomEach(inputPolys, function (geom, geomIndex, properties) {\n    if (geom.type === \"Polygon\") {\n      let outCoords: Position[][] = [[]];\n      for (let i = 0; i < iterations; i++) {\n        let tempOutput: Position[][] = [];\n        let poly = geom;\n        if (i > 0) {\n          poly = polygon(outCoords).geometry;\n        }\n        processPolygon(poly, tempOutput);\n        outCoords = tempOutput.slice(0);\n      }\n      outPolys.push(polygon(outCoords, properties));\n    } else if (geom.type === \"MultiPolygon\") {\n      let outCoords: Position[][][] = [[[]]];\n      for (let y = 0; y < iterations; y++) {\n        let tempOutput: Position[][][] = [];\n        let poly = geom;\n        if (y > 0) {\n          poly = multiPolygon(outCoords).geometry;\n        }\n        processMultiPolygon(poly, tempOutput);\n        outCoords = tempOutput.slice(0);\n      }\n      outPolys.push(multiPolygon(outCoords, properties));\n    } else {\n      throw new Error(\"geometry is invalid, must be Polygon or MultiPolygon\");\n    }\n  });\n\n  return featureCollection(outPolys);\n}\n\n/**\n * @param {poly} poly to process\n * @param {poly} tempOutput to place the results in\n * @private\n */\nfunction processPolygon(poly: Polygon, tempOutput: Position[][]) {\n  var previousCoord: Position;\n  var previousGeometryIndex: number;\n\n  coordEach(\n    poly,\n    function (\n      currentCoord,\n      coordIndex,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex\n    ) {\n      if (previousGeometryIndex !== geometryIndex) {\n        tempOutput.push([]);\n      } else {\n        var p0x = previousCoord[0];\n        var p0y = previousCoord[1];\n        var p1x = currentCoord[0];\n        var p1y = currentCoord[1];\n        tempOutput[geometryIndex].push([\n          0.75 * p0x + 0.25 * p1x,\n          0.75 * p0y + 0.25 * p1y,\n        ]);\n        tempOutput[geometryIndex].push([\n          0.25 * p0x + 0.75 * p1x,\n          0.25 * p0y + 0.75 * p1y,\n        ]);\n      }\n      previousCoord = currentCoord;\n      previousGeometryIndex = geometryIndex;\n    },\n    false\n  );\n  tempOutput.forEach(function (ring) {\n    ring.push(ring[0]);\n  });\n}\n\n/**\n * @param {poly} poly to process\n * @param {poly} tempOutput to place the results in\n * @private\n */\nfunction processMultiPolygon(poly: MultiPolygon, tempOutput: Position[][][]) {\n  let previousCoord: Position;\n  let previousMultiFeatureIndex: number;\n  let previousGeometryIndex: number;\n\n  coordEach(\n    poly,\n    function (\n      currentCoord,\n      coordIndex,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex\n    ) {\n      if (previousMultiFeatureIndex !== multiFeatureIndex) {\n        tempOutput.push([[]]);\n      } else if (previousGeometryIndex !== geometryIndex) {\n        tempOutput[multiFeatureIndex].push([]);\n      } else {\n        var p0x = previousCoord[0];\n        var p0y = previousCoord[1];\n        var p1x = currentCoord[0];\n        var p1y = currentCoord[1];\n        tempOutput[multiFeatureIndex][geometryIndex].push([\n          0.75 * p0x + 0.25 * p1x,\n          0.75 * p0y + 0.25 * p1y,\n        ]);\n        tempOutput[multiFeatureIndex][geometryIndex].push([\n          0.25 * p0x + 0.75 * p1x,\n          0.25 * p0y + 0.75 * p1y,\n        ]);\n      }\n      previousCoord = currentCoord;\n      previousMultiFeatureIndex = multiFeatureIndex;\n      previousGeometryIndex = geometryIndex;\n    },\n    false\n  );\n  tempOutput.forEach(function (poly) {\n    poly.forEach(function (ring) {\n      ring.push(ring[0]);\n    });\n  });\n}\n\nexport { polygonSmooth };\nexport default polygonSmooth;\n"],"mappings":";AAOA,SAAS,mBAAmB,cAAc,eAAe;AACzD,SAAS,WAAW,gBAAgB;AAmBpC,SAAS,cACP,YAKA,SAG2C;AAE3C,YAAU,WAAW,CAAC;AACtB,UAAQ,aAAa,QAAQ,cAAc;AAE3C,QAAM,EAAE,WAAW,IAAI;AAEvB,QAAM,WAA8C,CAAC;AACrD,MAAI,CAAC,WAAY,OAAM,IAAI,MAAM,wBAAwB;AAEzD,WAAS,YAAY,SAAU,MAAM,WAAW,YAAY;AAC1D,QAAI,KAAK,SAAS,WAAW;AAC3B,UAAI,YAA0B,CAAC,CAAC,CAAC;AACjC,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,YAAI,aAA2B,CAAC;AAChC,YAAI,OAAO;AACX,YAAI,IAAI,GAAG;AACT,iBAAO,QAAQ,SAAS,EAAE;AAAA,QAC5B;AACA,uBAAe,MAAM,UAAU;AAC/B,oBAAY,WAAW,MAAM,CAAC;AAAA,MAChC;AACA,eAAS,KAAK,QAAQ,WAAW,UAAU,CAAC;AAAA,IAC9C,WAAW,KAAK,SAAS,gBAAgB;AACvC,UAAI,YAA4B,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,YAAI,aAA6B,CAAC;AAClC,YAAI,OAAO;AACX,YAAI,IAAI,GAAG;AACT,iBAAO,aAAa,SAAS,EAAE;AAAA,QACjC;AACA,4BAAoB,MAAM,UAAU;AACpC,oBAAY,WAAW,MAAM,CAAC;AAAA,MAChC;AACA,eAAS,KAAK,aAAa,WAAW,UAAU,CAAC;AAAA,IACnD,OAAO;AACL,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AAAA,EACF,CAAC;AAED,SAAO,kBAAkB,QAAQ;AACnC;AAOA,SAAS,eAAe,MAAe,YAA0B;AAC/D,MAAI;AACJ,MAAI;AAEJ;AAAA,IACE;AAAA,IACA,SACE,cACA,YACA,cACA,mBACA,eACA;AACA,UAAI,0BAA0B,eAAe;AAC3C,mBAAW,KAAK,CAAC,CAAC;AAAA,MACpB,OAAO;AACL,YAAI,MAAM,cAAc,CAAC;AACzB,YAAI,MAAM,cAAc,CAAC;AACzB,YAAI,MAAM,aAAa,CAAC;AACxB,YAAI,MAAM,aAAa,CAAC;AACxB,mBAAW,aAAa,EAAE,KAAK;AAAA,UAC7B,OAAO,MAAM,OAAO;AAAA,UACpB,OAAO,MAAM,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,aAAa,EAAE,KAAK;AAAA,UAC7B,OAAO,MAAM,OAAO;AAAA,UACpB,OAAO,MAAM,OAAO;AAAA,QACtB,CAAC;AAAA,MACH;AACA,sBAAgB;AAChB,8BAAwB;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AACA,aAAW,QAAQ,SAAU,MAAM;AACjC,SAAK,KAAK,KAAK,CAAC,CAAC;AAAA,EACnB,CAAC;AACH;AAOA,SAAS,oBAAoB,MAAoB,YAA4B;AAC3E,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ;AAAA,IACE;AAAA,IACA,SACE,cACA,YACA,cACA,mBACA,eACA;AACA,UAAI,8BAA8B,mBAAmB;AACnD,mBAAW,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,MACtB,WAAW,0BAA0B,eAAe;AAClD,mBAAW,iBAAiB,EAAE,KAAK,CAAC,CAAC;AAAA,MACvC,OAAO;AACL,YAAI,MAAM,cAAc,CAAC;AACzB,YAAI,MAAM,cAAc,CAAC;AACzB,YAAI,MAAM,aAAa,CAAC;AACxB,YAAI,MAAM,aAAa,CAAC;AACxB,mBAAW,iBAAiB,EAAE,aAAa,EAAE,KAAK;AAAA,UAChD,OAAO,MAAM,OAAO;AAAA,UACpB,OAAO,MAAM,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,iBAAiB,EAAE,aAAa,EAAE,KAAK;AAAA,UAChD,OAAO,MAAM,OAAO;AAAA,UACpB,OAAO,MAAM,OAAO;AAAA,QACtB,CAAC;AAAA,MACH;AACA,sBAAgB;AAChB,kCAA4B;AAC5B,8BAAwB;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AACA,aAAW,QAAQ,SAAUA,OAAM;AACjC,IAAAA,MAAK,QAAQ,SAAU,MAAM;AAC3B,WAAK,KAAK,KAAK,CAAC,CAAC;AAAA,IACnB,CAAC;AAAA,EACH,CAAC;AACH;AAGA,IAAO,gBAAQ;","names":["poly"]}

package/node_modules/@turf/polygon-smooth/package.json

@@ -1,76 +0,0 @@
-{
-  "name": "@turf/polygon-smooth",
-  "version": "7.3.0",
-  "description": "Smooths a Polygon or MultiPolygon, based on Chaikin's algorithm.",
-  "author": "Turf Authors",
-  "contributors": [
-    "Rowan Winsemius <@rowanwins>"
-  ],
-  "license": "MIT",
-  "bugs": {
-    "url": "https://github.com/Turfjs/turf/issues"
-  },
-  "homepage": "https://github.com/Turfjs/turf",
-  "repository": {
-    "type": "git",
-    "url": "git://github.com/Turfjs/turf.git"
-  },
-  "funding": "https://opencollective.com/turf",
-  "publishConfig": {
-    "access": "public"
-  },
-  "keywords": [
-    "turf",
-    "geojson",
-    "polygon"
-  ],
-  "type": "module",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "./package.json": "./package.json",
-    ".": {
-      "import": {
-        "types": "./dist/esm/index.d.ts",
-        "default": "./dist/esm/index.js"
-      },
-      "require": {
-        "types": "./dist/cjs/index.d.cts",
-        "default": "./dist/cjs/index.cjs"
-      }
-    }
-  },
-  "sideEffects": false,
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "bench": "tsx bench.ts",
-    "build": "tsup --config ../../tsup.config.ts",
-    "docs": "tsx ../../scripts/generate-readmes.ts",
-    "test": "npm-run-all --npm-path npm test:*",
-    "test:tape": "tsx test.ts",
-    "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
-  },
-  "devDependencies": {
-    "@types/benchmark": "^2.1.5",
-    "@types/tape": "^5.8.1",
-    "benchmark": "^2.1.4",
-    "glob": "^11.0.2",
-    "load-json-file": "^7.0.1",
-    "npm-run-all": "^4.1.5",
-    "tape": "^5.9.0",
-    "tsup": "^8.4.0",
-    "tsx": "^4.19.4",
-    "typescript": "^5.8.3",
-    "write-json-file": "^6.0.0"
-  },
-  "dependencies": {
-    "@turf/helpers": "7.3.0",
-    "@turf/meta": "7.3.0",
-    "@types/geojson": "^7946.0.10",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
-}

package/node_modules/@turf/polygon-tangents/LICENSE

@@ -1,20 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2017 TurfJS
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software is furnished to do so,
-subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
-COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
-IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/node_modules/@turf/polygon-tangents/README.md

@@ -1,58 +0,0 @@
-# @turf/polygon-tangents
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## polygonTangents
-
-Finds the tangents of a [(Multi)Polygon][1] from a [Point][2].
-
-### Parameters
-
-*   `pt` **[Coord][3]** to calculate the tangent points from
-*   `polygon` **[Feature][4]<([Polygon][1] | [MultiPolygon][5])>** to get tangents from
-
-### Examples
-
-```javascript
-var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
-var point = turf.point([61, 5]);
-
-var tangents = turf.polygonTangents(point, polygon)
-
-//addToMap
-var addToMap = [tangents, point, polygon];
-```
-
-Returns **[FeatureCollection][6]<[Point][2]>** Feature Collection containing the two tangent points
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.1.6
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.1.2
-
-[3]: https://tools.ietf.org/html/rfc7946#section-3.1.1
-
-[4]: https://tools.ietf.org/html/rfc7946#section-3.2
-
-[5]: https://tools.ietf.org/html/rfc7946#section-3.1.7
-
-[6]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-<!-- This file is automatically generated. Please don't edit it directly. If you find an error, edit the source file of the module in question (likely index.js or index.ts), and re-run "yarn docs" from the root of the turf project. -->
-
----
-
-This module is part of the [Turfjs project](https://turfjs.org/), an open source module collection dedicated to geographic algorithms. It is maintained in the [Turfjs/turf](https://github.com/Turfjs/turf) repository, where you can create PRs and issues.
-
-### Installation
-
-Install this single module individually:
-
-```sh
-$ npm install @turf/polygon-tangents
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

package/node_modules/@turf/polygon-tangents/dist/cjs/index.cjs

@@ -1,108 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _invariant = require('@turf/invariant');
-var _helpers = require('@turf/helpers');
-var _bbox = require('@turf/bbox');
-var _explode = require('@turf/explode');
-var _nearestpoint = require('@turf/nearest-point');
-function polygonTangents(pt, polygon) {
-  const pointCoords = _invariant.getCoords.call(void 0, pt);
-  const polyCoords = _invariant.getCoords.call(void 0, polygon);
-  let rtan = [];
-  let ltan = [];
-  let eprev;
-  const bbox = _bbox.bbox.call(void 0, polygon);
-  let nearestPtIndex = 0;
-  let nearest = null;
-  if (pointCoords[0] > bbox[0] && pointCoords[0] < bbox[2] && pointCoords[1] > bbox[1] && pointCoords[1] < bbox[3]) {
-    nearest = _nearestpoint.nearestPoint.call(void 0, pt, _explode.explode.call(void 0, polygon));
-    nearestPtIndex = nearest.properties.featureIndex;
-  }
-  const type = _invariant.getType.call(void 0, polygon);
-  switch (type) {
-    case "Polygon":
-      rtan = polyCoords[0][nearestPtIndex];
-      ltan = polyCoords[0][0];
-      if (nearest !== null) {
-        if (nearest.geometry.coordinates[1] < pointCoords[1])
-          ltan = polyCoords[0][nearestPtIndex];
-      }
-      eprev = isLeft(
-        polyCoords[0][0],
-        polyCoords[0][polyCoords[0].length - 1],
-        pointCoords
-      );
-      [rtan, ltan] = processPolygon(
-        polyCoords[0],
-        pointCoords,
-        eprev,
-        rtan,
-        ltan
-      );
-      break;
-    case "MultiPolygon":
-      var closestFeature = 0;
-      var closestVertex = 0;
-      var verticesCounted = 0;
-      for (var i = 0; i < polyCoords[0].length; i++) {
-        closestFeature = i;
-        var verticeFound = false;
-        for (var i2 = 0; i2 < polyCoords[0][i].length; i2++) {
-          closestVertex = i2;
-          if (verticesCounted === nearestPtIndex) {
-            verticeFound = true;
-            break;
-          }
-          verticesCounted++;
-        }
-        if (verticeFound) break;
-      }
-      rtan = polyCoords[0][closestFeature][closestVertex];
-      ltan = polyCoords[0][closestFeature][closestVertex];
-      eprev = isLeft(
-        polyCoords[0][0][0],
-        polyCoords[0][0][polyCoords[0][0].length - 1],
-        pointCoords
-      );
-      polyCoords.forEach(function(ring) {
-        [rtan, ltan] = processPolygon(ring[0], pointCoords, eprev, rtan, ltan);
-      });
-      break;
-  }
-  return _helpers.featureCollection.call(void 0, [_helpers.point.call(void 0, rtan), _helpers.point.call(void 0, ltan)]);
-}
-function processPolygon(polygonCoords, ptCoords, eprev, rtan, ltan) {
-  for (let i = 0; i < polygonCoords.length; i++) {
-    const currentCoords = polygonCoords[i];
-    let nextCoordPair = polygonCoords[i + 1];
-    if (i === polygonCoords.length - 1) {
-      nextCoordPair = polygonCoords[0];
-    }
-    const enext = isLeft(currentCoords, nextCoordPair, ptCoords);
-    if (eprev <= 0 && enext > 0) {
-      if (!isBelow(ptCoords, currentCoords, rtan)) {
-        rtan = currentCoords;
-      }
-    } else if (eprev > 0 && enext <= 0) {
-      if (!isAbove(ptCoords, currentCoords, ltan)) {
-        ltan = currentCoords;
-      }
-    }
-    eprev = enext;
-  }
-  return [rtan, ltan];
-}
-function isAbove(point1, point2, point3) {
-  return isLeft(point1, point2, point3) > 0;
-}
-function isBelow(point1, point2, point3) {
-  return isLeft(point1, point2, point3) < 0;
-}
-function isLeft(point1, point2, point3) {
-  return (point2[0] - point1[0]) * (point3[1] - point1[1]) - (point3[0] - point1[0]) * (point2[1] - point1[1]);
-}
-var index_default = polygonTangents;
-
-
-
-exports.default = index_default; exports.polygonTangents = polygonTangents;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/polygon-tangents/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-polygon-tangents/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACSA,4CAAmC;AACnC,wCAAyC;AACzC,kCAAiC;AACjC,wCAAwB;AACxB,mDAA6B;AAkB7B,SAAS,eAAA,CACP,EAAA,EACA,OAAA,EAC0B;AAC1B,EAAA,MAAM,YAAA,EAAc,kCAAA,EAAY,CAAA;AAChC,EAAA,MAAM,WAAA,EAAa,kCAAA,OAAiB,CAAA;AAEpC,EAAA,IAAI,KAAA,EAAiB,CAAC,CAAA;AACtB,EAAA,IAAI,KAAA,EAAiB,CAAC,CAAA;AACtB,EAAA,IAAI,KAAA;AACJ,EAAA,MAAM,KAAA,EAAO,wBAAA,OAAgB,CAAA;AAC7B,EAAA,IAAI,eAAA,EAAiB,CAAA;AACrB,EAAA,IAAI,QAAA,EAAU,IAAA;AAId,EAAA,GAAA,CACE,WAAA,CAAY,CAAC,EAAA,EAAI,IAAA,CAAK,CAAC,EAAA,GACvB,WAAA,CAAY,CAAC,EAAA,EAAI,IAAA,CAAK,CAAC,EAAA,GACvB,WAAA,CAAY,CAAC,EAAA,EAAI,IAAA,CAAK,CAAC,EAAA,GACvB,WAAA,CAAY,CAAC,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,EACvB;AACA,IAAA,QAAA,EAAU,wCAAA,EAAa,EAAI,8BAAA,OAAe,CAAC,CAAA;AAC3C,IAAA,eAAA,EAAiB,OAAA,CAAQ,UAAA,CAAW,YAAA;AAAA,EACtC;AACA,EAAA,MAAM,KAAA,EAAO,gCAAA,OAAe,CAAA;AAC5B,EAAA,OAAA,CAAQ,IAAA,EAAM;AAAA,IACZ,KAAK,SAAA;AACH,MAAA,KAAA,EAAO,UAAA,CAAW,CAAC,CAAA,CAAE,cAAc,CAAA;AACnC,MAAA,KAAA,EAAO,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA;AACtB,MAAA,GAAA,CAAI,QAAA,IAAY,IAAA,EAAM;AACpB,QAAA,GAAA,CAAI,OAAA,CAAQ,QAAA,CAAS,WAAA,CAAY,CAAC,EAAA,EAAI,WAAA,CAAY,CAAC,CAAA;AACjD,UAAA,KAAA,EAAO,UAAA,CAAW,CAAC,CAAA,CAAE,cAAc,CAAA;AAAA,MACvC;AACA,MAAA,MAAA,EAAQ,MAAA;AAAA,QACN,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA;AAAA,QACf,UAAA,CAAW,CAAC,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA,CAAE,OAAA,EAAS,CAAC,CAAA;AAAA,QACtC;AAAA,MACF,CAAA;AACA,MAAA,CAAC,IAAA,EAAM,IAAI,EAAA,EAAI,cAAA;AAAA,QACb,UAAA,CAAW,CAAC,CAAA;AAAA,QACZ,WAAA;AAAA,QACA,KAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,MACF,CAAA;AACA,MAAA,KAAA;AAAA,IACF,KAAK,cAAA;AACH,MAAA,IAAI,eAAA,EAAiB,CAAA;AACrB,MAAA,IAAI,cAAA,EAAgB,CAAA;AACpB,MAAA,IAAI,gBAAA,EAAkB,CAAA;AACtB,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,UAAA,CAAW,CAAC,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC7C,QAAA,eAAA,EAAiB,CAAA;AACjB,QAAA,IAAI,aAAA,EAAe,KAAA;AACnB,QAAA,IAAA,CAAA,IAAS,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA,EAAQ,EAAA,EAAA,EAAM;AACnD,UAAA,cAAA,EAAgB,EAAA;AAChB,UAAA,GAAA,CAAI,gBAAA,IAAoB,cAAA,EAAgB;AACtC,YAAA,aAAA,EAAe,IAAA;AACf,YAAA,KAAA;AAAA,UACF;AACA,UAAA,eAAA,EAAA;AAAA,QACF;AACA,QAAA,GAAA,CAAI,YAAA,EAAc,KAAA;AAAA,MACpB;AACA,MAAA,KAAA,EAAO,UAAA,CAAW,CAAC,CAAA,CAAE,cAAc,CAAA,CAAE,aAAa,CAAA;AAClD,MAAA,KAAA,EAAO,UAAA,CAAW,CAAC,CAAA,CAAE,cAAc,CAAA,CAAE,aAAa,CAAA;AAClD,MAAA,MAAA,EAAQ,MAAA;AAAA,QACN,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA;AAAA,QAClB,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,OAAA,EAAS,CAAC,CAAA;AAAA,QAC5C;AAAA,MACF,CAAA;AACA,MAAA,UAAA,CAAW,OAAA,CAAQ,QAAA,CAAU,IAAA,EAAM;AACjC,QAAA,CAAC,IAAA,EAAM,IAAI,EAAA,EAAI,cAAA,CAAe,IAAA,CAAK,CAAC,CAAA,EAAG,WAAA,EAAa,KAAA,EAAO,IAAA,EAAM,IAAI,CAAA;AAAA,MACvE,CAAC,CAAA;AACD,MAAA,KAAA;AAAA,EACJ;AACA,EAAA,OAAO,wCAAA,CAAmB,4BAAA,IAAU,CAAA,EAAG,4BAAA,IAAU,CAAC,CAAC,CAAA;AACrD;AAEA,SAAS,cAAA,CACP,aAAA,EACA,QAAA,EACA,KAAA,EACA,IAAA,EACA,IAAA,EACA;AACA,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,aAAA,CAAc,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,cAAA,EAAgB,aAAA,CAAc,CAAC,CAAA;AACrC,IAAA,IAAI,cAAA,EAAgB,aAAA,CAAc,EAAA,EAAI,CAAC,CAAA;AACvC,IAAA,GAAA,CAAI,EAAA,IAAM,aAAA,CAAc,OAAA,EAAS,CAAA,EAAG;AAClC,MAAA,cAAA,EAAgB,aAAA,CAAc,CAAC,CAAA;AAAA,IACjC;AACA,IAAA,MAAM,MAAA,EAAQ,MAAA,CAAO,aAAA,EAAe,aAAA,EAAe,QAAQ,CAAA;AAC3D,IAAA,GAAA,CAAI,MAAA,GAAS,EAAA,GAAK,MAAA,EAAQ,CAAA,EAAG;AAC3B,MAAA,GAAA,CAAI,CAAC,OAAA,CAAQ,QAAA,EAAU,aAAA,EAAe,IAAI,CAAA,EAAG;AAC3C,QAAA,KAAA,EAAO,aAAA;AAAA,MACT;AAAA,IACF,EAAA,KAAA,GAAA,CAAW,MAAA,EAAQ,EAAA,GAAK,MAAA,GAAS,CAAA,EAAG;AAClC,MAAA,GAAA,CAAI,CAAC,OAAA,CAAQ,QAAA,EAAU,aAAA,EAAe,IAAI,CAAA,EAAG;AAC3C,QAAA,KAAA,EAAO,aAAA;AAAA,MACT;AAAA,IACF;AACA,IAAA,MAAA,EAAQ,KAAA;AAAA,EACV;AACA,EAAA,OAAO,CAAC,IAAA,EAAM,IAAI,CAAA;AACpB;AAEA,SAAS,OAAA,CAAQ,MAAA,EAAkB,MAAA,EAAkB,MAAA,EAAkB;AACrE,EAAA,OAAO,MAAA,CAAO,MAAA,EAAQ,MAAA,EAAQ,MAAM,EAAA,EAAI,CAAA;AAC1C;AAEA,SAAS,OAAA,CAAQ,MAAA,EAAkB,MAAA,EAAkB,MAAA,EAAkB;AACrE,EAAA,OAAO,MAAA,CAAO,MAAA,EAAQ,MAAA,EAAQ,MAAM,EAAA,EAAI,CAAA;AAC1C;AAEA,SAAS,MAAA,CAAO,MAAA,EAAkB,MAAA,EAAkB,MAAA,EAAkB;AACpE,EAAA,OAAA,CACG,MAAA,CAAO,CAAC,EAAA,EAAI,MAAA,CAAO,CAAC,CAAA,EAAA,EAAA,CAAM,MAAA,CAAO,CAAC,EAAA,EAAI,MAAA,CAAO,CAAC,CAAA,EAAA,EAAA,CAC9C,MAAA,CAAO,CAAC,EAAA,EAAI,MAAA,CAAO,CAAC,CAAA,EAAA,EAAA,CAAM,MAAA,CAAO,CAAC,EAAA,EAAI,MAAA,CAAO,CAAC,CAAA,CAAA;AAEnD;AAGA,IAAO,cAAA,EAAQ,eAAA;ADnDf;AACE;AACA;AACF,2EAAC","file":"/home/runner/work/turf/turf/packages/turf-polygon-tangents/dist/cjs/index.cjs","sourcesContent":[null,"import type {\n  Feature,\n  FeatureCollection,\n  Point,\n  Polygon,\n  Position,\n  MultiPolygon,\n} from \"geojson\";\nimport type { Coord } from \"@turf/helpers\";\nimport { getCoords, getType } from \"@turf/invariant\";\nimport { point, featureCollection } from \"@turf/helpers\";\nimport { bbox as calcBbox } from \"@turf/bbox\";\nimport { explode } from \"@turf/explode\";\nimport { nearestPoint } from \"@turf/nearest-point\";\n\n/**\n * Finds the tangents of a {@link Polygon|(Multi)Polygon} from a {@link Point}.\n *\n * @function\n * @param {Coord} pt to calculate the tangent points from\n * @param {Feature<Polygon|MultiPolygon>} polygon to get tangents from\n * @returns {FeatureCollection<Point>} Feature Collection containing the two tangent points\n * @example\n * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n * var point = turf.point([61, 5]);\n *\n * var tangents = turf.polygonTangents(point, polygon)\n *\n * //addToMap\n * var addToMap = [tangents, point, polygon];\n */\nfunction polygonTangents<T extends Polygon | MultiPolygon>(\n  pt: Coord,\n  polygon: Feature<T> | T\n): FeatureCollection<Point> {\n  const pointCoords = getCoords(pt);\n  const polyCoords = getCoords(polygon);\n\n  let rtan: Position = [];\n  let ltan: Position = [];\n  let eprev: number;\n  const bbox = calcBbox(polygon);\n  let nearestPtIndex = 0;\n  let nearest = null;\n\n  // If the point lies inside the polygon bbox then we need to be a bit trickier\n  // otherwise points lying inside reflex angles on concave polys can have issues\n  if (\n    pointCoords[0] > bbox[0] &&\n    pointCoords[0] < bbox[2] &&\n    pointCoords[1] > bbox[1] &&\n    pointCoords[1] < bbox[3]\n  ) {\n    nearest = nearestPoint(pt, explode(polygon));\n    nearestPtIndex = nearest.properties.featureIndex;\n  }\n  const type = getType(polygon);\n  switch (type) {\n    case \"Polygon\":\n      rtan = polyCoords[0][nearestPtIndex];\n      ltan = polyCoords[0][0];\n      if (nearest !== null) {\n        if (nearest.geometry.coordinates[1] < pointCoords[1])\n          ltan = polyCoords[0][nearestPtIndex];\n      }\n      eprev = isLeft(\n        polyCoords[0][0],\n        polyCoords[0][polyCoords[0].length - 1],\n        pointCoords\n      );\n      [rtan, ltan] = processPolygon(\n        polyCoords[0],\n        pointCoords,\n        eprev,\n        rtan,\n        ltan\n      );\n      break;\n    case \"MultiPolygon\":\n      var closestFeature = 0;\n      var closestVertex = 0;\n      var verticesCounted = 0;\n      for (var i = 0; i < polyCoords[0].length; i++) {\n        closestFeature = i;\n        var verticeFound = false;\n        for (var i2 = 0; i2 < polyCoords[0][i].length; i2++) {\n          closestVertex = i2;\n          if (verticesCounted === nearestPtIndex) {\n            verticeFound = true;\n            break;\n          }\n          verticesCounted++;\n        }\n        if (verticeFound) break;\n      }\n      rtan = polyCoords[0][closestFeature][closestVertex];\n      ltan = polyCoords[0][closestFeature][closestVertex];\n      eprev = isLeft(\n        polyCoords[0][0][0],\n        polyCoords[0][0][polyCoords[0][0].length - 1],\n        pointCoords\n      );\n      polyCoords.forEach(function (ring) {\n        [rtan, ltan] = processPolygon(ring[0], pointCoords, eprev, rtan, ltan);\n      });\n      break;\n  }\n  return featureCollection([point(rtan), point(ltan)]);\n}\n\nfunction processPolygon(\n  polygonCoords: Position[],\n  ptCoords: Position,\n  eprev: number,\n  rtan: Position,\n  ltan: Position\n) {\n  for (let i = 0; i < polygonCoords.length; i++) {\n    const currentCoords = polygonCoords[i];\n    let nextCoordPair = polygonCoords[i + 1];\n    if (i === polygonCoords.length - 1) {\n      nextCoordPair = polygonCoords[0];\n    }\n    const enext = isLeft(currentCoords, nextCoordPair, ptCoords);\n    if (eprev <= 0 && enext > 0) {\n      if (!isBelow(ptCoords, currentCoords, rtan)) {\n        rtan = currentCoords;\n      }\n    } else if (eprev > 0 && enext <= 0) {\n      if (!isAbove(ptCoords, currentCoords, ltan)) {\n        ltan = currentCoords;\n      }\n    }\n    eprev = enext;\n  }\n  return [rtan, ltan];\n}\n\nfunction isAbove(point1: Position, point2: Position, point3: Position) {\n  return isLeft(point1, point2, point3) > 0;\n}\n\nfunction isBelow(point1: Position, point2: Position, point3: Position) {\n  return isLeft(point1, point2, point3) < 0;\n}\n\nfunction isLeft(point1: Position, point2: Position, point3: Position) {\n  return (\n    (point2[0] - point1[0]) * (point3[1] - point1[1]) -\n    (point3[0] - point1[0]) * (point2[1] - point1[1])\n  );\n}\n\nexport { polygonTangents };\nexport default polygonTangents;\n"]}

package/node_modules/@turf/polygon-tangents/dist/cjs/index.d.cts

@@ -1,22 +0,0 @@
-import { Polygon, MultiPolygon, Feature, FeatureCollection, Point } from 'geojson';
-import { Coord } from '@turf/helpers';
-
-/**
- * Finds the tangents of a {@link Polygon|(Multi)Polygon} from a {@link Point}.
- *
- * @function
- * @param {Coord} pt to calculate the tangent points from
- * @param {Feature<Polygon|MultiPolygon>} polygon to get tangents from
- * @returns {FeatureCollection<Point>} Feature Collection containing the two tangent points
- * @example
- * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- * var point = turf.point([61, 5]);
- *
- * var tangents = turf.polygonTangents(point, polygon)
- *
- * //addToMap
- * var addToMap = [tangents, point, polygon];
- */
-declare function polygonTangents<T extends Polygon | MultiPolygon>(pt: Coord, polygon: Feature<T> | T): FeatureCollection<Point>;
-
-export { polygonTangents as default, polygonTangents };

package/node_modules/@turf/polygon-tangents/dist/esm/index.d.ts

@@ -1,22 +0,0 @@
-import { Polygon, MultiPolygon, Feature, FeatureCollection, Point } from 'geojson';
-import { Coord } from '@turf/helpers';
-
-/**
- * Finds the tangents of a {@link Polygon|(Multi)Polygon} from a {@link Point}.
- *
- * @function
- * @param {Coord} pt to calculate the tangent points from
- * @param {Feature<Polygon|MultiPolygon>} polygon to get tangents from
- * @returns {FeatureCollection<Point>} Feature Collection containing the two tangent points
- * @example
- * var polygon = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- * var point = turf.point([61, 5]);
- *
- * var tangents = turf.polygonTangents(point, polygon)
- *
- * //addToMap
- * var addToMap = [tangents, point, polygon];
- */
-declare function polygonTangents<T extends Polygon | MultiPolygon>(pt: Coord, polygon: Feature<T> | T): FeatureCollection<Point>;
-
-export { polygonTangents as default, polygonTangents };