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

package/node_modules/@turf/clusters-dbscan/dist/cjs/index.d.cts

@@ -1,51 +0,0 @@
-import { GeoJsonProperties, FeatureCollection, Point } from 'geojson';
-import { Units } from '@turf/helpers';
-
-/**
- * Point classification within the cluster.
- *
- * @typedef {"core" | "edge" | "noise"} Dbscan
- */
-type Dbscan = "core" | "edge" | "noise";
-/**
- * Properties assigned to each clustered point.
- *
- * @extends GeoJsonProperties
- * @typedef {object} DbscanProps
- * @property {Dbscan} [dbscan] type of point it has been classified as
- * @property {number} [cluster] associated clusterId
- */
-type DbscanProps = GeoJsonProperties & {
-    dbscan?: Dbscan;
-    cluster?: number;
-};
-/**
- * Takes a set of {@link Point|points} and partition them into clusters according to {@link https://en.wikipedia.org/wiki/DBSCAN|DBSCAN's} data clustering algorithm.
- *
- * @function
- * @param {FeatureCollection<Point>} points to be clustered
- * @param {number} maxDistance Maximum Distance between any point of the cluster to generate the clusters (kilometers by default, see options)
- * @param {Object} [options={}] Optional parameters
- * @param {string} [options.units="kilometers"] in which `maxDistance` is expressed, can be degrees, radians, miles, or kilometers
- * @param {boolean} [options.mutate=false] Allows GeoJSON input to be mutated
- * @param {number} [options.minPoints=3] Minimum number of points to generate a single cluster,
- * points which do not meet this requirement will be classified as an 'edge' or 'noise'.
- * @returns {FeatureCollection<Point, DbscanProps>} Clustered Points with an additional two properties associated to each Feature:
- * - {number} cluster - the associated clusterId
- * - {string} dbscan - type of point it has been classified as ('core'|'edge'|'noise')
- * @example
- * // create random points with random z-values in their properties
- * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});
- * var maxDistance = 100;
- * var clustered = turf.clustersDbscan(points, maxDistance);
- *
- * //addToMap
- * var addToMap = [clustered];
- */
-declare function clustersDbscan(points: FeatureCollection<Point>, maxDistance: number, options?: {
-    units?: Units;
-    minPoints?: number;
-    mutate?: boolean;
-}): FeatureCollection<Point, DbscanProps>;
-
-export { type Dbscan, type DbscanProps, clustersDbscan, clustersDbscan as default };

package/node_modules/@turf/clusters-dbscan/dist/esm/index.d.ts

@@ -1,51 +0,0 @@
-import { GeoJsonProperties, FeatureCollection, Point } from 'geojson';
-import { Units } from '@turf/helpers';
-
-/**
- * Point classification within the cluster.
- *
- * @typedef {"core" | "edge" | "noise"} Dbscan
- */
-type Dbscan = "core" | "edge" | "noise";
-/**
- * Properties assigned to each clustered point.
- *
- * @extends GeoJsonProperties
- * @typedef {object} DbscanProps
- * @property {Dbscan} [dbscan] type of point it has been classified as
- * @property {number} [cluster] associated clusterId
- */
-type DbscanProps = GeoJsonProperties & {
-    dbscan?: Dbscan;
-    cluster?: number;
-};
-/**
- * Takes a set of {@link Point|points} and partition them into clusters according to {@link https://en.wikipedia.org/wiki/DBSCAN|DBSCAN's} data clustering algorithm.
- *
- * @function
- * @param {FeatureCollection<Point>} points to be clustered
- * @param {number} maxDistance Maximum Distance between any point of the cluster to generate the clusters (kilometers by default, see options)
- * @param {Object} [options={}] Optional parameters
- * @param {string} [options.units="kilometers"] in which `maxDistance` is expressed, can be degrees, radians, miles, or kilometers
- * @param {boolean} [options.mutate=false] Allows GeoJSON input to be mutated
- * @param {number} [options.minPoints=3] Minimum number of points to generate a single cluster,
- * points which do not meet this requirement will be classified as an 'edge' or 'noise'.
- * @returns {FeatureCollection<Point, DbscanProps>} Clustered Points with an additional two properties associated to each Feature:
- * - {number} cluster - the associated clusterId
- * - {string} dbscan - type of point it has been classified as ('core'|'edge'|'noise')
- * @example
- * // create random points with random z-values in their properties
- * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});
- * var maxDistance = 100;
- * var clustered = turf.clustersDbscan(points, maxDistance);
- *
- * //addToMap
- * var addToMap = [clustered];
- */
-declare function clustersDbscan(points: FeatureCollection<Point>, maxDistance: number, options?: {
-    units?: Units;
-    minPoints?: number;
-    mutate?: boolean;
-}): FeatureCollection<Point, DbscanProps>;
-
-export { type Dbscan, type DbscanProps, clustersDbscan, clustersDbscan as default };

package/node_modules/@turf/clusters-dbscan/dist/esm/index.js

@@ -1,110 +0,0 @@
-// index.ts
-import { clone } from "@turf/clone";
-import { distance } from "@turf/distance";
-import { degreesToRadians, lengthToDegrees } from "@turf/helpers";
-
-// lib/rbush-export.ts
-import lib from "rbush";
-var rbush = lib;
-
-// index.ts
-function clustersDbscan(points, maxDistance, options = {}) {
-  if (options.mutate !== true) points = clone(points);
-  const minPoints = options.minPoints || 3;
-  const latDistanceInDegrees = lengthToDegrees(maxDistance, options.units);
-  var tree = new rbush(points.features.length);
-  var visited = points.features.map((_) => false);
-  var assigned = points.features.map((_) => false);
-  var isnoise = points.features.map((_) => false);
-  var clusterIds = points.features.map((_) => -1);
-  tree.load(
-    points.features.map((point, index) => {
-      var [x, y] = point.geometry.coordinates;
-      return {
-        minX: x,
-        minY: y,
-        maxX: x,
-        maxY: y,
-        index
-      };
-    })
-  );
-  const regionQuery = (index) => {
-    const point = points.features[index];
-    const [x, y] = point.geometry.coordinates;
-    const minY = Math.max(y - latDistanceInDegrees, -90);
-    const maxY = Math.min(y + latDistanceInDegrees, 90);
-    const lonDistanceInDegrees = function() {
-      if (minY < 0 && maxY > 0) {
-        return latDistanceInDegrees;
-      }
-      if (Math.abs(minY) < Math.abs(maxY)) {
-        return latDistanceInDegrees / Math.cos(degreesToRadians(maxY));
-      } else {
-        return latDistanceInDegrees / Math.cos(degreesToRadians(minY));
-      }
-    }();
-    const minX = Math.max(x - lonDistanceInDegrees, -360);
-    const maxX = Math.min(x + lonDistanceInDegrees, 360);
-    const bbox = { minX, minY, maxX, maxY };
-    return tree.search(bbox).filter(
-      (neighbor) => {
-        const neighborIndex = neighbor.index;
-        const neighborPoint = points.features[neighborIndex];
-        const distanceInKm = distance(point, neighborPoint, {
-          units: "kilometers"
-        });
-        return distanceInKm <= maxDistance;
-      }
-    );
-  };
-  const expandCluster = (clusteredId, neighbors) => {
-    for (var i = 0; i < neighbors.length; i++) {
-      var neighbor = neighbors[i];
-      const neighborIndex = neighbor.index;
-      if (!visited[neighborIndex]) {
-        visited[neighborIndex] = true;
-        const nextNeighbors = regionQuery(neighborIndex);
-        if (nextNeighbors.length >= minPoints) {
-          neighbors.push(...nextNeighbors);
-        }
-      }
-      if (!assigned[neighborIndex]) {
-        assigned[neighborIndex] = true;
-        clusterIds[neighborIndex] = clusteredId;
-      }
-    }
-  };
-  var nextClusteredId = 0;
-  points.features.forEach((_, index) => {
-    if (visited[index]) return;
-    const neighbors = regionQuery(index);
-    if (neighbors.length >= minPoints) {
-      const clusteredId = nextClusteredId;
-      nextClusteredId++;
-      visited[index] = true;
-      expandCluster(clusteredId, neighbors);
-    } else {
-      isnoise[index] = true;
-    }
-  });
-  points.features.forEach((_, index) => {
-    var clusterPoint = points.features[index];
-    if (!clusterPoint.properties) {
-      clusterPoint.properties = {};
-    }
-    if (clusterIds[index] >= 0) {
-      clusterPoint.properties.dbscan = isnoise[index] ? "edge" : "core";
-      clusterPoint.properties.cluster = clusterIds[index];
-    } else {
-      clusterPoint.properties.dbscan = "noise";
-    }
-  });
-  return points;
-}
-var turf_clusters_dbscan_default = clustersDbscan;
-export {
-  clustersDbscan,
-  turf_clusters_dbscan_default as default
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/clusters-dbscan/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts","../../lib/rbush-export.ts"],"sourcesContent":["import { GeoJsonProperties, FeatureCollection, Point } from \"geojson\";\nimport { clone } from \"@turf/clone\";\nimport { distance } from \"@turf/distance\";\nimport { degreesToRadians, lengthToDegrees, Units } from \"@turf/helpers\";\nimport { rbush as RBush } from \"./lib/rbush-export.js\";\n\n/**\n * Point classification within the cluster.\n *\n * @typedef {\"core\" | \"edge\" | \"noise\"} Dbscan\n */\ntype Dbscan = \"core\" | \"edge\" | \"noise\";\n\n/**\n * Properties assigned to each clustered point.\n *\n * @extends GeoJsonProperties\n * @typedef {object} DbscanProps\n * @property {Dbscan} [dbscan] type of point it has been classified as\n * @property {number} [cluster] associated clusterId\n */\ntype DbscanProps = GeoJsonProperties & {\n  dbscan?: Dbscan;\n  cluster?: number;\n};\n\n// Structure of a point in the spatial index\ntype IndexedPoint = {\n  minX: number;\n  minY: number;\n  maxX: number;\n  maxY: number;\n  index: number;\n};\n\n/**\n * Takes a set of {@link Point|points} and partition them into clusters according to {@link https://en.wikipedia.org/wiki/DBSCAN|DBSCAN's} data clustering algorithm.\n *\n * @function\n * @param {FeatureCollection<Point>} points to be clustered\n * @param {number} maxDistance Maximum Distance between any point of the cluster to generate the clusters (kilometers by default, see options)\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.units=\"kilometers\"] in which `maxDistance` is expressed, can be degrees, radians, miles, or kilometers\n * @param {boolean} [options.mutate=false] Allows GeoJSON input to be mutated\n * @param {number} [options.minPoints=3] Minimum number of points to generate a single cluster,\n * points which do not meet this requirement will be classified as an 'edge' or 'noise'.\n * @returns {FeatureCollection<Point, DbscanProps>} Clustered Points with an additional two properties associated to each Feature:\n * - {number} cluster - the associated clusterId\n * - {string} dbscan - type of point it has been classified as ('core'|'edge'|'noise')\n * @example\n * // create random points with random z-values in their properties\n * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});\n * var maxDistance = 100;\n * var clustered = turf.clustersDbscan(points, maxDistance);\n *\n * //addToMap\n * var addToMap = [clustered];\n */\nfunction clustersDbscan(\n  points: FeatureCollection<Point>,\n  maxDistance: number,\n  options: {\n    units?: Units;\n    minPoints?: number;\n    mutate?: boolean;\n  } = {}\n): FeatureCollection<Point, DbscanProps> {\n  // Input validation being handled by Typescript\n  // collectionOf(points, 'Point', 'points must consist of a FeatureCollection of only Points');\n  // if (maxDistance === null || maxDistance === undefined) throw new Error('maxDistance is required');\n  // if (!(Math.sign(maxDistance) > 0)) throw new Error('maxDistance is invalid');\n  // if (!(minPoints === undefined || minPoints === null || Math.sign(minPoints) > 0)) throw new Error('options.minPoints is invalid');\n\n  // Clone points to prevent any mutations\n  if (options.mutate !== true) points = clone(points);\n\n  // Defaults\n  const minPoints = options.minPoints || 3;\n\n  // Calculate the distance in degrees for region queries\n  const latDistanceInDegrees = lengthToDegrees(maxDistance, options.units);\n\n  // Create a spatial index\n  var tree = new RBush(points.features.length);\n\n  // Keeps track of whether a point has been visited or not.\n  var visited = points.features.map((_) => false);\n\n  // Keeps track of whether a point is assigned to a cluster or not.\n  var assigned = points.features.map((_) => false);\n\n  // Keeps track of whether a point is noise|edge or not.\n  var isnoise = points.features.map((_) => false);\n\n  // Keeps track of the clusterId for each point\n  var clusterIds: number[] = points.features.map((_) => -1);\n\n  // Index each point for spatial queries\n  tree.load(\n    points.features.map((point, index) => {\n      var [x, y] = point.geometry.coordinates;\n      return {\n        minX: x,\n        minY: y,\n        maxX: x,\n        maxY: y,\n        index: index,\n      } as IndexedPoint;\n    })\n  );\n\n  // Function to find neighbors of a point within a given distance\n  const regionQuery = (index: number): IndexedPoint[] => {\n    const point = points.features[index];\n    const [x, y] = point.geometry.coordinates;\n\n    const minY = Math.max(y - latDistanceInDegrees, -90.0);\n    const maxY = Math.min(y + latDistanceInDegrees, 90.0);\n\n    const lonDistanceInDegrees = (function () {\n      // Handle the case where the bounding box crosses the poles\n      if (minY < 0 && maxY > 0) {\n        return latDistanceInDegrees;\n      }\n      if (Math.abs(minY) < Math.abs(maxY)) {\n        return latDistanceInDegrees / Math.cos(degreesToRadians(maxY));\n      } else {\n        return latDistanceInDegrees / Math.cos(degreesToRadians(minY));\n      }\n    })();\n\n    const minX = Math.max(x - lonDistanceInDegrees, -360.0);\n    const maxX = Math.min(x + lonDistanceInDegrees, 360.0);\n\n    // Calculate the bounding box for the region query\n    const bbox = { minX, minY, maxX, maxY };\n    return (tree.search(bbox) as ReadonlyArray<IndexedPoint>).filter(\n      (neighbor) => {\n        const neighborIndex = neighbor.index;\n        const neighborPoint = points.features[neighborIndex];\n        const distanceInKm = distance(point, neighborPoint, {\n          units: \"kilometers\",\n        });\n        return distanceInKm <= maxDistance;\n      }\n    );\n  };\n\n  // Function to expand a cluster\n  const expandCluster = (clusteredId: number, neighbors: IndexedPoint[]) => {\n    for (var i = 0; i < neighbors.length; i++) {\n      var neighbor = neighbors[i];\n      const neighborIndex = neighbor.index;\n      if (!visited[neighborIndex]) {\n        visited[neighborIndex] = true;\n        const nextNeighbors = regionQuery(neighborIndex);\n        if (nextNeighbors.length >= minPoints) {\n          neighbors.push(...nextNeighbors);\n        }\n      }\n      if (!assigned[neighborIndex]) {\n        assigned[neighborIndex] = true;\n        clusterIds[neighborIndex] = clusteredId;\n      }\n    }\n  };\n\n  // Main DBSCAN clustering algorithm\n  var nextClusteredId = 0;\n  points.features.forEach((_, index) => {\n    if (visited[index]) return;\n    const neighbors = regionQuery(index);\n    if (neighbors.length >= minPoints) {\n      const clusteredId = nextClusteredId;\n      nextClusteredId++;\n      visited[index] = true;\n      expandCluster(clusteredId, neighbors);\n    } else {\n      isnoise[index] = true;\n    }\n  });\n\n  // Assign DBSCAN properties to each point\n  points.features.forEach((_, index) => {\n    var clusterPoint = points.features[index];\n    if (!clusterPoint.properties) {\n      clusterPoint.properties = {};\n    }\n\n    if (clusterIds[index] >= 0) {\n      clusterPoint.properties.dbscan = isnoise[index] ? \"edge\" : \"core\";\n      clusterPoint.properties.cluster = clusterIds[index];\n    } else {\n      clusterPoint.properties.dbscan = \"noise\";\n    }\n  });\n\n  return points as FeatureCollection<Point, DbscanProps>;\n}\n\nexport { Dbscan, DbscanProps, clustersDbscan };\nexport default clustersDbscan;\n","// Get around problems with moduleResolution node16 and some older libraries.\n// Manifests as \"This expression is not callable ... has no call signatures\"\n// https://stackoverflow.com/a/74709714\n\nimport lib from \"rbush\";\n\nexport const rbush = lib as unknown as typeof lib.default;\n"],"mappings":";AACA,SAAS,aAAa;AACtB,SAAS,gBAAgB;AACzB,SAAS,kBAAkB,uBAA8B;;;ACCzD,OAAO,SAAS;AAET,IAAM,QAAQ;;;ADoDrB,SAAS,eACP,QACA,aACA,UAII,CAAC,GACkC;AAQvC,MAAI,QAAQ,WAAW,KAAM,UAAS,MAAM,MAAM;AAGlD,QAAM,YAAY,QAAQ,aAAa;AAGvC,QAAM,uBAAuB,gBAAgB,aAAa,QAAQ,KAAK;AAGvE,MAAI,OAAO,IAAI,MAAM,OAAO,SAAS,MAAM;AAG3C,MAAI,UAAU,OAAO,SAAS,IAAI,CAAC,MAAM,KAAK;AAG9C,MAAI,WAAW,OAAO,SAAS,IAAI,CAAC,MAAM,KAAK;AAG/C,MAAI,UAAU,OAAO,SAAS,IAAI,CAAC,MAAM,KAAK;AAG9C,MAAI,aAAuB,OAAO,SAAS,IAAI,CAAC,MAAM,EAAE;AAGxD,OAAK;AAAA,IACH,OAAO,SAAS,IAAI,CAAC,OAAO,UAAU;AACpC,UAAI,CAAC,GAAG,CAAC,IAAI,MAAM,SAAS;AAC5B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAGA,QAAM,cAAc,CAAC,UAAkC;AACrD,UAAM,QAAQ,OAAO,SAAS,KAAK;AACnC,UAAM,CAAC,GAAG,CAAC,IAAI,MAAM,SAAS;AAE9B,UAAM,OAAO,KAAK,IAAI,IAAI,sBAAsB,GAAK;AACrD,UAAM,OAAO,KAAK,IAAI,IAAI,sBAAsB,EAAI;AAEpD,UAAM,uBAAwB,WAAY;AAExC,UAAI,OAAO,KAAK,OAAO,GAAG;AACxB,eAAO;AAAA,MACT;AACA,UAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG;AACnC,eAAO,uBAAuB,KAAK,IAAI,iBAAiB,IAAI,CAAC;AAAA,MAC/D,OAAO;AACL,eAAO,uBAAuB,KAAK,IAAI,iBAAiB,IAAI,CAAC;AAAA,MAC/D;AAAA,IACF,EAAG;AAEH,UAAM,OAAO,KAAK,IAAI,IAAI,sBAAsB,IAAM;AACtD,UAAM,OAAO,KAAK,IAAI,IAAI,sBAAsB,GAAK;AAGrD,UAAM,OAAO,EAAE,MAAM,MAAM,MAAM,KAAK;AACtC,WAAQ,KAAK,OAAO,IAAI,EAAkC;AAAA,MACxD,CAAC,aAAa;AACZ,cAAM,gBAAgB,SAAS;AAC/B,cAAM,gBAAgB,OAAO,SAAS,aAAa;AACnD,cAAM,eAAe,SAAS,OAAO,eAAe;AAAA,UAClD,OAAO;AAAA,QACT,CAAC;AACD,eAAO,gBAAgB;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,CAAC,aAAqB,cAA8B;AACxE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAI,WAAW,UAAU,CAAC;AAC1B,YAAM,gBAAgB,SAAS;AAC/B,UAAI,CAAC,QAAQ,aAAa,GAAG;AAC3B,gBAAQ,aAAa,IAAI;AACzB,cAAM,gBAAgB,YAAY,aAAa;AAC/C,YAAI,cAAc,UAAU,WAAW;AACrC,oBAAU,KAAK,GAAG,aAAa;AAAA,QACjC;AAAA,MACF;AACA,UAAI,CAAC,SAAS,aAAa,GAAG;AAC5B,iBAAS,aAAa,IAAI;AAC1B,mBAAW,aAAa,IAAI;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAGA,MAAI,kBAAkB;AACtB,SAAO,SAAS,QAAQ,CAAC,GAAG,UAAU;AACpC,QAAI,QAAQ,KAAK,EAAG;AACpB,UAAM,YAAY,YAAY,KAAK;AACnC,QAAI,UAAU,UAAU,WAAW;AACjC,YAAM,cAAc;AACpB;AACA,cAAQ,KAAK,IAAI;AACjB,oBAAc,aAAa,SAAS;AAAA,IACtC,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF,CAAC;AAGD,SAAO,SAAS,QAAQ,CAAC,GAAG,UAAU;AACpC,QAAI,eAAe,OAAO,SAAS,KAAK;AACxC,QAAI,CAAC,aAAa,YAAY;AAC5B,mBAAa,aAAa,CAAC;AAAA,IAC7B;AAEA,QAAI,WAAW,KAAK,KAAK,GAAG;AAC1B,mBAAa,WAAW,SAAS,QAAQ,KAAK,IAAI,SAAS;AAC3D,mBAAa,WAAW,UAAU,WAAW,KAAK;AAAA,IACpD,OAAO;AACL,mBAAa,WAAW,SAAS;AAAA,IACnC;AAAA,EACF,CAAC;AAED,SAAO;AACT;AAGA,IAAO,+BAAQ;","names":[]}

package/node_modules/@turf/clusters-dbscan/package.json

@@ -1,89 +0,0 @@
-{
-  "name": "@turf/clusters-dbscan",
-  "version": "7.2.0",
-  "description": "turf clusters-dbscan module",
-  "author": "Turf Authors",
-  "contributors": [
-    "Lukasz <@uhho>",
-    "Denis Carriere <@DenisCarriere>",
-    "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",
-    "geojson",
-    "cluster",
-    "clusters",
-    "clustering",
-    "density",
-    "dbscan"
-  ],
-  "type": "module",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "./package.json": "./package.json",
-    ".": {
-      "import": {
-        "types": "./dist/esm/index.d.ts",
-        "default": "./dist/esm/index.js"
-      },
-      "require": {
-        "types": "./dist/cjs/index.d.cts",
-        "default": "./dist/cjs/index.cjs"
-      }
-    }
-  },
-  "sideEffects": false,
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "bench": "tsx bench.ts",
-    "build": "tsup --config ../../tsup.config.ts",
-    "docs": "tsx ../../scripts/generate-readmes.ts",
-    "test": "npm-run-all --npm-path npm test:*",
-    "test:tape": "tsx test.ts",
-    "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
-  },
-  "devDependencies": {
-    "@turf/centroid": "^7.2.0",
-    "@turf/clusters": "^7.2.0",
-    "@types/benchmark": "^2.1.5",
-    "@types/rbush": "^3.0.2",
-    "@types/tape": "^4.13.4",
-    "benchmark": "^2.1.4",
-    "chromatism": "^3.0.0",
-    "concaveman": "^1.2.1",
-    "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"
-  },
-  "dependencies": {
-    "@turf/clone": "^7.2.0",
-    "@turf/distance": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/meta": "^7.2.0",
-    "@types/geojson": "^7946.0.10",
-    "rbush": "^3.0.1",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
-}

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

@@ -1,63 +0,0 @@
-# @turf/clusters-kmeans
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## clustersKmeans
-
-Takes a set of [points][1] and partition them into clusters using the k-mean .
-It uses the [k-means algorithm][2]
-
-### Parameters
-
-*   `points` **[FeatureCollection][3]<[Point][1]>** to be clustered
-*   `options` **[Object][4]** Optional parameters (optional, default `{}`)
-
-    *   `options.numberOfClusters` **[number][5]** numberOfClusters that will be generated (optional, default `Math.sqrt(numberOfPoints/2)`)
-    *   `options.mutate` **[boolean][6]** allows GeoJSON input to be mutated (significant performance increase if true) (optional, default `false`)
-
-### Examples
-
-```javascript
-// create random points with random z-values in their properties
-var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});
-var options = {numberOfClusters: 7};
-var clustered = turf.clustersKmeans(points, options);
-
-//addToMap
-var addToMap = [clustered];
-```
-
-Returns **[FeatureCollection][3]<[Point][1]>** Clustered Points with an additional two properties associated to each Feature:*   {number} cluster - the associated clusterId
-*   {\[number, number]} centroid - Centroid of the cluster \[Longitude, Latitude]
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.1.2
-
-[2]: https://en.wikipedia.org/wiki/K-means_clustering
-
-[3]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-[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/clusters-kmeans
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

package/node_modules/@turf/clusters-kmeans/dist/cjs/index.cjs

@@ -1,29 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }// index.ts
-var _clone = require('@turf/clone');
-var _meta = require('@turf/meta');
-var _skmeans = require('skmeans'); var _skmeans2 = _interopRequireDefault(_skmeans);
-function clustersKmeans(points, options = {}) {
-  var count = points.features.length;
-  options.numberOfClusters = options.numberOfClusters || Math.round(Math.sqrt(count / 2));
-  if (options.numberOfClusters > count) options.numberOfClusters = count;
-  if (options.mutate !== true) points = _clone.clone.call(void 0, points);
-  var data = _meta.coordAll.call(void 0, points);
-  var initialCentroids = data.slice(0, options.numberOfClusters);
-  var skmeansResult = _skmeans2.default.call(void 0, data, options.numberOfClusters, initialCentroids);
-  var centroids = {};
-  skmeansResult.centroids.forEach(function(coord, idx) {
-    centroids[idx] = coord;
-  });
-  _meta.featureEach.call(void 0, points, function(point, index) {
-    var clusterId = skmeansResult.idxs[index];
-    point.properties.cluster = clusterId;
-    point.properties.centroid = centroids[clusterId];
-  });
-  return points;
-}
-var turf_clusters_kmeans_default = clustersKmeans;
-
-
-
-exports.clustersKmeans = clustersKmeans; exports.default = turf_clusters_kmeans_default;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/clusters-kmeans/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-clusters-kmeans/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,oCAAsB;AACtB,kCAAsC;AACtC,oFAAoB;AA4BpB,SAAS,cAAA,CACP,MAAA,EACA,QAAA,EAGI,CAAC,CAAA,EACkC;AAEvC,EAAA,IAAI,MAAA,EAAQ,MAAA,CAAO,QAAA,CAAS,MAAA;AAC5B,EAAA,OAAA,CAAQ,iBAAA,EACN,OAAA,CAAQ,iBAAA,GAAoB,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAC,CAAA;AAI7D,EAAA,GAAA,CAAI,OAAA,CAAQ,iBAAA,EAAmB,KAAA,EAAO,OAAA,CAAQ,iBAAA,EAAmB,KAAA;AAGjE,EAAA,GAAA,CAAI,OAAA,CAAQ,OAAA,IAAW,IAAA,EAAM,OAAA,EAAS,0BAAA,MAAY,CAAA;AAGlD,EAAA,IAAI,KAAA,EAAO,4BAAA,MAAe,CAAA;AAG1B,EAAA,IAAI,iBAAA,EAAmB,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,gBAAgB,CAAA;AAG7D,EAAA,IAAI,cAAA,EAAgB,+BAAA,IAAQ,EAAM,OAAA,CAAQ,gBAAA,EAAkB,gBAAgB,CAAA;AAG5E,EAAA,IAAI,UAAA,EAAsC,CAAC,CAAA;AAC3C,EAAC,aAAA,CAAc,SAAA,CAAyB,OAAA,CAAQ,QAAA,CAC9C,KAAA,EACA,GAAA,EACA;AACA,IAAA,SAAA,CAAU,GAAG,EAAA,EAAI,KAAA;AAAA,EACnB,CAAC,CAAA;AAGD,EAAA,+BAAA,MAAY,EAAQ,QAAA,CAAU,KAAA,EAAO,KAAA,EAAO;AAC1C,IAAA,IAAI,UAAA,EAAY,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACxC,IAAA,KAAA,CAAM,UAAA,CAAY,QAAA,EAAU,SAAA;AAC5B,IAAA,KAAA,CAAM,UAAA,CAAY,SAAA,EAAW,SAAA,CAAU,SAAS,CAAA;AAAA,EAClD,CAAC,CAAA;AAED,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,6BAAA,EAAQ,cAAA;ADvDf;AACE;AACA;AACF,wFAAC","file":"/home/runner/work/turf/turf/packages/turf-clusters-kmeans/dist/cjs/index.cjs","sourcesContent":[null,"import { FeatureCollection, Point, GeoJsonProperties } from \"geojson\";\nimport { clone } from \"@turf/clone\";\nimport { coordAll, featureEach } from \"@turf/meta\";\nimport skmeans from \"skmeans\";\n\ntype KmeansProps = GeoJsonProperties & {\n  cluster?: number;\n  centroid?: [number, number];\n};\n\n/**\n * Takes a set of {@link Point|points} and partition them into clusters using the k-mean .\n * It uses the [k-means algorithm](https://en.wikipedia.org/wiki/K-means_clustering)\n *\n * @function\n * @param {FeatureCollection<Point>} points to be clustered\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.numberOfClusters=Math.sqrt(numberOfPoints/2)] numberOfClusters that will be generated\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:\n * - {number} cluster - the associated clusterId\n * - {[number, number]} centroid - Centroid of the cluster [Longitude, Latitude]\n * @example\n * // create random points with random z-values in their properties\n * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});\n * var options = {numberOfClusters: 7};\n * var clustered = turf.clustersKmeans(points, options);\n *\n * //addToMap\n * var addToMap = [clustered];\n */\nfunction clustersKmeans(\n  points: FeatureCollection<Point>,\n  options: {\n    numberOfClusters?: number;\n    mutate?: boolean;\n  } = {}\n): FeatureCollection<Point, KmeansProps> {\n  // Default Params\n  var count = points.features.length;\n  options.numberOfClusters =\n    options.numberOfClusters || Math.round(Math.sqrt(count / 2));\n\n  // numberOfClusters can't be greater than the number of points\n  // fallbacks to count\n  if (options.numberOfClusters > count) options.numberOfClusters = count;\n\n  // Clone points to prevent any mutations (enabled by default)\n  if (options.mutate !== true) points = clone(points);\n\n  // collect points coordinates\n  var data = coordAll(points);\n\n  // create seed to avoid skmeans to drift\n  var initialCentroids = data.slice(0, options.numberOfClusters);\n\n  // create skmeans clusters\n  var skmeansResult = skmeans(data, options.numberOfClusters, initialCentroids);\n\n  // store centroids {clusterId: [number, number]}\n  var centroids: Record<string, number[]> = {};\n  (skmeansResult.centroids as number[][]).forEach(function (\n    coord: number[],\n    idx: number\n  ) {\n    centroids[idx] = coord;\n  });\n\n  // add associated cluster number\n  featureEach(points, function (point, index) {\n    var clusterId = skmeansResult.idxs[index];\n    point.properties!.cluster = clusterId;\n    point.properties!.centroid = centroids[clusterId];\n  });\n\n  return points as FeatureCollection<Point, KmeansProps>;\n}\n\nexport { clustersKmeans, KmeansProps };\nexport default clustersKmeans;\n"]}

package/node_modules/@turf/clusters-kmeans/dist/cjs/index.d.cts

@@ -1,33 +0,0 @@
-import { GeoJsonProperties, FeatureCollection, Point } from 'geojson';
-
-type KmeansProps = GeoJsonProperties & {
-    cluster?: number;
-    centroid?: [number, number];
-};
-/**
- * Takes a set of {@link Point|points} and partition them into clusters using the k-mean .
- * It uses the [k-means algorithm](https://en.wikipedia.org/wiki/K-means_clustering)
- *
- * @function
- * @param {FeatureCollection<Point>} points to be clustered
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.numberOfClusters=Math.sqrt(numberOfPoints/2)] numberOfClusters that will be generated
- * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)
- * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:
- * - {number} cluster - the associated clusterId
- * - {[number, number]} centroid - Centroid of the cluster [Longitude, Latitude]
- * @example
- * // create random points with random z-values in their properties
- * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});
- * var options = {numberOfClusters: 7};
- * var clustered = turf.clustersKmeans(points, options);
- *
- * //addToMap
- * var addToMap = [clustered];
- */
-declare function clustersKmeans(points: FeatureCollection<Point>, options?: {
-    numberOfClusters?: number;
-    mutate?: boolean;
-}): FeatureCollection<Point, KmeansProps>;
-
-export { type KmeansProps, clustersKmeans, clustersKmeans as default };

package/node_modules/@turf/clusters-kmeans/dist/esm/index.d.ts

@@ -1,33 +0,0 @@
-import { GeoJsonProperties, FeatureCollection, Point } from 'geojson';
-
-type KmeansProps = GeoJsonProperties & {
-    cluster?: number;
-    centroid?: [number, number];
-};
-/**
- * Takes a set of {@link Point|points} and partition them into clusters using the k-mean .
- * It uses the [k-means algorithm](https://en.wikipedia.org/wiki/K-means_clustering)
- *
- * @function
- * @param {FeatureCollection<Point>} points to be clustered
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.numberOfClusters=Math.sqrt(numberOfPoints/2)] numberOfClusters that will be generated
- * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)
- * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:
- * - {number} cluster - the associated clusterId
- * - {[number, number]} centroid - Centroid of the cluster [Longitude, Latitude]
- * @example
- * // create random points with random z-values in their properties
- * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});
- * var options = {numberOfClusters: 7};
- * var clustered = turf.clustersKmeans(points, options);
- *
- * //addToMap
- * var addToMap = [clustered];
- */
-declare function clustersKmeans(points: FeatureCollection<Point>, options?: {
-    numberOfClusters?: number;
-    mutate?: boolean;
-}): FeatureCollection<Point, KmeansProps>;
-
-export { type KmeansProps, clustersKmeans, clustersKmeans as default };

package/node_modules/@turf/clusters-kmeans/dist/esm/index.js

@@ -1,29 +0,0 @@
-// index.ts
-import { clone } from "@turf/clone";
-import { coordAll, featureEach } from "@turf/meta";
-import skmeans from "skmeans";
-function clustersKmeans(points, options = {}) {
-  var count = points.features.length;
-  options.numberOfClusters = options.numberOfClusters || Math.round(Math.sqrt(count / 2));
-  if (options.numberOfClusters > count) options.numberOfClusters = count;
-  if (options.mutate !== true) points = clone(points);
-  var data = coordAll(points);
-  var initialCentroids = data.slice(0, options.numberOfClusters);
-  var skmeansResult = skmeans(data, options.numberOfClusters, initialCentroids);
-  var centroids = {};
-  skmeansResult.centroids.forEach(function(coord, idx) {
-    centroids[idx] = coord;
-  });
-  featureEach(points, function(point, index) {
-    var clusterId = skmeansResult.idxs[index];
-    point.properties.cluster = clusterId;
-    point.properties.centroid = centroids[clusterId];
-  });
-  return points;
-}
-var turf_clusters_kmeans_default = clustersKmeans;
-export {
-  clustersKmeans,
-  turf_clusters_kmeans_default as default
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/clusters-kmeans/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { FeatureCollection, Point, GeoJsonProperties } from \"geojson\";\nimport { clone } from \"@turf/clone\";\nimport { coordAll, featureEach } from \"@turf/meta\";\nimport skmeans from \"skmeans\";\n\ntype KmeansProps = GeoJsonProperties & {\n  cluster?: number;\n  centroid?: [number, number];\n};\n\n/**\n * Takes a set of {@link Point|points} and partition them into clusters using the k-mean .\n * It uses the [k-means algorithm](https://en.wikipedia.org/wiki/K-means_clustering)\n *\n * @function\n * @param {FeatureCollection<Point>} points to be clustered\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.numberOfClusters=Math.sqrt(numberOfPoints/2)] numberOfClusters that will be generated\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:\n * - {number} cluster - the associated clusterId\n * - {[number, number]} centroid - Centroid of the cluster [Longitude, Latitude]\n * @example\n * // create random points with random z-values in their properties\n * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});\n * var options = {numberOfClusters: 7};\n * var clustered = turf.clustersKmeans(points, options);\n *\n * //addToMap\n * var addToMap = [clustered];\n */\nfunction clustersKmeans(\n  points: FeatureCollection<Point>,\n  options: {\n    numberOfClusters?: number;\n    mutate?: boolean;\n  } = {}\n): FeatureCollection<Point, KmeansProps> {\n  // Default Params\n  var count = points.features.length;\n  options.numberOfClusters =\n    options.numberOfClusters || Math.round(Math.sqrt(count / 2));\n\n  // numberOfClusters can't be greater than the number of points\n  // fallbacks to count\n  if (options.numberOfClusters > count) options.numberOfClusters = count;\n\n  // Clone points to prevent any mutations (enabled by default)\n  if (options.mutate !== true) points = clone(points);\n\n  // collect points coordinates\n  var data = coordAll(points);\n\n  // create seed to avoid skmeans to drift\n  var initialCentroids = data.slice(0, options.numberOfClusters);\n\n  // create skmeans clusters\n  var skmeansResult = skmeans(data, options.numberOfClusters, initialCentroids);\n\n  // store centroids {clusterId: [number, number]}\n  var centroids: Record<string, number[]> = {};\n  (skmeansResult.centroids as number[][]).forEach(function (\n    coord: number[],\n    idx: number\n  ) {\n    centroids[idx] = coord;\n  });\n\n  // add associated cluster number\n  featureEach(points, function (point, index) {\n    var clusterId = skmeansResult.idxs[index];\n    point.properties!.cluster = clusterId;\n    point.properties!.centroid = centroids[clusterId];\n  });\n\n  return points as FeatureCollection<Point, KmeansProps>;\n}\n\nexport { clustersKmeans, KmeansProps };\nexport default clustersKmeans;\n"],"mappings":";AACA,SAAS,aAAa;AACtB,SAAS,UAAU,mBAAmB;AACtC,OAAO,aAAa;AA4BpB,SAAS,eACP,QACA,UAGI,CAAC,GACkC;AAEvC,MAAI,QAAQ,OAAO,SAAS;AAC5B,UAAQ,mBACN,QAAQ,oBAAoB,KAAK,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;AAI7D,MAAI,QAAQ,mBAAmB,MAAO,SAAQ,mBAAmB;AAGjE,MAAI,QAAQ,WAAW,KAAM,UAAS,MAAM,MAAM;AAGlD,MAAI,OAAO,SAAS,MAAM;AAG1B,MAAI,mBAAmB,KAAK,MAAM,GAAG,QAAQ,gBAAgB;AAG7D,MAAI,gBAAgB,QAAQ,MAAM,QAAQ,kBAAkB,gBAAgB;AAG5E,MAAI,YAAsC,CAAC;AAC3C,EAAC,cAAc,UAAyB,QAAQ,SAC9C,OACA,KACA;AACA,cAAU,GAAG,IAAI;AAAA,EACnB,CAAC;AAGD,cAAY,QAAQ,SAAU,OAAO,OAAO;AAC1C,QAAI,YAAY,cAAc,KAAK,KAAK;AACxC,UAAM,WAAY,UAAU;AAC5B,UAAM,WAAY,WAAW,UAAU,SAAS;AAAA,EAClD,CAAC;AAED,SAAO;AACT;AAGA,IAAO,+BAAQ;","names":[]}

package/node_modules/@turf/clusters-kmeans/package.json

@@ -1,89 +0,0 @@
-{
-  "name": "@turf/clusters-kmeans",
-  "version": "7.2.0",
-  "description": "turf clusters-kmeans module",
-  "author": "Turf Authors",
-  "contributors": [
-    "David Gómez Matarrodona <@solzimer>",
-    "Stefano Borghi <@stebogit>",
-    "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",
-    "geojson",
-    "cluster",
-    "clusters",
-    "clustering",
-    "k-means"
-  ],
-  "type": "module",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "./package.json": "./package.json",
-    ".": {
-      "import": {
-        "types": "./dist/esm/index.d.ts",
-        "default": "./dist/esm/index.js"
-      },
-      "require": {
-        "types": "./dist/cjs/index.d.cts",
-        "default": "./dist/cjs/index.cjs"
-      }
-    }
-  },
-  "sideEffects": false,
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "bench": "tsx bench.ts",
-    "build": "tsup --config ../../tsup.config.ts",
-    "docs": "tsx ../../scripts/generate-readmes.ts",
-    "test": "npm-run-all --npm-path npm test:*",
-    "test:tape": "tsx test.ts",
-    "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
-  },
-  "devDependencies": {
-    "@turf/centroid": "^7.2.0",
-    "@turf/clusters": "^7.2.0",
-    "@turf/random": "^7.2.0",
-    "@types/benchmark": "^2.1.5",
-    "@types/skmeans": "^0.11.7",
-    "@types/tape": "^4.13.4",
-    "benchmark": "^2.1.4",
-    "chromatism": "^3.0.0",
-    "concaveman": "^1.2.1",
-    "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"
-  },
-  "dependencies": {
-    "@turf/clone": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/invariant": "^7.2.0",
-    "@turf/meta": "^7.2.0",
-    "@types/geojson": "^7946.0.10",
-    "skmeans": "0.9.7",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
-}