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

package/node_modules/@turf/quadrat-analysis/README.md

@@ -1,114 +0,0 @@
-# @turf/quadrat-analysis
-
-<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
-
-## quadratAnalysis
-
-Quadrat analysis lays a set of equal-size areas(quadrat) over the study area and counts
-the number of features in each quadrat and creates a frequency table.
-The table lists the number of quadrats containing no features,
-the number containing one feature, two features, and so on,
-all the way up to the quadrat containing the most features.
-The method then creates the frequency table for the random distribution, usually based on a Poisson distribution.
-The method uses the distribution to calculate the probability for 0 feature occuring,
-1 feature occuring, 2 features, and so on,
-and lists these probabilities in the frequency table.
-By comparing the two frequency tables, you can see whether the features create a pattern.
-If the table for the observed distribution has more quadrats containing many features than the
-table for the random distribution dose, then the features create a clustered pattern.
-
-It is hard to judge the frequency tables are similar or different just by looking at them.
-So, we can use serval statistical tests to find out how much the frequency tables differ.
-We use Kolmogorov-Smirnov test.This method calculates cumulative probabilities for both distributions,
-and then compares the cumulative probabilities at each class level and selects the largest absolute difference D.
-Then, the test compares D to the critical value for a confidence level you specify.
-If D is greater than the critical value, the difference between  the observed distribution and
-the random distribution is significant. The greater the value the bigger the difference.
-
-Traditionally, squares are used for the shape of the quadrats, in a regular grid(square-grid).
-Some researchers suggest that the quadrat size equal twice the size of mean area per feature,
-which is simply the area of the study area divided by the number of features.
-
-### Parameters
-
-*   `pointFeatureSet` **[FeatureCollection][1]<[Point][2]>** point set to study
-*   `options` **[Object][3]** optional parameters (optional, default `{}`)
-
-    *   `options.studyBbox` **\[[number][4], [number][4], [number][4], [number][4]]?** bbox representing the study area
-    *   `options.confidenceLevel` **(`20` | `15` | `10` | `5` | `2` | `1`)** a confidence level.
-        The unit is percentage . 5 means 95%, value must be in [K\_TABLE][5] (optional, default `20`)
-
-### Examples
-
-```javascript
-var bbox = [-65, 40, -63, 42];
-var dataset = turf.randomPoint(100, { bbox: bbox });
-var result = turf.quadratAnalysis(dataset);
-```
-
-Returns **[QuadratAnalysisResult][6]** result
-
-## K\_TABLE
-
-the confidence level
-
-Type: [Object][3]
-
-### Properties
-
-*   `20` **[number][4]** 1.07275
-*   `15` **[number][4]** 1.13795
-*   `10` **[number][4]** 1.22385
-*   `5` **[number][4]** 1.3581
-*   `2` **[number][4]** 1.51743
-*   `1` **[number][4]** 1.62762
-
-## QuadratAnalysisResult
-
-the return type of the quadratAnalysis
-
-Type: [object][3]
-
-### Properties
-
-*   `criticalValue` **[number][4]**&#x20;
-*   `maxAbsoluteDifference` **[number][4]**&#x20;
-*   `isRandom` **[boolean][7]**&#x20;
-*   `observedDistribution` **[Array][8]<[number][4]>** the cumulative distribution of observed features,
-    the index represents the number of features in the quadrat.
-
-[1]: https://tools.ietf.org/html/rfc7946#section-3.3
-
-[2]: https://tools.ietf.org/html/rfc7946#section-3.1.2
-
-[3]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object
-
-[4]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Number
-
-[5]: #k_table
-
-[6]: #quadratanalysisresult
-
-[7]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean
-
-[8]: 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/quadrat-analysis
-```
-
-Or install the all-encompassing @turf/turf module that includes all modules as functions:
-
-```sh
-$ npm install @turf/turf
-```

package/node_modules/@turf/quadrat-analysis/dist/cjs/index.cjs

@@ -1,114 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// index.ts
-var _area = require('@turf/area');
-var _bbox = require('@turf/bbox');
-var _bboxpolygon = require('@turf/bbox-polygon');
-var _invariant = require('@turf/invariant');
-var _squaregrid = require('@turf/square-grid');
-function quadratAnalysis(pointFeatureSet, options) {
-  options = options || {};
-  const studyBbox = options.studyBbox || _bbox.bbox.call(void 0, pointFeatureSet);
-  const confidenceLevel = options.confidenceLevel || 20;
-  const points = pointFeatureSet.features;
-  const numOfPoints = points.length;
-  const sizeOfArea = _area.area.call(void 0, _bboxpolygon.bboxPolygon.call(void 0, studyBbox));
-  const lengthOfSide = Math.sqrt(sizeOfArea / numOfPoints * 2);
-  const grid = _squaregrid.squareGrid.call(void 0, studyBbox, lengthOfSide, {
-    units: "meters"
-  });
-  const quadrats = grid.features;
-  const quadratIdDict = {};
-  for (let i = 0; i < quadrats.length; i++) {
-    quadratIdDict[i] = {
-      box: _bbox.bbox.call(void 0, quadrats[i]),
-      cnt: 0
-    };
-  }
-  let sumOfPoint = 0;
-  for (const pt of points) {
-    for (const key of Object.keys(quadratIdDict)) {
-      const box = quadratIdDict[key].box;
-      if (inBBox(_invariant.getCoord.call(void 0, pt), box)) {
-        quadratIdDict[key].cnt += 1;
-        sumOfPoint += 1;
-        break;
-      }
-    }
-  }
-  let maxCnt = 0;
-  for (const key of Object.keys(quadratIdDict)) {
-    const cnt = quadratIdDict[key].cnt;
-    if (cnt > maxCnt) {
-      maxCnt = cnt;
-    }
-  }
-  const expectedDistribution = [];
-  const numOfQuadrat = Object.keys(quadratIdDict).length;
-  const lambda = sumOfPoint / numOfQuadrat;
-  let cumulativeProbility = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    cumulativeProbility += Math.exp(-lambda) * Math.pow(lambda, x) / factorial(x);
-    expectedDistribution.push(cumulativeProbility);
-  }
-  const observedDistribution = [];
-  let cumulativeObservedQuads = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    for (const key of Object.keys(quadratIdDict)) {
-      if (quadratIdDict[key].cnt === x) {
-        cumulativeObservedQuads += 1;
-      }
-    }
-    const p = cumulativeObservedQuads / numOfQuadrat;
-    observedDistribution.push(p);
-  }
-  let maxDifference = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    const difference = Math.abs(
-      expectedDistribution[x] - observedDistribution[x]
-    );
-    if (difference > maxDifference) {
-      maxDifference = difference;
-    }
-  }
-  const k = K_TABLE[confidenceLevel];
-  const criticalValue = k / Math.sqrt(numOfQuadrat);
-  const result = {
-    criticalValue,
-    isRandom: true,
-    maxAbsoluteDifference: maxDifference,
-    observedDistribution
-  };
-  if (maxDifference > criticalValue) {
-    result.isRandom = false;
-  }
-  return result;
-}
-var K_TABLE = {
-  20: 1.07275,
-  15: 1.13795,
-  10: 1.22385,
-  5: 1.3581,
-  2: 1.51743,
-  1: 1.62762
-};
-function inBBox(pt, bbox) {
-  return bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1];
-}
-function factorial(num) {
-  const f = [];
-  function inner(n) {
-    if (n === 0 || n === 1) {
-      return 1;
-    }
-    if (f[n] > 0) {
-      return f[n];
-    }
-    return f[n] = inner(n - 1) * n;
-  }
-  return inner(num);
-}
-var turf_quadrat_analysis_default = quadratAnalysis;
-
-
-
-exports.default = turf_quadrat_analysis_default; exports.quadratAnalysis = quadratAnalysis;
-//# sourceMappingURL=index.cjs.map

package/node_modules/@turf/quadrat-analysis/dist/cjs/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-quadrat-analysis/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,kCAAqB;AACrB,kCAAiC;AACjC,iDAA4B;AAC5B,4CAAyB;AACzB,+CAA2B;AAkD3B,SAAS,eAAA,CACP,eAAA,EACA,OAAA,EAIuB;AACvB,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,MAAM,UAAA,EAAY,OAAA,CAAQ,UAAA,GAAa,wBAAA,eAAwB,CAAA;AAC/D,EAAA,MAAM,gBAAA,EAAkB,OAAA,CAAQ,gBAAA,GAAmB,EAAA;AACnD,EAAA,MAAM,OAAA,EAAS,eAAA,CAAgB,QAAA;AAG/B,EAAA,MAAM,YAAA,EAAc,MAAA,CAAO,MAAA;AAC3B,EAAA,MAAM,WAAA,EAAa,wBAAA,sCAAK,SAAqB,CAAC,CAAA;AAC9C,EAAA,MAAM,aAAA,EAAe,IAAA,CAAK,IAAA,CAAM,WAAA,EAAa,YAAA,EAAe,CAAC,CAAA;AAC7D,EAAA,MAAM,KAAA,EAAO,oCAAA,SAAW,EAAW,YAAA,EAAc;AAAA,IAC/C,KAAA,EAAO;AAAA,EACT,CAAC,CAAA;AACD,EAAA,MAAM,SAAA,EAAW,IAAA,CAAK,QAAA;AAGtB,EAAA,MAAM,cAAA,EAA+D,CAAC,CAAA;AACtE,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,aAAA,CAAc,CAAC,EAAA,EAAI;AAAA,MACjB,GAAA,EAAK,wBAAA,QAAS,CAAS,CAAC,CAAC,CAAA;AAAA,MACzB,GAAA,EAAK;AAAA,IACP,CAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAA,EAAa,CAAA;AACjB,EAAA,IAAA,CAAA,MAAW,GAAA,GAAM,MAAA,EAAQ;AACvB,IAAA,IAAA,CAAA,MAAW,IAAA,GAAO,MAAA,CAAO,IAAA,CAAK,aAAa,CAAA,EAAG;AAC5C,MAAA,MAAM,IAAA,EAAM,aAAA,CAAc,GAAG,CAAA,CAAE,GAAA;AAC/B,MAAA,GAAA,CAAI,MAAA,CAAO,iCAAA,EAAW,CAAA,EAAG,GAAG,CAAA,EAAG;AAC7B,QAAA,aAAA,CAAc,GAAG,CAAA,CAAE,IAAA,GAAO,CAAA;AAC1B,QAAA,WAAA,GAAc,CAAA;AACd,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,OAAA,EAAS,CAAA;AACb,EAAA,IAAA,CAAA,MAAW,IAAA,GAAO,MAAA,CAAO,IAAA,CAAK,aAAa,CAAA,EAAG;AAC5C,IAAA,MAAM,IAAA,EAAM,aAAA,CAAc,GAAG,CAAA,CAAE,GAAA;AAC/B,IAAA,GAAA,CAAI,IAAA,EAAM,MAAA,EAAQ;AAChB,MAAA,OAAA,EAAS,GAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,MAAM,qBAAA,EAAuB,CAAC,CAAA;AAC9B,EAAA,MAAM,aAAA,EAAe,MAAA,CAAO,IAAA,CAAK,aAAa,CAAA,CAAE,MAAA;AAChD,EAAA,MAAM,OAAA,EAAS,WAAA,EAAa,YAAA;AAG5B,EAAA,IAAI,oBAAA,EAAsB,CAAA;AAC1B,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,OAAA,EAAS,CAAA,EAAG,CAAA,EAAA,EAAK;AACnC,IAAA,oBAAA,GACG,IAAA,CAAK,GAAA,CAAI,CAAC,MAAM,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAC,EAAA,EAAK,SAAA,CAAU,CAAC,CAAA;AACzD,IAAA,oBAAA,CAAqB,IAAA,CAAK,mBAAmB,CAAA;AAAA,EAC/C;AAGA,EAAA,MAAM,qBAAA,EAAuB,CAAC,CAAA;AAC9B,EAAA,IAAI,wBAAA,EAA0B,CAAA;AAC9B,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,OAAA,EAAS,CAAA,EAAG,CAAA,EAAA,EAAK;AACnC,IAAA,IAAA,CAAA,MAAW,IAAA,GAAO,MAAA,CAAO,IAAA,CAAK,aAAa,CAAA,EAAG;AAC5C,MAAA,GAAA,CAAI,aAAA,CAAc,GAAG,CAAA,CAAE,IAAA,IAAQ,CAAA,EAAG;AAChC,QAAA,wBAAA,GAA2B,CAAA;AAAA,MAC7B;AAAA,IACF;AACA,IAAA,MAAM,EAAA,EAAI,wBAAA,EAA0B,YAAA;AACpC,IAAA,oBAAA,CAAqB,IAAA,CAAK,CAAC,CAAA;AAAA,EAC7B;AAGA,EAAA,IAAI,cAAA,EAAgB,CAAA;AACpB,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,OAAA,EAAS,CAAA,EAAG,CAAA,EAAA,EAAK;AACnC,IAAA,MAAM,WAAA,EAAa,IAAA,CAAK,GAAA;AAAA,MACtB,oBAAA,CAAqB,CAAC,EAAA,EAAI,oBAAA,CAAqB,CAAC;AAAA,IAClD,CAAA;AACA,IAAA,GAAA,CAAI,WAAA,EAAa,aAAA,EAAe;AAC9B,MAAA,cAAA,EAAgB,UAAA;AAAA,IAClB;AAAA,EACF;AAEA,EAAA,MAAM,EAAA,EAAI,OAAA,CAAQ,eAAe,CAAA;AAGjC,EAAA,MAAM,cAAA,EAAgB,EAAA,EAAI,IAAA,CAAK,IAAA,CAAK,YAAY,CAAA;AAChD,EAAA,MAAM,OAAA,EAAgC;AAAA,IACpC,aAAA;AAAA,IACA,QAAA,EAAU,IAAA;AAAA,IACV,qBAAA,EAAuB,aAAA;AAAA,IACvB;AAAA,EACF,CAAA;AAEA,EAAA,GAAA,CAAI,cAAA,EAAgB,aAAA,EAAe;AACjC,IAAA,MAAA,CAAO,SAAA,EAAW,KAAA;AAAA,EACpB;AAEA,EAAA,OAAO,MAAA;AACT;AAcA,IAAM,QAAA,EAAU;AAAA,EACd,EAAA,EAAI,OAAA;AAAA,EACJ,EAAA,EAAI,OAAA;AAAA,EACJ,EAAA,EAAI,OAAA;AAAA,EACJ,CAAA,EAAG,MAAA;AAAA,EACH,CAAA,EAAG,OAAA;AAAA,EACH,CAAA,EAAG;AACL,CAAA;AAqBA,SAAS,MAAA,CAAO,EAAA,EAAc,IAAA,EAAY;AACxC,EAAA,OACE,IAAA,CAAK,CAAC,EAAA,GAAK,EAAA,CAAG,CAAC,EAAA,GAAK,IAAA,CAAK,CAAC,EAAA,GAAK,EAAA,CAAG,CAAC,EAAA,GAAK,IAAA,CAAK,CAAC,EAAA,GAAK,EAAA,CAAG,CAAC,EAAA,GAAK,IAAA,CAAK,CAAC,EAAA,GAAK,EAAA,CAAG,CAAC,CAAA;AAE/E;AAQA,SAAS,SAAA,CAAU,GAAA,EAAa;AAC9B,EAAA,MAAM,EAAA,EAAc,CAAC,CAAA;AACrB,EAAA,SAAS,KAAA,CAAM,CAAA,EAAmB;AAChC,IAAA,GAAA,CAAI,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,CAAA,EAAG;AACtB,MAAA,OAAO,CAAA;AAAA,IACT;AACA,IAAA,GAAA,CAAI,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA,EAAG;AACZ,MAAA,OAAO,CAAA,CAAE,CAAC,CAAA;AAAA,IACZ;AACA,IAAA,OAAQ,CAAA,CAAE,CAAC,EAAA,EAAI,KAAA,CAAM,EAAA,EAAI,CAAC,EAAA,EAAI,CAAA;AAAA,EAChC;AACA,EAAA,OAAO,KAAA,CAAM,GAAG,CAAA;AAClB;AAGA,IAAO,8BAAA,EAAQ,eAAA;ADtHf;AACE;AACA;AACF,2FAAC","file":"/home/runner/work/turf/turf/packages/turf-quadrat-analysis/dist/cjs/index.cjs","sourcesContent":[null,"import { BBox, FeatureCollection, Point } from \"geojson\";\nimport { area } from \"@turf/area\";\nimport { bbox as turfBBox } from \"@turf/bbox\";\nimport { bboxPolygon } from \"@turf/bbox-polygon\";\nimport { getCoord } from \"@turf/invariant\";\nimport { squareGrid } from \"@turf/square-grid\";\n\ninterface QuadratAnalysisResult {\n  criticalValue: number;\n  maxAbsoluteDifference: number;\n  isRandom: boolean;\n  observedDistribution: number[];\n}\n\n/**\n * Quadrat analysis lays a set of equal-size areas(quadrat) over the study area and counts\n * the number of features in each quadrat and creates a frequency table.\n * The table lists the number of quadrats containing no features,\n * the number containing one feature, two features, and so on,\n * all the way up to the quadrat containing the most features.\n * The method then creates the frequency table for the random distribution, usually based on a Poisson distribution.\n * The method uses the distribution to calculate the probability for 0 feature occuring,\n * 1 feature occuring, 2 features, and so on,\n * and lists these probabilities in the frequency table.\n * By comparing the two frequency tables, you can see whether the features create a pattern.\n * If the table for the observed distribution has more quadrats containing many features than the\n * table for the random distribution dose, then the features create a clustered pattern.\n *\n * It is hard to judge the frequency tables are similar or different just by looking at them.\n * So, we can use serval statistical tests to find out how much the frequency tables differ.\n * We use Kolmogorov-Smirnov test.This method calculates cumulative probabilities for both distributions,\n * and then compares the cumulative probabilities at each class level and selects the largest absolute difference D.\n * Then, the test compares D to the critical value for a confidence level you specify.\n * If D is greater than the critical value, the difference between  the observed distribution and\n * the random distribution is significant. The greater the value the bigger the difference.\n *\n * Traditionally, squares are used for the shape of the quadrats, in a regular grid(square-grid).\n * Some researchers suggest that the quadrat size equal twice the size of mean area per feature,\n * which is simply the area of the study area divided by the number of features.\n *\n *\n * @function\n * @param {FeatureCollection<Point>} pointFeatureSet point set to study\n * @param {Object} [options={}] optional parameters\n * @param {[number, number, number, number]} [options.studyBbox] bbox representing the study area\n * @param {20 | 15 | 10 | 5 | 2 | 1} [options.confidenceLevel=20] a confidence level.\n * The unit is percentage . 5 means 95%, value must be in {@link K_TABLE}\n * @returns {QuadratAnalysisResult} result\n * @example\n *\n * var bbox = [-65, 40, -63, 42];\n * var dataset = turf.randomPoint(100, { bbox: bbox });\n * var result = turf.quadratAnalysis(dataset);\n *\n */\nfunction quadratAnalysis(\n  pointFeatureSet: FeatureCollection<Point>,\n  options: {\n    studyBbox?: [number, number, number, number];\n    confidenceLevel?: 20 | 15 | 10 | 5 | 2 | 1;\n  }\n): QuadratAnalysisResult {\n  options = options || {};\n  const studyBbox = options.studyBbox || turfBBox(pointFeatureSet);\n  const confidenceLevel = options.confidenceLevel || 20;\n  const points = pointFeatureSet.features;\n\n  // create square-grid\n  const numOfPoints = points.length;\n  const sizeOfArea = area(bboxPolygon(studyBbox));\n  const lengthOfSide = Math.sqrt((sizeOfArea / numOfPoints) * 2);\n  const grid = squareGrid(studyBbox, lengthOfSide, {\n    units: \"meters\",\n  });\n  const quadrats = grid.features;\n\n  // count the number of features in each quadrat\n  const quadratIdDict: { [key: string]: { box: BBox; cnt: number } } = {};\n  for (let i = 0; i < quadrats.length; i++) {\n    quadratIdDict[i] = {\n      box: turfBBox(quadrats[i]),\n      cnt: 0,\n    };\n  }\n\n  let sumOfPoint = 0;\n  for (const pt of points) {\n    for (const key of Object.keys(quadratIdDict)) {\n      const box = quadratIdDict[key].box;\n      if (inBBox(getCoord(pt), box)) {\n        quadratIdDict[key].cnt += 1;\n        sumOfPoint += 1;\n        break;\n      }\n    }\n  }\n\n  // the most amount of features in quadrat\n  let maxCnt = 0;\n  for (const key of Object.keys(quadratIdDict)) {\n    const cnt = quadratIdDict[key].cnt;\n    if (cnt > maxCnt) {\n      maxCnt = cnt;\n    }\n  }\n\n  const expectedDistribution = [];\n  const numOfQuadrat = Object.keys(quadratIdDict).length;\n  const lambda = sumOfPoint / numOfQuadrat;\n\n  // get the cumulative probability of the random distribution\n  let cumulativeProbility = 0.0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    cumulativeProbility +=\n      (Math.exp(-lambda) * Math.pow(lambda, x)) / factorial(x);\n    expectedDistribution.push(cumulativeProbility);\n  }\n\n  // get the cumulative probability of the observed distribution\n  const observedDistribution = [];\n  let cumulativeObservedQuads = 0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    for (const key of Object.keys(quadratIdDict)) {\n      if (quadratIdDict[key].cnt === x) {\n        cumulativeObservedQuads += 1;\n      }\n    }\n    const p = cumulativeObservedQuads / numOfQuadrat;\n    observedDistribution.push(p);\n  }\n\n  // get the largest absolute difference between two distributions\n  let maxDifference = 0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    const difference = Math.abs(\n      expectedDistribution[x] - observedDistribution[x]\n    );\n    if (difference > maxDifference) {\n      maxDifference = difference;\n    }\n  }\n\n  const k = K_TABLE[confidenceLevel];\n\n  // statistical test\n  const criticalValue = k / Math.sqrt(numOfQuadrat);\n  const result: QuadratAnalysisResult = {\n    criticalValue,\n    isRandom: true,\n    maxAbsoluteDifference: maxDifference,\n    observedDistribution,\n  };\n\n  if (maxDifference > criticalValue) {\n    result.isRandom = false;\n  }\n\n  return result;\n}\n\n/**\n * the confidence level\n *\n * @constant\n * @type {Object}\n * @property {number} 20 1.07275\n * @property {number} 15 1.13795\n * @property {number} 10 1.22385\n * @property {number} 5 1.3581\n * @property {number} 2 1.51743\n * @property {number} 1 1.62762\n */\nconst K_TABLE = {\n  20: 1.07275,\n  15: 1.13795,\n  10: 1.22385,\n  5: 1.3581,\n  2: 1.51743,\n  1: 1.62762,\n};\n\n/**\n * the return type of the quadratAnalysis\n *\n * @typedef {object} QuadratAnalysisResult\n * @property {number} criticalValue\n * @property {number} maxAbsoluteDifference\n * @property {boolean} isRandom\n * @property {Array<number>} observedDistribution the cumulative distribution of observed features,\n * the index represents the number of features in the quadrat.\n */\n\n/**\n * inBBox from @turf/boolean-point-in-polygon\n *\n * @private\n * @param {Array<number>} pt point [x,y]\n * @param {BBox} bbox BBox [west, south, east, north]\n * @returns {boolean} true/false if point is inside BBox\n */\nfunction inBBox(pt: number[], bbox: BBox) {\n  return (\n    bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1]\n  );\n}\n\n/**\n * https://stackoverflow.com/questions/3959211/fast-factorial-function-in-javascript\n * @private\n * @param {number} num Number\n * @returns {number} the factorial of num\n */\nfunction factorial(num: number) {\n  const f: number[] = [];\n  function inner(n: number): number {\n    if (n === 0 || n === 1) {\n      return 1;\n    }\n    if (f[n] > 0) {\n      return f[n];\n    }\n    return (f[n] = inner(n - 1) * n);\n  }\n  return inner(num);\n}\n\nexport { QuadratAnalysisResult, quadratAnalysis };\nexport default quadratAnalysis;\n"]}

package/node_modules/@turf/quadrat-analysis/dist/cjs/index.d.cts

@@ -1,55 +0,0 @@
-import { FeatureCollection, Point } from 'geojson';
-
-interface QuadratAnalysisResult {
-    criticalValue: number;
-    maxAbsoluteDifference: number;
-    isRandom: boolean;
-    observedDistribution: number[];
-}
-/**
- * Quadrat analysis lays a set of equal-size areas(quadrat) over the study area and counts
- * the number of features in each quadrat and creates a frequency table.
- * The table lists the number of quadrats containing no features,
- * the number containing one feature, two features, and so on,
- * all the way up to the quadrat containing the most features.
- * The method then creates the frequency table for the random distribution, usually based on a Poisson distribution.
- * The method uses the distribution to calculate the probability for 0 feature occuring,
- * 1 feature occuring, 2 features, and so on,
- * and lists these probabilities in the frequency table.
- * By comparing the two frequency tables, you can see whether the features create a pattern.
- * If the table for the observed distribution has more quadrats containing many features than the
- * table for the random distribution dose, then the features create a clustered pattern.
- *
- * It is hard to judge the frequency tables are similar or different just by looking at them.
- * So, we can use serval statistical tests to find out how much the frequency tables differ.
- * We use Kolmogorov-Smirnov test.This method calculates cumulative probabilities for both distributions,
- * and then compares the cumulative probabilities at each class level and selects the largest absolute difference D.
- * Then, the test compares D to the critical value for a confidence level you specify.
- * If D is greater than the critical value, the difference between  the observed distribution and
- * the random distribution is significant. The greater the value the bigger the difference.
- *
- * Traditionally, squares are used for the shape of the quadrats, in a regular grid(square-grid).
- * Some researchers suggest that the quadrat size equal twice the size of mean area per feature,
- * which is simply the area of the study area divided by the number of features.
- *
- *
- * @function
- * @param {FeatureCollection<Point>} pointFeatureSet point set to study
- * @param {Object} [options={}] optional parameters
- * @param {[number, number, number, number]} [options.studyBbox] bbox representing the study area
- * @param {20 | 15 | 10 | 5 | 2 | 1} [options.confidenceLevel=20] a confidence level.
- * The unit is percentage . 5 means 95%, value must be in {@link K_TABLE}
- * @returns {QuadratAnalysisResult} result
- * @example
- *
- * var bbox = [-65, 40, -63, 42];
- * var dataset = turf.randomPoint(100, { bbox: bbox });
- * var result = turf.quadratAnalysis(dataset);
- *
- */
-declare function quadratAnalysis(pointFeatureSet: FeatureCollection<Point>, options: {
-    studyBbox?: [number, number, number, number];
-    confidenceLevel?: 20 | 15 | 10 | 5 | 2 | 1;
-}): QuadratAnalysisResult;
-
-export { type QuadratAnalysisResult, quadratAnalysis as default, quadratAnalysis };

package/node_modules/@turf/quadrat-analysis/dist/esm/index.d.ts

@@ -1,55 +0,0 @@
-import { FeatureCollection, Point } from 'geojson';
-
-interface QuadratAnalysisResult {
-    criticalValue: number;
-    maxAbsoluteDifference: number;
-    isRandom: boolean;
-    observedDistribution: number[];
-}
-/**
- * Quadrat analysis lays a set of equal-size areas(quadrat) over the study area and counts
- * the number of features in each quadrat and creates a frequency table.
- * The table lists the number of quadrats containing no features,
- * the number containing one feature, two features, and so on,
- * all the way up to the quadrat containing the most features.
- * The method then creates the frequency table for the random distribution, usually based on a Poisson distribution.
- * The method uses the distribution to calculate the probability for 0 feature occuring,
- * 1 feature occuring, 2 features, and so on,
- * and lists these probabilities in the frequency table.
- * By comparing the two frequency tables, you can see whether the features create a pattern.
- * If the table for the observed distribution has more quadrats containing many features than the
- * table for the random distribution dose, then the features create a clustered pattern.
- *
- * It is hard to judge the frequency tables are similar or different just by looking at them.
- * So, we can use serval statistical tests to find out how much the frequency tables differ.
- * We use Kolmogorov-Smirnov test.This method calculates cumulative probabilities for both distributions,
- * and then compares the cumulative probabilities at each class level and selects the largest absolute difference D.
- * Then, the test compares D to the critical value for a confidence level you specify.
- * If D is greater than the critical value, the difference between  the observed distribution and
- * the random distribution is significant. The greater the value the bigger the difference.
- *
- * Traditionally, squares are used for the shape of the quadrats, in a regular grid(square-grid).
- * Some researchers suggest that the quadrat size equal twice the size of mean area per feature,
- * which is simply the area of the study area divided by the number of features.
- *
- *
- * @function
- * @param {FeatureCollection<Point>} pointFeatureSet point set to study
- * @param {Object} [options={}] optional parameters
- * @param {[number, number, number, number]} [options.studyBbox] bbox representing the study area
- * @param {20 | 15 | 10 | 5 | 2 | 1} [options.confidenceLevel=20] a confidence level.
- * The unit is percentage . 5 means 95%, value must be in {@link K_TABLE}
- * @returns {QuadratAnalysisResult} result
- * @example
- *
- * var bbox = [-65, 40, -63, 42];
- * var dataset = turf.randomPoint(100, { bbox: bbox });
- * var result = turf.quadratAnalysis(dataset);
- *
- */
-declare function quadratAnalysis(pointFeatureSet: FeatureCollection<Point>, options: {
-    studyBbox?: [number, number, number, number];
-    confidenceLevel?: 20 | 15 | 10 | 5 | 2 | 1;
-}): QuadratAnalysisResult;
-
-export { type QuadratAnalysisResult, quadratAnalysis as default, quadratAnalysis };

package/node_modules/@turf/quadrat-analysis/dist/esm/index.js

@@ -1,114 +0,0 @@
-// index.ts
-import { area } from "@turf/area";
-import { bbox as turfBBox } from "@turf/bbox";
-import { bboxPolygon } from "@turf/bbox-polygon";
-import { getCoord } from "@turf/invariant";
-import { squareGrid } from "@turf/square-grid";
-function quadratAnalysis(pointFeatureSet, options) {
-  options = options || {};
-  const studyBbox = options.studyBbox || turfBBox(pointFeatureSet);
-  const confidenceLevel = options.confidenceLevel || 20;
-  const points = pointFeatureSet.features;
-  const numOfPoints = points.length;
-  const sizeOfArea = area(bboxPolygon(studyBbox));
-  const lengthOfSide = Math.sqrt(sizeOfArea / numOfPoints * 2);
-  const grid = squareGrid(studyBbox, lengthOfSide, {
-    units: "meters"
-  });
-  const quadrats = grid.features;
-  const quadratIdDict = {};
-  for (let i = 0; i < quadrats.length; i++) {
-    quadratIdDict[i] = {
-      box: turfBBox(quadrats[i]),
-      cnt: 0
-    };
-  }
-  let sumOfPoint = 0;
-  for (const pt of points) {
-    for (const key of Object.keys(quadratIdDict)) {
-      const box = quadratIdDict[key].box;
-      if (inBBox(getCoord(pt), box)) {
-        quadratIdDict[key].cnt += 1;
-        sumOfPoint += 1;
-        break;
-      }
-    }
-  }
-  let maxCnt = 0;
-  for (const key of Object.keys(quadratIdDict)) {
-    const cnt = quadratIdDict[key].cnt;
-    if (cnt > maxCnt) {
-      maxCnt = cnt;
-    }
-  }
-  const expectedDistribution = [];
-  const numOfQuadrat = Object.keys(quadratIdDict).length;
-  const lambda = sumOfPoint / numOfQuadrat;
-  let cumulativeProbility = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    cumulativeProbility += Math.exp(-lambda) * Math.pow(lambda, x) / factorial(x);
-    expectedDistribution.push(cumulativeProbility);
-  }
-  const observedDistribution = [];
-  let cumulativeObservedQuads = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    for (const key of Object.keys(quadratIdDict)) {
-      if (quadratIdDict[key].cnt === x) {
-        cumulativeObservedQuads += 1;
-      }
-    }
-    const p = cumulativeObservedQuads / numOfQuadrat;
-    observedDistribution.push(p);
-  }
-  let maxDifference = 0;
-  for (let x = 0; x < maxCnt + 1; x++) {
-    const difference = Math.abs(
-      expectedDistribution[x] - observedDistribution[x]
-    );
-    if (difference > maxDifference) {
-      maxDifference = difference;
-    }
-  }
-  const k = K_TABLE[confidenceLevel];
-  const criticalValue = k / Math.sqrt(numOfQuadrat);
-  const result = {
-    criticalValue,
-    isRandom: true,
-    maxAbsoluteDifference: maxDifference,
-    observedDistribution
-  };
-  if (maxDifference > criticalValue) {
-    result.isRandom = false;
-  }
-  return result;
-}
-var K_TABLE = {
-  20: 1.07275,
-  15: 1.13795,
-  10: 1.22385,
-  5: 1.3581,
-  2: 1.51743,
-  1: 1.62762
-};
-function inBBox(pt, bbox) {
-  return bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1];
-}
-function factorial(num) {
-  const f = [];
-  function inner(n) {
-    if (n === 0 || n === 1) {
-      return 1;
-    }
-    if (f[n] > 0) {
-      return f[n];
-    }
-    return f[n] = inner(n - 1) * n;
-  }
-  return inner(num);
-}
-var turf_quadrat_analysis_default = quadratAnalysis;
-export {
-  turf_quadrat_analysis_default as default,
-  quadratAnalysis
-};
-//# sourceMappingURL=index.js.map

package/node_modules/@turf/quadrat-analysis/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { BBox, FeatureCollection, Point } from \"geojson\";\nimport { area } from \"@turf/area\";\nimport { bbox as turfBBox } from \"@turf/bbox\";\nimport { bboxPolygon } from \"@turf/bbox-polygon\";\nimport { getCoord } from \"@turf/invariant\";\nimport { squareGrid } from \"@turf/square-grid\";\n\ninterface QuadratAnalysisResult {\n  criticalValue: number;\n  maxAbsoluteDifference: number;\n  isRandom: boolean;\n  observedDistribution: number[];\n}\n\n/**\n * Quadrat analysis lays a set of equal-size areas(quadrat) over the study area and counts\n * the number of features in each quadrat and creates a frequency table.\n * The table lists the number of quadrats containing no features,\n * the number containing one feature, two features, and so on,\n * all the way up to the quadrat containing the most features.\n * The method then creates the frequency table for the random distribution, usually based on a Poisson distribution.\n * The method uses the distribution to calculate the probability for 0 feature occuring,\n * 1 feature occuring, 2 features, and so on,\n * and lists these probabilities in the frequency table.\n * By comparing the two frequency tables, you can see whether the features create a pattern.\n * If the table for the observed distribution has more quadrats containing many features than the\n * table for the random distribution dose, then the features create a clustered pattern.\n *\n * It is hard to judge the frequency tables are similar or different just by looking at them.\n * So, we can use serval statistical tests to find out how much the frequency tables differ.\n * We use Kolmogorov-Smirnov test.This method calculates cumulative probabilities for both distributions,\n * and then compares the cumulative probabilities at each class level and selects the largest absolute difference D.\n * Then, the test compares D to the critical value for a confidence level you specify.\n * If D is greater than the critical value, the difference between  the observed distribution and\n * the random distribution is significant. The greater the value the bigger the difference.\n *\n * Traditionally, squares are used for the shape of the quadrats, in a regular grid(square-grid).\n * Some researchers suggest that the quadrat size equal twice the size of mean area per feature,\n * which is simply the area of the study area divided by the number of features.\n *\n *\n * @function\n * @param {FeatureCollection<Point>} pointFeatureSet point set to study\n * @param {Object} [options={}] optional parameters\n * @param {[number, number, number, number]} [options.studyBbox] bbox representing the study area\n * @param {20 | 15 | 10 | 5 | 2 | 1} [options.confidenceLevel=20] a confidence level.\n * The unit is percentage . 5 means 95%, value must be in {@link K_TABLE}\n * @returns {QuadratAnalysisResult} result\n * @example\n *\n * var bbox = [-65, 40, -63, 42];\n * var dataset = turf.randomPoint(100, { bbox: bbox });\n * var result = turf.quadratAnalysis(dataset);\n *\n */\nfunction quadratAnalysis(\n  pointFeatureSet: FeatureCollection<Point>,\n  options: {\n    studyBbox?: [number, number, number, number];\n    confidenceLevel?: 20 | 15 | 10 | 5 | 2 | 1;\n  }\n): QuadratAnalysisResult {\n  options = options || {};\n  const studyBbox = options.studyBbox || turfBBox(pointFeatureSet);\n  const confidenceLevel = options.confidenceLevel || 20;\n  const points = pointFeatureSet.features;\n\n  // create square-grid\n  const numOfPoints = points.length;\n  const sizeOfArea = area(bboxPolygon(studyBbox));\n  const lengthOfSide = Math.sqrt((sizeOfArea / numOfPoints) * 2);\n  const grid = squareGrid(studyBbox, lengthOfSide, {\n    units: \"meters\",\n  });\n  const quadrats = grid.features;\n\n  // count the number of features in each quadrat\n  const quadratIdDict: { [key: string]: { box: BBox; cnt: number } } = {};\n  for (let i = 0; i < quadrats.length; i++) {\n    quadratIdDict[i] = {\n      box: turfBBox(quadrats[i]),\n      cnt: 0,\n    };\n  }\n\n  let sumOfPoint = 0;\n  for (const pt of points) {\n    for (const key of Object.keys(quadratIdDict)) {\n      const box = quadratIdDict[key].box;\n      if (inBBox(getCoord(pt), box)) {\n        quadratIdDict[key].cnt += 1;\n        sumOfPoint += 1;\n        break;\n      }\n    }\n  }\n\n  // the most amount of features in quadrat\n  let maxCnt = 0;\n  for (const key of Object.keys(quadratIdDict)) {\n    const cnt = quadratIdDict[key].cnt;\n    if (cnt > maxCnt) {\n      maxCnt = cnt;\n    }\n  }\n\n  const expectedDistribution = [];\n  const numOfQuadrat = Object.keys(quadratIdDict).length;\n  const lambda = sumOfPoint / numOfQuadrat;\n\n  // get the cumulative probability of the random distribution\n  let cumulativeProbility = 0.0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    cumulativeProbility +=\n      (Math.exp(-lambda) * Math.pow(lambda, x)) / factorial(x);\n    expectedDistribution.push(cumulativeProbility);\n  }\n\n  // get the cumulative probability of the observed distribution\n  const observedDistribution = [];\n  let cumulativeObservedQuads = 0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    for (const key of Object.keys(quadratIdDict)) {\n      if (quadratIdDict[key].cnt === x) {\n        cumulativeObservedQuads += 1;\n      }\n    }\n    const p = cumulativeObservedQuads / numOfQuadrat;\n    observedDistribution.push(p);\n  }\n\n  // get the largest absolute difference between two distributions\n  let maxDifference = 0;\n  for (let x = 0; x < maxCnt + 1; x++) {\n    const difference = Math.abs(\n      expectedDistribution[x] - observedDistribution[x]\n    );\n    if (difference > maxDifference) {\n      maxDifference = difference;\n    }\n  }\n\n  const k = K_TABLE[confidenceLevel];\n\n  // statistical test\n  const criticalValue = k / Math.sqrt(numOfQuadrat);\n  const result: QuadratAnalysisResult = {\n    criticalValue,\n    isRandom: true,\n    maxAbsoluteDifference: maxDifference,\n    observedDistribution,\n  };\n\n  if (maxDifference > criticalValue) {\n    result.isRandom = false;\n  }\n\n  return result;\n}\n\n/**\n * the confidence level\n *\n * @constant\n * @type {Object}\n * @property {number} 20 1.07275\n * @property {number} 15 1.13795\n * @property {number} 10 1.22385\n * @property {number} 5 1.3581\n * @property {number} 2 1.51743\n * @property {number} 1 1.62762\n */\nconst K_TABLE = {\n  20: 1.07275,\n  15: 1.13795,\n  10: 1.22385,\n  5: 1.3581,\n  2: 1.51743,\n  1: 1.62762,\n};\n\n/**\n * the return type of the quadratAnalysis\n *\n * @typedef {object} QuadratAnalysisResult\n * @property {number} criticalValue\n * @property {number} maxAbsoluteDifference\n * @property {boolean} isRandom\n * @property {Array<number>} observedDistribution the cumulative distribution of observed features,\n * the index represents the number of features in the quadrat.\n */\n\n/**\n * inBBox from @turf/boolean-point-in-polygon\n *\n * @private\n * @param {Array<number>} pt point [x,y]\n * @param {BBox} bbox BBox [west, south, east, north]\n * @returns {boolean} true/false if point is inside BBox\n */\nfunction inBBox(pt: number[], bbox: BBox) {\n  return (\n    bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1]\n  );\n}\n\n/**\n * https://stackoverflow.com/questions/3959211/fast-factorial-function-in-javascript\n * @private\n * @param {number} num Number\n * @returns {number} the factorial of num\n */\nfunction factorial(num: number) {\n  const f: number[] = [];\n  function inner(n: number): number {\n    if (n === 0 || n === 1) {\n      return 1;\n    }\n    if (f[n] > 0) {\n      return f[n];\n    }\n    return (f[n] = inner(n - 1) * n);\n  }\n  return inner(num);\n}\n\nexport { QuadratAnalysisResult, quadratAnalysis };\nexport default quadratAnalysis;\n"],"mappings":";AACA,SAAS,YAAY;AACrB,SAAS,QAAQ,gBAAgB;AACjC,SAAS,mBAAmB;AAC5B,SAAS,gBAAgB;AACzB,SAAS,kBAAkB;AAkD3B,SAAS,gBACP,iBACA,SAIuB;AACvB,YAAU,WAAW,CAAC;AACtB,QAAM,YAAY,QAAQ,aAAa,SAAS,eAAe;AAC/D,QAAM,kBAAkB,QAAQ,mBAAmB;AACnD,QAAM,SAAS,gBAAgB;AAG/B,QAAM,cAAc,OAAO;AAC3B,QAAM,aAAa,KAAK,YAAY,SAAS,CAAC;AAC9C,QAAM,eAAe,KAAK,KAAM,aAAa,cAAe,CAAC;AAC7D,QAAM,OAAO,WAAW,WAAW,cAAc;AAAA,IAC/C,OAAO;AAAA,EACT,CAAC;AACD,QAAM,WAAW,KAAK;AAGtB,QAAM,gBAA+D,CAAC;AACtE,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,kBAAc,CAAC,IAAI;AAAA,MACjB,KAAK,SAAS,SAAS,CAAC,CAAC;AAAA,MACzB,KAAK;AAAA,IACP;AAAA,EACF;AAEA,MAAI,aAAa;AACjB,aAAW,MAAM,QAAQ;AACvB,eAAW,OAAO,OAAO,KAAK,aAAa,GAAG;AAC5C,YAAM,MAAM,cAAc,GAAG,EAAE;AAC/B,UAAI,OAAO,SAAS,EAAE,GAAG,GAAG,GAAG;AAC7B,sBAAc,GAAG,EAAE,OAAO;AAC1B,sBAAc;AACd;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,SAAS;AACb,aAAW,OAAO,OAAO,KAAK,aAAa,GAAG;AAC5C,UAAM,MAAM,cAAc,GAAG,EAAE;AAC/B,QAAI,MAAM,QAAQ;AAChB,eAAS;AAAA,IACX;AAAA,EACF;AAEA,QAAM,uBAAuB,CAAC;AAC9B,QAAM,eAAe,OAAO,KAAK,aAAa,EAAE;AAChD,QAAM,SAAS,aAAa;AAG5B,MAAI,sBAAsB;AAC1B,WAAS,IAAI,GAAG,IAAI,SAAS,GAAG,KAAK;AACnC,2BACG,KAAK,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,QAAQ,CAAC,IAAK,UAAU,CAAC;AACzD,yBAAqB,KAAK,mBAAmB;AAAA,EAC/C;AAGA,QAAM,uBAAuB,CAAC;AAC9B,MAAI,0BAA0B;AAC9B,WAAS,IAAI,GAAG,IAAI,SAAS,GAAG,KAAK;AACnC,eAAW,OAAO,OAAO,KAAK,aAAa,GAAG;AAC5C,UAAI,cAAc,GAAG,EAAE,QAAQ,GAAG;AAChC,mCAA2B;AAAA,MAC7B;AAAA,IACF;AACA,UAAM,IAAI,0BAA0B;AACpC,yBAAqB,KAAK,CAAC;AAAA,EAC7B;AAGA,MAAI,gBAAgB;AACpB,WAAS,IAAI,GAAG,IAAI,SAAS,GAAG,KAAK;AACnC,UAAM,aAAa,KAAK;AAAA,MACtB,qBAAqB,CAAC,IAAI,qBAAqB,CAAC;AAAA,IAClD;AACA,QAAI,aAAa,eAAe;AAC9B,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,IAAI,QAAQ,eAAe;AAGjC,QAAM,gBAAgB,IAAI,KAAK,KAAK,YAAY;AAChD,QAAM,SAAgC;AAAA,IACpC;AAAA,IACA,UAAU;AAAA,IACV,uBAAuB;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,gBAAgB,eAAe;AACjC,WAAO,WAAW;AAAA,EACpB;AAEA,SAAO;AACT;AAcA,IAAM,UAAU;AAAA,EACd,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAqBA,SAAS,OAAO,IAAc,MAAY;AACxC,SACE,KAAK,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,CAAC,KAAK,GAAG,CAAC;AAE/E;AAQA,SAAS,UAAU,KAAa;AAC9B,QAAM,IAAc,CAAC;AACrB,WAAS,MAAM,GAAmB;AAChC,QAAI,MAAM,KAAK,MAAM,GAAG;AACtB,aAAO;AAAA,IACT;AACA,QAAI,EAAE,CAAC,IAAI,GAAG;AACZ,aAAO,EAAE,CAAC;AAAA,IACZ;AACA,WAAQ,EAAE,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI;AAAA,EAChC;AACA,SAAO,MAAM,GAAG;AAClB;AAGA,IAAO,gCAAQ;","names":[]}

package/node_modules/@turf/quadrat-analysis/package.json

@@ -1,81 +0,0 @@
-{
-  "name": "@turf/quadrat-analysis",
-  "version": "7.2.0",
-  "description": "turf quadrat-analysis module",
-  "author": "Turf Authors",
-  "contributors": [
-    "Haoming Zhuang <@zhuang-hao-ming>"
-  ],
-  "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",
-    "quadrat-analysis"
-  ],
-  "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": {
-    "@turf/nearest-neighbor-analysis": "^7.2.0",
-    "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.13.4",
-    "benchmark": "^2.1.4",
-    "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/area": "^7.2.0",
-    "@turf/bbox": "^7.2.0",
-    "@turf/bbox-polygon": "^7.2.0",
-    "@turf/centroid": "^7.2.0",
-    "@turf/helpers": "^7.2.0",
-    "@turf/invariant": "^7.2.0",
-    "@turf/point-grid": "^7.2.0",
-    "@turf/random": "^7.2.0",
-    "@turf/square-grid": "^7.2.0",
-    "@types/geojson": "^7946.0.10",
-    "tslib": "^2.8.1"
-  },
-  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
-}

package/node_modules/@turf/random/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.