@turf/distance-weight 7.0.0-alpha.2 → 7.1.0-alpha.7

package/README.md

@@ -55,26 +55,21 @@ Returns **[Array][7]<[Array][7]<[number][3]>>** distance weight matrix.
 
 [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 (likely index.js), and re-run
-./scripts/generate-readmes in the turf project. -->
+<!-- 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](http://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.
+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 module individually:
+Install this single module individually:
 
 ```sh
 $ npm install @turf/distance-weight
 ```
 
-Or install the Turf module that includes it as a function:
+Or install the all-encompassing @turf/turf module that includes all modules as functions:
 
 ```sh
 $ npm install @turf/turf

package/dist/cjs/index.cjs

@@ -0,0 +1,80 @@
+"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 turf_distance_weight_default = distanceWeight;
+
+
+
+
+exports.default = turf_distance_weight_default; exports.distanceWeight = distanceWeight; exports.pNormDistance = pNormDistance;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"names":[],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,gBAAgB;AACzB,SAAS,mBAAmB;AAQ5B,SAAS,cACP,UACA,UACA,IAAI,GACI;AACR,QAAM,cAAc,SAAS,QAAQ;AACrC,QAAM,cAAc,SAAS,QAAQ;AACrC,QAAM,QAAQ,YAAY,CAAC,IAAI,YAAY,CAAC;AAC5C,QAAM,QAAQ,YAAY,CAAC,IAAI,YAAY,CAAC;AAC5C,MAAI,MAAM,GAAG;AACX,WAAO,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC;AAChE;AAwBA,SAAS,eACP,IACA,SAOY;AAzDd;AA0DE,YAAU,WAAW,CAAC;AACtB,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,IAAI,QAAQ,KAAK;AACvB,QAAM,UAAS,aAAQ,WAAR,YAAkB;AACjC,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,gBAAe,aAAQ,oBAAR,YAA2B;AAEhD,QAAM,WAAkC,CAAC;AACzC,cAAY,IAAI,CAAC,YAAY;AAC3B,aAAS,KAAK,SAAS,OAAO,CAAC;AAAA,EACjC,CAAC;AAGD,QAAM,UAAsB,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAQ,CAAC,IAAI,CAAC;AAAA,EAChB;AAEA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAI,MAAM,GAAG;AACX,gBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,MAClB;AACA,YAAM,MAAM,cAAc,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC;AACrD,cAAQ,CAAC,EAAE,CAAC,IAAI;AAChB,cAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,IAClB;AAAA,EACF;AAGA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,MAAc,QAAQ,CAAC,EAAE,CAAC;AAChC,UAAI,QAAQ,GAAG;AACb;AAAA,MACF;AACA,UAAI,QAAQ;AACV,YAAI,OAAO,WAAW;AACpB,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB,OAAO;AACL,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACF,OAAO;AACL,YAAI,OAAO,WAAW;AACpB,kBAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK;AAAA,QACrC,OAAO;AACL,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,cAAc;AAChB,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,SAAS,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAa,eAAuB;AACpE,eAAO,MAAM;AAAA,MACf,GAAG,CAAC;AACJ,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,gBAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,+BAAQ","sourcesContent":["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 * @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 * @name distanceWeight\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"]}

package/dist/cjs/index.d.cts

@@ -0,0 +1,40 @@
+import { Feature, Point, FeatureCollection } from 'geojson';
+
+/**
+ * calcualte the Minkowski p-norm distance between two features.
+ * @param feature1 point feature
+ * @param feature2 point feature
+ * @param p p-norm 1=<p<=infinity 1: Manhattan distance 2: Euclidean distance
+ */
+declare function pNormDistance(feature1: Feature<Point>, feature2: Feature<Point>, p?: number): number;
+/**
+ *
+ *
+ * @name distanceWeight
+ * @param {FeatureCollection<any>} fc FeatureCollection.
+ * @param {Object} [options] option object.
+ * @param {number} [options.threshold=10000] If the distance between neighbor and
+ * target features is greater than threshold, the weight of that neighbor is 0.
+ * @param {number} [options.p=2] Minkowski p-norm distance parameter.
+ * 1: Manhattan distance. 2: Euclidean distance. 1=<p<=infinity.
+ * @param {boolean} [options.binary=false] If true, weight=1 if d <= threshold otherwise weight=0.
+ *  If false, weight=Math.pow(d, alpha).
+ * @param {number} [options.alpha=-1] distance decay parameter.
+ * A big value means the weight decay quickly as distance increases.
+ * @param {boolean} [options.standardization=false] row standardization.
+ * @returns {Array<Array<number>>} distance weight matrix.
+ * @example
+ *
+ * var bbox = [-65, 40, -63, 42];
+ * var dataset = turf.randomPoint(100, { bbox: bbox });
+ * var result = turf.distanceWeight(dataset);
+ */
+declare function distanceWeight(fc: FeatureCollection<any>, options?: {
+    threshold?: number;
+    p?: number;
+    binary?: boolean;
+    alpha?: number;
+    standardization?: boolean;
+}): number[][];
+
+export { distanceWeight as default, distanceWeight, pNormDistance };

package/dist/{js → esm}/index.d.ts

@@ -1,11 +1,12 @@
-import { Feature, FeatureCollection, Point } from "geojson";
+import { Feature, Point, FeatureCollection } from 'geojson';
+
 /**
  * calcualte the Minkowski p-norm distance between two features.
  * @param feature1 point feature
  * @param feature2 point feature
  * @param p p-norm 1=<p<=infinity 1: Manhattan distance 2: Euclidean distance
  */
-export declare function pNormDistance(feature1: Feature<Point>, feature2: Feature<Point>, p?: number): number;
+declare function pNormDistance(feature1: Feature<Point>, feature2: Feature<Point>, p?: number): number;
 /**
  *
  *
@@ -28,10 +29,12 @@ export declare function pNormDistance(feature1: Feature<Point>, feature2: Featur
  * var dataset = turf.randomPoint(100, { bbox: bbox });
  * var result = turf.distanceWeight(dataset);
  */
-export default function distanceWeight(fc: FeatureCollection<any>, options?: {
+declare function distanceWeight(fc: FeatureCollection<any>, options?: {
     threshold?: number;
     p?: number;
     binary?: boolean;
     alpha?: number;
     standardization?: boolean;
 }): number[][];
+
+export { distanceWeight as default, distanceWeight, pNormDistance };

package/dist/esm/index.js

@@ -0,0 +1,80 @@
+// index.ts
+import { centroid } from "@turf/centroid";
+import { getCoord } from "@turf/invariant";
+import { featureEach } from "@turf/meta";
+function pNormDistance(feature1, feature2, p = 2) {
+  const coordinate1 = getCoord(feature1);
+  const coordinate2 = getCoord(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 = [];
+  featureEach(fc, (feature) => {
+    features.push(centroid(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 turf_distance_weight_default = distanceWeight;
+export {
+  turf_distance_weight_default as default,
+  distanceWeight,
+  pNormDistance
+};
+//# sourceMappingURL=index.js.map

package/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["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 * @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 * @name distanceWeight\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"],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,gBAAgB;AACzB,SAAS,mBAAmB;AAQ5B,SAAS,cACP,UACA,UACA,IAAI,GACI;AACR,QAAM,cAAc,SAAS,QAAQ;AACrC,QAAM,cAAc,SAAS,QAAQ;AACrC,QAAM,QAAQ,YAAY,CAAC,IAAI,YAAY,CAAC;AAC5C,QAAM,QAAQ,YAAY,CAAC,IAAI,YAAY,CAAC;AAC5C,MAAI,MAAM,GAAG;AACX,WAAO,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC;AAChE;AAwBA,SAAS,eACP,IACA,SAOY;AAzDd;AA0DE,YAAU,WAAW,CAAC;AACtB,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,IAAI,QAAQ,KAAK;AACvB,QAAM,UAAS,aAAQ,WAAR,YAAkB;AACjC,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,gBAAe,aAAQ,oBAAR,YAA2B;AAEhD,QAAM,WAAkC,CAAC;AACzC,cAAY,IAAI,CAAC,YAAY;AAC3B,aAAS,KAAK,SAAS,OAAO,CAAC;AAAA,EACjC,CAAC;AAGD,QAAM,UAAsB,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAQ,CAAC,IAAI,CAAC;AAAA,EAChB;AAEA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAI,MAAM,GAAG;AACX,gBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,MAClB;AACA,YAAM,MAAM,cAAc,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC;AACrD,cAAQ,CAAC,EAAE,CAAC,IAAI;AAChB,cAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,IAClB;AAAA,EACF;AAGA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,MAAc,QAAQ,CAAC,EAAE,CAAC;AAChC,UAAI,QAAQ,GAAG;AACb;AAAA,MACF;AACA,UAAI,QAAQ;AACV,YAAI,OAAO,WAAW;AACpB,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB,OAAO;AACL,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACF,OAAO;AACL,YAAI,OAAO,WAAW;AACpB,kBAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK;AAAA,QACrC,OAAO;AACL,kBAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,cAAc;AAChB,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,SAAS,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAa,eAAuB;AACpE,eAAO,MAAM;AAAA,MACf,GAAG,CAAC;AACJ,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,gBAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,IAAI;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,+BAAQ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/distance-weight",
-  "version": "7.0.0-alpha.2",
+  "version": "7.1.0-alpha.7+0ce6ecca0",
   "description": "turf distance-weight module",
   "author": "Turf Authors",
   "contributors": [
@@ -23,47 +23,52 @@
     "turf",
     "distance-weight"
   ],
-  "main": "dist/js/index.js",
-  "module": "dist/es/index.js",
+  "type": "module",
+  "main": "dist/cjs/index.cjs",
+  "module": "dist/esm/index.js",
+  "types": "dist/esm/index.d.ts",
   "exports": {
     "./package.json": "./package.json",
     ".": {
-      "types": "./dist/js/index.d.ts",
-      "import": "./dist/es/index.js",
-      "require": "./dist/js/index.js"
+      "import": {
+        "types": "./dist/esm/index.d.ts",
+        "default": "./dist/esm/index.js"
+      },
+      "require": {
+        "types": "./dist/cjs/index.d.cts",
+        "default": "./dist/cjs/index.cjs"
+      }
     }
   },
-  "types": "dist/js/index.d.ts",
   "sideEffects": false,
   "files": [
     "dist"
   ],
   "scripts": {
-    "bench": "tsx bench.js",
-    "build": "npm-run-all build:*",
-    "build:es": "tsc --outDir dist/es --module esnext --declaration false && echo '{\"type\":\"module\"}' > dist/es/package.json",
-    "build:js": "tsc",
-    "docs": "tsx ../../scripts/generate-readmes",
-    "test": "npm-run-all test:*",
-    "test:tape": "tsx test.js"
+    "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/tape": "*",
-    "benchmark": "*",
-    "load-json-file": "*",
-    "npm-run-all": "*",
-    "tape": "*",
-    "tslint": "*",
-    "tsx": "*",
-    "typescript": "*",
-    "write-json-file": "*"
+    "@types/benchmark": "^2.1.5",
+    "@types/tape": "^4.2.32",
+    "benchmark": "^2.1.4",
+    "load-json-file": "^7.0.1",
+    "npm-run-all": "^4.1.5",
+    "tape": "^5.7.2",
+    "tsup": "^8.0.1",
+    "tsx": "^4.6.2",
+    "typescript": "^5.2.2",
+    "write-json-file": "^5.0.0"
   },
   "dependencies": {
-    "@turf/centroid": "^7.0.0-alpha.2",
-    "@turf/helpers": "^7.0.0-alpha.2",
-    "@turf/invariant": "^7.0.0-alpha.2",
-    "@turf/meta": "^7.0.0-alpha.2",
-    "tslib": "^2.3.0"
+    "@turf/centroid": "^7.1.0-alpha.7+0ce6ecca0",
+    "@turf/helpers": "^7.1.0-alpha.7+0ce6ecca0",
+    "@turf/invariant": "^7.1.0-alpha.7+0ce6ecca0",
+    "@turf/meta": "^7.1.0-alpha.7+0ce6ecca0",
+    "tslib": "^2.6.2"
   },
-  "gitHead": "dd35b52725945b4fa29a98d9a550733e06cc222e"
+  "gitHead": "0ce6ecca05829690270fec6d6bed2003495fe0ea"
 }

package/dist/es/index.js

@@ -1,104 +0,0 @@
-import centroid from "@turf/centroid";
-import { getCoord } from "@turf/invariant";
-import { featureEach } from "@turf/meta";
-/**
- * calcualte the Minkowski p-norm distance between two features.
- * @param feature1 point feature
- * @param feature2 point feature
- * @param p p-norm 1=<p<=infinity 1: Manhattan distance 2: Euclidean distance
- */
-export function pNormDistance(feature1, feature2, p = 2) {
-    const coordinate1 = getCoord(feature1);
-    const coordinate2 = getCoord(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);
-}
-/**
- *
- *
- * @name distanceWeight
- * @param {FeatureCollection<any>} fc FeatureCollection.
- * @param {Object} [options] option object.
- * @param {number} [options.threshold=10000] If the distance between neighbor and
- * target features is greater than threshold, the weight of that neighbor is 0.
- * @param {number} [options.p=2] Minkowski p-norm distance parameter.
- * 1: Manhattan distance. 2: Euclidean distance. 1=<p<=infinity.
- * @param {boolean} [options.binary=false] If true, weight=1 if d <= threshold otherwise weight=0.
- *  If false, weight=Math.pow(d, alpha).
- * @param {number} [options.alpha=-1] distance decay parameter.
- * A big value means the weight decay quickly as distance increases.
- * @param {boolean} [options.standardization=false] row standardization.
- * @returns {Array<Array<number>>} distance weight matrix.
- * @example
- *
- * var bbox = [-65, 40, -63, 42];
- * var dataset = turf.randomPoint(100, { bbox: bbox });
- * var result = turf.distanceWeight(dataset);
- */
-export default function distanceWeight(fc, options) {
-    options = options || {};
-    const threshold = options.threshold || 10000;
-    const p = options.p || 2;
-    const binary = options.binary || false;
-    const alpha = options.alpha || -1;
-    const rowTransform = options.standardization || false;
-    const features = [];
-    featureEach(fc, (feature) => {
-        features.push(centroid(feature));
-    });
-    // computing the distance between the features
-    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;
-        }
-    }
-    // binary or distance decay
-    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.0;
-                }
-                else {
-                    weights[i][j] = 0.0;
-                }
-            }
-            else {
-                if (dis <= threshold) {
-                    weights[i][j] = Math.pow(dis, alpha);
-                }
-                else {
-                    weights[i][j] = 0.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;
-}

package/dist/es/package.json

@@ -1 +0,0 @@
-{"type":"module"}

package/dist/js/index.js

@@ -1,109 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-const centroid_1 = tslib_1.__importDefault(require("@turf/centroid"));
-const invariant_1 = require("@turf/invariant");
-const meta_1 = require("@turf/meta");
-/**
- * calcualte the Minkowski p-norm distance between two features.
- * @param feature1 point feature
- * @param feature2 point feature
- * @param p p-norm 1=<p<=infinity 1: Manhattan distance 2: Euclidean distance
- */
-function pNormDistance(feature1, feature2, p = 2) {
-    const coordinate1 = invariant_1.getCoord(feature1);
-    const coordinate2 = invariant_1.getCoord(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);
-}
-exports.pNormDistance = pNormDistance;
-/**
- *
- *
- * @name distanceWeight
- * @param {FeatureCollection<any>} fc FeatureCollection.
- * @param {Object} [options] option object.
- * @param {number} [options.threshold=10000] If the distance between neighbor and
- * target features is greater than threshold, the weight of that neighbor is 0.
- * @param {number} [options.p=2] Minkowski p-norm distance parameter.
- * 1: Manhattan distance. 2: Euclidean distance. 1=<p<=infinity.
- * @param {boolean} [options.binary=false] If true, weight=1 if d <= threshold otherwise weight=0.
- *  If false, weight=Math.pow(d, alpha).
- * @param {number} [options.alpha=-1] distance decay parameter.
- * A big value means the weight decay quickly as distance increases.
- * @param {boolean} [options.standardization=false] row standardization.
- * @returns {Array<Array<number>>} distance weight matrix.
- * @example
- *
- * var bbox = [-65, 40, -63, 42];
- * var dataset = turf.randomPoint(100, { bbox: bbox });
- * var result = turf.distanceWeight(dataset);
- */
-function distanceWeight(fc, options) {
-    options = options || {};
-    const threshold = options.threshold || 10000;
-    const p = options.p || 2;
-    const binary = options.binary || false;
-    const alpha = options.alpha || -1;
-    const rowTransform = options.standardization || false;
-    const features = [];
-    meta_1.featureEach(fc, (feature) => {
-        features.push(centroid_1.default(feature));
-    });
-    // computing the distance between the features
-    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;
-        }
-    }
-    // binary or distance decay
-    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.0;
-                }
-                else {
-                    weights[i][j] = 0.0;
-                }
-            }
-            else {
-                if (dis <= threshold) {
-                    weights[i][j] = Math.pow(dis, alpha);
-                }
-                else {
-                    weights[i][j] = 0.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;
-}
-exports.default = distanceWeight;