node-red-contrib-tak-registration 0.16.1 → 0.16.5

package/node_modules/@turf/tesselate/README.md

@@ -1,54 +0,0 @@
-# @turf/tesselate
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## tesselate
-
-Tesselates a polygon or multipolygon into a collection of triangle polygons
-using [earcut][1].
-
-### Parameters
-
-*   `poly` **[Feature][2]<([Polygon][3] | [MultiPolygon][4])>** the polygon to tesselate
-
-### Examples
-
-```javascript
-const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
-const triangles = turf.tesselate(poly);
-
-//addToMap
-const addToMap = [poly, triangles]
-```
-
-Returns **[FeatureCollection][5]<[Polygon][3]>** collection of polygon tesselations
-
-[1]: https://github.com/mapbox/earcut
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.2
-
-[3]: https://tools.ietf.org/html/rfc7946#section-3.1.6
-
-[4]: https://tools.ietf.org/html/rfc7946#section-3.1.7
-
-[5]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-<!-- This file is automatically generated. Please don't edit it directly. If you find an error, edit the source file of the module in question (likely index.js or index.ts), and re-run "yarn docs" from the root of the turf project. -->
-
----
-
-This module is part of the [Turfjs project](https://turfjs.org/), an open source module collection dedicated to geographic algorithms. It is maintained in the [Turfjs/turf](https://github.com/Turfjs/turf) repository, where you can create PRs and issues.
-
-### Installation
-
-Install this single module individually:
-
-```sh
-$ npm install @turf/tesselate
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

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

@@ -1,61 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }// index.ts
-var _earcut = require('earcut'); var _earcut2 = _interopRequireDefault(_earcut);
-var _helpers = require('@turf/helpers');
-function tesselate(poly) {
-  if (!poly.geometry || poly.geometry.type !== "Polygon" && poly.geometry.type !== "MultiPolygon") {
-    throw new Error("input must be a Polygon or MultiPolygon");
-  }
-  const fc = {
-    type: "FeatureCollection",
-    features: []
-  };
-  if (poly.geometry.type === "Polygon") {
-    fc.features = processPolygon(poly.geometry.coordinates);
-  } else {
-    poly.geometry.coordinates.forEach(function(coordinates) {
-      fc.features = fc.features.concat(processPolygon(coordinates));
-    });
-  }
-  return fc;
-}
-function processPolygon(coordinates) {
-  const data = flattenCoords(coordinates);
-  const dim = 2;
-  const result = _earcut2.default.call(void 0, data.vertices, data.holes, dim);
-  const features = [];
-  const vertices = [];
-  result.forEach(function(vert, i2) {
-    const index = result[i2];
-    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);
-  });
-  for (var i = 0; i < vertices.length; i += 3) {
-    const coords = vertices.slice(i, i + 3);
-    coords.push(vertices[i]);
-    features.push(_helpers.polygon.call(void 0, [coords]));
-  }
-  return features;
-}
-function flattenCoords(data) {
-  const dim = data[0][0].length, result = {
-    vertices: [],
-    holes: [],
-    dimensions: dim
-  };
-  let holeIndex = 0;
-  for (let i = 0; i < data.length; i++) {
-    for (let j = 0; j < data[i].length; j++) {
-      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);
-    }
-    if (i > 0) {
-      holeIndex += data[i - 1].length;
-      result.holes.push(holeIndex);
-    }
-  }
-  return result;
-}
-var turf_tesselate_default = tesselate;
-
-
-
-exports.default = turf_tesselate_default; exports.tesselate = tesselate;
-//# sourceMappingURL=index.cjs.map

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

@@ -1 +0,0 @@
-{"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"]}

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

@@ -1,19 +0,0 @@
-import { Feature, Polygon, MultiPolygon, FeatureCollection } from 'geojson';
-
-/**
- * Tesselates a polygon or multipolygon into a collection of triangle polygons
- * using [earcut](https://github.com/mapbox/earcut).
- *
- * @function
- * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate
- * @returns {FeatureCollection<Polygon>} collection of polygon tesselations
- * @example
- * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- * const triangles = turf.tesselate(poly);
- *
- * //addToMap
- * const addToMap = [poly, triangles]
- */
-declare function tesselate(poly: Feature<Polygon | MultiPolygon>): FeatureCollection<Polygon>;
-
-export { tesselate as default, tesselate };

package/node_modules/@turf/tesselate/dist/esm/index.d.ts

@@ -1,19 +0,0 @@
-import { Feature, Polygon, MultiPolygon, FeatureCollection } from 'geojson';
-
-/**
- * Tesselates a polygon or multipolygon into a collection of triangle polygons
- * using [earcut](https://github.com/mapbox/earcut).
- *
- * @function
- * @param {Feature<Polygon|MultiPolygon>} poly the polygon to tesselate
- * @returns {FeatureCollection<Polygon>} collection of polygon tesselations
- * @example
- * const poly = turf.polygon([[[11, 0], [22, 4], [31, 0], [31, 11], [21, 15], [11, 11], [11, 0]]]);
- * const triangles = turf.tesselate(poly);
- *
- * //addToMap
- * const addToMap = [poly, triangles]
- */
-declare function tesselate(poly: Feature<Polygon | MultiPolygon>): FeatureCollection<Polygon>;
-
-export { tesselate as default, tesselate };

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

@@ -1,61 +0,0 @@
-// index.ts
-import earcut from "earcut";
-import { polygon } from "@turf/helpers";
-function tesselate(poly) {
-  if (!poly.geometry || poly.geometry.type !== "Polygon" && poly.geometry.type !== "MultiPolygon") {
-    throw new Error("input must be a Polygon or MultiPolygon");
-  }
-  const fc = {
-    type: "FeatureCollection",
-    features: []
-  };
-  if (poly.geometry.type === "Polygon") {
-    fc.features = processPolygon(poly.geometry.coordinates);
-  } else {
-    poly.geometry.coordinates.forEach(function(coordinates) {
-      fc.features = fc.features.concat(processPolygon(coordinates));
-    });
-  }
-  return fc;
-}
-function processPolygon(coordinates) {
-  const data = flattenCoords(coordinates);
-  const dim = 2;
-  const result = earcut(data.vertices, data.holes, dim);
-  const features = [];
-  const vertices = [];
-  result.forEach(function(vert, i2) {
-    const index = result[i2];
-    vertices.push([data.vertices[index * dim], data.vertices[index * dim + 1]]);
-  });
-  for (var i = 0; i < vertices.length; i += 3) {
-    const coords = vertices.slice(i, i + 3);
-    coords.push(vertices[i]);
-    features.push(polygon([coords]));
-  }
-  return features;
-}
-function flattenCoords(data) {
-  const dim = data[0][0].length, result = {
-    vertices: [],
-    holes: [],
-    dimensions: dim
-  };
-  let holeIndex = 0;
-  for (let i = 0; i < data.length; i++) {
-    for (let j = 0; j < data[i].length; j++) {
-      for (let d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);
-    }
-    if (i > 0) {
-      holeIndex += data[i - 1].length;
-      result.holes.push(holeIndex);
-    }
-  }
-  return result;
-}
-var turf_tesselate_default = tesselate;
-export {
-  turf_tesselate_default as default,
-  tesselate
-};
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"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"]}

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

@@ -1,78 +0,0 @@
-{
-  "name": "@turf/tesselate",
-  "version": "7.2.0",
-  "description": "turf tesselate module",
-  "author": "Turf Authors",
-  "contributors": [
-    "Abel Vázquez <@AbelVM>",
-    "Morgan Herlocker <@morganherlocker>",
-    "Tom MacWright <@tmcw>",
-    "Vladimir Agafonkin <@mourner>"
-  ],
-  "license": "MIT",
-  "bugs": {
-    "url": "https://github.com/Turfjs/turf/issues"
-  },
-  "homepage": "https://github.com/Turfjs/turf",
-  "repository": {
-    "type": "git",
-    "url": "git://github.com/Turfjs/turf.git"
-  },
-  "funding": "https://opencollective.com/turf",
-  "publishConfig": {
-    "access": "public"
-  },
-  "keywords": [
-    "turf",
-    "turfjs",
-    "tesselation",
-    "earcut",
-    "polygon",
-    "triangles"
-  ],
-  "type": "module",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "./package.json": "./package.json",
-    ".": {
-      "import": {
-        "types": "./dist/esm/index.d.ts",
-        "default": "./dist/esm/index.js"
-      },
-      "require": {
-        "types": "./dist/cjs/index.d.cts",
-        "default": "./dist/cjs/index.cjs"
-      }
-    }
-  },
-  "sideEffects": false,
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "bench": "tsx bench.ts",
-    "build": "tsup --config ../../tsup.config.ts",
-    "docs": "tsx ../../scripts/generate-readmes.ts",
-    "test": "npm-run-all --npm-path npm test:*",
-    "test:tape": "tsx test.ts"
-  },
-  "devDependencies": {
-    "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
-    "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"
-  },
-  "dependencies": {
-    "@turf/helpers": "^7.2.0",
-    "@types/geojson": "^7946.0.10",
-    "earcut": "^2.2.4",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
-}

package/node_modules/@turf/tin/LICENSE

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

package/node_modules/@turf/tin/README.md

@@ -1,72 +0,0 @@
-# @turf/tin
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## tin
-
-Takes a set of [points][1] and creates a
-[Triangulated Irregular Network][2],
-or a TIN for short, returned as a collection of Polygons. These are often used
-for developing elevation contour maps or stepped heat visualizations.
-
-If an optional z-value property is provided then it is added as properties called `a`, `b`,
-and `c` representing its value at each of the points that represent the corners of the
-triangle.
-
-### Parameters
-
-*   `points` **[FeatureCollection][3]<[Point][1]>** input points
-*   `z` **[String][4]?** name of the property from which to pull z values
-    This is optional: if not given, then there will be no extra data added to the derived triangles.
-
-### Examples
-
-```javascript
-// generate some random point data
-var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});
-
-// add a random property to each point between 0 and 9
-for (var i = 0; i < points.features.length; i++) {
-  points.features[i].properties.z = ~~(Math.random() * 9);
-}
-var tin = turf.tin(points, 'z');
-
-//addToMap
-var addToMap = [tin, points]
-for (var i = 0; i < tin.features.length; i++) {
-  var properties  = tin.features[i].properties;
-  properties.fill = '#' + properties.a + properties.b + properties.c;
-}
-```
-
-Returns **[FeatureCollection][3]<[Polygon][5]>** TIN output
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.1.2
-
-[2]: http://en.wikipedia.org/wiki/Triangulated_irregular_network
-
-[3]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-[4]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String
-
-[5]: https://tools.ietf.org/html/rfc7946#section-3.1.6
-
-<!-- This file is automatically generated. Please don't edit it directly. If you find an error, edit the source file of the module in question (likely index.js or index.ts), and re-run "yarn docs" from the root of the turf project. -->
-
----
-
-This module is part of the [Turfjs project](https://turfjs.org/), an open source module collection dedicated to geographic algorithms. It is maintained in the [Turfjs/turf](https://github.com/Turfjs/turf) repository, where you can create PRs and issues.
-
-### Installation
-
-Install this single module individually:
-
-```sh
-$ npm install @turf/tin
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

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

@@ -1,192 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _helpers = require('@turf/helpers');
-function tin(points, z) {
-  let isPointZ = false;
-  return _helpers.featureCollection.call(void 0, 
-    triangulate(
-      points.features.map((p) => {
-        const point = {
-          x: p.geometry.coordinates[0],
-          y: p.geometry.coordinates[1]
-        };
-        if (z) {
-          point.z = p.properties[z];
-        } else if (p.geometry.coordinates.length === 3) {
-          isPointZ = true;
-          point.z = p.geometry.coordinates[2];
-        }
-        return point;
-      })
-    ).map((triangle) => {
-      const a = [triangle.a.x, triangle.a.y];
-      const b = [triangle.b.x, triangle.b.y];
-      const c = [triangle.c.x, triangle.c.y];
-      let properties = {};
-      if (isPointZ) {
-        a.push(triangle.a.z);
-        b.push(triangle.b.z);
-        c.push(triangle.c.z);
-      } else {
-        properties = {
-          a: triangle.a.z,
-          b: triangle.b.z,
-          c: triangle.c.z
-        };
-      }
-      return _helpers.polygon.call(void 0, [[a, b, c, a]], properties);
-    })
-  );
-}
-var Triangle = class {
-  constructor(a, b, c) {
-    this.a = a;
-    this.b = b;
-    this.c = c;
-    const A = b.x - a.x;
-    const B = b.y - a.y;
-    const C = c.x - a.x;
-    const D = c.y - a.y;
-    const E = A * (a.x + b.x) + B * (a.y + b.y);
-    const F = C * (a.x + c.x) + D * (a.y + c.y);
-    const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));
-    let dx;
-    let dy;
-    this.x = (D * E - B * F) / G;
-    this.y = (A * F - C * E) / G;
-    dx = this.x - a.x;
-    dy = this.y - a.y;
-    this.r = dx * dx + dy * dy;
-  }
-};
-function byX(a, b) {
-  return b.x - a.x;
-}
-function dedup(edges) {
-  let j = edges.length;
-  let a;
-  let b;
-  let i;
-  let m;
-  let n;
-  outer: while (j) {
-    b = edges[--j];
-    a = edges[--j];
-    i = j;
-    while (i) {
-      n = edges[--i];
-      m = edges[--i];
-      if (a === m && b === n || a === n && b === m) {
-        edges.splice(j, 2);
-        edges.splice(i, 2);
-        j -= 2;
-        continue outer;
-      }
-    }
-  }
-}
-function triangulate(vertices) {
-  if (vertices.length < 3) {
-    return [];
-  }
-  vertices.sort(byX);
-  let i = vertices.length - 1;
-  const xmin = vertices[i].x;
-  const xmax = vertices[0].x;
-  let ymin = vertices[i].y;
-  let ymax = ymin;
-  const epsilon = 1e-12;
-  let a;
-  let b;
-  let c;
-  let A;
-  let B;
-  let G;
-  while (i--) {
-    if (vertices[i].y < ymin) {
-      ymin = vertices[i].y;
-    }
-    if (vertices[i].y > ymax) {
-      ymax = vertices[i].y;
-    }
-  }
-  let dx = xmax - xmin;
-  let dy = ymax - ymin;
-  const dmax = dx > dy ? dx : dy;
-  const xmid = (xmax + xmin) * 0.5;
-  const ymid = (ymax + ymin) * 0.5;
-  const open = [
-    new Triangle(
-      {
-        __sentinel: true,
-        x: xmid - 20 * dmax,
-        y: ymid - dmax
-      },
-      {
-        __sentinel: true,
-        x: xmid,
-        y: ymid + 20 * dmax
-      },
-      {
-        __sentinel: true,
-        x: xmid + 20 * dmax,
-        y: ymid - dmax
-      }
-    )
-  ];
-  const closed = [];
-  const edges = [];
-  let j;
-  i = vertices.length;
-  while (i--) {
-    edges.length = 0;
-    j = open.length;
-    while (j--) {
-      dx = vertices[i].x - open[j].x;
-      if (dx > 0 && dx * dx > open[j].r) {
-        closed.push(open[j]);
-        open.splice(j, 1);
-        continue;
-      }
-      dy = vertices[i].y - open[j].y;
-      if (dx * dx + dy * dy > open[j].r) {
-        continue;
-      }
-      edges.push(
-        open[j].a,
-        open[j].b,
-        open[j].b,
-        open[j].c,
-        open[j].c,
-        open[j].a
-      );
-      open.splice(j, 1);
-    }
-    dedup(edges);
-    j = edges.length;
-    while (j) {
-      b = edges[--j];
-      a = edges[--j];
-      c = vertices[i];
-      A = b.x - a.x;
-      B = b.y - a.y;
-      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));
-      if (Math.abs(G) > epsilon) {
-        open.push(new Triangle(a, b, c));
-      }
-    }
-  }
-  Array.prototype.push.apply(closed, open);
-  i = closed.length;
-  while (i--) {
-    if (closed[i].a.__sentinel || closed[i].b.__sentinel || closed[i].c.__sentinel) {
-      closed.splice(i, 1);
-    }
-  }
-  return closed;
-}
-var turf_tin_default = tin;
-
-
-
-exports.default = turf_tin_default; exports.tin = tin;
-//# sourceMappingURL=index.cjs.map

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

@@ -1 +0,0 @@
-{"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"]}