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

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

@@ -1,28 +0,0 @@
-import { FeatureCollection, Polygon } from 'geojson';
-
-/**
- * Dissolves a FeatureCollection of {@link Polygon} features, filtered by an optional property name:value.
- * Note that {@link MultiPolygon} features within the collection are not supported
- *
- * @function
- * @param {FeatureCollection<Polygon>} featureCollection input feature collection to be dissolved
- * @param {Object} [options={}] Optional parameters
- * @param {string} [options.propertyName] features with the same `propertyName` value will be dissolved.
- * @returns {FeatureCollection<Polygon>} a FeatureCollection containing the dissolved polygons
- * @example
- * var features = turf.featureCollection([
- *   turf.polygon([[[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]], {combine: 'yes'}),
- *   turf.polygon([[[0, -1], [0, 0], [1, 0], [1, -1], [0,-1]]], {combine: 'yes'}),
- *   turf.polygon([[[1,-1],[1, 0], [2, 0], [2, -1], [1, -1]]], {combine: 'no'}),
- * ]);
- *
- * var dissolved = turf.dissolve(features, {propertyName: 'combine'});
- *
- * //addToMap
- * var addToMap = [features, dissolved]
- */
-declare function dissolve(fc: FeatureCollection<Polygon>, options?: {
-    propertyName?: string;
-}): FeatureCollection<Polygon>;
-
-export { dissolve as default, dissolve };

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

@@ -1,62 +0,0 @@
-// index.ts
-import { featureCollection, isObject, multiPolygon } from "@turf/helpers";
-import { collectionOf } from "@turf/invariant";
-import { featureEach } from "@turf/meta";
-import { flatten } from "@turf/flatten";
-import * as polyclip from "polyclip-ts";
-function dissolve(fc, options = {}) {
-  options = options || {};
-  if (!isObject(options)) throw new Error("options is invalid");
-  const { propertyName } = options;
-  collectionOf(fc, "Polygon", "dissolve");
-  const outFeatures = [];
-  if (!propertyName) {
-    return flatten(
-      multiPolygon(
-        polyclip.union.apply(
-          null,
-          // List of polygons expressed as Position[][][] a.k.a. Geom[]
-          fc.features.map(function(f) {
-            return f.geometry.coordinates;
-          })
-        )
-      )
-    );
-  } else {
-    const uniquePropertyVals = {};
-    featureEach(fc, function(feature) {
-      if (feature.properties) {
-        if (!Object.prototype.hasOwnProperty.call(
-          uniquePropertyVals,
-          feature.properties[propertyName]
-        )) {
-          uniquePropertyVals[feature.properties[propertyName]] = [];
-        }
-        uniquePropertyVals[feature.properties[propertyName]].push(feature);
-      }
-    });
-    const vals = Object.keys(uniquePropertyVals);
-    for (let i = 0; i < vals.length; i++) {
-      const mp = multiPolygon(
-        polyclip.union.apply(
-          null,
-          // List of polygons expressed as Position[][][] a.k.a. Geom[]
-          uniquePropertyVals[vals[i]].map(function(f) {
-            return f.geometry.coordinates;
-          })
-        )
-      );
-      if (mp && mp.properties) {
-        mp.properties[propertyName] = vals[i];
-        outFeatures.push(mp);
-      }
-    }
-  }
-  return flatten(featureCollection(outFeatures));
-}
-var index_default = dissolve;
-export {
-  index_default as default,
-  dissolve
-};
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { Feature, FeatureCollection, Polygon } from \"geojson\";\nimport { featureCollection, isObject, multiPolygon } from \"@turf/helpers\";\nimport { collectionOf } from \"@turf/invariant\";\nimport { featureEach } from \"@turf/meta\";\nimport { flatten } from \"@turf/flatten\";\nimport * as polyclip from \"polyclip-ts\";\n\n/**\n * Dissolves a FeatureCollection of {@link Polygon} features, filtered by an optional property name:value.\n * Note that {@link MultiPolygon} features within the collection are not supported\n *\n * @function\n * @param {FeatureCollection<Polygon>} featureCollection input feature collection to be dissolved\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.propertyName] features with the same `propertyName` value will be dissolved.\n * @returns {FeatureCollection<Polygon>} a FeatureCollection containing the dissolved polygons\n * @example\n * var features = turf.featureCollection([\n *   turf.polygon([[[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]], {combine: 'yes'}),\n *   turf.polygon([[[0, -1], [0, 0], [1, 0], [1, -1], [0,-1]]], {combine: 'yes'}),\n *   turf.polygon([[[1,-1],[1, 0], [2, 0], [2, -1], [1, -1]]], {combine: 'no'}),\n * ]);\n *\n * var dissolved = turf.dissolve(features, {propertyName: 'combine'});\n *\n * //addToMap\n * var addToMap = [features, dissolved]\n */\nfunction dissolve(\n  fc: FeatureCollection<Polygon>,\n  options: {\n    propertyName?: string;\n  } = {}\n): FeatureCollection<Polygon> {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  const { propertyName } = options;\n\n  // Input validation\n  collectionOf(fc, \"Polygon\", \"dissolve\");\n\n  // Main\n  const outFeatures = [];\n  if (!propertyName) {\n    return flatten(\n      multiPolygon(\n        polyclip.union.apply(\n          null,\n          // List of polygons expressed as Position[][][] a.k.a. Geom[]\n          fc.features.map(function (f) {\n            return f.geometry.coordinates;\n          }) as [polyclip.Geom, ...polyclip.Geom[]]\n        )\n      )\n    );\n  } else {\n    // Group polygons by the value of their property named by propertyName\n    const uniquePropertyVals: { [key: string]: Feature[] } = {};\n    featureEach(fc, function (feature) {\n      if (feature.properties) {\n        if (\n          !Object.prototype.hasOwnProperty.call(\n            uniquePropertyVals,\n            feature.properties[propertyName]\n          )\n        ) {\n          uniquePropertyVals[feature.properties[propertyName]] =\n            [] as Feature[];\n        }\n        uniquePropertyVals[feature.properties[propertyName]].push(feature);\n      }\n    });\n    const vals = Object.keys(uniquePropertyVals);\n\n    // Export each group of polygons as a separate feature.\n    for (let i = 0; i < vals.length; i++) {\n      const mp = multiPolygon(\n        polyclip.union.apply(\n          null,\n          // List of polygons expressed as Position[][][] a.k.a. Geom[]\n          (uniquePropertyVals[vals[i]] as Feature<Polygon>[]).map(function (f) {\n            return f.geometry.coordinates;\n          }) as [polyclip.Geom, ...polyclip.Geom[]]\n        )\n      );\n      if (mp && mp.properties) {\n        mp.properties[propertyName] = vals[i];\n        outFeatures.push(mp);\n      }\n    }\n  }\n\n  return flatten(featureCollection(outFeatures));\n}\n\nexport { dissolve };\nexport default dissolve;\n"],"mappings":";AACA,SAAS,mBAAmB,UAAU,oBAAoB;AAC1D,SAAS,oBAAoB;AAC7B,SAAS,mBAAmB;AAC5B,SAAS,eAAe;AACxB,YAAY,cAAc;AAuB1B,SAAS,SACP,IACA,UAEI,CAAC,GACuB;AAE5B,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC5D,QAAM,EAAE,aAAa,IAAI;AAGzB,eAAa,IAAI,WAAW,UAAU;AAGtC,QAAM,cAAc,CAAC;AACrB,MAAI,CAAC,cAAc;AACjB,WAAO;AAAA,MACL;AAAA,QACW,eAAM;AAAA,UACb;AAAA;AAAA,UAEA,GAAG,SAAS,IAAI,SAAU,GAAG;AAC3B,mBAAO,EAAE,SAAS;AAAA,UACpB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF,OAAO;AAEL,UAAM,qBAAmD,CAAC;AAC1D,gBAAY,IAAI,SAAU,SAAS;AACjC,UAAI,QAAQ,YAAY;AACtB,YACE,CAAC,OAAO,UAAU,eAAe;AAAA,UAC/B;AAAA,UACA,QAAQ,WAAW,YAAY;AAAA,QACjC,GACA;AACA,6BAAmB,QAAQ,WAAW,YAAY,CAAC,IACjD,CAAC;AAAA,QACL;AACA,2BAAmB,QAAQ,WAAW,YAAY,CAAC,EAAE,KAAK,OAAO;AAAA,MACnE;AAAA,IACF,CAAC;AACD,UAAM,OAAO,OAAO,KAAK,kBAAkB;AAG3C,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,KAAK;AAAA,QACA,eAAM;AAAA,UACb;AAAA;AAAA,UAEC,mBAAmB,KAAK,CAAC,CAAC,EAAyB,IAAI,SAAU,GAAG;AACnE,mBAAO,EAAE,SAAS;AAAA,UACpB,CAAC;AAAA,QACH;AAAA,MACF;AACA,UAAI,MAAM,GAAG,YAAY;AACvB,WAAG,WAAW,YAAY,IAAI,KAAK,CAAC;AACpC,oBAAY,KAAK,EAAE;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,QAAQ,kBAAkB,WAAW,CAAC;AAC/C;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/dissolve/package.json

@@ -1,76 +0,0 @@
-{
-  "name": "@turf/dissolve",
-  "version": "7.3.0",
-  "description": "Dissolves a FeatureCollection of Polygon features.",
-  "author": "Turf Authors",
-  "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",
-    "dissolve",
-    "gis",
-    "geojson",
-    "polygon"
-  ],
-  "type": "module",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "./package.json": "./package.json",
-    ".": {
-      "import": {
-        "types": "./dist/esm/index.d.ts",
-        "default": "./dist/esm/index.js"
-      },
-      "require": {
-        "types": "./dist/cjs/index.d.cts",
-        "default": "./dist/cjs/index.cjs"
-      }
-    }
-  },
-  "sideEffects": false,
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "bench": "tsx bench.ts",
-    "build": "tsup --config ../../tsup.config.ts",
-    "docs": "tsx ../../scripts/generate-readmes.ts",
-    "test": "npm-run-all --npm-path npm test:*",
-    "test:tape": "tsx test.ts"
-  },
-  "devDependencies": {
-    "@types/benchmark": "^2.1.5",
-    "@types/tape": "^5.8.1",
-    "benchmark": "^2.1.4",
-    "load-json-file": "^7.0.1",
-    "npm-run-all": "^4.1.5",
-    "tape": "^5.9.0",
-    "tsup": "^8.4.0",
-    "tsx": "^4.19.4",
-    "typescript": "^5.8.3",
-    "write-json-file": "^6.0.0"
-  },
-  "dependencies": {
-    "@turf/flatten": "7.3.0",
-    "@turf/helpers": "7.3.0",
-    "@turf/invariant": "7.3.0",
-    "@turf/meta": "7.3.0",
-    "@types/geojson": "^7946.0.10",
-    "polyclip-ts": "^0.16.8",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
-}

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

@@ -1,63 +0,0 @@
-# @turf/distance
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## distance
-
-Calculates the distance between two [coordinates][1] in degrees, radians, miles, or kilometers.
-This uses the [Haversine formula][2] to account for global curvature.
-
-### Parameters
-
-*   `from` **[Coord][1]** origin coordinate
-*   `to` **[Coord][1]** destination coordinate
-*   `options` **[Object][3]** Optional parameters (optional, default `{}`)
-
-    *   `options.units` **Units** Supports all valid Turf [Units][4]. (optional, default `'kilometers'`)
-
-### Examples
-
-```javascript
-var from = turf.point([-75.343, 39.984]);
-var to = turf.point([-75.534, 39.123]);
-var options = {units: 'miles'};
-
-var distance = turf.distance(from, to, options);
-
-//addToMap
-var addToMap = [from, to];
-from.properties.distance = distance;
-to.properties.distance = distance;
-```
-
-Returns **[number][5]** distance between the two coordinates
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.1.1
-
-[2]: http://en.wikipedia.org/wiki/Haversine_formula
-
-[3]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object
-
-[4]: https://turfjs.org/docs/api/types/Units
-
-[5]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Number
-
-<!-- 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/distance
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

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

@@ -1,22 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _invariant = require('@turf/invariant');
-var _helpers = require('@turf/helpers');
-function distance(from, to, options = {}) {
-  var coordinates1 = _invariant.getCoord.call(void 0, from);
-  var coordinates2 = _invariant.getCoord.call(void 0, to);
-  var dLat = _helpers.degreesToRadians.call(void 0, coordinates2[1] - coordinates1[1]);
-  var dLon = _helpers.degreesToRadians.call(void 0, coordinates2[0] - coordinates1[0]);
-  var lat1 = _helpers.degreesToRadians.call(void 0, coordinates1[1]);
-  var lat2 = _helpers.degreesToRadians.call(void 0, coordinates2[1]);
-  var a = Math.pow(Math.sin(dLat / 2), 2) + Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);
-  return _helpers.radiansToLength.call(void 0, 
-    2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)),
-    options.units
-  );
-}
-var index_default = distance;
-
-
-
-exports.default = index_default; exports.distance = distance;
-//# sourceMappingURL=index.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-distance/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACAA,4CAAyB;AACzB,wCAAgE;AA2BhE,SAAS,QAAA,CACP,IAAA,EACA,EAAA,EACA,QAAA,EAEI,CAAC,CAAA,EACL;AACA,EAAA,IAAI,aAAA,EAAe,iCAAA,IAAa,CAAA;AAChC,EAAA,IAAI,aAAA,EAAe,iCAAA,EAAW,CAAA;AAC9B,EAAA,IAAI,KAAA,EAAO,uCAAA,YAAiB,CAAa,CAAC,EAAA,EAAI,YAAA,CAAa,CAAC,CAAC,CAAA;AAC7D,EAAA,IAAI,KAAA,EAAO,uCAAA,YAAiB,CAAa,CAAC,EAAA,EAAI,YAAA,CAAa,CAAC,CAAC,CAAA;AAC7D,EAAA,IAAI,KAAA,EAAO,uCAAA,YAAiB,CAAa,CAAC,CAAC,CAAA;AAC3C,EAAA,IAAI,KAAA,EAAO,uCAAA,YAAiB,CAAa,CAAC,CAAC,CAAA;AAE3C,EAAA,IAAI,EAAA,EACF,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAC,CAAA,EAAG,CAAC,EAAA,EAC9B,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAC,CAAA,EAAG,CAAC,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,IAAI,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAElE,EAAA,OAAO,sCAAA;AAAA,IACL,EAAA,EAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,EAAA,EAAI,CAAC,CAAC,CAAA;AAAA,IAC7C,OAAA,CAAQ;AAAA,EACV,CAAA;AACF;AAGA,IAAO,cAAA,EAAQ,QAAA;ADpCf;AACE;AACA;AACF,6DAAC","file":"/home/runner/work/turf/turf/packages/turf-distance/dist/cjs/index.cjs","sourcesContent":[null,"import { getCoord } from \"@turf/invariant\";\nimport { radiansToLength, degreesToRadians, Coord, Units } from \"@turf/helpers\";\n\n//http://en.wikipedia.org/wiki/Haversine_formula\n//http://www.movable-type.co.uk/scripts/latlong.html\n\n/**\n * Calculates the distance between two {@link Coord|coordinates} in degrees, radians, miles, or kilometers.\n * This uses the [Haversine formula](http://en.wikipedia.org/wiki/Haversine_formula) to account for global curvature.\n *\n * @function\n * @param {Coord} from origin coordinate\n * @param {Coord} to destination coordinate\n * @param {Object} [options={}] Optional parameters\n * @param {Units} [options.units='kilometers'] Supports all valid Turf {@link https://turfjs.org/docs/api/types/Units Units}.\n * @returns {number} distance between the two coordinates\n * @example\n * var from = turf.point([-75.343, 39.984]);\n * var to = turf.point([-75.534, 39.123]);\n * var options = {units: 'miles'};\n *\n * var distance = turf.distance(from, to, options);\n *\n * //addToMap\n * var addToMap = [from, to];\n * from.properties.distance = distance;\n * to.properties.distance = distance;\n */\nfunction distance(\n  from: Coord,\n  to: Coord,\n  options: {\n    units?: Units;\n  } = {}\n) {\n  var coordinates1 = getCoord(from);\n  var coordinates2 = getCoord(to);\n  var dLat = degreesToRadians(coordinates2[1] - coordinates1[1]);\n  var dLon = degreesToRadians(coordinates2[0] - coordinates1[0]);\n  var lat1 = degreesToRadians(coordinates1[1]);\n  var lat2 = degreesToRadians(coordinates2[1]);\n\n  var a =\n    Math.pow(Math.sin(dLat / 2), 2) +\n    Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);\n\n  return radiansToLength(\n    2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)),\n    options.units\n  );\n}\n\nexport { distance };\nexport default distance;\n"]}

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

@@ -1,29 +0,0 @@
-import { Coord, Units } from '@turf/helpers';
-
-/**
- * Calculates the distance between two {@link Coord|coordinates} in degrees, radians, miles, or kilometers.
- * This uses the [Haversine formula](http://en.wikipedia.org/wiki/Haversine_formula) to account for global curvature.
- *
- * @function
- * @param {Coord} from origin coordinate
- * @param {Coord} to destination coordinate
- * @param {Object} [options={}] Optional parameters
- * @param {Units} [options.units='kilometers'] Supports all valid Turf {@link https://turfjs.org/docs/api/types/Units Units}.
- * @returns {number} distance between the two coordinates
- * @example
- * var from = turf.point([-75.343, 39.984]);
- * var to = turf.point([-75.534, 39.123]);
- * var options = {units: 'miles'};
- *
- * var distance = turf.distance(from, to, options);
- *
- * //addToMap
- * var addToMap = [from, to];
- * from.properties.distance = distance;
- * to.properties.distance = distance;
- */
-declare function distance(from: Coord, to: Coord, options?: {
-    units?: Units;
-}): number;
-
-export { distance as default, distance };

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

@@ -1,29 +0,0 @@
-import { Coord, Units } from '@turf/helpers';
-
-/**
- * Calculates the distance between two {@link Coord|coordinates} in degrees, radians, miles, or kilometers.
- * This uses the [Haversine formula](http://en.wikipedia.org/wiki/Haversine_formula) to account for global curvature.
- *
- * @function
- * @param {Coord} from origin coordinate
- * @param {Coord} to destination coordinate
- * @param {Object} [options={}] Optional parameters
- * @param {Units} [options.units='kilometers'] Supports all valid Turf {@link https://turfjs.org/docs/api/types/Units Units}.
- * @returns {number} distance between the two coordinates
- * @example
- * var from = turf.point([-75.343, 39.984]);
- * var to = turf.point([-75.534, 39.123]);
- * var options = {units: 'miles'};
- *
- * var distance = turf.distance(from, to, options);
- *
- * //addToMap
- * var addToMap = [from, to];
- * from.properties.distance = distance;
- * to.properties.distance = distance;
- */
-declare function distance(from: Coord, to: Coord, options?: {
-    units?: Units;
-}): number;
-
-export { distance as default, distance };

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

@@ -1,22 +0,0 @@
-// index.ts
-import { getCoord } from "@turf/invariant";
-import { radiansToLength, degreesToRadians } from "@turf/helpers";
-function distance(from, to, options = {}) {
-  var coordinates1 = getCoord(from);
-  var coordinates2 = getCoord(to);
-  var dLat = degreesToRadians(coordinates2[1] - coordinates1[1]);
-  var dLon = degreesToRadians(coordinates2[0] - coordinates1[0]);
-  var lat1 = degreesToRadians(coordinates1[1]);
-  var lat2 = degreesToRadians(coordinates2[1]);
-  var a = Math.pow(Math.sin(dLat / 2), 2) + Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);
-  return radiansToLength(
-    2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)),
-    options.units
-  );
-}
-var index_default = distance;
-export {
-  index_default as default,
-  distance
-};
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { getCoord } from \"@turf/invariant\";\nimport { radiansToLength, degreesToRadians, Coord, Units } from \"@turf/helpers\";\n\n//http://en.wikipedia.org/wiki/Haversine_formula\n//http://www.movable-type.co.uk/scripts/latlong.html\n\n/**\n * Calculates the distance between two {@link Coord|coordinates} in degrees, radians, miles, or kilometers.\n * This uses the [Haversine formula](http://en.wikipedia.org/wiki/Haversine_formula) to account for global curvature.\n *\n * @function\n * @param {Coord} from origin coordinate\n * @param {Coord} to destination coordinate\n * @param {Object} [options={}] Optional parameters\n * @param {Units} [options.units='kilometers'] Supports all valid Turf {@link https://turfjs.org/docs/api/types/Units Units}.\n * @returns {number} distance between the two coordinates\n * @example\n * var from = turf.point([-75.343, 39.984]);\n * var to = turf.point([-75.534, 39.123]);\n * var options = {units: 'miles'};\n *\n * var distance = turf.distance(from, to, options);\n *\n * //addToMap\n * var addToMap = [from, to];\n * from.properties.distance = distance;\n * to.properties.distance = distance;\n */\nfunction distance(\n  from: Coord,\n  to: Coord,\n  options: {\n    units?: Units;\n  } = {}\n) {\n  var coordinates1 = getCoord(from);\n  var coordinates2 = getCoord(to);\n  var dLat = degreesToRadians(coordinates2[1] - coordinates1[1]);\n  var dLon = degreesToRadians(coordinates2[0] - coordinates1[0]);\n  var lat1 = degreesToRadians(coordinates1[1]);\n  var lat2 = degreesToRadians(coordinates2[1]);\n\n  var a =\n    Math.pow(Math.sin(dLat / 2), 2) +\n    Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);\n\n  return radiansToLength(\n    2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)),\n    options.units\n  );\n}\n\nexport { distance };\nexport default distance;\n"],"mappings":";AAAA,SAAS,gBAAgB;AACzB,SAAS,iBAAiB,wBAAsC;AA2BhE,SAAS,SACP,MACA,IACA,UAEI,CAAC,GACL;AACA,MAAI,eAAe,SAAS,IAAI;AAChC,MAAI,eAAe,SAAS,EAAE;AAC9B,MAAI,OAAO,iBAAiB,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC;AAC7D,MAAI,OAAO,iBAAiB,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC;AAC7D,MAAI,OAAO,iBAAiB,aAAa,CAAC,CAAC;AAC3C,MAAI,OAAO,iBAAiB,aAAa,CAAC,CAAC;AAE3C,MAAI,IACF,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,IAC9B,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AAElE,SAAO;AAAA,IACL,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,IAC7C,QAAQ;AAAA,EACV;AACF;AAGA,IAAO,gBAAQ;","names":[]}

package/node_modules/@turf/distance/package.json

@@ -1,72 +0,0 @@
-{
-  "name": "@turf/distance",
-  "version": "7.3.0",
-  "description": "Measures the straight-line distance between two points, like cities or landmarks.",
-  "author": "Turf Authors",
-  "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",
-    "distance",
-    "miles",
-    "km"
-  ],
-  "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",
-    "load-json-file": "^7.0.1",
-    "npm-run-all": "^4.1.5",
-    "tape": "^5.9.0",
-    "tsup": "^8.4.0",
-    "tsx": "^4.19.4",
-    "typescript": "^5.8.3",
-    "write-json-file": "^6.0.0"
-  },
-  "dependencies": {
-    "@turf/helpers": "7.3.0",
-    "@turf/invariant": "7.3.0",
-    "@types/geojson": "^7946.0.10",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "9f58a103e8f9a587ab640307ed03ba5233913ddd"
-}

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

@@ -1,76 +0,0 @@
-# @turf/distance-weight
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## pNormDistance
-
-calcualte the Minkowski p-norm distance between two features.
-
-### Parameters
-
-*   `feature1` **[Feature][1]<[Point][2]>** point feature
-*   `feature2` **[Feature][1]<[Point][2]>** point feature
-*   `p`  p-norm 1=\<p<=infinity 1: Manhattan distance 2: Euclidean distance (optional, default `2`)
-
-Returns **[number][3]**&#x20;
-
-## distanceWeight
-
-### Parameters
-
-*   `fc` **[FeatureCollection][4]\<any>** FeatureCollection.
-*   `options` **[Object][5]?** option object.
-
-    *   `options.threshold` **[number][3]** If the distance between neighbor and
-        target features is greater than threshold, the weight of that neighbor is 0. (optional, default `10000`)
-    *   `options.p` **[number][3]** Minkowski p-norm distance parameter.
-        1: Manhattan distance. 2: Euclidean distance. 1=\<p<=infinity. (optional, default `2`)
-    *   `options.binary` **[boolean][6]** If true, weight=1 if d <= threshold otherwise weight=0.
-        If false, weight=Math.pow(d, alpha). (optional, default `false`)
-    *   `options.alpha` **[number][3]** distance decay parameter.
-        A big value means the weight decay quickly as distance increases. (optional, default `-1`)
-    *   `options.standardization` **[boolean][6]** row standardization. (optional, default `false`)
-
-### Examples
-
-```javascript
-var bbox = [-65, 40, -63, 42];
-var dataset = turf.randomPoint(100, { bbox: bbox });
-var result = turf.distanceWeight(dataset);
-```
-
-Returns **[Array][7]<[Array][7]<[number][3]>>** distance weight matrix.
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.2
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.1.2
-
-[3]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Number
-
-[4]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-[5]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object
-
-[6]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean
-
-[7]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array
-
-<!-- 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/distance-weight
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

package/node_modules/@turf/distance-weight/dist/cjs/index.cjs

@@ -1,80 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _centroid = require('@turf/centroid');
-var _invariant = require('@turf/invariant');
-var _meta = require('@turf/meta');
-function pNormDistance(feature1, feature2, p = 2) {
-  const coordinate1 = _invariant.getCoord.call(void 0, feature1);
-  const coordinate2 = _invariant.getCoord.call(void 0, feature2);
-  const xDiff = coordinate1[0] - coordinate2[0];
-  const yDiff = coordinate1[1] - coordinate2[1];
-  if (p === 1) {
-    return Math.abs(xDiff) + Math.abs(yDiff);
-  }
-  return Math.pow(Math.pow(xDiff, p) + Math.pow(yDiff, p), 1 / p);
-}
-function distanceWeight(fc, options) {
-  var _a, _b;
-  options = options || {};
-  const threshold = options.threshold || 1e4;
-  const p = options.p || 2;
-  const binary = (_a = options.binary) != null ? _a : false;
-  const alpha = options.alpha || -1;
-  const rowTransform = (_b = options.standardization) != null ? _b : false;
-  const features = [];
-  _meta.featureEach.call(void 0, fc, (feature) => {
-    features.push(_centroid.centroid.call(void 0, feature));
-  });
-  const weights = [];
-  for (let i = 0; i < features.length; i++) {
-    weights[i] = [];
-  }
-  for (let i = 0; i < features.length; i++) {
-    for (let j = i; j < features.length; j++) {
-      if (i === j) {
-        weights[i][j] = 0;
-      }
-      const dis = pNormDistance(features[i], features[j], p);
-      weights[i][j] = dis;
-      weights[j][i] = dis;
-    }
-  }
-  for (let i = 0; i < features.length; i++) {
-    for (let j = 0; j < features.length; j++) {
-      const dis = weights[i][j];
-      if (dis === 0) {
-        continue;
-      }
-      if (binary) {
-        if (dis <= threshold) {
-          weights[i][j] = 1;
-        } else {
-          weights[i][j] = 0;
-        }
-      } else {
-        if (dis <= threshold) {
-          weights[i][j] = Math.pow(dis, alpha);
-        } else {
-          weights[i][j] = 0;
-        }
-      }
-    }
-  }
-  if (rowTransform) {
-    for (let i = 0; i < features.length; i++) {
-      const rowSum = weights[i].reduce((sum, currentVal) => {
-        return sum + currentVal;
-      }, 0);
-      for (let j = 0; j < features.length; j++) {
-        weights[i][j] = weights[i][j] / rowSum;
-      }
-    }
-  }
-  return weights;
-}
-var index_default = distanceWeight;
-
-
-
-
-exports.default = index_default; exports.distanceWeight = distanceWeight; exports.pNormDistance = pNormDistance;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/distance-weight/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-distance-weight/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,0CAAyB;AACzB,4CAAyB;AACzB,kCAA4B;AAU5B,SAAS,aAAA,CACP,QAAA,EACA,QAAA,EACA,EAAA,EAAI,CAAA,EACI;AACR,EAAA,MAAM,YAAA,EAAc,iCAAA,QAAiB,CAAA;AACrC,EAAA,MAAM,YAAA,EAAc,iCAAA,QAAiB,CAAA;AACrC,EAAA,MAAM,MAAA,EAAQ,WAAA,CAAY,CAAC,EAAA,EAAI,WAAA,CAAY,CAAC,CAAA;AAC5C,EAAA,MAAM,MAAA,EAAQ,WAAA,CAAY,CAAC,EAAA,EAAI,WAAA,CAAY,CAAC,CAAA;AAC5C,EAAA,GAAA,CAAI,EAAA,IAAM,CAAA,EAAG;AACX,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,KAAK,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA;AAAA,EACzC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAC,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAC,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AAChE;AAwBA,SAAS,cAAA,CACP,EAAA,EACA,OAAA,EAOY;AA3Dd,EAAA,IAAA,EAAA,EAAA,EAAA;AA4DE,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,MAAM,UAAA,EAAY,OAAA,CAAQ,UAAA,GAAa,GAAA;AACvC,EAAA,MAAM,EAAA,EAAI,OAAA,CAAQ,EAAA,GAAK,CAAA;AACvB,EAAA,MAAM,OAAA,EAAA,CAAS,GAAA,EAAA,OAAA,CAAQ,MAAA,EAAA,GAAR,KAAA,EAAA,GAAA,EAAkB,KAAA;AACjC,EAAA,MAAM,MAAA,EAAQ,OAAA,CAAQ,MAAA,GAAS,CAAA,CAAA;AAC/B,EAAA,MAAM,aAAA,EAAA,CAAe,GAAA,EAAA,OAAA,CAAQ,eAAA,EAAA,GAAR,KAAA,EAAA,GAAA,EAA2B,KAAA;AAEhD,EAAA,MAAM,SAAA,EAAkC,CAAC,CAAA;AACzC,EAAA,+BAAA,EAAY,EAAI,CAAC,OAAA,EAAA,GAAY;AAC3B,IAAA,QAAA,CAAS,IAAA,CAAK,gCAAA,OAAgB,CAAC,CAAA;AAAA,EACjC,CAAC,CAAA;AAGD,EAAA,MAAM,QAAA,EAAsB,CAAC,CAAA;AAC7B,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,OAAA,CAAQ,CAAC,EAAA,EAAI,CAAC,CAAA;AAAA,EAChB;AAEA,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,MAAA,GAAA,CAAI,EAAA,IAAM,CAAA,EAAG;AACX,QAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA;AAAA,MAClB;AACA,MAAA,MAAM,IAAA,EAAM,aAAA,CAAc,QAAA,CAAS,CAAC,CAAA,EAAG,QAAA,CAAS,CAAC,CAAA,EAAG,CAAC,CAAA;AACrD,MAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,GAAA;AAChB,MAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,GAAA;AAAA,IAClB;AAAA,EACF;AAGA,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,MAAA,MAAM,IAAA,EAAc,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,CAAA;AAChC,MAAA,GAAA,CAAI,IAAA,IAAQ,CAAA,EAAG;AACb,QAAA,QAAA;AAAA,MACF;AACA,MAAA,GAAA,CAAI,MAAA,EAAQ;AACV,QAAA,GAAA,CAAI,IAAA,GAAO,SAAA,EAAW;AACpB,UAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA;AAAA,QAClB,EAAA,KAAO;AACL,UAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA;AAAA,QAClB;AAAA,MACF,EAAA,KAAO;AACL,QAAA,GAAA,CAAI,IAAA,GAAO,SAAA,EAAW;AACpB,UAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,QACrC,EAAA,KAAO;AACL,UAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,YAAA,EAAc;AAChB,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,MAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,CAAC,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,EAAa,UAAA,EAAA,GAAuB;AACpE,QAAA,OAAO,IAAA,EAAM,UAAA;AAAA,MACf,CAAA,EAAG,CAAC,CAAA;AACJ,MAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,QAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,MAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAGA,IAAO,cAAA,EAAQ,cAAA;ADrDf;AACE;AACA;AACA;AACF,gHAAC","file":"/home/runner/work/turf/turf/packages/turf-distance-weight/dist/cjs/index.cjs","sourcesContent":[null,"import { Feature, FeatureCollection, Point } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { getCoord } from \"@turf/invariant\";\nimport { featureEach } from \"@turf/meta\";\n\n/**\n * calcualte the Minkowski p-norm distance between two features.\n *\n * @function\n * @param feature1 point feature\n * @param feature2 point feature\n * @param p p-norm 1=<p<=infinity 1: Manhattan distance 2: Euclidean distance\n */\nfunction pNormDistance(\n  feature1: Feature<Point>,\n  feature2: Feature<Point>,\n  p = 2\n): number {\n  const coordinate1 = getCoord(feature1);\n  const coordinate2 = getCoord(feature2);\n  const xDiff = coordinate1[0] - coordinate2[0];\n  const yDiff = coordinate1[1] - coordinate2[1];\n  if (p === 1) {\n    return Math.abs(xDiff) + Math.abs(yDiff);\n  }\n  return Math.pow(Math.pow(xDiff, p) + Math.pow(yDiff, p), 1 / p);\n}\n\n/**\n *\n *\n * @function\n * @param {FeatureCollection<any>} fc FeatureCollection.\n * @param {Object} [options] option object.\n * @param {number} [options.threshold=10000] If the distance between neighbor and\n * target features is greater than threshold, the weight of that neighbor is 0.\n * @param {number} [options.p=2] Minkowski p-norm distance parameter.\n * 1: Manhattan distance. 2: Euclidean distance. 1=<p<=infinity.\n * @param {boolean} [options.binary=false] If true, weight=1 if d <= threshold otherwise weight=0.\n *  If false, weight=Math.pow(d, alpha).\n * @param {number} [options.alpha=-1] distance decay parameter.\n * A big value means the weight decay quickly as distance increases.\n * @param {boolean} [options.standardization=false] row standardization.\n * @returns {Array<Array<number>>} distance weight matrix.\n * @example\n *\n * var bbox = [-65, 40, -63, 42];\n * var dataset = turf.randomPoint(100, { bbox: bbox });\n * var result = turf.distanceWeight(dataset);\n */\nfunction distanceWeight(\n  fc: FeatureCollection<any>,\n  options?: {\n    threshold?: number;\n    p?: number;\n    binary?: boolean;\n    alpha?: number;\n    standardization?: boolean;\n  }\n): number[][] {\n  options = options || {};\n  const threshold = options.threshold || 10000;\n  const p = options.p || 2;\n  const binary = options.binary ?? false;\n  const alpha = options.alpha || -1;\n  const rowTransform = options.standardization ?? false;\n\n  const features: Array<Feature<Point>> = [];\n  featureEach(fc, (feature) => {\n    features.push(centroid(feature));\n  });\n\n  // computing the distance between the features\n  const weights: number[][] = [];\n  for (let i = 0; i < features.length; i++) {\n    weights[i] = [];\n  }\n\n  for (let i = 0; i < features.length; i++) {\n    for (let j = i; j < features.length; j++) {\n      if (i === j) {\n        weights[i][j] = 0;\n      }\n      const dis = pNormDistance(features[i], features[j], p);\n      weights[i][j] = dis;\n      weights[j][i] = dis;\n    }\n  }\n\n  // binary or distance decay\n  for (let i = 0; i < features.length; i++) {\n    for (let j = 0; j < features.length; j++) {\n      const dis: number = weights[i][j];\n      if (dis === 0) {\n        continue;\n      }\n      if (binary) {\n        if (dis <= threshold) {\n          weights[i][j] = 1.0;\n        } else {\n          weights[i][j] = 0.0;\n        }\n      } else {\n        if (dis <= threshold) {\n          weights[i][j] = Math.pow(dis, alpha);\n        } else {\n          weights[i][j] = 0.0;\n        }\n      }\n    }\n  }\n\n  if (rowTransform) {\n    for (let i = 0; i < features.length; i++) {\n      const rowSum = weights[i].reduce((sum: number, currentVal: number) => {\n        return sum + currentVal;\n      }, 0);\n      for (let j = 0; j < features.length; j++) {\n        weights[i][j] = weights[i][j] / rowSum;\n      }\n    }\n  }\n\n  return weights;\n}\n\nexport { pNormDistance, distanceWeight };\nexport default distanceWeight;\n"]}