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

package/node_modules/@turf/standard-deviational-ellipse/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@turf/standard-deviational-ellipse",
-  "version": "7.2.0",
-  "description": "turf standard-deviational-ellipse module",
+  "version": "7.3.0",
+  "description": "Takes a collection of features and returns a standard deviational ellipse.",
   "author": "Turf Authors",
   "contributors": [
     "Moacir P. de Sá Pereira <@muziejus>"
@@ -55,28 +55,28 @@
     "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
   },
   "devDependencies": {
-    "@turf/random": "^7.2.0",
-    "@turf/truncate": "^7.2.0",
+    "@turf/random": "7.3.0",
+    "@turf/truncate": "7.3.0",
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
+    "@types/tape": "^5.8.1",
     "benchmark": "^2.1.4",
     "load-json-file": "^7.0.1",
     "npm-run-all": "^4.1.5",
     "tape": "^5.9.0",
-    "tsup": "^8.3.5",
-    "tsx": "^4.19.2",
-    "typescript": "^5.5.4",
-    "write-json-file": "^5.0.0"
+    "tsup": "^8.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3",
+    "write-json-file": "^6.0.0"
   },
   "dependencies": {
-    "@turf/center-mean": "^7.2.0",
-    "@turf/ellipse": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/invariant": "^7.2.0",
-    "@turf/meta": "^7.2.0",
-    "@turf/points-within-polygon": "^7.2.0",
+    "@turf/center-mean": "7.3.0",
+    "@turf/ellipse": "7.3.0",
+    "@turf/helpers": "7.3.0",
+    "@turf/invariant": "7.3.0",
+    "@turf/meta": "7.3.0",
+    "@turf/points-within-polygon": "7.3.0",
     "@types/geojson": "^7946.0.10",
     "tslib": "^2.8.1"
   },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
+  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
 }

package/node_modules/@turf/tag/dist/cjs/index.cjs

@@ -18,9 +18,9 @@ function tag(points, polygons, field, outField) {
   });
   return points;
 }
-var turf_tag_default = tag;
+var index_default = tag;
 
 
 
-exports.default = turf_tag_default; exports.tag = tag;
+exports.default = index_default; exports.tag = tag;
 //# sourceMappingURL=index.cjs.map

package/node_modules/@turf/tag/dist/cjs/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tag/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,uEAAsC;AACtC,oCAAsB;AACtB,kCAA4B;AAqC5B,SAAS,GAAA,CACP,MAAA,EACA,QAAA,EACA,KAAA,EACA,QAAA,EAC0B;AAE1B,EAAA,OAAA,EAAS,0BAAA,MAAY,CAAA;AACrB,EAAA,SAAA,EAAW,0BAAA,QAAc,CAAA;AACzB,EAAA,+BAAA,MAAY,EAAQ,QAAA,CAAU,EAAA,EAAI;AAChC,IAAA,GAAA,CAAI,CAAC,EAAA,CAAG,UAAA,EAAY,EAAA,CAAG,WAAA,EAAa,CAAC,CAAA;AACrC,IAAA,+BAAA,QAAY,EAAU,QAAA,CAAU,IAAA,EAAM;AACpC,MAAA,GAAA,CAAI,EAAA,CAAG,WAAA,GAAc,IAAA,CAAK,UAAA,EAAY;AACpC,QAAA,GAAA,CAAI,EAAA,CAAG,UAAA,CAAW,QAAQ,EAAA,IAAM,KAAA,CAAA,EAAW;AACzC,UAAA,GAAA,CAAI,0DAAA,EAAsB,EAAI,IAAI,CAAA;AAChC,YAAA,EAAA,CAAG,UAAA,CAAW,QAAQ,EAAA,EAAI,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA;AAAA,QACnD;AAAA,MACF;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,iBAAA,EAAQ,GAAA;AD3Cf;AACE;AACA;AACF,sDAAC","file":"/home/runner/work/turf/turf/packages/turf-tag/dist/cjs/index.cjs","sourcesContent":[null,"import { Point, FeatureCollection, Polygon, MultiPolygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { clone } from \"@turf/clone\";\nimport { featureEach } from \"@turf/meta\";\n\n/**\n * Takes a set of {@link Point|points} and a set of {@link Polygon|polygons} and/or {@link MultiPolygon|multipolygons} and performs a spatial join.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {FeatureCollection<Polygon|MultiPolygon>} polygons input (multi)polygons\n * @param {string} field property in `polygons` to add to joined {<Point>} features\n * @param {string} outField property in `points` in which to store joined property from `polygons`\n * @returns {FeatureCollection<Point>} points with `containingPolyId` property containing values from `polyId`\n * @example\n * var pt1 = turf.point([-77, 44]);\n * var pt2 = turf.point([-77, 38]);\n * var poly1 = turf.polygon([[\n *   [-81, 41],\n *   [-81, 47],\n *   [-72, 47],\n *   [-72, 41],\n *   [-81, 41]\n * ]], {pop: 3000});\n * var poly2 = turf.polygon([[\n *   [-81, 35],\n *   [-81, 41],\n *   [-72, 41],\n *   [-72, 35],\n *   [-81, 35]\n * ]], {pop: 1000});\n *\n * var points = turf.featureCollection([pt1, pt2]);\n * var polygons = turf.featureCollection([poly1, poly2]);\n *\n * var tagged = turf.tag(points, polygons, 'pop', 'population');\n *\n * //addToMap\n * var addToMap = [tagged, polygons]\n */\nfunction tag(\n  points: FeatureCollection<Point>,\n  polygons: FeatureCollection<Polygon | MultiPolygon>,\n  field: string,\n  outField: string\n): FeatureCollection<Point> {\n  // prevent mutations\n  points = clone(points);\n  polygons = clone(polygons);\n  featureEach(points, function (pt) {\n    if (!pt.properties) pt.properties = {};\n    featureEach(polygons, function (poly) {\n      if (pt.properties && poly.properties) {\n        if (pt.properties[outField] === undefined) {\n          if (booleanPointInPolygon(pt, poly))\n            pt.properties[outField] = poly.properties[field];\n        }\n      }\n    });\n  });\n  return points;\n}\n\nexport { tag };\nexport default tag;\n"]}
+{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tag/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,uEAAsC;AACtC,oCAAsB;AACtB,kCAA4B;AAqC5B,SAAS,GAAA,CACP,MAAA,EACA,QAAA,EACA,KAAA,EACA,QAAA,EAC0B;AAE1B,EAAA,OAAA,EAAS,0BAAA,MAAY,CAAA;AACrB,EAAA,SAAA,EAAW,0BAAA,QAAc,CAAA;AACzB,EAAA,+BAAA,MAAY,EAAQ,QAAA,CAAU,EAAA,EAAI;AAChC,IAAA,GAAA,CAAI,CAAC,EAAA,CAAG,UAAA,EAAY,EAAA,CAAG,WAAA,EAAa,CAAC,CAAA;AACrC,IAAA,+BAAA,QAAY,EAAU,QAAA,CAAU,IAAA,EAAM;AACpC,MAAA,GAAA,CAAI,EAAA,CAAG,WAAA,GAAc,IAAA,CAAK,UAAA,EAAY;AACpC,QAAA,GAAA,CAAI,EAAA,CAAG,UAAA,CAAW,QAAQ,EAAA,IAAM,KAAA,CAAA,EAAW;AACzC,UAAA,GAAA,CAAI,0DAAA,EAAsB,EAAI,IAAI,CAAA;AAChC,YAAA,EAAA,CAAG,UAAA,CAAW,QAAQ,EAAA,EAAI,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA;AAAA,QACnD;AAAA,MACF;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,cAAA,EAAQ,GAAA;AD3Cf;AACE;AACA;AACF,mDAAC","file":"/home/runner/work/turf/turf/packages/turf-tag/dist/cjs/index.cjs","sourcesContent":[null,"import { Point, FeatureCollection, Polygon, MultiPolygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { clone } from \"@turf/clone\";\nimport { featureEach } from \"@turf/meta\";\n\n/**\n * Takes a set of {@link Point|points} and a set of {@link Polygon|polygons} and/or {@link MultiPolygon|multipolygons} and performs a spatial join.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {FeatureCollection<Polygon|MultiPolygon>} polygons input (multi)polygons\n * @param {string} field property in `polygons` to add to joined {<Point>} features\n * @param {string} outField property in `points` in which to store joined property from `polygons`\n * @returns {FeatureCollection<Point>} points with `containingPolyId` property containing values from `polyId`\n * @example\n * var pt1 = turf.point([-77, 44]);\n * var pt2 = turf.point([-77, 38]);\n * var poly1 = turf.polygon([[\n *   [-81, 41],\n *   [-81, 47],\n *   [-72, 47],\n *   [-72, 41],\n *   [-81, 41]\n * ]], {pop: 3000});\n * var poly2 = turf.polygon([[\n *   [-81, 35],\n *   [-81, 41],\n *   [-72, 41],\n *   [-72, 35],\n *   [-81, 35]\n * ]], {pop: 1000});\n *\n * var points = turf.featureCollection([pt1, pt2]);\n * var polygons = turf.featureCollection([poly1, poly2]);\n *\n * var tagged = turf.tag(points, polygons, 'pop', 'population');\n *\n * //addToMap\n * var addToMap = [tagged, polygons]\n */\nfunction tag(\n  points: FeatureCollection<Point>,\n  polygons: FeatureCollection<Polygon | MultiPolygon>,\n  field: string,\n  outField: string\n): FeatureCollection<Point> {\n  // prevent mutations\n  points = clone(points);\n  polygons = clone(polygons);\n  featureEach(points, function (pt) {\n    if (!pt.properties) pt.properties = {};\n    featureEach(polygons, function (poly) {\n      if (pt.properties && poly.properties) {\n        if (pt.properties[outField] === undefined) {\n          if (booleanPointInPolygon(pt, poly))\n            pt.properties[outField] = poly.properties[field];\n        }\n      }\n    });\n  });\n  return points;\n}\n\nexport { tag };\nexport default tag;\n"]}

package/node_modules/@turf/tag/dist/esm/index.js

@@ -18,9 +18,9 @@ function tag(points, polygons, field, outField) {
   });
   return points;
 }
-var turf_tag_default = tag;
+var index_default = tag;
 export {
-  turf_tag_default as default,
+  index_default as default,
   tag
 };
 //# sourceMappingURL=index.js.map

package/node_modules/@turf/tag/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { Point, FeatureCollection, Polygon, MultiPolygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { clone } from \"@turf/clone\";\nimport { featureEach } from \"@turf/meta\";\n\n/**\n * Takes a set of {@link Point|points} and a set of {@link Polygon|polygons} and/or {@link MultiPolygon|multipolygons} and performs a spatial join.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {FeatureCollection<Polygon|MultiPolygon>} polygons input (multi)polygons\n * @param {string} field property in `polygons` to add to joined {<Point>} features\n * @param {string} outField property in `points` in which to store joined property from `polygons`\n * @returns {FeatureCollection<Point>} points with `containingPolyId` property containing values from `polyId`\n * @example\n * var pt1 = turf.point([-77, 44]);\n * var pt2 = turf.point([-77, 38]);\n * var poly1 = turf.polygon([[\n *   [-81, 41],\n *   [-81, 47],\n *   [-72, 47],\n *   [-72, 41],\n *   [-81, 41]\n * ]], {pop: 3000});\n * var poly2 = turf.polygon([[\n *   [-81, 35],\n *   [-81, 41],\n *   [-72, 41],\n *   [-72, 35],\n *   [-81, 35]\n * ]], {pop: 1000});\n *\n * var points = turf.featureCollection([pt1, pt2]);\n * var polygons = turf.featureCollection([poly1, poly2]);\n *\n * var tagged = turf.tag(points, polygons, 'pop', 'population');\n *\n * //addToMap\n * var addToMap = [tagged, polygons]\n */\nfunction tag(\n  points: FeatureCollection<Point>,\n  polygons: FeatureCollection<Polygon | MultiPolygon>,\n  field: string,\n  outField: string\n): FeatureCollection<Point> {\n  // prevent mutations\n  points = clone(points);\n  polygons = clone(polygons);\n  featureEach(points, function (pt) {\n    if (!pt.properties) pt.properties = {};\n    featureEach(polygons, function (poly) {\n      if (pt.properties && poly.properties) {\n        if (pt.properties[outField] === undefined) {\n          if (booleanPointInPolygon(pt, poly))\n            pt.properties[outField] = poly.properties[field];\n        }\n      }\n    });\n  });\n  return points;\n}\n\nexport { tag };\nexport default tag;\n"],"mappings":";AACA,SAAS,6BAA6B;AACtC,SAAS,aAAa;AACtB,SAAS,mBAAmB;AAqC5B,SAAS,IACP,QACA,UACA,OACA,UAC0B;AAE1B,WAAS,MAAM,MAAM;AACrB,aAAW,MAAM,QAAQ;AACzB,cAAY,QAAQ,SAAU,IAAI;AAChC,QAAI,CAAC,GAAG,WAAY,IAAG,aAAa,CAAC;AACrC,gBAAY,UAAU,SAAU,MAAM;AACpC,UAAI,GAAG,cAAc,KAAK,YAAY;AACpC,YAAI,GAAG,WAAW,QAAQ,MAAM,QAAW;AACzC,cAAI,sBAAsB,IAAI,IAAI;AAChC,eAAG,WAAW,QAAQ,IAAI,KAAK,WAAW,KAAK;AAAA,QACnD;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAGA,IAAO,mBAAQ;","names":[]}
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { Point, FeatureCollection, Polygon, MultiPolygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { clone } from \"@turf/clone\";\nimport { featureEach } from \"@turf/meta\";\n\n/**\n * Takes a set of {@link Point|points} and a set of {@link Polygon|polygons} and/or {@link MultiPolygon|multipolygons} and performs a spatial join.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {FeatureCollection<Polygon|MultiPolygon>} polygons input (multi)polygons\n * @param {string} field property in `polygons` to add to joined {<Point>} features\n * @param {string} outField property in `points` in which to store joined property from `polygons`\n * @returns {FeatureCollection<Point>} points with `containingPolyId` property containing values from `polyId`\n * @example\n * var pt1 = turf.point([-77, 44]);\n * var pt2 = turf.point([-77, 38]);\n * var poly1 = turf.polygon([[\n *   [-81, 41],\n *   [-81, 47],\n *   [-72, 47],\n *   [-72, 41],\n *   [-81, 41]\n * ]], {pop: 3000});\n * var poly2 = turf.polygon([[\n *   [-81, 35],\n *   [-81, 41],\n *   [-72, 41],\n *   [-72, 35],\n *   [-81, 35]\n * ]], {pop: 1000});\n *\n * var points = turf.featureCollection([pt1, pt2]);\n * var polygons = turf.featureCollection([poly1, poly2]);\n *\n * var tagged = turf.tag(points, polygons, 'pop', 'population');\n *\n * //addToMap\n * var addToMap = [tagged, polygons]\n */\nfunction tag(\n  points: FeatureCollection<Point>,\n  polygons: FeatureCollection<Polygon | MultiPolygon>,\n  field: string,\n  outField: string\n): FeatureCollection<Point> {\n  // prevent mutations\n  points = clone(points);\n  polygons = clone(polygons);\n  featureEach(points, function (pt) {\n    if (!pt.properties) pt.properties = {};\n    featureEach(polygons, function (poly) {\n      if (pt.properties && poly.properties) {\n        if (pt.properties[outField] === undefined) {\n          if (booleanPointInPolygon(pt, poly))\n            pt.properties[outField] = poly.properties[field];\n        }\n      }\n    });\n  });\n  return points;\n}\n\nexport { tag };\nexport default tag;\n"],"mappings":";AACA,SAAS,6BAA6B;AACtC,SAAS,aAAa;AACtB,SAAS,mBAAmB;AAqC5B,SAAS,IACP,QACA,UACA,OACA,UAC0B;AAE1B,WAAS,MAAM,MAAM;AACrB,aAAW,MAAM,QAAQ;AACzB,cAAY,QAAQ,SAAU,IAAI;AAChC,QAAI,CAAC,GAAG,WAAY,IAAG,aAAa,CAAC;AACrC,gBAAY,UAAU,SAAU,MAAM;AACpC,UAAI,GAAG,cAAc,KAAK,YAAY;AACpC,YAAI,GAAG,WAAW,QAAQ,MAAM,QAAW;AACzC,cAAI,sBAAsB,IAAI,IAAI;AAChC,eAAG,WAAW,QAAQ,IAAI,KAAK,WAAW,KAAK;AAAA,QACnD;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/tag/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@turf/tag",
-  "version": "7.2.0",
-  "description": "turf tag module",
+  "version": "7.3.0",
+  "description": "Takes a set of points and a set of polygons and/or multipolygons and performs a spatial join.",
   "author": "Turf Authors",
   "license": "MIT",
   "bugs": {
@@ -56,22 +56,22 @@
   },
   "devDependencies": {
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
+    "@types/tape": "^5.8.1",
     "benchmark": "^2.1.4",
     "load-json-file": "^7.0.1",
     "npm-run-all": "^4.1.5",
     "tape": "^5.9.0",
-    "tsup": "^8.3.5",
-    "tsx": "^4.19.2",
-    "typescript": "^5.5.4"
+    "tsup": "^8.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3"
   },
   "dependencies": {
-    "@turf/boolean-point-in-polygon": "^7.2.0",
-    "@turf/clone": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/meta": "^7.2.0",
+    "@turf/boolean-point-in-polygon": "7.3.0",
+    "@turf/clone": "7.3.0",
+    "@turf/helpers": "7.3.0",
+    "@turf/meta": "7.3.0",
     "@types/geojson": "^7946.0.10",
     "tslib": "^2.8.1"
   },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
+  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
 }

package/node_modules/@turf/tesselate/dist/cjs/index.cjs

@@ -53,9 +53,9 @@ function flattenCoords(data) {
   }
   return result;
 }
-var turf_tesselate_default = tesselate;
+var index_default = tesselate;
 
 
 
-exports.default = turf_tesselate_default; exports.tesselate = tesselate;
+exports.default = index_default; exports.tesselate = tesselate;
 //# sourceMappingURL=index.cjs.map

package/node_modules/@turf/tesselate/dist/cjs/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tesselate/dist/cjs/index.cjs","../../index.ts"],"names":["i"],"mappings":"AAAA;ACOA,gFAAmB;AACnB,wCAAwB;AAgBxB,SAAS,SAAA,CACP,IAAA,EAC4B;AAC5B,EAAA,GAAA,CACE,CAAC,IAAA,CAAK,SAAA,GACL,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,cAAA,EAC5D;AACA,IAAA,MAAM,IAAI,KAAA,CAAM,yCAAyC,CAAA;AAAA,EAC3D;AAEA,EAAA,MAAM,GAAA,EAAiC;AAAA,IACrC,IAAA,EAAM,mBAAA;AAAA,IACN,QAAA,EAAU,CAAC;AAAA,EACb,CAAA;AAEA,EAAA,GAAA,CAAI,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,SAAA,EAAW;AACpC,IAAA,EAAA,CAAG,SAAA,EAAW,cAAA,CAAe,IAAA,CAAK,QAAA,CAAS,WAAW,CAAA;AAAA,EACxD,EAAA,KAAO;AACL,IAAA,IAAA,CAAK,QAAA,CAAS,WAAA,CAAY,OAAA,CAAQ,QAAA,CAAU,WAAA,EAAa;AACvD,MAAA,EAAA,CAAG,SAAA,EAAW,EAAA,CAAG,QAAA,CAAS,MAAA,CAAO,cAAA,CAAe,WAAW,CAAC,CAAA;AAAA,IAC9D,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,EAAA;AACT;AAEA,SAAS,cAAA,CAAe,WAAA,EAA2B;AACjD,EAAA,MAAM,KAAA,EAAO,aAAA,CAAc,WAAW,CAAA;AACtC,EAAA,MAAM,IAAA,EAAM,CAAA;AACZ,EAAA,MAAM,OAAA,EAAS,8BAAA,IAAO,CAAK,QAAA,EAAU,IAAA,CAAK,KAAA,EAAO,GAAG,CAAA;AAEpD,EAAA,MAAM,SAAA,EAA+B,CAAC,CAAA;AACtC,EAAA,MAAM,SAAA,EAAuB,CAAC,CAAA;AAE9B,EAAA,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAU,IAAA,EAAWA,EAAAA,EAAW;AAC7C,IAAA,MAAM,MAAA,EAAQ,MAAA,CAAOA,EAAC,CAAA;AACtB,IAAA,QAAA,CAAS,IAAA,CAAK,CAAC,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,GAAG,CAAA,EAAG,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5E,CAAC,CAAA;AAED,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AAC3C,IAAA,MAAM,OAAA,EAAS,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AACtC,IAAA,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,CAAC,CAAC,CAAA;AACvB,IAAA,QAAA,CAAS,IAAA,CAAK,8BAAA,CAAS,MAAM,CAAC,CAAC,CAAA;AAAA,EACjC;AAEA,EAAA,OAAO,QAAA;AACT;AAEA,SAAS,aAAA,CAAc,IAAA,EAAoB;AACzC,EAAA,MAAM,IAAA,EAAc,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA,EAC7B,OAAA,EAAsE;AAAA,IACpE,QAAA,EAAU,CAAC,CAAA;AAAA,IACX,KAAA,EAAO,CAAC,CAAA;AAAA,IACR,UAAA,EAAY;AAAA,EACd,CAAA;AACF,EAAA,IAAI,UAAA,EAAY,CAAA;AAEhB,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA,EAAK;AACvC,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,CAAA,EAAA,EAAK,MAAA,CAAO,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAC,CAAA;AAAA,IAClE;AACA,IAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACT,MAAA,UAAA,GAAa,IAAA,CAAK,EAAA,EAAI,CAAC,CAAA,CAAE,MAAA;AACzB,MAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AAAA,IAC7B;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,uBAAA,EAAQ,SAAA;ADvCf;AACE;AACA;AACF,wEAAC","file":"/home/runner/work/turf/turf/packages/turf-tesselate/dist/cjs/index.cjs","sourcesContent":[null,"import {\n  Feature,\n  FeatureCollection,\n  MultiPolygon,\n  Polygon,\n  Position,\n} from \"geojson\";\nimport earcut from \"earcut\";\nimport { polygon } from \"@turf/helpers\";\n\n/**\n * Tesselates a polygon or multipolygon into a collection of triangle polygons\n * using [earcut](https://github.com/mapbox/earcut).\n *\n * @function\n * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate\n * @returns {FeatureCollection<Polygon>} collection of polygon tesselations\n * @example\n * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n * const triangles = turf.tesselate(poly);\n *\n * //addToMap\n * const addToMap = [poly, triangles]\n */\nfunction tesselate(\n  poly: Feature<Polygon | MultiPolygon>\n): FeatureCollection<Polygon> {\n  if (\n    !poly.geometry ||\n    (poly.geometry.type !== \"Polygon\" && poly.geometry.type !== \"MultiPolygon\")\n  ) {\n    throw new Error(\"input must be a Polygon or MultiPolygon\");\n  }\n\n  const fc: FeatureCollection<Polygon> = {\n    type: \"FeatureCollection\",\n    features: [],\n  };\n\n  if (poly.geometry.type === \"Polygon\") {\n    fc.features = processPolygon(poly.geometry.coordinates);\n  } else {\n    poly.geometry.coordinates.forEach(function (coordinates) {\n      fc.features = fc.features.concat(processPolygon(coordinates));\n    });\n  }\n\n  return fc;\n}\n\nfunction processPolygon(coordinates: Position[][]) {\n  const data = flattenCoords(coordinates);\n  const dim = 2;\n  const result = earcut(data.vertices, data.holes, dim);\n\n  const features: Feature<Polygon>[] = [];\n  const vertices: Position[] = [];\n\n  result.forEach(function (vert: any, i: number) {\n    const index = result[i];\n    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);\n  });\n\n  for (var i = 0; i < vertices.length; i += 3) {\n    const coords = vertices.slice(i, i + 3);\n    coords.push(vertices[i]);\n    features.push(polygon([coords]));\n  }\n\n  return features;\n}\n\nfunction flattenCoords(data: Position[][]) {\n  const dim: number = data[0][0].length,\n    result: { vertices: number[]; holes: number[]; dimensions: number } = {\n      vertices: [],\n      holes: [],\n      dimensions: dim,\n    };\n  let holeIndex = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    for (let j = 0; j < data[i].length; j++) {\n      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);\n    }\n    if (i > 0) {\n      holeIndex += data[i - 1].length;\n      result.holes.push(holeIndex);\n    }\n  }\n\n  return result;\n}\n\nexport { tesselate };\nexport default tesselate;\n"]}
+{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tesselate/dist/cjs/index.cjs","../../index.ts"],"names":["i"],"mappings":"AAAA;ACOA,gFAAmB;AACnB,wCAAwB;AAgBxB,SAAS,SAAA,CACP,IAAA,EAC4B;AAC5B,EAAA,GAAA,CACE,CAAC,IAAA,CAAK,SAAA,GACL,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,cAAA,EAC5D;AACA,IAAA,MAAM,IAAI,KAAA,CAAM,yCAAyC,CAAA;AAAA,EAC3D;AAEA,EAAA,MAAM,GAAA,EAAiC;AAAA,IACrC,IAAA,EAAM,mBAAA;AAAA,IACN,QAAA,EAAU,CAAC;AAAA,EACb,CAAA;AAEA,EAAA,GAAA,CAAI,IAAA,CAAK,QAAA,CAAS,KAAA,IAAS,SAAA,EAAW;AACpC,IAAA,EAAA,CAAG,SAAA,EAAW,cAAA,CAAe,IAAA,CAAK,QAAA,CAAS,WAAW,CAAA;AAAA,EACxD,EAAA,KAAO;AACL,IAAA,IAAA,CAAK,QAAA,CAAS,WAAA,CAAY,OAAA,CAAQ,QAAA,CAAU,WAAA,EAAa;AACvD,MAAA,EAAA,CAAG,SAAA,EAAW,EAAA,CAAG,QAAA,CAAS,MAAA,CAAO,cAAA,CAAe,WAAW,CAAC,CAAA;AAAA,IAC9D,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,EAAA;AACT;AAEA,SAAS,cAAA,CAAe,WAAA,EAA2B;AACjD,EAAA,MAAM,KAAA,EAAO,aAAA,CAAc,WAAW,CAAA;AACtC,EAAA,MAAM,IAAA,EAAM,CAAA;AACZ,EAAA,MAAM,OAAA,EAAS,8BAAA,IAAO,CAAK,QAAA,EAAU,IAAA,CAAK,KAAA,EAAO,GAAG,CAAA;AAEpD,EAAA,MAAM,SAAA,EAA+B,CAAC,CAAA;AACtC,EAAA,MAAM,SAAA,EAAuB,CAAC,CAAA;AAE9B,EAAA,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAU,IAAA,EAAWA,EAAAA,EAAW;AAC7C,IAAA,MAAM,MAAA,EAAQ,MAAA,CAAOA,EAAC,CAAA;AACtB,IAAA,QAAA,CAAS,IAAA,CAAK,CAAC,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,GAAG,CAAA,EAAG,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5E,CAAC,CAAA;AAED,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AAC3C,IAAA,MAAM,OAAA,EAAS,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AACtC,IAAA,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,CAAC,CAAC,CAAA;AACvB,IAAA,QAAA,CAAS,IAAA,CAAK,8BAAA,CAAS,MAAM,CAAC,CAAC,CAAA;AAAA,EACjC;AAEA,EAAA,OAAO,QAAA;AACT;AAEA,SAAS,aAAA,CAAc,IAAA,EAAoB;AACzC,EAAA,MAAM,IAAA,EAAc,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA,EAC7B,OAAA,EAAsE;AAAA,IACpE,QAAA,EAAU,CAAC,CAAA;AAAA,IACX,KAAA,EAAO,CAAC,CAAA;AAAA,IACR,UAAA,EAAY;AAAA,EACd,CAAA;AACF,EAAA,IAAI,UAAA,EAAY,CAAA;AAEhB,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA,EAAK;AACvC,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,CAAA,EAAA,EAAK,MAAA,CAAO,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAC,CAAA;AAAA,IAClE;AACA,IAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACT,MAAA,UAAA,GAAa,IAAA,CAAK,EAAA,EAAI,CAAC,CAAA,CAAE,MAAA;AACzB,MAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AAAA,IAC7B;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,cAAA,EAAQ,SAAA;ADvCf;AACE;AACA;AACF,+DAAC","file":"/home/runner/work/turf/turf/packages/turf-tesselate/dist/cjs/index.cjs","sourcesContent":[null,"import {\n  Feature,\n  FeatureCollection,\n  MultiPolygon,\n  Polygon,\n  Position,\n} from \"geojson\";\nimport earcut from \"earcut\";\nimport { polygon } from \"@turf/helpers\";\n\n/**\n * Tesselates a polygon or multipolygon into a collection of triangle polygons\n * using [earcut](https://github.com/mapbox/earcut).\n *\n * @function\n * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate\n * @returns {FeatureCollection<Polygon>} collection of polygon tesselations\n * @example\n * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n * const triangles = turf.tesselate(poly);\n *\n * //addToMap\n * const addToMap = [poly, triangles]\n */\nfunction tesselate(\n  poly: Feature<Polygon | MultiPolygon>\n): FeatureCollection<Polygon> {\n  if (\n    !poly.geometry ||\n    (poly.geometry.type !== \"Polygon\" && poly.geometry.type !== \"MultiPolygon\")\n  ) {\n    throw new Error(\"input must be a Polygon or MultiPolygon\");\n  }\n\n  const fc: FeatureCollection<Polygon> = {\n    type: \"FeatureCollection\",\n    features: [],\n  };\n\n  if (poly.geometry.type === \"Polygon\") {\n    fc.features = processPolygon(poly.geometry.coordinates);\n  } else {\n    poly.geometry.coordinates.forEach(function (coordinates) {\n      fc.features = fc.features.concat(processPolygon(coordinates));\n    });\n  }\n\n  return fc;\n}\n\nfunction processPolygon(coordinates: Position[][]) {\n  const data = flattenCoords(coordinates);\n  const dim = 2;\n  const result = earcut(data.vertices, data.holes, dim);\n\n  const features: Feature<Polygon>[] = [];\n  const vertices: Position[] = [];\n\n  result.forEach(function (vert: any, i: number) {\n    const index = result[i];\n    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);\n  });\n\n  for (var i = 0; i < vertices.length; i += 3) {\n    const coords = vertices.slice(i, i + 3);\n    coords.push(vertices[i]);\n    features.push(polygon([coords]));\n  }\n\n  return features;\n}\n\nfunction flattenCoords(data: Position[][]) {\n  const dim: number = data[0][0].length,\n    result: { vertices: number[]; holes: number[]; dimensions: number } = {\n      vertices: [],\n      holes: [],\n      dimensions: dim,\n    };\n  let holeIndex = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    for (let j = 0; j < data[i].length; j++) {\n      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);\n    }\n    if (i > 0) {\n      holeIndex += data[i - 1].length;\n      result.holes.push(holeIndex);\n    }\n  }\n\n  return result;\n}\n\nexport { tesselate };\nexport default tesselate;\n"]}

package/node_modules/@turf/tesselate/dist/esm/index.js

@@ -53,9 +53,9 @@ function flattenCoords(data) {
   }
   return result;
 }
-var turf_tesselate_default = tesselate;
+var index_default = tesselate;
 export {
-  turf_tesselate_default as default,
+  index_default as default,
   tesselate
 };
 //# sourceMappingURL=index.js.map

package/node_modules/@turf/tesselate/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import {\n  Feature,\n  FeatureCollection,\n  MultiPolygon,\n  Polygon,\n  Position,\n} from \"geojson\";\nimport earcut from \"earcut\";\nimport { polygon } from \"@turf/helpers\";\n\n/**\n * Tesselates a polygon or multipolygon into a collection of triangle polygons\n * using [earcut](https://github.com/mapbox/earcut).\n *\n * @function\n * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate\n * @returns {FeatureCollection<Polygon>} collection of polygon tesselations\n * @example\n * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n * const triangles = turf.tesselate(poly);\n *\n * //addToMap\n * const addToMap = [poly, triangles]\n */\nfunction tesselate(\n  poly: Feature<Polygon | MultiPolygon>\n): FeatureCollection<Polygon> {\n  if (\n    !poly.geometry ||\n    (poly.geometry.type !== \"Polygon\" && poly.geometry.type !== \"MultiPolygon\")\n  ) {\n    throw new Error(\"input must be a Polygon or MultiPolygon\");\n  }\n\n  const fc: FeatureCollection<Polygon> = {\n    type: \"FeatureCollection\",\n    features: [],\n  };\n\n  if (poly.geometry.type === \"Polygon\") {\n    fc.features = processPolygon(poly.geometry.coordinates);\n  } else {\n    poly.geometry.coordinates.forEach(function (coordinates) {\n      fc.features = fc.features.concat(processPolygon(coordinates));\n    });\n  }\n\n  return fc;\n}\n\nfunction processPolygon(coordinates: Position[][]) {\n  const data = flattenCoords(coordinates);\n  const dim = 2;\n  const result = earcut(data.vertices, data.holes, dim);\n\n  const features: Feature<Polygon>[] = [];\n  const vertices: Position[] = [];\n\n  result.forEach(function (vert: any, i: number) {\n    const index = result[i];\n    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);\n  });\n\n  for (var i = 0; i < vertices.length; i += 3) {\n    const coords = vertices.slice(i, i + 3);\n    coords.push(vertices[i]);\n    features.push(polygon([coords]));\n  }\n\n  return features;\n}\n\nfunction flattenCoords(data: Position[][]) {\n  const dim: number = data[0][0].length,\n    result: { vertices: number[]; holes: number[]; dimensions: number } = {\n      vertices: [],\n      holes: [],\n      dimensions: dim,\n    };\n  let holeIndex = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    for (let j = 0; j < data[i].length; j++) {\n      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);\n    }\n    if (i > 0) {\n      holeIndex += data[i - 1].length;\n      result.holes.push(holeIndex);\n    }\n  }\n\n  return result;\n}\n\nexport { tesselate };\nexport default tesselate;\n"],"mappings":";AAOA,OAAO,YAAY;AACnB,SAAS,eAAe;AAgBxB,SAAS,UACP,MAC4B;AAC5B,MACE,CAAC,KAAK,YACL,KAAK,SAAS,SAAS,aAAa,KAAK,SAAS,SAAS,gBAC5D;AACA,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAEA,QAAM,KAAiC;AAAA,IACrC,MAAM;AAAA,IACN,UAAU,CAAC;AAAA,EACb;AAEA,MAAI,KAAK,SAAS,SAAS,WAAW;AACpC,OAAG,WAAW,eAAe,KAAK,SAAS,WAAW;AAAA,EACxD,OAAO;AACL,SAAK,SAAS,YAAY,QAAQ,SAAU,aAAa;AACvD,SAAG,WAAW,GAAG,SAAS,OAAO,eAAe,WAAW,CAAC;AAAA,IAC9D,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,aAA2B;AACjD,QAAM,OAAO,cAAc,WAAW;AACtC,QAAM,MAAM;AACZ,QAAM,SAAS,OAAO,KAAK,UAAU,KAAK,OAAO,GAAG;AAEpD,QAAM,WAA+B,CAAC;AACtC,QAAM,WAAuB,CAAC;AAE9B,SAAO,QAAQ,SAAU,MAAWA,IAAW;AAC7C,UAAM,QAAQ,OAAOA,EAAC;AACtB,aAAS,KAAK,CAAC,KAAK,SAAS,QAAQ,GAAG,GAAG,KAAK,SAAS,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,EAC5E,CAAC;AAED,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,UAAM,SAAS,SAAS,MAAM,GAAG,IAAI,CAAC;AACtC,WAAO,KAAK,SAAS,CAAC,CAAC;AACvB,aAAS,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;AAAA,EACjC;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,MAAoB;AACzC,QAAM,MAAc,KAAK,CAAC,EAAE,CAAC,EAAE,QAC7B,SAAsE;AAAA,IACpE,UAAU,CAAC;AAAA,IACX,OAAO,CAAC;AAAA,IACR,YAAY;AAAA,EACd;AACF,MAAI,YAAY;AAEhB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,KAAK;AACvC,eAAS,IAAI,GAAG,IAAI,KAAK,IAAK,QAAO,SAAS,KAAK,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,IAClE;AACA,QAAI,IAAI,GAAG;AACT,mBAAa,KAAK,IAAI,CAAC,EAAE;AACzB,aAAO,MAAM,KAAK,SAAS;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,yBAAQ;","names":["i"]}
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import {\n  Feature,\n  FeatureCollection,\n  MultiPolygon,\n  Polygon,\n  Position,\n} from \"geojson\";\nimport earcut from \"earcut\";\nimport { polygon } from \"@turf/helpers\";\n\n/**\n * Tesselates a polygon or multipolygon into a collection of triangle polygons\n * using [earcut](https://github.com/mapbox/earcut).\n *\n * @function\n * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate\n * @returns {FeatureCollection<Polygon>} collection of polygon tesselations\n * @example\n * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);\n * const triangles = turf.tesselate(poly);\n *\n * //addToMap\n * const addToMap = [poly, triangles]\n */\nfunction tesselate(\n  poly: Feature<Polygon | MultiPolygon>\n): FeatureCollection<Polygon> {\n  if (\n    !poly.geometry ||\n    (poly.geometry.type !== \"Polygon\" && poly.geometry.type !== \"MultiPolygon\")\n  ) {\n    throw new Error(\"input must be a Polygon or MultiPolygon\");\n  }\n\n  const fc: FeatureCollection<Polygon> = {\n    type: \"FeatureCollection\",\n    features: [],\n  };\n\n  if (poly.geometry.type === \"Polygon\") {\n    fc.features = processPolygon(poly.geometry.coordinates);\n  } else {\n    poly.geometry.coordinates.forEach(function (coordinates) {\n      fc.features = fc.features.concat(processPolygon(coordinates));\n    });\n  }\n\n  return fc;\n}\n\nfunction processPolygon(coordinates: Position[][]) {\n  const data = flattenCoords(coordinates);\n  const dim = 2;\n  const result = earcut(data.vertices, data.holes, dim);\n\n  const features: Feature<Polygon>[] = [];\n  const vertices: Position[] = [];\n\n  result.forEach(function (vert: any, i: number) {\n    const index = result[i];\n    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);\n  });\n\n  for (var i = 0; i < vertices.length; i += 3) {\n    const coords = vertices.slice(i, i + 3);\n    coords.push(vertices[i]);\n    features.push(polygon([coords]));\n  }\n\n  return features;\n}\n\nfunction flattenCoords(data: Position[][]) {\n  const dim: number = data[0][0].length,\n    result: { vertices: number[]; holes: number[]; dimensions: number } = {\n      vertices: [],\n      holes: [],\n      dimensions: dim,\n    };\n  let holeIndex = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    for (let j = 0; j < data[i].length; j++) {\n      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);\n    }\n    if (i > 0) {\n      holeIndex += data[i - 1].length;\n      result.holes.push(holeIndex);\n    }\n  }\n\n  return result;\n}\n\nexport { tesselate };\nexport default tesselate;\n"],"mappings":";AAOA,OAAO,YAAY;AACnB,SAAS,eAAe;AAgBxB,SAAS,UACP,MAC4B;AAC5B,MACE,CAAC,KAAK,YACL,KAAK,SAAS,SAAS,aAAa,KAAK,SAAS,SAAS,gBAC5D;AACA,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAEA,QAAM,KAAiC;AAAA,IACrC,MAAM;AAAA,IACN,UAAU,CAAC;AAAA,EACb;AAEA,MAAI,KAAK,SAAS,SAAS,WAAW;AACpC,OAAG,WAAW,eAAe,KAAK,SAAS,WAAW;AAAA,EACxD,OAAO;AACL,SAAK,SAAS,YAAY,QAAQ,SAAU,aAAa;AACvD,SAAG,WAAW,GAAG,SAAS,OAAO,eAAe,WAAW,CAAC;AAAA,IAC9D,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,aAA2B;AACjD,QAAM,OAAO,cAAc,WAAW;AACtC,QAAM,MAAM;AACZ,QAAM,SAAS,OAAO,KAAK,UAAU,KAAK,OAAO,GAAG;AAEpD,QAAM,WAA+B,CAAC;AACtC,QAAM,WAAuB,CAAC;AAE9B,SAAO,QAAQ,SAAU,MAAWA,IAAW;AAC7C,UAAM,QAAQ,OAAOA,EAAC;AACtB,aAAS,KAAK,CAAC,KAAK,SAAS,QAAQ,GAAG,GAAG,KAAK,SAAS,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,EAC5E,CAAC;AAED,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,UAAM,SAAS,SAAS,MAAM,GAAG,IAAI,CAAC;AACtC,WAAO,KAAK,SAAS,CAAC,CAAC;AACvB,aAAS,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;AAAA,EACjC;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,MAAoB;AACzC,QAAM,MAAc,KAAK,CAAC,EAAE,CAAC,EAAE,QAC7B,SAAsE;AAAA,IACpE,UAAU,CAAC;AAAA,IACX,OAAO,CAAC;AAAA,IACR,YAAY;AAAA,EACd;AACF,MAAI,YAAY;AAEhB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,KAAK;AACvC,eAAS,IAAI,GAAG,IAAI,KAAK,IAAK,QAAO,SAAS,KAAK,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,IAClE;AACA,QAAI,IAAI,GAAG;AACT,mBAAa,KAAK,IAAI,CAAC,EAAE;AACzB,aAAO,MAAM,KAAK,SAAS;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,gBAAQ;","names":["i"]}

package/node_modules/@turf/tesselate/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@turf/tesselate",
-  "version": "7.2.0",
-  "description": "turf tesselate module",
+  "version": "7.3.0",
+  "description": "Tesselates a polygon or multipolygon into a collection of triangle polygons using earcut.",
   "author": "Turf Authors",
   "contributors": [
     "Abel Vázquez <@AbelVM>",
@@ -60,19 +60,19 @@
   },
   "devDependencies": {
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
+    "@types/tape": "^5.8.1",
     "benchmark": "^2.1.4",
     "npm-run-all": "^4.1.5",
     "tape": "^5.9.0",
-    "tsup": "^8.3.5",
-    "tsx": "^4.19.2",
-    "typescript": "^5.5.4"
+    "tsup": "^8.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3"
   },
   "dependencies": {
-    "@turf/helpers": "^7.2.0",
+    "@turf/helpers": "7.3.0",
     "@types/geojson": "^7946.0.10",
     "earcut": "^2.2.4",
     "tslib": "^2.8.1"
   },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
+  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
 }

package/node_modules/@turf/tin/dist/cjs/index.cjs

@@ -184,9 +184,9 @@ function triangulate(vertices) {
   }
   return closed;
 }
-var turf_tin_default = tin;
+var index_default = tin;
 
 
 
-exports.default = turf_tin_default; exports.tin = tin;
+exports.default = index_default; exports.tin = tin;
 //# sourceMappingURL=index.cjs.map

package/node_modules/@turf/tin/dist/cjs/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACGA,wCAA2C;AA6C3C,SAAS,GAAA,CACP,MAAA,EACA,CAAA,EAC4B;AAE5B,EAAA,IAAI,SAAA,EAAW,KAAA;AACf,EAAA,OAAO,wCAAA;AAAA,IACL,WAAA;AAAA,MACE,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM;AACzB,QAAA,MAAM,MAAA,EAAY;AAAA,UAChB,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,UAC3B,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC;AAAA,QAC7B,CAAA;AACA,QAAA,GAAA,CAAI,CAAA,EAAG;AACL,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AAAA,QAC1B,EAAA,KAAA,GAAA,CAAW,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,OAAA,IAAW,CAAA,EAAG;AAC9C,UAAA,SAAA,EAAW,IAAA;AACX,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,QACpC;AACA,QAAA,OAAO,KAAA;AAAA,MACT,CAAC;AAAA,IACH,CAAA,CAAE,GAAA,CAAI,CAAC,QAAA,EAAA,GAAkB;AACvB,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,IAAI,WAAA,EAAa,CAAC,CAAA;AAIlB,MAAA,GAAA,CAAI,QAAA,EAAU;AACZ,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AAAA,MACrB,EAAA,KAAO;AACL,QAAA,WAAA,EAAa;AAAA,UACX,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE;AAAA,QAChB,CAAA;AAAA,MACF;AAEA,MAAA,OAAO,8BAAA,CAAS,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,EAAG,UAAU,CAAA;AAAA,IAC3C,CAAC;AAAA,EACH,CAAA;AACF;AAEA,IAAM,SAAA,EAAN,MAAe;AAAA,EAQb,WAAA,CAAY,CAAA,EAAO,CAAA,EAAO,CAAA,EAAO;AAC/B,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AAET,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AAC9C,IAAA,IAAI,EAAA;AACJ,IAAA,IAAI,EAAA;AAIJ,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,IAAA,CAAK,EAAA,EAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAAA,EAC1B;AACF,CAAA;AAEA,SAAS,GAAA,CAAI,CAAA,EAAO,CAAA,EAAO;AACzB,EAAA,OAAO,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACjB;AAEA,SAAS,KAAA,CAAM,KAAA,EAAiB;AAC9B,EAAA,IAAI,EAAA,EAAI,KAAA,CAAM,MAAA;AACd,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,KAAA,EAAO,MAAA,CAAO,CAAA,EAAG;AACf,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,CAAA;AACJ,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,GAAA,CAAK,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,EAAA,GAAO,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,CAAA,EAAI;AAChD,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,EAAA,GAAK,CAAA;AACL,QAAA,SAAS,KAAA;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAA,CAAY,QAAA,EAAqB;AAExC,EAAA,GAAA,CAAI,QAAA,CAAS,OAAA,EAAS,CAAA,EAAG;AACvB,IAAA,OAAO,CAAC,CAAA;AAAA,EACV;AAKA,EAAA,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAEjB,EAAA,IAAI,EAAA,EAAI,QAAA,CAAS,OAAA,EAAS,CAAA;AAC1B,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,IAAI,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACvB,EAAA,IAAI,KAAA,EAAO,IAAA;AACX,EAAA,MAAM,QAAA,EAAU,KAAA;AAEhB,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AACA,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAUA,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,MAAM,KAAA,EAAO,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAC5B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAO;AAAA,IACX,IAAI,QAAA;AAAA,MACF;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,IAAA;AAAA,QACH,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK;AAAA,MACjB,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF,CAAA;AACA,EAAA,MAAM,OAAA,EAAS,CAAC,CAAA;AAChB,EAAA,MAAM,MAAA,EAAa,CAAC,CAAA;AACpB,EAAA,IAAI,CAAA;AAGJ,EAAA,EAAA,EAAI,QAAA,CAAS,MAAA;AACb,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,IAAA,KAAA,CAAM,OAAA,EAAS,CAAA;AACf,IAAA,EAAA,EAAI,IAAA,CAAK,MAAA;AACT,IAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,EAAA,GAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACnB,QAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAChB,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE;AAAA,MACV,CAAA;AACA,MAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IAClB;AAGA,IAAA,KAAA,CAAM,KAAK,CAAA;AAGX,IAAA,EAAA,EAAI,KAAA,CAAM,MAAA;AACV,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,QAAA,CAAS,CAAC,CAAA;AAGd,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AACxC,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAC,EAAA,EAAI,OAAA,EAAS;AACzB,QAAA,IAAA,CAAK,IAAA,CAAK,IAAI,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,EAAA,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ,IAAI,CAAA;AAEvC,EAAA,EAAA,EAAI,MAAA,CAAO,MAAA;AACX,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CACE,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,UAAA,EACZ;AACA,MAAA,MAAA,CAAO,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IACpB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,iBAAA,EAAQ,GAAA;ADnHf;AACE;AACA;AACF,sDAAC","file":"/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","sourcesContent":[null,"// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n  x: number;\n  y: number;\n  z?: number;\n  __sentinel?: boolean;\n}\ninterface Vertice {\n  x: number;\n  y: number;\n}\n\n/**\n * Takes a set of {@link Point|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n *\n * If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n *\n * // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n *   points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n *\n * //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n *   var properties  = tin.features[i].properties;\n *   properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n */\nfunction tin(\n  points: FeatureCollection<Point, any>,\n  z?: string\n): FeatureCollection<Polygon> {\n  // break down points\n  let isPointZ = false;\n  return featureCollection(\n    triangulate(\n      points.features.map((p) => {\n        const point: Pt = {\n          x: p.geometry.coordinates[0],\n          y: p.geometry.coordinates[1],\n        };\n        if (z) {\n          point.z = p.properties[z];\n        } else if (p.geometry.coordinates.length === 3) {\n          isPointZ = true;\n          point.z = p.geometry.coordinates[2];\n        }\n        return point;\n      })\n    ).map((triangle: any) => {\n      const a = [triangle.a.x, triangle.a.y];\n      const b = [triangle.b.x, triangle.b.y];\n      const c = [triangle.c.x, triangle.c.y];\n      let properties = {};\n\n      // Add z coordinates to triangle points if user passed\n      // them in that way otherwise add it as a property.\n      if (isPointZ) {\n        a.push(triangle.a.z);\n        b.push(triangle.b.z);\n        c.push(triangle.c.z);\n      } else {\n        properties = {\n          a: triangle.a.z,\n          b: triangle.b.z,\n          c: triangle.c.z,\n        };\n      }\n\n      return polygon([[a, b, c, a]], properties);\n    })\n  );\n}\n\nclass Triangle {\n  public a: Pt;\n  public b: Pt;\n  public c: Pt;\n  public x: number;\n  public y: number;\n  public r: number;\n\n  constructor(a: Pt, b: Pt, c: Pt) {\n    this.a = a;\n    this.b = b;\n    this.c = c;\n\n    const A = b.x - a.x;\n    const B = b.y - a.y;\n    const C = c.x - a.x;\n    const D = c.y - a.y;\n    const E = A * (a.x + b.x) + B * (a.y + b.y);\n    const F = C * (a.x + c.x) + D * (a.y + c.y);\n    const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n    let dx;\n    let dy;\n\n    // If the points of the triangle are collinear, then just find the\n    // extremes and use the midpoint as the center of the circumcircle.\n    this.x = (D * E - B * F) / G;\n    this.y = (A * F - C * E) / G;\n    dx = this.x - a.x;\n    dy = this.y - a.y;\n    this.r = dx * dx + dy * dy;\n  }\n}\n\nfunction byX(a: Pt, b: Pt) {\n  return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n  let j = edges.length;\n  let a;\n  let b;\n  let i;\n  let m;\n  let n;\n\n  outer: while (j) {\n    b = edges[--j];\n    a = edges[--j];\n    i = j;\n    while (i) {\n      n = edges[--i];\n      m = edges[--i];\n      if ((a === m && b === n) || (a === n && b === m)) {\n        edges.splice(j, 2);\n        edges.splice(i, 2);\n        j -= 2;\n        continue outer;\n      }\n    }\n  }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n  // Bail if there aren't enough vertices to form any triangles.\n  if (vertices.length < 3) {\n    return [];\n  }\n\n  // Ensure the vertex array is in order of descending X coordinate\n  // (which is needed to ensure a subquadratic runtime), and then find\n  // the bounding box around the points.\n  vertices.sort(byX);\n\n  let i = vertices.length - 1;\n  const xmin = vertices[i].x;\n  const xmax = vertices[0].x;\n  let ymin = vertices[i].y;\n  let ymax = ymin;\n  const epsilon = 1e-12;\n\n  let a;\n  let b;\n  let c;\n  let A;\n  let B;\n  let G;\n\n  while (i--) {\n    if (vertices[i].y < ymin) {\n      ymin = vertices[i].y;\n    }\n    if (vertices[i].y > ymax) {\n      ymax = vertices[i].y;\n    }\n  }\n\n  // Find a supertriangle, which is a triangle that surrounds all the\n  // vertices. This is used like something of a sentinel value to remove\n  // cases in the main algorithm, and is removed before we return any\n  // results.\n\n  // Once found, put it in the \"open\" list. (The \"open\" list is for\n  // triangles who may still need to be considered; the \"closed\" list is\n  // for triangles which do not.)\n  let dx = xmax - xmin;\n  let dy = ymax - ymin;\n  const dmax = dx > dy ? dx : dy;\n  const xmid = (xmax + xmin) * 0.5;\n  const ymid = (ymax + ymin) * 0.5;\n  const open = [\n    new Triangle(\n      {\n        __sentinel: true,\n        x: xmid - 20 * dmax,\n        y: ymid - dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid,\n        y: ymid + 20 * dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid + 20 * dmax,\n        y: ymid - dmax,\n      }\n    ),\n  ];\n  const closed = [];\n  const edges: any = [];\n  let j;\n\n  // Incrementally add each vertex to the mesh.\n  i = vertices.length;\n  while (i--) {\n    // For each open triangle, check to see if the current point is\n    // inside it's circumcircle. If it is, remove the triangle and add\n    // it's edges to an edge list.\n    edges.length = 0;\n    j = open.length;\n    while (j--) {\n      // If this point is to the right of this triangle's circumcircle,\n      // then this triangle should never get checked again. Remove it\n      // from the open list, add it to the closed list, and skip.\n      dx = vertices[i].x - open[j].x;\n      if (dx > 0 && dx * dx > open[j].r) {\n        closed.push(open[j]);\n        open.splice(j, 1);\n        continue;\n      }\n\n      // If not, skip this triangle.\n      dy = vertices[i].y - open[j].y;\n      if (dx * dx + dy * dy > open[j].r) {\n        continue;\n      }\n\n      // Remove the triangle and add it's edges to the edge list.\n      edges.push(\n        open[j].a,\n        open[j].b,\n        open[j].b,\n        open[j].c,\n        open[j].c,\n        open[j].a\n      );\n      open.splice(j, 1);\n    }\n\n    // Remove any doubled edges.\n    dedup(edges);\n\n    // Add a new triangle for each edge.\n    j = edges.length;\n    while (j) {\n      b = edges[--j];\n      a = edges[--j];\n      c = vertices[i];\n      // Avoid adding colinear triangles (which have error-prone\n      // circumcircles)\n      A = b.x - a.x;\n      B = b.y - a.y;\n      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n      if (Math.abs(G) > epsilon) {\n        open.push(new Triangle(a, b, c));\n      }\n    }\n  }\n\n  // Copy any remaining open triangles to the closed list, and then\n  // remove any triangles that share a vertex with the supertriangle.\n  Array.prototype.push.apply(closed, open);\n\n  i = closed.length;\n  while (i--) {\n    if (\n      closed[i].a.__sentinel ||\n      closed[i].b.__sentinel ||\n      closed[i].c.__sentinel\n    ) {\n      closed.splice(i, 1);\n    }\n  }\n\n  return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"]}
+{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACGA,wCAA2C;AA6C3C,SAAS,GAAA,CACP,MAAA,EACA,CAAA,EAC4B;AAE5B,EAAA,IAAI,SAAA,EAAW,KAAA;AACf,EAAA,OAAO,wCAAA;AAAA,IACL,WAAA;AAAA,MACE,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM;AACzB,QAAA,MAAM,MAAA,EAAY;AAAA,UAChB,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,UAC3B,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC;AAAA,QAC7B,CAAA;AACA,QAAA,GAAA,CAAI,CAAA,EAAG;AACL,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AAAA,QAC1B,EAAA,KAAA,GAAA,CAAW,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,OAAA,IAAW,CAAA,EAAG;AAC9C,UAAA,SAAA,EAAW,IAAA;AACX,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,QACpC;AACA,QAAA,OAAO,KAAA;AAAA,MACT,CAAC;AAAA,IACH,CAAA,CAAE,GAAA,CAAI,CAAC,QAAA,EAAA,GAAkB;AACvB,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,IAAI,WAAA,EAAa,CAAC,CAAA;AAIlB,MAAA,GAAA,CAAI,QAAA,EAAU;AACZ,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AAAA,MACrB,EAAA,KAAO;AACL,QAAA,WAAA,EAAa;AAAA,UACX,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE;AAAA,QAChB,CAAA;AAAA,MACF;AAEA,MAAA,OAAO,8BAAA,CAAS,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,EAAG,UAAU,CAAA;AAAA,IAC3C,CAAC;AAAA,EACH,CAAA;AACF;AAEA,IAAM,SAAA,EAAN,MAAe;AAAA,EAQb,WAAA,CAAY,CAAA,EAAO,CAAA,EAAO,CAAA,EAAO;AAC/B,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AAET,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AAC9C,IAAA,IAAI,EAAA;AACJ,IAAA,IAAI,EAAA;AAIJ,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,IAAA,CAAK,EAAA,EAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAAA,EAC1B;AACF,CAAA;AAEA,SAAS,GAAA,CAAI,CAAA,EAAO,CAAA,EAAO;AACzB,EAAA,OAAO,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACjB;AAEA,SAAS,KAAA,CAAM,KAAA,EAAiB;AAC9B,EAAA,IAAI,EAAA,EAAI,KAAA,CAAM,MAAA;AACd,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,KAAA,EAAO,MAAA,CAAO,CAAA,EAAG;AACf,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,CAAA;AACJ,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,GAAA,CAAK,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,EAAA,GAAO,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,CAAA,EAAI;AAChD,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,EAAA,GAAK,CAAA;AACL,QAAA,SAAS,KAAA;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAA,CAAY,QAAA,EAAqB;AAExC,EAAA,GAAA,CAAI,QAAA,CAAS,OAAA,EAAS,CAAA,EAAG;AACvB,IAAA,OAAO,CAAC,CAAA;AAAA,EACV;AAKA,EAAA,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAEjB,EAAA,IAAI,EAAA,EAAI,QAAA,CAAS,OAAA,EAAS,CAAA;AAC1B,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,IAAI,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACvB,EAAA,IAAI,KAAA,EAAO,IAAA;AACX,EAAA,MAAM,QAAA,EAAU,KAAA;AAEhB,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AACA,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAUA,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,MAAM,KAAA,EAAO,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAC5B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAO;AAAA,IACX,IAAI,QAAA;AAAA,MACF;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,IAAA;AAAA,QACH,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK;AAAA,MACjB,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF,CAAA;AACA,EAAA,MAAM,OAAA,EAAS,CAAC,CAAA;AAChB,EAAA,MAAM,MAAA,EAAa,CAAC,CAAA;AACpB,EAAA,IAAI,CAAA;AAGJ,EAAA,EAAA,EAAI,QAAA,CAAS,MAAA;AACb,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,IAAA,KAAA,CAAM,OAAA,EAAS,CAAA;AACf,IAAA,EAAA,EAAI,IAAA,CAAK,MAAA;AACT,IAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,EAAA,GAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACnB,QAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAChB,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE;AAAA,MACV,CAAA;AACA,MAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IAClB;AAGA,IAAA,KAAA,CAAM,KAAK,CAAA;AAGX,IAAA,EAAA,EAAI,KAAA,CAAM,MAAA;AACV,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,QAAA,CAAS,CAAC,CAAA;AAGd,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AACxC,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAC,EAAA,EAAI,OAAA,EAAS;AACzB,QAAA,IAAA,CAAK,IAAA,CAAK,IAAI,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,EAAA,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ,IAAI,CAAA;AAEvC,EAAA,EAAA,EAAI,MAAA,CAAO,MAAA;AACX,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CACE,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,UAAA,EACZ;AACA,MAAA,MAAA,CAAO,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IACpB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,cAAA,EAAQ,GAAA;ADnHf;AACE;AACA;AACF,mDAAC","file":"/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","sourcesContent":[null,"// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n  x: number;\n  y: number;\n  z?: number;\n  __sentinel?: boolean;\n}\ninterface Vertice {\n  x: number;\n  y: number;\n}\n\n/**\n * Takes a set of {@link Point|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n *\n * If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n *\n * // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n *   points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n *\n * //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n *   var properties  = tin.features[i].properties;\n *   properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n */\nfunction tin(\n  points: FeatureCollection<Point, any>,\n  z?: string\n): FeatureCollection<Polygon> {\n  // break down points\n  let isPointZ = false;\n  return featureCollection(\n    triangulate(\n      points.features.map((p) => {\n        const point: Pt = {\n          x: p.geometry.coordinates[0],\n          y: p.geometry.coordinates[1],\n        };\n        if (z) {\n          point.z = p.properties[z];\n        } else if (p.geometry.coordinates.length === 3) {\n          isPointZ = true;\n          point.z = p.geometry.coordinates[2];\n        }\n        return point;\n      })\n    ).map((triangle: any) => {\n      const a = [triangle.a.x, triangle.a.y];\n      const b = [triangle.b.x, triangle.b.y];\n      const c = [triangle.c.x, triangle.c.y];\n      let properties = {};\n\n      // Add z coordinates to triangle points if user passed\n      // them in that way otherwise add it as a property.\n      if (isPointZ) {\n        a.push(triangle.a.z);\n        b.push(triangle.b.z);\n        c.push(triangle.c.z);\n      } else {\n        properties = {\n          a: triangle.a.z,\n          b: triangle.b.z,\n          c: triangle.c.z,\n        };\n      }\n\n      return polygon([[a, b, c, a]], properties);\n    })\n  );\n}\n\nclass Triangle {\n  public a: Pt;\n  public b: Pt;\n  public c: Pt;\n  public x: number;\n  public y: number;\n  public r: number;\n\n  constructor(a: Pt, b: Pt, c: Pt) {\n    this.a = a;\n    this.b = b;\n    this.c = c;\n\n    const A = b.x - a.x;\n    const B = b.y - a.y;\n    const C = c.x - a.x;\n    const D = c.y - a.y;\n    const E = A * (a.x + b.x) + B * (a.y + b.y);\n    const F = C * (a.x + c.x) + D * (a.y + c.y);\n    const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n    let dx;\n    let dy;\n\n    // If the points of the triangle are collinear, then just find the\n    // extremes and use the midpoint as the center of the circumcircle.\n    this.x = (D * E - B * F) / G;\n    this.y = (A * F - C * E) / G;\n    dx = this.x - a.x;\n    dy = this.y - a.y;\n    this.r = dx * dx + dy * dy;\n  }\n}\n\nfunction byX(a: Pt, b: Pt) {\n  return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n  let j = edges.length;\n  let a;\n  let b;\n  let i;\n  let m;\n  let n;\n\n  outer: while (j) {\n    b = edges[--j];\n    a = edges[--j];\n    i = j;\n    while (i) {\n      n = edges[--i];\n      m = edges[--i];\n      if ((a === m && b === n) || (a === n && b === m)) {\n        edges.splice(j, 2);\n        edges.splice(i, 2);\n        j -= 2;\n        continue outer;\n      }\n    }\n  }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n  // Bail if there aren't enough vertices to form any triangles.\n  if (vertices.length < 3) {\n    return [];\n  }\n\n  // Ensure the vertex array is in order of descending X coordinate\n  // (which is needed to ensure a subquadratic runtime), and then find\n  // the bounding box around the points.\n  vertices.sort(byX);\n\n  let i = vertices.length - 1;\n  const xmin = vertices[i].x;\n  const xmax = vertices[0].x;\n  let ymin = vertices[i].y;\n  let ymax = ymin;\n  const epsilon = 1e-12;\n\n  let a;\n  let b;\n  let c;\n  let A;\n  let B;\n  let G;\n\n  while (i--) {\n    if (vertices[i].y < ymin) {\n      ymin = vertices[i].y;\n    }\n    if (vertices[i].y > ymax) {\n      ymax = vertices[i].y;\n    }\n  }\n\n  // Find a supertriangle, which is a triangle that surrounds all the\n  // vertices. This is used like something of a sentinel value to remove\n  // cases in the main algorithm, and is removed before we return any\n  // results.\n\n  // Once found, put it in the \"open\" list. (The \"open\" list is for\n  // triangles who may still need to be considered; the \"closed\" list is\n  // for triangles which do not.)\n  let dx = xmax - xmin;\n  let dy = ymax - ymin;\n  const dmax = dx > dy ? dx : dy;\n  const xmid = (xmax + xmin) * 0.5;\n  const ymid = (ymax + ymin) * 0.5;\n  const open = [\n    new Triangle(\n      {\n        __sentinel: true,\n        x: xmid - 20 * dmax,\n        y: ymid - dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid,\n        y: ymid + 20 * dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid + 20 * dmax,\n        y: ymid - dmax,\n      }\n    ),\n  ];\n  const closed = [];\n  const edges: any = [];\n  let j;\n\n  // Incrementally add each vertex to the mesh.\n  i = vertices.length;\n  while (i--) {\n    // For each open triangle, check to see if the current point is\n    // inside it's circumcircle. If it is, remove the triangle and add\n    // it's edges to an edge list.\n    edges.length = 0;\n    j = open.length;\n    while (j--) {\n      // If this point is to the right of this triangle's circumcircle,\n      // then this triangle should never get checked again. Remove it\n      // from the open list, add it to the closed list, and skip.\n      dx = vertices[i].x - open[j].x;\n      if (dx > 0 && dx * dx > open[j].r) {\n        closed.push(open[j]);\n        open.splice(j, 1);\n        continue;\n      }\n\n      // If not, skip this triangle.\n      dy = vertices[i].y - open[j].y;\n      if (dx * dx + dy * dy > open[j].r) {\n        continue;\n      }\n\n      // Remove the triangle and add it's edges to the edge list.\n      edges.push(\n        open[j].a,\n        open[j].b,\n        open[j].b,\n        open[j].c,\n        open[j].c,\n        open[j].a\n      );\n      open.splice(j, 1);\n    }\n\n    // Remove any doubled edges.\n    dedup(edges);\n\n    // Add a new triangle for each edge.\n    j = edges.length;\n    while (j) {\n      b = edges[--j];\n      a = edges[--j];\n      c = vertices[i];\n      // Avoid adding colinear triangles (which have error-prone\n      // circumcircles)\n      A = b.x - a.x;\n      B = b.y - a.y;\n      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n      if (Math.abs(G) > epsilon) {\n        open.push(new Triangle(a, b, c));\n      }\n    }\n  }\n\n  // Copy any remaining open triangles to the closed list, and then\n  // remove any triangles that share a vertex with the supertriangle.\n  Array.prototype.push.apply(closed, open);\n\n  i = closed.length;\n  while (i--) {\n    if (\n      closed[i].a.__sentinel ||\n      closed[i].b.__sentinel ||\n      closed[i].c.__sentinel\n    ) {\n      closed.splice(i, 1);\n    }\n  }\n\n  return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"]}

package/node_modules/@turf/tin/dist/esm/index.js

@@ -184,9 +184,9 @@ function triangulate(vertices) {
   }
   return closed;
 }
-var turf_tin_default = tin;
+var index_default = tin;
 export {
-  turf_tin_default as default,
+  index_default as default,
   tin
 };
 //# sourceMappingURL=index.js.map

package/node_modules/@turf/tin/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n  x: number;\n  y: number;\n  z?: number;\n  __sentinel?: boolean;\n}\ninterface Vertice {\n  x: number;\n  y: number;\n}\n\n/**\n * Takes a set of {@link Point|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n *\n * If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n *\n * // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n *   points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n *\n * //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n *   var properties  = tin.features[i].properties;\n *   properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n */\nfunction tin(\n  points: FeatureCollection<Point, any>,\n  z?: string\n): FeatureCollection<Polygon> {\n  // break down points\n  let isPointZ = false;\n  return featureCollection(\n    triangulate(\n      points.features.map((p) => {\n        const point: Pt = {\n          x: p.geometry.coordinates[0],\n          y: p.geometry.coordinates[1],\n        };\n        if (z) {\n          point.z = p.properties[z];\n        } else if (p.geometry.coordinates.length === 3) {\n          isPointZ = true;\n          point.z = p.geometry.coordinates[2];\n        }\n        return point;\n      })\n    ).map((triangle: any) => {\n      const a = [triangle.a.x, triangle.a.y];\n      const b = [triangle.b.x, triangle.b.y];\n      const c = [triangle.c.x, triangle.c.y];\n      let properties = {};\n\n      // Add z coordinates to triangle points if user passed\n      // them in that way otherwise add it as a property.\n      if (isPointZ) {\n        a.push(triangle.a.z);\n        b.push(triangle.b.z);\n        c.push(triangle.c.z);\n      } else {\n        properties = {\n          a: triangle.a.z,\n          b: triangle.b.z,\n          c: triangle.c.z,\n        };\n      }\n\n      return polygon([[a, b, c, a]], properties);\n    })\n  );\n}\n\nclass Triangle {\n  public a: Pt;\n  public b: Pt;\n  public c: Pt;\n  public x: number;\n  public y: number;\n  public r: number;\n\n  constructor(a: Pt, b: Pt, c: Pt) {\n    this.a = a;\n    this.b = b;\n    this.c = c;\n\n    const A = b.x - a.x;\n    const B = b.y - a.y;\n    const C = c.x - a.x;\n    const D = c.y - a.y;\n    const E = A * (a.x + b.x) + B * (a.y + b.y);\n    const F = C * (a.x + c.x) + D * (a.y + c.y);\n    const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n    let dx;\n    let dy;\n\n    // If the points of the triangle are collinear, then just find the\n    // extremes and use the midpoint as the center of the circumcircle.\n    this.x = (D * E - B * F) / G;\n    this.y = (A * F - C * E) / G;\n    dx = this.x - a.x;\n    dy = this.y - a.y;\n    this.r = dx * dx + dy * dy;\n  }\n}\n\nfunction byX(a: Pt, b: Pt) {\n  return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n  let j = edges.length;\n  let a;\n  let b;\n  let i;\n  let m;\n  let n;\n\n  outer: while (j) {\n    b = edges[--j];\n    a = edges[--j];\n    i = j;\n    while (i) {\n      n = edges[--i];\n      m = edges[--i];\n      if ((a === m && b === n) || (a === n && b === m)) {\n        edges.splice(j, 2);\n        edges.splice(i, 2);\n        j -= 2;\n        continue outer;\n      }\n    }\n  }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n  // Bail if there aren't enough vertices to form any triangles.\n  if (vertices.length < 3) {\n    return [];\n  }\n\n  // Ensure the vertex array is in order of descending X coordinate\n  // (which is needed to ensure a subquadratic runtime), and then find\n  // the bounding box around the points.\n  vertices.sort(byX);\n\n  let i = vertices.length - 1;\n  const xmin = vertices[i].x;\n  const xmax = vertices[0].x;\n  let ymin = vertices[i].y;\n  let ymax = ymin;\n  const epsilon = 1e-12;\n\n  let a;\n  let b;\n  let c;\n  let A;\n  let B;\n  let G;\n\n  while (i--) {\n    if (vertices[i].y < ymin) {\n      ymin = vertices[i].y;\n    }\n    if (vertices[i].y > ymax) {\n      ymax = vertices[i].y;\n    }\n  }\n\n  // Find a supertriangle, which is a triangle that surrounds all the\n  // vertices. This is used like something of a sentinel value to remove\n  // cases in the main algorithm, and is removed before we return any\n  // results.\n\n  // Once found, put it in the \"open\" list. (The \"open\" list is for\n  // triangles who may still need to be considered; the \"closed\" list is\n  // for triangles which do not.)\n  let dx = xmax - xmin;\n  let dy = ymax - ymin;\n  const dmax = dx > dy ? dx : dy;\n  const xmid = (xmax + xmin) * 0.5;\n  const ymid = (ymax + ymin) * 0.5;\n  const open = [\n    new Triangle(\n      {\n        __sentinel: true,\n        x: xmid - 20 * dmax,\n        y: ymid - dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid,\n        y: ymid + 20 * dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid + 20 * dmax,\n        y: ymid - dmax,\n      }\n    ),\n  ];\n  const closed = [];\n  const edges: any = [];\n  let j;\n\n  // Incrementally add each vertex to the mesh.\n  i = vertices.length;\n  while (i--) {\n    // For each open triangle, check to see if the current point is\n    // inside it's circumcircle. If it is, remove the triangle and add\n    // it's edges to an edge list.\n    edges.length = 0;\n    j = open.length;\n    while (j--) {\n      // If this point is to the right of this triangle's circumcircle,\n      // then this triangle should never get checked again. Remove it\n      // from the open list, add it to the closed list, and skip.\n      dx = vertices[i].x - open[j].x;\n      if (dx > 0 && dx * dx > open[j].r) {\n        closed.push(open[j]);\n        open.splice(j, 1);\n        continue;\n      }\n\n      // If not, skip this triangle.\n      dy = vertices[i].y - open[j].y;\n      if (dx * dx + dy * dy > open[j].r) {\n        continue;\n      }\n\n      // Remove the triangle and add it's edges to the edge list.\n      edges.push(\n        open[j].a,\n        open[j].b,\n        open[j].b,\n        open[j].c,\n        open[j].c,\n        open[j].a\n      );\n      open.splice(j, 1);\n    }\n\n    // Remove any doubled edges.\n    dedup(edges);\n\n    // Add a new triangle for each edge.\n    j = edges.length;\n    while (j) {\n      b = edges[--j];\n      a = edges[--j];\n      c = vertices[i];\n      // Avoid adding colinear triangles (which have error-prone\n      // circumcircles)\n      A = b.x - a.x;\n      B = b.y - a.y;\n      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n      if (Math.abs(G) > epsilon) {\n        open.push(new Triangle(a, b, c));\n      }\n    }\n  }\n\n  // Copy any remaining open triangles to the closed list, and then\n  // remove any triangles that share a vertex with the supertriangle.\n  Array.prototype.push.apply(closed, open);\n\n  i = closed.length;\n  while (i--) {\n    if (\n      closed[i].a.__sentinel ||\n      closed[i].b.__sentinel ||\n      closed[i].c.__sentinel\n    ) {\n      closed.splice(i, 1);\n    }\n  }\n\n  return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"],"mappings":";AAGA,SAAS,mBAAmB,eAAe;AA6C3C,SAAS,IACP,QACA,GAC4B;AAE5B,MAAI,WAAW;AACf,SAAO;AAAA,IACL;AAAA,MACE,OAAO,SAAS,IAAI,CAAC,MAAM;AACzB,cAAM,QAAY;AAAA,UAChB,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,UAC3B,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,QAC7B;AACA,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE,WAAW,CAAC;AAAA,QAC1B,WAAW,EAAE,SAAS,YAAY,WAAW,GAAG;AAC9C,qBAAW;AACX,gBAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAAA,QACpC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,EAAE,IAAI,CAAC,aAAkB;AACvB,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,UAAI,aAAa,CAAC;AAIlB,UAAI,UAAU;AACZ,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AAAA,MACrB,OAAO;AACL,qBAAa;AAAA,UACX,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,QAChB;AAAA,MACF;AAEA,aAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU;AAAA,IAC3C,CAAC;AAAA,EACH;AACF;AAEA,IAAM,WAAN,MAAe;AAAA,EAQb,YAAY,GAAO,GAAO,GAAO;AAC/B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AAET,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AAC9C,QAAI;AACJ,QAAI;AAIJ,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1B;AACF;AAEA,SAAS,IAAI,GAAO,GAAO;AACzB,SAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAS,MAAM,OAAiB;AAC9B,MAAI,IAAI,MAAM;AACd,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,QAAO,QAAO,GAAG;AACf,QAAI,MAAM,EAAE,CAAC;AACb,QAAI,MAAM,EAAE,CAAC;AACb,QAAI;AACJ,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAK,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,GAAI;AAChD,cAAM,OAAO,GAAG,CAAC;AACjB,cAAM,OAAO,GAAG,CAAC;AACjB,aAAK;AACL,iBAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YAAY,UAAqB;AAExC,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAKA,WAAS,KAAK,GAAG;AAEjB,MAAI,IAAI,SAAS,SAAS;AAC1B,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,MAAI,OAAO,SAAS,CAAC,EAAE;AACvB,MAAI,OAAO;AACX,QAAM,UAAU;AAEhB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,SAAO,KAAK;AACV,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AACA,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAUA,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,OAAO;AAAA,IACX,IAAI;AAAA,MACF;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG;AAAA,QACH,GAAG,OAAO,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,CAAC;AAChB,QAAM,QAAa,CAAC;AACpB,MAAI;AAGJ,MAAI,SAAS;AACb,SAAO,KAAK;AAIV,UAAM,SAAS;AACf,QAAI,KAAK;AACT,WAAO,KAAK;AAIV,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC,eAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAK,OAAO,GAAG,CAAC;AAChB;AAAA,MACF;AAGA,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC;AAAA,MACF;AAGA,YAAM;AAAA,QACJ,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,MACV;AACA,WAAK,OAAO,GAAG,CAAC;AAAA,IAClB;AAGA,UAAM,KAAK;AAGX,QAAI,MAAM;AACV,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,SAAS,CAAC;AAGd,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACxC,UAAI,KAAK,IAAI,CAAC,IAAI,SAAS;AACzB,aAAK,KAAK,IAAI,SAAS,GAAG,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,QAAM,UAAU,KAAK,MAAM,QAAQ,IAAI;AAEvC,MAAI,OAAO;AACX,SAAO,KAAK;AACV,QACE,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,YACZ;AACA,aAAO,OAAO,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,mBAAQ;","names":[]}
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n  x: number;\n  y: number;\n  z?: number;\n  __sentinel?: boolean;\n}\ninterface Vertice {\n  x: number;\n  y: number;\n}\n\n/**\n * Takes a set of {@link Point|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n *\n * If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n *\n * @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n *\n * // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n *   points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n *\n * //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n *   var properties  = tin.features[i].properties;\n *   properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n */\nfunction tin(\n  points: FeatureCollection<Point, any>,\n  z?: string\n): FeatureCollection<Polygon> {\n  // break down points\n  let isPointZ = false;\n  return featureCollection(\n    triangulate(\n      points.features.map((p) => {\n        const point: Pt = {\n          x: p.geometry.coordinates[0],\n          y: p.geometry.coordinates[1],\n        };\n        if (z) {\n          point.z = p.properties[z];\n        } else if (p.geometry.coordinates.length === 3) {\n          isPointZ = true;\n          point.z = p.geometry.coordinates[2];\n        }\n        return point;\n      })\n    ).map((triangle: any) => {\n      const a = [triangle.a.x, triangle.a.y];\n      const b = [triangle.b.x, triangle.b.y];\n      const c = [triangle.c.x, triangle.c.y];\n      let properties = {};\n\n      // Add z coordinates to triangle points if user passed\n      // them in that way otherwise add it as a property.\n      if (isPointZ) {\n        a.push(triangle.a.z);\n        b.push(triangle.b.z);\n        c.push(triangle.c.z);\n      } else {\n        properties = {\n          a: triangle.a.z,\n          b: triangle.b.z,\n          c: triangle.c.z,\n        };\n      }\n\n      return polygon([[a, b, c, a]], properties);\n    })\n  );\n}\n\nclass Triangle {\n  public a: Pt;\n  public b: Pt;\n  public c: Pt;\n  public x: number;\n  public y: number;\n  public r: number;\n\n  constructor(a: Pt, b: Pt, c: Pt) {\n    this.a = a;\n    this.b = b;\n    this.c = c;\n\n    const A = b.x - a.x;\n    const B = b.y - a.y;\n    const C = c.x - a.x;\n    const D = c.y - a.y;\n    const E = A * (a.x + b.x) + B * (a.y + b.y);\n    const F = C * (a.x + c.x) + D * (a.y + c.y);\n    const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n    let dx;\n    let dy;\n\n    // If the points of the triangle are collinear, then just find the\n    // extremes and use the midpoint as the center of the circumcircle.\n    this.x = (D * E - B * F) / G;\n    this.y = (A * F - C * E) / G;\n    dx = this.x - a.x;\n    dy = this.y - a.y;\n    this.r = dx * dx + dy * dy;\n  }\n}\n\nfunction byX(a: Pt, b: Pt) {\n  return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n  let j = edges.length;\n  let a;\n  let b;\n  let i;\n  let m;\n  let n;\n\n  outer: while (j) {\n    b = edges[--j];\n    a = edges[--j];\n    i = j;\n    while (i) {\n      n = edges[--i];\n      m = edges[--i];\n      if ((a === m && b === n) || (a === n && b === m)) {\n        edges.splice(j, 2);\n        edges.splice(i, 2);\n        j -= 2;\n        continue outer;\n      }\n    }\n  }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n  // Bail if there aren't enough vertices to form any triangles.\n  if (vertices.length < 3) {\n    return [];\n  }\n\n  // Ensure the vertex array is in order of descending X coordinate\n  // (which is needed to ensure a subquadratic runtime), and then find\n  // the bounding box around the points.\n  vertices.sort(byX);\n\n  let i = vertices.length - 1;\n  const xmin = vertices[i].x;\n  const xmax = vertices[0].x;\n  let ymin = vertices[i].y;\n  let ymax = ymin;\n  const epsilon = 1e-12;\n\n  let a;\n  let b;\n  let c;\n  let A;\n  let B;\n  let G;\n\n  while (i--) {\n    if (vertices[i].y < ymin) {\n      ymin = vertices[i].y;\n    }\n    if (vertices[i].y > ymax) {\n      ymax = vertices[i].y;\n    }\n  }\n\n  // Find a supertriangle, which is a triangle that surrounds all the\n  // vertices. This is used like something of a sentinel value to remove\n  // cases in the main algorithm, and is removed before we return any\n  // results.\n\n  // Once found, put it in the \"open\" list. (The \"open\" list is for\n  // triangles who may still need to be considered; the \"closed\" list is\n  // for triangles which do not.)\n  let dx = xmax - xmin;\n  let dy = ymax - ymin;\n  const dmax = dx > dy ? dx : dy;\n  const xmid = (xmax + xmin) * 0.5;\n  const ymid = (ymax + ymin) * 0.5;\n  const open = [\n    new Triangle(\n      {\n        __sentinel: true,\n        x: xmid - 20 * dmax,\n        y: ymid - dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid,\n        y: ymid + 20 * dmax,\n      },\n      {\n        __sentinel: true,\n        x: xmid + 20 * dmax,\n        y: ymid - dmax,\n      }\n    ),\n  ];\n  const closed = [];\n  const edges: any = [];\n  let j;\n\n  // Incrementally add each vertex to the mesh.\n  i = vertices.length;\n  while (i--) {\n    // For each open triangle, check to see if the current point is\n    // inside it's circumcircle. If it is, remove the triangle and add\n    // it's edges to an edge list.\n    edges.length = 0;\n    j = open.length;\n    while (j--) {\n      // If this point is to the right of this triangle's circumcircle,\n      // then this triangle should never get checked again. Remove it\n      // from the open list, add it to the closed list, and skip.\n      dx = vertices[i].x - open[j].x;\n      if (dx > 0 && dx * dx > open[j].r) {\n        closed.push(open[j]);\n        open.splice(j, 1);\n        continue;\n      }\n\n      // If not, skip this triangle.\n      dy = vertices[i].y - open[j].y;\n      if (dx * dx + dy * dy > open[j].r) {\n        continue;\n      }\n\n      // Remove the triangle and add it's edges to the edge list.\n      edges.push(\n        open[j].a,\n        open[j].b,\n        open[j].b,\n        open[j].c,\n        open[j].c,\n        open[j].a\n      );\n      open.splice(j, 1);\n    }\n\n    // Remove any doubled edges.\n    dedup(edges);\n\n    // Add a new triangle for each edge.\n    j = edges.length;\n    while (j) {\n      b = edges[--j];\n      a = edges[--j];\n      c = vertices[i];\n      // Avoid adding colinear triangles (which have error-prone\n      // circumcircles)\n      A = b.x - a.x;\n      B = b.y - a.y;\n      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n      if (Math.abs(G) > epsilon) {\n        open.push(new Triangle(a, b, c));\n      }\n    }\n  }\n\n  // Copy any remaining open triangles to the closed list, and then\n  // remove any triangles that share a vertex with the supertriangle.\n  Array.prototype.push.apply(closed, open);\n\n  i = closed.length;\n  while (i--) {\n    if (\n      closed[i].a.__sentinel ||\n      closed[i].b.__sentinel ||\n      closed[i].c.__sentinel\n    ) {\n      closed.splice(i, 1);\n    }\n  }\n\n  return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"],"mappings":";AAGA,SAAS,mBAAmB,eAAe;AA6C3C,SAAS,IACP,QACA,GAC4B;AAE5B,MAAI,WAAW;AACf,SAAO;AAAA,IACL;AAAA,MACE,OAAO,SAAS,IAAI,CAAC,MAAM;AACzB,cAAM,QAAY;AAAA,UAChB,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,UAC3B,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,QAC7B;AACA,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE,WAAW,CAAC;AAAA,QAC1B,WAAW,EAAE,SAAS,YAAY,WAAW,GAAG;AAC9C,qBAAW;AACX,gBAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAAA,QACpC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,EAAE,IAAI,CAAC,aAAkB;AACvB,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,UAAI,aAAa,CAAC;AAIlB,UAAI,UAAU;AACZ,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AAAA,MACrB,OAAO;AACL,qBAAa;AAAA,UACX,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,QAChB;AAAA,MACF;AAEA,aAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU;AAAA,IAC3C,CAAC;AAAA,EACH;AACF;AAEA,IAAM,WAAN,MAAe;AAAA,EAQb,YAAY,GAAO,GAAO,GAAO;AAC/B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AAET,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AAC9C,QAAI;AACJ,QAAI;AAIJ,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1B;AACF;AAEA,SAAS,IAAI,GAAO,GAAO;AACzB,SAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAS,MAAM,OAAiB;AAC9B,MAAI,IAAI,MAAM;AACd,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,QAAO,QAAO,GAAG;AACf,QAAI,MAAM,EAAE,CAAC;AACb,QAAI,MAAM,EAAE,CAAC;AACb,QAAI;AACJ,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAK,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,GAAI;AAChD,cAAM,OAAO,GAAG,CAAC;AACjB,cAAM,OAAO,GAAG,CAAC;AACjB,aAAK;AACL,iBAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YAAY,UAAqB;AAExC,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAKA,WAAS,KAAK,GAAG;AAEjB,MAAI,IAAI,SAAS,SAAS;AAC1B,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,MAAI,OAAO,SAAS,CAAC,EAAE;AACvB,MAAI,OAAO;AACX,QAAM,UAAU;AAEhB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,SAAO,KAAK;AACV,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AACA,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAUA,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,OAAO;AAAA,IACX,IAAI;AAAA,MACF;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG;AAAA,QACH,GAAG,OAAO,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,CAAC;AAChB,QAAM,QAAa,CAAC;AACpB,MAAI;AAGJ,MAAI,SAAS;AACb,SAAO,KAAK;AAIV,UAAM,SAAS;AACf,QAAI,KAAK;AACT,WAAO,KAAK;AAIV,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC,eAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAK,OAAO,GAAG,CAAC;AAChB;AAAA,MACF;AAGA,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC;AAAA,MACF;AAGA,YAAM;AAAA,QACJ,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,MACV;AACA,WAAK,OAAO,GAAG,CAAC;AAAA,IAClB;AAGA,UAAM,KAAK;AAGX,QAAI,MAAM;AACV,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,SAAS,CAAC;AAGd,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACxC,UAAI,KAAK,IAAI,CAAC,IAAI,SAAS;AACzB,aAAK,KAAK,IAAI,SAAS,GAAG,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,QAAM,UAAU,KAAK,MAAM,QAAQ,IAAI;AAEvC,MAAI,OAAO;AACX,SAAO,KAAK;AACV,QACE,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,YACZ;AACA,aAAO,OAAO,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/tin/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@turf/tin",
-  "version": "7.2.0",
-  "description": "turf tin module",
+  "version": "7.3.0",
+  "description": "Takes a set of points and creates a Triangulated Irregular Network.",
   "author": "Turf Authors",
   "license": "MIT",
   "bugs": {
@@ -52,18 +52,18 @@
   },
   "devDependencies": {
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
+    "@types/tape": "^5.8.1",
     "benchmark": "^2.1.4",
     "npm-run-all": "^4.1.5",
     "tape": "^5.9.0",
-    "tsup": "^8.3.5",
-    "tsx": "^4.19.2",
-    "typescript": "^5.5.4"
+    "tsup": "^8.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3"
   },
   "dependencies": {
-    "@turf/helpers": "^7.2.0",
+    "@turf/helpers": "7.3.0",
     "@types/geojson": "^7946.0.10",
     "tslib": "^2.8.1"
   },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
+  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
 }

package/node_modules/@turf/transform-rotate/dist/cjs/index.cjs

@@ -30,9 +30,9 @@ function transformRotate(geojson, angle, options) {
   });
   return geojson;
 }
-var turf_transform_rotate_default = transformRotate;
+var index_default = transformRotate;
 
 
 
-exports.default = turf_transform_rotate_default; exports.transformRotate = transformRotate;
+exports.default = index_default; exports.transformRotate = transformRotate;
 //# sourceMappingURL=index.cjs.map

package/node_modules/@turf/transform-rotate/dist/cjs/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,0CAAyB;AACzB,mDAA6B;AAC7B,qDAA8B;AAC9B,2DAAiC;AACjC,oCAAsB;AACtB,kCAA0B;AAC1B,4CAA0B;AAC1B,wCAAgC;AAqBhC,SAAS,eAAA,CACP,OAAA,EACA,KAAA,EACA,OAAA,EAIG;AAEH,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,GAAA,CAAI,CAAC,+BAAA,OAAgB,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,oBAAoB,CAAA;AAC5D,EAAA,MAAM,MAAA,EAAQ,OAAA,CAAQ,KAAA;AACtB,EAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,MAAA;AAGvB,EAAA,GAAA,CAAI,CAAC,OAAA,EAAS,MAAM,IAAI,KAAA,CAAM,qBAAqB,CAAA;AACnD,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,EAAA,GAAa,MAAA,IAAU,KAAA,GAAQ,KAAA,CAAM,KAAK,CAAA;AACtD,IAAA,MAAM,IAAI,KAAA,CAAM,mBAAmB,CAAA;AAGrC,EAAA,GAAA,CAAI,MAAA,IAAU,CAAA,EAAG,OAAO,OAAA;AAGxB,EAAA,MAAM,WAAA,EAAa,MAAA,GAAA,KAAA,EAAA,MAAA,EAAS,gCAAA,OAAgB,CAAA;AAG5C,EAAA,GAAA,CAAI,OAAA,IAAW,MAAA,GAAS,OAAA,IAAW,KAAA,CAAA,EAAW,QAAA,EAAU,0BAAA,OAAa,CAAA;AAGrE,EAAA,6BAAA,OAAU,EAAS,QAAA,CAAU,WAAA,EAAa;AACxC,IAAA,MAAM,aAAA,EAAe,wCAAA,UAAa,EAAY,WAAW,CAAA;AACzD,IAAA,MAAM,WAAA,EAAa,aAAA,EAAe,KAAA;AAClC,IAAA,MAAM,SAAA,EAAW,0CAAA,UAAc,EAAY,WAAW,CAAA;AACtD,IAAA,MAAM,UAAA,EAAY,kCAAA;AAAA,MAChB,gDAAA,UAAiB,EAAY,QAAA,EAAU,UAAU;AAAA,IACnD,CAAA;AACA,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAC5B,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAAA,EAC9B,CAAC,CAAA;AACD,EAAA,OAAO,OAAA;AACT;AAGA,IAAO,8BAAA,EAAQ,eAAA;ADvCf;AACE;AACA;AACF,2FAAC","file":"/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","sourcesContent":[null,"import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/**\n * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n *\n * @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n *\n * //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON | GeometryCollection>(\n  geojson: T,\n  angle: number,\n  options?: {\n    pivot?: Coord;\n    mutate?: boolean;\n  }\n): T {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  const pivot = options.pivot;\n  const mutate = options.mutate;\n\n  // Input validation\n  if (!geojson) throw new Error(\"geojson is required\");\n  if (angle === undefined || angle === null || isNaN(angle))\n    throw new Error(\"angle is required\");\n\n  // Shortcut no-rotation\n  if (angle === 0) return geojson;\n\n  // Use centroid of GeoJSON if pivot is not provided\n  const pivotCoord = pivot ?? centroid(geojson);\n\n  // Clone geojson to avoid side effects\n  if (mutate === false || mutate === undefined) geojson = clone(geojson);\n\n  // Rotate each coordinate\n  coordEach(geojson, function (pointCoords) {\n    const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n    const finalAngle = initialAngle + angle;\n    const distance = rhumbDistance(pivotCoord, pointCoords);\n    const newCoords = getCoords(\n      rhumbDestination(pivotCoord, distance, finalAngle)\n    );\n    pointCoords[0] = newCoords[0];\n    pointCoords[1] = newCoords[1];\n  });\n  return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"]}
+{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,0CAAyB;AACzB,mDAA6B;AAC7B,qDAA8B;AAC9B,2DAAiC;AACjC,oCAAsB;AACtB,kCAA0B;AAC1B,4CAA0B;AAC1B,wCAAgC;AAqBhC,SAAS,eAAA,CACP,OAAA,EACA,KAAA,EACA,OAAA,EAIG;AAEH,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,GAAA,CAAI,CAAC,+BAAA,OAAgB,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,oBAAoB,CAAA;AAC5D,EAAA,MAAM,MAAA,EAAQ,OAAA,CAAQ,KAAA;AACtB,EAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,MAAA;AAGvB,EAAA,GAAA,CAAI,CAAC,OAAA,EAAS,MAAM,IAAI,KAAA,CAAM,qBAAqB,CAAA;AACnD,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,EAAA,GAAa,MAAA,IAAU,KAAA,GAAQ,KAAA,CAAM,KAAK,CAAA;AACtD,IAAA,MAAM,IAAI,KAAA,CAAM,mBAAmB,CAAA;AAGrC,EAAA,GAAA,CAAI,MAAA,IAAU,CAAA,EAAG,OAAO,OAAA;AAGxB,EAAA,MAAM,WAAA,EAAa,MAAA,GAAA,KAAA,EAAA,MAAA,EAAS,gCAAA,OAAgB,CAAA;AAG5C,EAAA,GAAA,CAAI,OAAA,IAAW,MAAA,GAAS,OAAA,IAAW,KAAA,CAAA,EAAW,QAAA,EAAU,0BAAA,OAAa,CAAA;AAGrE,EAAA,6BAAA,OAAU,EAAS,QAAA,CAAU,WAAA,EAAa;AACxC,IAAA,MAAM,aAAA,EAAe,wCAAA,UAAa,EAAY,WAAW,CAAA;AACzD,IAAA,MAAM,WAAA,EAAa,aAAA,EAAe,KAAA;AAClC,IAAA,MAAM,SAAA,EAAW,0CAAA,UAAc,EAAY,WAAW,CAAA;AACtD,IAAA,MAAM,UAAA,EAAY,kCAAA;AAAA,MAChB,gDAAA,UAAiB,EAAY,QAAA,EAAU,UAAU;AAAA,IACnD,CAAA;AACA,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAC5B,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAAA,EAC9B,CAAC,CAAA;AACD,EAAA,OAAO,OAAA;AACT;AAGA,IAAO,cAAA,EAAQ,eAAA;ADvCf;AACE;AACA;AACF,2EAAC","file":"/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","sourcesContent":[null,"import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/**\n * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n *\n * @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n *\n * //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON | GeometryCollection>(\n  geojson: T,\n  angle: number,\n  options?: {\n    pivot?: Coord;\n    mutate?: boolean;\n  }\n): T {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  const pivot = options.pivot;\n  const mutate = options.mutate;\n\n  // Input validation\n  if (!geojson) throw new Error(\"geojson is required\");\n  if (angle === undefined || angle === null || isNaN(angle))\n    throw new Error(\"angle is required\");\n\n  // Shortcut no-rotation\n  if (angle === 0) return geojson;\n\n  // Use centroid of GeoJSON if pivot is not provided\n  const pivotCoord = pivot ?? centroid(geojson);\n\n  // Clone geojson to avoid side effects\n  if (mutate === false || mutate === undefined) geojson = clone(geojson);\n\n  // Rotate each coordinate\n  coordEach(geojson, function (pointCoords) {\n    const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n    const finalAngle = initialAngle + angle;\n    const distance = rhumbDistance(pivotCoord, pointCoords);\n    const newCoords = getCoords(\n      rhumbDestination(pivotCoord, distance, finalAngle)\n    );\n    pointCoords[0] = newCoords[0];\n    pointCoords[1] = newCoords[1];\n  });\n  return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"]}

package/node_modules/@turf/transform-rotate/dist/esm/index.js

@@ -30,9 +30,9 @@ function transformRotate(geojson, angle, options) {
   });
   return geojson;
 }
-var turf_transform_rotate_default = transformRotate;
+var index_default = transformRotate;
 export {
-  turf_transform_rotate_default as default,
+  index_default as default,
   transformRotate
 };
 //# sourceMappingURL=index.js.map

package/node_modules/@turf/transform-rotate/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/**\n * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n *\n * @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n *\n * //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON | GeometryCollection>(\n  geojson: T,\n  angle: number,\n  options?: {\n    pivot?: Coord;\n    mutate?: boolean;\n  }\n): T {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  const pivot = options.pivot;\n  const mutate = options.mutate;\n\n  // Input validation\n  if (!geojson) throw new Error(\"geojson is required\");\n  if (angle === undefined || angle === null || isNaN(angle))\n    throw new Error(\"angle is required\");\n\n  // Shortcut no-rotation\n  if (angle === 0) return geojson;\n\n  // Use centroid of GeoJSON if pivot is not provided\n  const pivotCoord = pivot ?? centroid(geojson);\n\n  // Clone geojson to avoid side effects\n  if (mutate === false || mutate === undefined) geojson = clone(geojson);\n\n  // Rotate each coordinate\n  coordEach(geojson, function (pointCoords) {\n    const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n    const finalAngle = initialAngle + angle;\n    const distance = rhumbDistance(pivotCoord, pointCoords);\n    const newCoords = getCoords(\n      rhumbDestination(pivotCoord, distance, finalAngle)\n    );\n    pointCoords[0] = newCoords[0];\n    pointCoords[1] = newCoords[1];\n  });\n  return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,oBAAoB;AAC7B,SAAS,qBAAqB;AAC9B,SAAS,wBAAwB;AACjC,SAAS,aAAa;AACtB,SAAS,iBAAiB;AAC1B,SAAS,iBAAiB;AAC1B,SAAS,gBAAuB;AAqBhC,SAAS,gBACP,SACA,OACA,SAIG;AAEH,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC5D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAGvB,MAAI,CAAC,QAAS,OAAM,IAAI,MAAM,qBAAqB;AACnD,MAAI,UAAU,UAAa,UAAU,QAAQ,MAAM,KAAK;AACtD,UAAM,IAAI,MAAM,mBAAmB;AAGrC,MAAI,UAAU,EAAG,QAAO;AAGxB,QAAM,aAAa,wBAAS,SAAS,OAAO;AAG5C,MAAI,WAAW,SAAS,WAAW,OAAW,WAAU,MAAM,OAAO;AAGrE,YAAU,SAAS,SAAU,aAAa;AACxC,UAAM,eAAe,aAAa,YAAY,WAAW;AACzD,UAAM,aAAa,eAAe;AAClC,UAAM,WAAW,cAAc,YAAY,WAAW;AACtD,UAAM,YAAY;AAAA,MAChB,iBAAiB,YAAY,UAAU,UAAU;AAAA,IACnD;AACA,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAGA,IAAO,gCAAQ;","names":[]}
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/**\n * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n *\n * @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n *\n * //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON | GeometryCollection>(\n  geojson: T,\n  angle: number,\n  options?: {\n    pivot?: Coord;\n    mutate?: boolean;\n  }\n): T {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  const pivot = options.pivot;\n  const mutate = options.mutate;\n\n  // Input validation\n  if (!geojson) throw new Error(\"geojson is required\");\n  if (angle === undefined || angle === null || isNaN(angle))\n    throw new Error(\"angle is required\");\n\n  // Shortcut no-rotation\n  if (angle === 0) return geojson;\n\n  // Use centroid of GeoJSON if pivot is not provided\n  const pivotCoord = pivot ?? centroid(geojson);\n\n  // Clone geojson to avoid side effects\n  if (mutate === false || mutate === undefined) geojson = clone(geojson);\n\n  // Rotate each coordinate\n  coordEach(geojson, function (pointCoords) {\n    const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n    const finalAngle = initialAngle + angle;\n    const distance = rhumbDistance(pivotCoord, pointCoords);\n    const newCoords = getCoords(\n      rhumbDestination(pivotCoord, distance, finalAngle)\n    );\n    pointCoords[0] = newCoords[0];\n    pointCoords[1] = newCoords[1];\n  });\n  return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,oBAAoB;AAC7B,SAAS,qBAAqB;AAC9B,SAAS,wBAAwB;AACjC,SAAS,aAAa;AACtB,SAAS,iBAAiB;AAC1B,SAAS,iBAAiB;AAC1B,SAAS,gBAAuB;AAqBhC,SAAS,gBACP,SACA,OACA,SAIG;AAEH,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC5D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAGvB,MAAI,CAAC,QAAS,OAAM,IAAI,MAAM,qBAAqB;AACnD,MAAI,UAAU,UAAa,UAAU,QAAQ,MAAM,KAAK;AACtD,UAAM,IAAI,MAAM,mBAAmB;AAGrC,MAAI,UAAU,EAAG,QAAO;AAGxB,QAAM,aAAa,wBAAS,SAAS,OAAO;AAG5C,MAAI,WAAW,SAAS,WAAW,OAAW,WAAU,MAAM,OAAO;AAGrE,YAAU,SAAS,SAAU,aAAa;AACxC,UAAM,eAAe,aAAa,YAAY,WAAW;AACzD,UAAM,aAAa,eAAe;AAClC,UAAM,WAAW,cAAc,YAAY,WAAW;AACtD,UAAM,YAAY;AAAA,MAChB,iBAAiB,YAAY,UAAU,UAAU;AAAA,IACnD;AACA,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/transform-rotate/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@turf/transform-rotate",
-  "version": "7.2.0",
-  "description": "turf transform-rotate module",
+  "version": "7.3.0",
+  "description": "Rotates a geometry around its center or a given point.",
   "author": "Turf Authors",
   "contributors": [
     "Stefano Borghi <@stebogit>",
@@ -56,29 +56,29 @@
     "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
   },
   "devDependencies": {
-    "@turf/truncate": "^7.2.0",
+    "@turf/truncate": "7.3.0",
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
+    "@types/tape": "^5.8.1",
     "benchmark": "^2.1.4",
     "load-json-file": "^7.0.1",
     "npm-run-all": "^4.1.5",
     "tape": "^5.9.0",
-    "tsup": "^8.3.5",
-    "tsx": "^4.19.2",
-    "typescript": "^5.5.4",
-    "write-json-file": "^5.0.0"
+    "tsup": "^8.4.0",
+    "tsx": "^4.19.4",
+    "typescript": "^5.8.3",
+    "write-json-file": "^6.0.0"
   },
   "dependencies": {
-    "@turf/centroid": "^7.2.0",
-    "@turf/clone": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/invariant": "^7.2.0",
-    "@turf/meta": "^7.2.0",
-    "@turf/rhumb-bearing": "^7.2.0",
-    "@turf/rhumb-destination": "^7.2.0",
-    "@turf/rhumb-distance": "^7.2.0",
+    "@turf/centroid": "7.3.0",
+    "@turf/clone": "7.3.0",
+    "@turf/helpers": "7.3.0",
+    "@turf/invariant": "7.3.0",
+    "@turf/meta": "7.3.0",
+    "@turf/rhumb-bearing": "7.3.0",
+    "@turf/rhumb-destination": "7.3.0",
+    "@turf/rhumb-distance": "7.3.0",
     "@types/geojson": "^7946.0.10",
     "tslib": "^2.8.1"
   },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
+  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
 }