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

package/node_modules/@turf/boolean-disjoint/dist/esm/index.js

@@ -1,143 +0,0 @@
-// index.ts
-import { booleanPointInPolygon } from "@turf/boolean-point-in-polygon";
-import { lineIntersect } from "@turf/line-intersect";
-import { flattenEach } from "@turf/meta";
-import { polygonToLine } from "@turf/polygon-to-line";
-function booleanDisjoint(feature1, feature2, {
-  ignoreSelfIntersections = true
-} = { ignoreSelfIntersections: true }) {
-  let bool = true;
-  flattenEach(feature1, (flatten1) => {
-    flattenEach(feature2, (flatten2) => {
-      if (bool === false) {
-        return false;
-      }
-      bool = disjoint(
-        flatten1.geometry,
-        flatten2.geometry,
-        ignoreSelfIntersections
-      );
-    });
-  });
-  return bool;
-}
-function disjoint(geom1, geom2, ignoreSelfIntersections) {
-  switch (geom1.type) {
-    case "Point":
-      switch (geom2.type) {
-        case "Point":
-          return !compareCoords(geom1.coordinates, geom2.coordinates);
-        case "LineString":
-          return !isPointOnLine(geom2, geom1);
-        case "Polygon":
-          return !booleanPointInPolygon(geom1, geom2);
-      }
-      break;
-    case "LineString":
-      switch (geom2.type) {
-        case "Point":
-          return !isPointOnLine(geom1, geom2);
-        case "LineString":
-          return !isLineOnLine(geom1, geom2, ignoreSelfIntersections);
-        case "Polygon":
-          return !isLineInPoly(geom2, geom1, ignoreSelfIntersections);
-      }
-      break;
-    case "Polygon":
-      switch (geom2.type) {
-        case "Point":
-          return !booleanPointInPolygon(geom2, geom1);
-        case "LineString":
-          return !isLineInPoly(geom1, geom2, ignoreSelfIntersections);
-        case "Polygon":
-          return !isPolyInPoly(geom2, geom1, ignoreSelfIntersections);
-      }
-  }
-  return false;
-}
-function isPointOnLine(lineString, pt) {
-  for (let i = 0; i < lineString.coordinates.length - 1; i++) {
-    if (isPointOnLineSegment(
-      lineString.coordinates[i],
-      lineString.coordinates[i + 1],
-      pt.coordinates
-    )) {
-      return true;
-    }
-  }
-  return false;
-}
-function isLineOnLine(lineString1, lineString2, ignoreSelfIntersections) {
-  const doLinesIntersect = lineIntersect(lineString1, lineString2, {
-    ignoreSelfIntersections
-  });
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isLineInPoly(polygon, lineString, ignoreSelfIntersections) {
-  for (const coord of lineString.coordinates) {
-    if (booleanPointInPolygon(coord, polygon)) {
-      return true;
-    }
-  }
-  const doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon), {
-    ignoreSelfIntersections
-  });
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isPolyInPoly(feature1, feature2, ignoreSelfIntersections) {
-  for (const coord1 of feature1.coordinates[0]) {
-    if (booleanPointInPolygon(coord1, feature2)) {
-      return true;
-    }
-  }
-  for (const coord2 of feature2.coordinates[0]) {
-    if (booleanPointInPolygon(coord2, feature1)) {
-      return true;
-    }
-  }
-  const doLinesIntersect = lineIntersect(
-    polygonToLine(feature1),
-    polygonToLine(feature2),
-    { ignoreSelfIntersections }
-  );
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt) {
-  const dxc = pt[0] - lineSegmentStart[0];
-  const dyc = pt[1] - lineSegmentStart[1];
-  const dxl = lineSegmentEnd[0] - lineSegmentStart[0];
-  const dyl = lineSegmentEnd[1] - lineSegmentStart[1];
-  const cross = dxc * dyl - dyc * dxl;
-  if (cross !== 0) {
-    return false;
-  }
-  if (Math.abs(dxl) >= Math.abs(dyl)) {
-    if (dxl > 0) {
-      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];
-    } else {
-      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-    }
-  } else if (dyl > 0) {
-    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];
-  } else {
-    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-  }
-}
-function compareCoords(pair1, pair2) {
-  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
-}
-var index_default = booleanDisjoint;
-export {
-  booleanDisjoint,
-  index_default as default
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/boolean-disjoint/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import {\n  Feature,\n  Geometry,\n  LineString,\n  Point,\n  Polygon,\n  Position,\n} from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { flattenEach } from \"@turf/meta\";\nimport { polygonToLine } from \"@turf/polygon-to-line\";\n\n/**\n * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.\n *\n * @function\n * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry\n * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry\n * @param {Object} [options={}] Optional parameters\n * @param {boolean} [options.ignoreSelfIntersections=true] ignore self-intersections on input features\n * @returns {boolean} true if the intersection is an empty set, false otherwise\n * @example\n * var point = turf.point([2, 2]);\n * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n *\n * turf.booleanDisjoint(line, point);\n * //=true\n */\nfunction booleanDisjoint(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry,\n  {\n    ignoreSelfIntersections = true,\n  }: {\n    ignoreSelfIntersections?: boolean;\n  } = { ignoreSelfIntersections: true }\n): boolean {\n  let bool = true;\n  flattenEach(feature1, (flatten1) => {\n    flattenEach(feature2, (flatten2) => {\n      if (bool === false) {\n        return false;\n      }\n      bool = disjoint(\n        flatten1.geometry,\n        flatten2.geometry,\n        ignoreSelfIntersections\n      );\n    });\n  });\n  return bool;\n}\n\n/**\n * Disjoint operation for simple Geometries (Point/LineString/Polygon)\n *\n * @private\n * @param {Geometry<any>} geom1 GeoJSON Geometry\n * @param {Geometry<any>} geom2 GeoJSON Geometry\n * @param {boolean} ignoreSelfIntersections ignore self-intersections on input features\n * @returns {boolean} true if disjoint, false otherwise\n */\nfunction disjoint(geom1: any, geom2: any, ignoreSelfIntersections: boolean) {\n  switch (geom1.type) {\n    case \"Point\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !compareCoords(geom1.coordinates, geom2.coordinates);\n        case \"LineString\":\n          return !isPointOnLine(geom2, geom1);\n        case \"Polygon\":\n          return !booleanPointInPolygon(geom1, geom2);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"LineString\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !isPointOnLine(geom1, geom2);\n        case \"LineString\":\n          return !isLineOnLine(geom1, geom2, ignoreSelfIntersections);\n        case \"Polygon\":\n          return !isLineInPoly(geom2, geom1, ignoreSelfIntersections);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"Polygon\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !booleanPointInPolygon(geom2, geom1);\n        case \"LineString\":\n          return !isLineInPoly(geom1, geom2, ignoreSelfIntersections);\n        case \"Polygon\":\n          return !isPolyInPoly(geom2, geom1, ignoreSelfIntersections);\n      }\n  }\n  return false;\n}\n\n// http://stackoverflow.com/a/11908158/1979085\nfunction isPointOnLine(lineString: LineString, pt: Point) {\n  for (let i = 0; i < lineString.coordinates.length - 1; i++) {\n    if (\n      isPointOnLineSegment(\n        lineString.coordinates[i],\n        lineString.coordinates[i + 1],\n        pt.coordinates\n      )\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction isLineOnLine(\n  lineString1: LineString,\n  lineString2: LineString,\n  ignoreSelfIntersections: boolean\n) {\n  const doLinesIntersect = lineIntersect(lineString1, lineString2, {\n    ignoreSelfIntersections,\n  });\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isLineInPoly(\n  polygon: Polygon,\n  lineString: LineString,\n  ignoreSelfIntersections: boolean\n) {\n  for (const coord of lineString.coordinates) {\n    if (booleanPointInPolygon(coord, polygon)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon), {\n    ignoreSelfIntersections,\n  });\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Is Polygon (geom1) in Polygon (geom2)\n * Only takes into account outer rings\n * See http://stackoverflow.com/a/4833823/1979085\n *\n * @private\n * @param {Geometry|Feature<Polygon>} feature1 Polygon1\n * @param {Geometry|Feature<Polygon>} feature2 Polygon2\n * @param {boolean} ignoreSelfIntersections ignore self-intersections on input features\n * @returns {boolean} true if geom1 is in geom2, false otherwise\n */\nfunction isPolyInPoly(\n  feature1: Polygon,\n  feature2: Polygon,\n  ignoreSelfIntersections: boolean\n) {\n  for (const coord1 of feature1.coordinates[0]) {\n    if (booleanPointInPolygon(coord1, feature2)) {\n      return true;\n    }\n  }\n  for (const coord2 of feature2.coordinates[0]) {\n    if (booleanPointInPolygon(coord2, feature1)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(\n    polygonToLine(feature1),\n    polygonToLine(feature2),\n    { ignoreSelfIntersections }\n  );\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isPointOnLineSegment(\n  lineSegmentStart: Position,\n  lineSegmentEnd: Position,\n  pt: Position\n) {\n  const dxc = pt[0] - lineSegmentStart[0];\n  const dyc = pt[1] - lineSegmentStart[1];\n  const dxl = lineSegmentEnd[0] - lineSegmentStart[0];\n  const dyl = lineSegmentEnd[1] - lineSegmentStart[1];\n  const cross = dxc * dyl - dyc * dxl;\n  if (cross !== 0) {\n    return false;\n  }\n  if (Math.abs(dxl) >= Math.abs(dyl)) {\n    if (dxl > 0) {\n      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];\n    } else {\n      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];\n    }\n  } else if (dyl > 0) {\n    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];\n  } else {\n    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];\n  }\n}\n\n/**\n * compareCoords\n *\n * @private\n * @param {Position} pair1 point [x,y]\n * @param {Position} pair2 point [x,y]\n * @returns {boolean} true if coord pairs match, false otherwise\n */\nfunction compareCoords(pair1: Position, pair2: Position) {\n  return pair1[0] === pair2[0] && pair1[1] === pair2[1];\n}\n\nexport { booleanDisjoint };\nexport default booleanDisjoint;\n"],"mappings":";AAQA,SAAS,6BAA6B;AACtC,SAAS,qBAAqB;AAC9B,SAAS,mBAAmB;AAC5B,SAAS,qBAAqB;AAkB9B,SAAS,gBACP,UACA,UACA;AAAA,EACE,0BAA0B;AAC5B,IAEI,EAAE,yBAAyB,KAAK,GAC3B;AACT,MAAI,OAAO;AACX,cAAY,UAAU,CAAC,aAAa;AAClC,gBAAY,UAAU,CAAC,aAAa;AAClC,UAAI,SAAS,OAAO;AAClB,eAAO;AAAA,MACT;AACA,aAAO;AAAA,QACL,SAAS;AAAA,QACT,SAAS;AAAA,QACT;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAWA,SAAS,SAAS,OAAY,OAAY,yBAAkC;AAC1E,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,MAAM,aAAa,MAAM,WAAW;AAAA,QAC5D,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,MAC9C;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,OAAO,uBAAuB;AAAA,QAC5D,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,OAAO,uBAAuB;AAAA,MAC9D;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,QAC5C,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,OAAO,uBAAuB;AAAA,QAC5D,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,OAAO,uBAAuB;AAAA,MAC9D;AAAA,EACJ;AACA,SAAO;AACT;AAGA,SAAS,cAAc,YAAwB,IAAW;AACxD,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,SAAS,GAAG,KAAK;AAC1D,QACE;AAAA,MACE,WAAW,YAAY,CAAC;AAAA,MACxB,WAAW,YAAY,IAAI,CAAC;AAAA,MAC5B,GAAG;AAAA,IACL,GACA;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aACP,aACA,aACA,yBACA;AACA,QAAM,mBAAmB,cAAc,aAAa,aAAa;AAAA,IAC/D;AAAA,EACF,CAAC;AACD,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,aACP,SACA,YACA,yBACA;AACA,aAAW,SAAS,WAAW,aAAa;AAC1C,QAAI,sBAAsB,OAAO,OAAO,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB,cAAc,YAAY,cAAc,OAAO,GAAG;AAAA,IACzE;AAAA,EACF,CAAC;AACD,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAaA,SAAS,aACP,UACA,UACA,yBACA;AACA,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB;AAAA,IACvB,cAAc,QAAQ;AAAA,IACtB,cAAc,QAAQ;AAAA,IACtB,EAAE,wBAAwB;AAAA,EAC5B;AACA,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,qBACP,kBACA,gBACA,IACA;AACA,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,QAAQ,MAAM,MAAM,MAAM;AAChC,MAAI,UAAU,GAAG;AACf,WAAO;AAAA,EACT;AACA,MAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,QAAI,MAAM,GAAG;AACX,aAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,IAClE,OAAO;AACL,aAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,IAClE;AAAA,EACF,WAAW,MAAM,GAAG;AAClB,WAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,EAClE,OAAO;AACL,WAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,EAClE;AACF;AAUA,SAAS,cAAc,OAAiB,OAAiB;AACvD,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC;AACtD;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/boolean-disjoint/package.json

@@ -1,79 +0,0 @@
-{
-  "name": "@turf/boolean-disjoint",
-  "version": "7.3.0",
-  "description": "Checks if two geometries have no overlapping areas.",
-  "author": "Turf Authors",
-  "contributors": [
-    "Rowan Winsemius <@rowanwins>",
-    "Denis Carriere <@DenisCarriere>"
-  ],
-  "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",
-    "disjoint",
-    "boolean",
-    "de-9im"
-  ],
-  "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": "^5.8.1",
-    "benchmark": "^2.1.4",
-    "boolean-shapely": "*",
-    "load-json-file": "^7.0.1",
-    "npm-run-all": "^4.1.5",
-    "tape": "^5.9.0",
-    "tsup": "^8.4.0",
-    "tsx": "^4.19.4",
-    "typescript": "^5.8.3"
-  },
-  "dependencies": {
-    "@turf/boolean-point-in-polygon": "7.3.0",
-    "@turf/helpers": "7.3.0",
-    "@turf/line-intersect": "7.3.0",
-    "@turf/meta": "7.3.0",
-    "@turf/polygon-to-line": "7.3.0",
-    "@types/geojson": "^7946.0.10",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
-}

package/node_modules/@turf/boolean-equal/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/boolean-equal/README.md

@@ -1,68 +0,0 @@
-# @turf/boolean-equal
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## booleanEqual
-
-Determine whether two geometries of the same type have identical X,Y coordinate values.
-See [http://edndoc.esri.com/arcsde/9.0/general\_topics/understand\_spatial\_relations.htm][1]
-
-### Parameters
-
-*   `feature1` **([Geometry][2] | [Feature][3])** GeoJSON input
-*   `feature2` **([Geometry][2] | [Feature][3])** GeoJSON input
-*   `options` **[Object][4]** Optional parameters (optional, default `{}`)
-
-    *   `options.precision` **[number][5]** decimal precision to use when comparing coordinates (optional, default `6`)
-
-### Examples
-
-```javascript
-var pt1 = turf.point([0, 0]);
-var pt2 = turf.point([0, 0]);
-var pt3 = turf.point([1, 1]);
-
-turf.booleanEqual(pt1, pt2);
-//= true
-turf.booleanEqual(pt2, pt3);
-//= false
-```
-
-Returns **[boolean][6]** true if the objects are equal, false otherwise
-
-[1]: http://edndoc.esri.com/arcsde/9.0/general_topics/understand_spatial_relations.htm
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.1
-
-[3]: https://tools.ietf.org/html/rfc7946#section-3.2
-
-[4]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object
-
-[5]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Number
-
-[6]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean
-
-<!-- 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/boolean-equal
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```
-
-
-### Diagrams
-
-![esri-equals](diagrams/esri-equals.gif)

package/node_modules/@turf/boolean-equal/dist/cjs/index.cjs

@@ -1,23 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _geojsonequalityts = require('geojson-equality-ts');
-var _cleancoords = require('@turf/clean-coords');
-var _invariant = require('@turf/invariant');
-function booleanEqual(feature1, feature2, options = {}) {
-  let precision = options.precision;
-  precision = precision === void 0 || precision === null || isNaN(precision) ? 6 : precision;
-  if (typeof precision !== "number" || !(precision >= 0)) {
-    throw new Error("precision must be a positive number");
-  }
-  const type1 = _invariant.getGeom.call(void 0, feature1).type;
-  const type2 = _invariant.getGeom.call(void 0, feature2).type;
-  if (type1 !== type2) return false;
-  return _geojsonequalityts.geojsonEquality.call(void 0, _cleancoords.cleanCoords.call(void 0, feature1), _cleancoords.cleanCoords.call(void 0, feature2), {
-    precision
-  });
-}
-var index_default = booleanEqual;
-
-
-
-exports.booleanEqual = booleanEqual; exports.default = index_default;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/boolean-equal/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-boolean-equal/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,wDAAgC;AAChC,iDAA4B;AAC5B,4CAAwB;AAsBxB,SAAS,YAAA,CACP,QAAA,EACA,QAAA,EACA,QAAA,EAEI,CAAC,CAAA,EACI;AACT,EAAA,IAAI,UAAA,EAAY,OAAA,CAAQ,SAAA;AAExB,EAAA,UAAA,EACE,UAAA,IAAc,KAAA,EAAA,GAAa,UAAA,IAAc,KAAA,GAAQ,KAAA,CAAM,SAAS,EAAA,EAC5D,EAAA,EACA,SAAA;AAEN,EAAA,GAAA,CAAI,OAAO,UAAA,IAAc,SAAA,GAAY,CAAA,CAAE,UAAA,GAAa,CAAA,CAAA,EAAI;AACtD,IAAA,MAAM,IAAI,KAAA,CAAM,qCAAqC,CAAA;AAAA,EACvD;AAEA,EAAA,MAAM,MAAA,EAAQ,gCAAA,QAAgB,CAAA,CAAE,IAAA;AAChC,EAAA,MAAM,MAAA,EAAQ,gCAAA,QAAgB,CAAA,CAAE,IAAA;AAChC,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,EAAO,OAAO,KAAA;AAE5B,EAAA,OAAO,gDAAA,sCAAgB,QAAoB,CAAA,EAAG,sCAAA,QAAoB,CAAA,EAAG;AAAA,IACnE;AAAA,EACF,CAAC,CAAA;AACH;AAGA,IAAO,cAAA,EAAQ,YAAA;ADnCf;AACE;AACA;AACF,qEAAC","file":"/home/runner/work/turf/turf/packages/turf-boolean-equal/dist/cjs/index.cjs","sourcesContent":[null,"import { Feature, Geometry } from \"geojson\";\nimport { geojsonEquality } from \"geojson-equality-ts\";\nimport { cleanCoords } from \"@turf/clean-coords\";\nimport { getGeom } from \"@turf/invariant\";\n\n/**\n * Determine whether two geometries of the same type have identical X,Y coordinate values.\n * See http://edndoc.esri.com/arcsde/9.0/general_topics/understand_spatial_relations.htm\n *\n * @function\n * @param {Geometry|Feature} feature1 GeoJSON input\n * @param {Geometry|Feature} feature2 GeoJSON input\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.precision=6] decimal precision to use when comparing coordinates\n * @returns {boolean} true if the objects are equal, false otherwise\n * @example\n * var pt1 = turf.point([0, 0]);\n * var pt2 = turf.point([0, 0]);\n * var pt3 = turf.point([1, 1]);\n *\n * turf.booleanEqual(pt1, pt2);\n * //= true\n * turf.booleanEqual(pt2, pt3);\n * //= false\n */\nfunction booleanEqual(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry,\n  options: {\n    precision?: number;\n  } = {}\n): boolean {\n  let precision = options.precision;\n\n  precision =\n    precision === undefined || precision === null || isNaN(precision)\n      ? 6\n      : precision;\n\n  if (typeof precision !== \"number\" || !(precision >= 0)) {\n    throw new Error(\"precision must be a positive number\");\n  }\n\n  const type1 = getGeom(feature1).type;\n  const type2 = getGeom(feature2).type;\n  if (type1 !== type2) return false;\n\n  return geojsonEquality(cleanCoords(feature1), cleanCoords(feature2), {\n    precision,\n  });\n}\n\nexport { booleanEqual };\nexport default booleanEqual;\n"]}

package/node_modules/@turf/boolean-equal/dist/cjs/index.d.cts

@@ -1,27 +0,0 @@
-import { Feature, Geometry } from 'geojson';
-
-/**
- * Determine whether two geometries of the same type have identical X,Y coordinate values.
- * See http://edndoc.esri.com/arcsde/9.0/general_topics/understand_spatial_relations.htm
- *
- * @function
- * @param {Geometry|Feature} feature1 GeoJSON input
- * @param {Geometry|Feature} feature2 GeoJSON input
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.precision=6] decimal precision to use when comparing coordinates
- * @returns {boolean} true if the objects are equal, false otherwise
- * @example
- * var pt1 = turf.point([0, 0]);
- * var pt2 = turf.point([0, 0]);
- * var pt3 = turf.point([1, 1]);
- *
- * turf.booleanEqual(pt1, pt2);
- * //= true
- * turf.booleanEqual(pt2, pt3);
- * //= false
- */
-declare function booleanEqual(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry, options?: {
-    precision?: number;
-}): boolean;
-
-export { booleanEqual, booleanEqual as default };

package/node_modules/@turf/boolean-equal/dist/esm/index.d.ts

@@ -1,27 +0,0 @@
-import { Feature, Geometry } from 'geojson';
-
-/**
- * Determine whether two geometries of the same type have identical X,Y coordinate values.
- * See http://edndoc.esri.com/arcsde/9.0/general_topics/understand_spatial_relations.htm
- *
- * @function
- * @param {Geometry|Feature} feature1 GeoJSON input
- * @param {Geometry|Feature} feature2 GeoJSON input
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.precision=6] decimal precision to use when comparing coordinates
- * @returns {boolean} true if the objects are equal, false otherwise
- * @example
- * var pt1 = turf.point([0, 0]);
- * var pt2 = turf.point([0, 0]);
- * var pt3 = turf.point([1, 1]);
- *
- * turf.booleanEqual(pt1, pt2);
- * //= true
- * turf.booleanEqual(pt2, pt3);
- * //= false
- */
-declare function booleanEqual(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry, options?: {
-    precision?: number;
-}): boolean;
-
-export { booleanEqual, booleanEqual as default };

package/node_modules/@turf/boolean-equal/dist/esm/index.js

@@ -1,23 +0,0 @@
-// index.ts
-import { geojsonEquality } from "geojson-equality-ts";
-import { cleanCoords } from "@turf/clean-coords";
-import { getGeom } from "@turf/invariant";
-function booleanEqual(feature1, feature2, options = {}) {
-  let precision = options.precision;
-  precision = precision === void 0 || precision === null || isNaN(precision) ? 6 : precision;
-  if (typeof precision !== "number" || !(precision >= 0)) {
-    throw new Error("precision must be a positive number");
-  }
-  const type1 = getGeom(feature1).type;
-  const type2 = getGeom(feature2).type;
-  if (type1 !== type2) return false;
-  return geojsonEquality(cleanCoords(feature1), cleanCoords(feature2), {
-    precision
-  });
-}
-var index_default = booleanEqual;
-export {
-  booleanEqual,
-  index_default as default
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/boolean-equal/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { Feature, Geometry } from \"geojson\";\nimport { geojsonEquality } from \"geojson-equality-ts\";\nimport { cleanCoords } from \"@turf/clean-coords\";\nimport { getGeom } from \"@turf/invariant\";\n\n/**\n * Determine whether two geometries of the same type have identical X,Y coordinate values.\n * See http://edndoc.esri.com/arcsde/9.0/general_topics/understand_spatial_relations.htm\n *\n * @function\n * @param {Geometry|Feature} feature1 GeoJSON input\n * @param {Geometry|Feature} feature2 GeoJSON input\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.precision=6] decimal precision to use when comparing coordinates\n * @returns {boolean} true if the objects are equal, false otherwise\n * @example\n * var pt1 = turf.point([0, 0]);\n * var pt2 = turf.point([0, 0]);\n * var pt3 = turf.point([1, 1]);\n *\n * turf.booleanEqual(pt1, pt2);\n * //= true\n * turf.booleanEqual(pt2, pt3);\n * //= false\n */\nfunction booleanEqual(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry,\n  options: {\n    precision?: number;\n  } = {}\n): boolean {\n  let precision = options.precision;\n\n  precision =\n    precision === undefined || precision === null || isNaN(precision)\n      ? 6\n      : precision;\n\n  if (typeof precision !== \"number\" || !(precision >= 0)) {\n    throw new Error(\"precision must be a positive number\");\n  }\n\n  const type1 = getGeom(feature1).type;\n  const type2 = getGeom(feature2).type;\n  if (type1 !== type2) return false;\n\n  return geojsonEquality(cleanCoords(feature1), cleanCoords(feature2), {\n    precision,\n  });\n}\n\nexport { booleanEqual };\nexport default booleanEqual;\n"],"mappings":";AACA,SAAS,uBAAuB;AAChC,SAAS,mBAAmB;AAC5B,SAAS,eAAe;AAsBxB,SAAS,aACP,UACA,UACA,UAEI,CAAC,GACI;AACT,MAAI,YAAY,QAAQ;AAExB,cACE,cAAc,UAAa,cAAc,QAAQ,MAAM,SAAS,IAC5D,IACA;AAEN,MAAI,OAAO,cAAc,YAAY,EAAE,aAAa,IAAI;AACtD,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AAEA,QAAM,QAAQ,QAAQ,QAAQ,EAAE;AAChC,QAAM,QAAQ,QAAQ,QAAQ,EAAE;AAChC,MAAI,UAAU,MAAO,QAAO;AAE5B,SAAO,gBAAgB,YAAY,QAAQ,GAAG,YAAY,QAAQ,GAAG;AAAA,IACnE;AAAA,EACF,CAAC;AACH;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/boolean-equal/package.json

@@ -1,82 +0,0 @@
-{
-  "name": "@turf/boolean-equal",
-  "version": "7.3.0",
-  "description": "Determine whether two geometries of the same type have identical X,Y coordinate values",
-  "author": "Turf Authors",
-  "contributors": [
-    "Tom MacWright <@tmcw>",
-    "Tim Channell <@tcql>",
-    "Stefano Borghi <@stebogit>"
-  ],
-  "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",
-    "gis",
-    "boolean",
-    "de-9im",
-    "equal",
-    "boolean-equal"
-  ],
-  "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": "^5.8.1",
-    "benchmark": "^2.1.4",
-    "boolean-shapely": "*",
-    "glob": "^11.0.2",
-    "load-json-file": "^7.0.1",
-    "npm-run-all": "^4.1.5",
-    "tape": "^5.9.0",
-    "tsup": "^8.4.0",
-    "tsx": "^4.19.4",
-    "typescript": "^5.8.3"
-  },
-  "dependencies": {
-    "@turf/clean-coords": "7.3.0",
-    "@turf/helpers": "7.3.0",
-    "@turf/invariant": "7.3.0",
-    "@types/geojson": "^7946.0.10",
-    "geojson-equality-ts": "^1.0.2",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
-}

package/node_modules/@turf/boolean-intersects/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/boolean-intersects/README.md

@@ -1,64 +0,0 @@
-# @turf/boolean-intersects
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## booleanIntersects
-
-Boolean-intersects returns (TRUE) if the intersection of the two geometries is NOT an empty set.
-
-### Parameters
-
-*   `feature1` **([Geometry][1] | [Feature][2]\<any>)** GeoJSON Feature or Geometry
-*   `feature2` **([Geometry][1] | [Feature][2]\<any>)** GeoJSON Feature or Geometry
-*   `options` **[Object][3]** Optional parameters (optional, default `{}`)
-
-    *   `options.ignoreSelfIntersections` **[boolean][4]** ignore self-intersections on input features (optional, default `true`)
-
-### Examples
-
-```javascript
-var point1 = turf.point([2, 2]);
-var point2 = turf.point([1, 2]);
-var line = turf.lineString([[1, 1], [1, 3], [1, 4]]);
-
-turf.booleanIntersects(line, point1);
-//=false
-
-turf.booleanIntersects(line, point2);
-//=true
-
-//addToMap
-var addToMap = [point1, point2, line];
-point1.properties['marker-color'] = '#f00'
-point2.properties['marker-color'] = '#0f0'
-```
-
-Returns **[boolean][4]** true if geometries intersect, false otherwise
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.1
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.2
-
-[3]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object
-
-[4]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean
-
-<!-- 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/boolean-intersects
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

package/node_modules/@turf/boolean-intersects/dist/cjs/index.cjs

@@ -1,25 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _booleandisjoint = require('@turf/boolean-disjoint');
-var _meta = require('@turf/meta');
-function booleanIntersects(feature1, feature2, {
-  ignoreSelfIntersections = true
-} = {}) {
-  let bool = false;
-  _meta.flattenEach.call(void 0, feature1, (flatten1) => {
-    _meta.flattenEach.call(void 0, feature2, (flatten2) => {
-      if (bool === true) {
-        return true;
-      }
-      bool = !_booleandisjoint.booleanDisjoint.call(void 0, flatten1.geometry, flatten2.geometry, {
-        ignoreSelfIntersections
-      });
-    });
-  });
-  return bool;
-}
-var index_default = booleanIntersects;
-
-
-
-exports.booleanIntersects = booleanIntersects; exports.default = index_default;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/boolean-intersects/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-boolean-intersects/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,yDAAgC;AAChC,kCAA4B;AA2B5B,SAAS,iBAAA,CACP,QAAA,EACA,QAAA,EACA;AAAA,EACE,wBAAA,EAA0B;AAC5B,EAAA,EAEI,CAAC,CAAA,EACL;AACA,EAAA,IAAI,KAAA,EAAO,KAAA;AACX,EAAA,+BAAA,QAAY,EAAU,CAAC,QAAA,EAAA,GAAa;AAClC,IAAA,+BAAA,QAAY,EAAU,CAAC,QAAA,EAAA,GAAa;AAClC,MAAA,GAAA,CAAI,KAAA,IAAS,IAAA,EAAM;AACjB,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,KAAA,EAAO,CAAC,8CAAA,QAAgB,CAAS,QAAA,EAAU,QAAA,CAAS,QAAA,EAAU;AAAA,QAC5D;AAAA,MACF,CAAC,CAAA;AAAA,IACH,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,IAAA;AACT;AAGA,IAAO,cAAA,EAAQ,iBAAA;ADjCf;AACE;AACA;AACF,+EAAC","file":"/home/runner/work/turf/turf/packages/turf-boolean-intersects/dist/cjs/index.cjs","sourcesContent":[null,"import { Feature, Geometry } from \"geojson\";\nimport { booleanDisjoint } from \"@turf/boolean-disjoint\";\nimport { flattenEach } from \"@turf/meta\";\n\n/**\n * Boolean-intersects returns (TRUE) if the intersection of the two geometries is NOT an empty set.\n *\n * @function\n * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry\n * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry\n * @param {Object} [options={}] Optional parameters\n * @param {boolean} [options.ignoreSelfIntersections=true] ignore self-intersections on input features\n * @returns {boolean} true if geometries intersect, false otherwise\n * @example\n * var point1 = turf.point([2, 2]);\n * var point2 = turf.point([1, 2]);\n * var line = turf.lineString([[1, 1], [1, 3], [1, 4]]);\n *\n * turf.booleanIntersects(line, point1);\n * //=false\n *\n * turf.booleanIntersects(line, point2);\n * //=true\n *\n * //addToMap\n * var addToMap = [point1, point2, line];\n * point1.properties['marker-color'] = '#f00'\n * point2.properties['marker-color'] = '#0f0'\n */\nfunction booleanIntersects(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry,\n  {\n    ignoreSelfIntersections = true,\n  }: {\n    ignoreSelfIntersections?: boolean;\n  } = {}\n) {\n  let bool = false;\n  flattenEach(feature1, (flatten1) => {\n    flattenEach(feature2, (flatten2) => {\n      if (bool === true) {\n        return true;\n      }\n      bool = !booleanDisjoint(flatten1.geometry, flatten2.geometry, {\n        ignoreSelfIntersections,\n      });\n    });\n  });\n  return bool;\n}\n\nexport { booleanIntersects };\nexport default booleanIntersects;\n"]}