@turf/boolean-disjoint 7.0.0-alpha.1 → 7.0.0-alpha.110

package/README.md

@@ -29,26 +29,21 @@ Returns **[boolean][3]** true/false
 
 [3]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean
 
-<!-- This file is automatically generated. Please don't edit it directly:
-if you find an error, edit the source file (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/boolean-disjoint
 ```
 
-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,143 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// index.ts
+var _booleanpointinpolygon = require('@turf/boolean-point-in-polygon');
+var _lineintersect = require('@turf/line-intersect');
+var _meta = require('@turf/meta');
+var _polygontoline = require('@turf/polygon-to-line');
+function booleanDisjoint(feature1, feature2) {
+  let bool = true;
+  _meta.flattenEach.call(void 0, feature1, (flatten1) => {
+    _meta.flattenEach.call(void 0, feature2, (flatten2) => {
+      if (bool === false) {
+        return false;
+      }
+      bool = disjoint(flatten1.geometry, flatten2.geometry);
+    });
+  });
+  return bool;
+}
+__name(booleanDisjoint, "booleanDisjoint");
+function disjoint(geom1, geom2) {
+  switch (geom1.type) {
+    case "Point":
+      switch (geom2.type) {
+        case "Point":
+          return !compareCoords(geom1.coordinates, geom2.coordinates);
+        case "LineString":
+          return !isPointOnLine(geom2, geom1);
+        case "Polygon":
+          return !_booleanpointinpolygon.booleanPointInPolygon.call(void 0, geom1, geom2);
+      }
+      break;
+    case "LineString":
+      switch (geom2.type) {
+        case "Point":
+          return !isPointOnLine(geom1, geom2);
+        case "LineString":
+          return !isLineOnLine(geom1, geom2);
+        case "Polygon":
+          return !isLineInPoly(geom2, geom1);
+      }
+      break;
+    case "Polygon":
+      switch (geom2.type) {
+        case "Point":
+          return !_booleanpointinpolygon.booleanPointInPolygon.call(void 0, geom2, geom1);
+        case "LineString":
+          return !isLineInPoly(geom1, geom2);
+        case "Polygon":
+          return !isPolyInPoly(geom2, geom1);
+      }
+  }
+  return false;
+}
+__name(disjoint, "disjoint");
+function isPointOnLine(lineString, pt) {
+  for (let i = 0; i < lineString.coordinates.length - 1; i++) {
+    if (isPointOnLineSegment(
+      lineString.coordinates[i],
+      lineString.coordinates[i + 1],
+      pt.coordinates
+    )) {
+      return true;
+    }
+  }
+  return false;
+}
+__name(isPointOnLine, "isPointOnLine");
+function isLineOnLine(lineString1, lineString2) {
+  const doLinesIntersect = _lineintersect.lineIntersect.call(void 0, lineString1, lineString2);
+  if (doLinesIntersect.features.length > 0) {
+    return true;
+  }
+  return false;
+}
+__name(isLineOnLine, "isLineOnLine");
+function isLineInPoly(polygon, lineString) {
+  for (const coord of lineString.coordinates) {
+    if (_booleanpointinpolygon.booleanPointInPolygon.call(void 0, coord, polygon)) {
+      return true;
+    }
+  }
+  const doLinesIntersect = _lineintersect.lineIntersect.call(void 0, lineString, _polygontoline.polygonToLine.call(void 0, polygon));
+  if (doLinesIntersect.features.length > 0) {
+    return true;
+  }
+  return false;
+}
+__name(isLineInPoly, "isLineInPoly");
+function isPolyInPoly(feature1, feature2) {
+  for (const coord1 of feature1.coordinates[0]) {
+    if (_booleanpointinpolygon.booleanPointInPolygon.call(void 0, coord1, feature2)) {
+      return true;
+    }
+  }
+  for (const coord2 of feature2.coordinates[0]) {
+    if (_booleanpointinpolygon.booleanPointInPolygon.call(void 0, coord2, feature1)) {
+      return true;
+    }
+  }
+  const doLinesIntersect = _lineintersect.lineIntersect.call(void 0, 
+    _polygontoline.polygonToLine.call(void 0, feature1),
+    _polygontoline.polygonToLine.call(void 0, feature2)
+  );
+  if (doLinesIntersect.features.length > 0) {
+    return true;
+  }
+  return false;
+}
+__name(isPolyInPoly, "isPolyInPoly");
+function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt) {
+  const dxc = pt[0] - lineSegmentStart[0];
+  const dyc = pt[1] - lineSegmentStart[1];
+  const dxl = lineSegmentEnd[0] - lineSegmentStart[0];
+  const dyl = lineSegmentEnd[1] - lineSegmentStart[1];
+  const cross = dxc * dyl - dyc * dxl;
+  if (cross !== 0) {
+    return false;
+  }
+  if (Math.abs(dxl) >= Math.abs(dyl)) {
+    if (dxl > 0) {
+      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];
+    } else {
+      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
+    }
+  } else if (dyl > 0) {
+    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];
+  } else {
+    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
+  }
+}
+__name(isPointOnLineSegment, "isPointOnLineSegment");
+function compareCoords(pair1, pair2) {
+  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
+}
+__name(compareCoords, "compareCoords");
+var turf_boolean_disjoint_default = booleanDisjoint;
+
+
+
+exports.booleanDisjoint = booleanDisjoint; exports.default = turf_boolean_disjoint_default;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"names":[],"mappings":";;;;AACA,SAAS,6BAA6B;AACtC,SAAS,qBAAqB;AAC9B,SAAS,mBAAmB;AAC5B,SAAS,qBAAqB;AAgB9B,SAAS,gBACP,UACA,UACS;AACT,MAAI,OAAO;AACX,cAAY,UAAU,CAAC,aAAa;AAClC,gBAAY,UAAU,CAAC,aAAa;AAClC,UAAI,SAAS,OAAO;AAClB,eAAO;AAAA,MACT;AACA,aAAO,SAAS,SAAS,UAAU,SAAS,QAAQ;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAdS;AAwBT,SAAS,SAAS,OAAY,OAAY;AACxC,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,MAAM,aAAa,MAAM,WAAW;AAAA,QAC5D,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,MAC9C;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,QACnC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,MACrC;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,QAC5C,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,QACnC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,MACrC;AAAA,EACJ;AACA,SAAO;AACT;AAnCS;AAsCT,SAAS,cAAc,YAAwB,IAAW;AACxD,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,SAAS,GAAG,KAAK;AAC1D,QACE;AAAA,MACE,WAAW,YAAY,CAAC;AAAA,MACxB,WAAW,YAAY,IAAI,CAAC;AAAA,MAC5B,GAAG;AAAA,IACL,GACA;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAbS;AAeT,SAAS,aAAa,aAAyB,aAAyB;AACtE,QAAM,mBAAmB,cAAc,aAAa,WAAW;AAC/D,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AANS;AAQT,SAAS,aAAa,SAAkB,YAAwB;AAC9D,aAAW,SAAS,WAAW,aAAa;AAC1C,QAAI,sBAAsB,OAAO,OAAO,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB,cAAc,YAAY,cAAc,OAAO,CAAC;AACzE,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAXS;AAuBT,SAAS,aAAa,UAAmB,UAAmB;AAC1D,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB;AAAA,IACvB,cAAc,QAAQ;AAAA,IACtB,cAAc,QAAQ;AAAA,EACxB;AACA,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAnBS;AAqBT,SAAS,qBACP,kBACA,gBACA,IACA;AACA,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,QAAQ,MAAM,MAAM,MAAM;AAChC,MAAI,UAAU,GAAG;AACf,WAAO;AAAA,EACT;AACA,MAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,QAAI,MAAM,GAAG;AACX,aAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,IAClE,OAAO;AACL,aAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,IAClE;AAAA,EACF,WAAW,MAAM,GAAG;AAClB,WAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,EAClE,OAAO;AACL,WAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,EAClE;AACF;AAxBS;AAkCT,SAAS,cAAc,OAAiB,OAAiB;AACvD,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC;AACtD;AAFS;AAKT,IAAO,gCAAQ","sourcesContent":["import { Feature, Geometry, LineString, Point, Polygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { flattenEach } from \"@turf/meta\";\nimport { polygonToLine } from \"@turf/polygon-to-line\";\n\n/**\n * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.\n *\n * @name booleanDisjoint\n * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry\n * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry\n * @returns {boolean} true/false\n * @example\n * var point = turf.point([2, 2]);\n * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n *\n * turf.booleanDisjoint(line, point);\n * //=true\n */\nfunction booleanDisjoint(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry\n): boolean {\n  let bool = true;\n  flattenEach(feature1, (flatten1) => {\n    flattenEach(feature2, (flatten2) => {\n      if (bool === false) {\n        return false;\n      }\n      bool = disjoint(flatten1.geometry, flatten2.geometry);\n    });\n  });\n  return bool;\n}\n\n/**\n * Disjoint operation for simple Geometries (Point/LineString/Polygon)\n *\n * @private\n * @param {Geometry<any>} geom1 GeoJSON Geometry\n * @param {Geometry<any>} geom2 GeoJSON Geometry\n * @returns {boolean} true/false\n */\nfunction disjoint(geom1: any, geom2: any) {\n  switch (geom1.type) {\n    case \"Point\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !compareCoords(geom1.coordinates, geom2.coordinates);\n        case \"LineString\":\n          return !isPointOnLine(geom2, geom1);\n        case \"Polygon\":\n          return !booleanPointInPolygon(geom1, geom2);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"LineString\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !isPointOnLine(geom1, geom2);\n        case \"LineString\":\n          return !isLineOnLine(geom1, geom2);\n        case \"Polygon\":\n          return !isLineInPoly(geom2, geom1);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"Polygon\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !booleanPointInPolygon(geom2, geom1);\n        case \"LineString\":\n          return !isLineInPoly(geom1, geom2);\n        case \"Polygon\":\n          return !isPolyInPoly(geom2, geom1);\n      }\n  }\n  return false;\n}\n\n// http://stackoverflow.com/a/11908158/1979085\nfunction isPointOnLine(lineString: LineString, pt: Point) {\n  for (let i = 0; i < lineString.coordinates.length - 1; i++) {\n    if (\n      isPointOnLineSegment(\n        lineString.coordinates[i],\n        lineString.coordinates[i + 1],\n        pt.coordinates\n      )\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction isLineOnLine(lineString1: LineString, lineString2: LineString) {\n  const doLinesIntersect = lineIntersect(lineString1, lineString2);\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isLineInPoly(polygon: Polygon, lineString: LineString) {\n  for (const coord of lineString.coordinates) {\n    if (booleanPointInPolygon(coord, polygon)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon));\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Is Polygon (geom1) in Polygon (geom2)\n * Only takes into account outer rings\n * See http://stackoverflow.com/a/4833823/1979085\n *\n * @private\n * @param {Geometry|Feature<Polygon>} feature1 Polygon1\n * @param {Geometry|Feature<Polygon>} feature2 Polygon2\n * @returns {boolean} true/false\n */\nfunction isPolyInPoly(feature1: Polygon, feature2: Polygon) {\n  for (const coord1 of feature1.coordinates[0]) {\n    if (booleanPointInPolygon(coord1, feature2)) {\n      return true;\n    }\n  }\n  for (const coord2 of feature2.coordinates[0]) {\n    if (booleanPointInPolygon(coord2, feature1)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(\n    polygonToLine(feature1),\n    polygonToLine(feature2)\n  );\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isPointOnLineSegment(\n  lineSegmentStart: number[],\n  lineSegmentEnd: number[],\n  pt: number[]\n) {\n  const dxc = pt[0] - lineSegmentStart[0];\n  const dyc = pt[1] - lineSegmentStart[1];\n  const dxl = lineSegmentEnd[0] - lineSegmentStart[0];\n  const dyl = lineSegmentEnd[1] - lineSegmentStart[1];\n  const cross = dxc * dyl - dyc * dxl;\n  if (cross !== 0) {\n    return false;\n  }\n  if (Math.abs(dxl) >= Math.abs(dyl)) {\n    if (dxl > 0) {\n      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];\n    } else {\n      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];\n    }\n  } else if (dyl > 0) {\n    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];\n  } else {\n    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];\n  }\n}\n\n/**\n * compareCoords\n *\n * @private\n * @param {Position} pair1 point [x,y]\n * @param {Position} pair2 point [x,y]\n * @returns {boolean} true/false if coord pairs match\n */\nfunction compareCoords(pair1: number[], pair2: number[]) {\n  return pair1[0] === pair2[0] && pair1[1] === pair2[1];\n}\n\nexport { booleanDisjoint };\nexport default booleanDisjoint;\n"]}

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

@@ -1,4 +1,5 @@
-import { Feature, Geometry } from "geojson";
+import { Feature, Geometry } from 'geojson';
+
 /**
  * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.
  *
@@ -14,4 +15,5 @@ import { Feature, Geometry } from "geojson";
  * //=true
  */
 declare function booleanDisjoint(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
-export default booleanDisjoint;
+
+export { booleanDisjoint, booleanDisjoint as default };

package/dist/esm/index.d.mts

@@ -0,0 +1,19 @@
+import { Feature, Geometry } from 'geojson';
+
+/**
+ * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.
+ *
+ * @name booleanDisjoint
+ * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
+ * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
+ * @returns {boolean} true/false
+ * @example
+ * var point = turf.point([2, 2]);
+ * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
+ *
+ * turf.booleanDisjoint(line, point);
+ * //=true
+ */
+declare function booleanDisjoint(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
+
+export { booleanDisjoint, booleanDisjoint as default };

package/dist/esm/index.mjs

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

package/dist/esm/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { Feature, Geometry, LineString, Point, Polygon } from \"geojson\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { flattenEach } from \"@turf/meta\";\nimport { polygonToLine } from \"@turf/polygon-to-line\";\n\n/**\n * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.\n *\n * @name booleanDisjoint\n * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry\n * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry\n * @returns {boolean} true/false\n * @example\n * var point = turf.point([2, 2]);\n * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n *\n * turf.booleanDisjoint(line, point);\n * //=true\n */\nfunction booleanDisjoint(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry\n): boolean {\n  let bool = true;\n  flattenEach(feature1, (flatten1) => {\n    flattenEach(feature2, (flatten2) => {\n      if (bool === false) {\n        return false;\n      }\n      bool = disjoint(flatten1.geometry, flatten2.geometry);\n    });\n  });\n  return bool;\n}\n\n/**\n * Disjoint operation for simple Geometries (Point/LineString/Polygon)\n *\n * @private\n * @param {Geometry<any>} geom1 GeoJSON Geometry\n * @param {Geometry<any>} geom2 GeoJSON Geometry\n * @returns {boolean} true/false\n */\nfunction disjoint(geom1: any, geom2: any) {\n  switch (geom1.type) {\n    case \"Point\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !compareCoords(geom1.coordinates, geom2.coordinates);\n        case \"LineString\":\n          return !isPointOnLine(geom2, geom1);\n        case \"Polygon\":\n          return !booleanPointInPolygon(geom1, geom2);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"LineString\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !isPointOnLine(geom1, geom2);\n        case \"LineString\":\n          return !isLineOnLine(geom1, geom2);\n        case \"Polygon\":\n          return !isLineInPoly(geom2, geom1);\n      }\n      /* istanbul ignore next */\n      break;\n    case \"Polygon\":\n      switch (geom2.type) {\n        case \"Point\":\n          return !booleanPointInPolygon(geom2, geom1);\n        case \"LineString\":\n          return !isLineInPoly(geom1, geom2);\n        case \"Polygon\":\n          return !isPolyInPoly(geom2, geom1);\n      }\n  }\n  return false;\n}\n\n// http://stackoverflow.com/a/11908158/1979085\nfunction isPointOnLine(lineString: LineString, pt: Point) {\n  for (let i = 0; i < lineString.coordinates.length - 1; i++) {\n    if (\n      isPointOnLineSegment(\n        lineString.coordinates[i],\n        lineString.coordinates[i + 1],\n        pt.coordinates\n      )\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction isLineOnLine(lineString1: LineString, lineString2: LineString) {\n  const doLinesIntersect = lineIntersect(lineString1, lineString2);\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isLineInPoly(polygon: Polygon, lineString: LineString) {\n  for (const coord of lineString.coordinates) {\n    if (booleanPointInPolygon(coord, polygon)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon));\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Is Polygon (geom1) in Polygon (geom2)\n * Only takes into account outer rings\n * See http://stackoverflow.com/a/4833823/1979085\n *\n * @private\n * @param {Geometry|Feature<Polygon>} feature1 Polygon1\n * @param {Geometry|Feature<Polygon>} feature2 Polygon2\n * @returns {boolean} true/false\n */\nfunction isPolyInPoly(feature1: Polygon, feature2: Polygon) {\n  for (const coord1 of feature1.coordinates[0]) {\n    if (booleanPointInPolygon(coord1, feature2)) {\n      return true;\n    }\n  }\n  for (const coord2 of feature2.coordinates[0]) {\n    if (booleanPointInPolygon(coord2, feature1)) {\n      return true;\n    }\n  }\n  const doLinesIntersect = lineIntersect(\n    polygonToLine(feature1),\n    polygonToLine(feature2)\n  );\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction isPointOnLineSegment(\n  lineSegmentStart: number[],\n  lineSegmentEnd: number[],\n  pt: number[]\n) {\n  const dxc = pt[0] - lineSegmentStart[0];\n  const dyc = pt[1] - lineSegmentStart[1];\n  const dxl = lineSegmentEnd[0] - lineSegmentStart[0];\n  const dyl = lineSegmentEnd[1] - lineSegmentStart[1];\n  const cross = dxc * dyl - dyc * dxl;\n  if (cross !== 0) {\n    return false;\n  }\n  if (Math.abs(dxl) >= Math.abs(dyl)) {\n    if (dxl > 0) {\n      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];\n    } else {\n      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];\n    }\n  } else if (dyl > 0) {\n    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];\n  } else {\n    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];\n  }\n}\n\n/**\n * compareCoords\n *\n * @private\n * @param {Position} pair1 point [x,y]\n * @param {Position} pair2 point [x,y]\n * @returns {boolean} true/false if coord pairs match\n */\nfunction compareCoords(pair1: number[], pair2: number[]) {\n  return pair1[0] === pair2[0] && pair1[1] === pair2[1];\n}\n\nexport { booleanDisjoint };\nexport default booleanDisjoint;\n"],"mappings":";;;;AACA,SAAS,6BAA6B;AACtC,SAAS,qBAAqB;AAC9B,SAAS,mBAAmB;AAC5B,SAAS,qBAAqB;AAgB9B,SAAS,gBACP,UACA,UACS;AACT,MAAI,OAAO;AACX,cAAY,UAAU,CAAC,aAAa;AAClC,gBAAY,UAAU,CAAC,aAAa;AAClC,UAAI,SAAS,OAAO;AAClB,eAAO;AAAA,MACT;AACA,aAAO,SAAS,SAAS,UAAU,SAAS,QAAQ;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAdS;AAwBT,SAAS,SAAS,OAAY,OAAY;AACxC,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,MAAM,aAAa,MAAM,WAAW;AAAA,QAC5D,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,MAC9C;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,cAAc,OAAO,KAAK;AAAA,QACpC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,QACnC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,MACrC;AAEA;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,MAAM;AAAA,QAClB,KAAK;AACH,iBAAO,CAAC,sBAAsB,OAAO,KAAK;AAAA,QAC5C,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,QACnC,KAAK;AACH,iBAAO,CAAC,aAAa,OAAO,KAAK;AAAA,MACrC;AAAA,EACJ;AACA,SAAO;AACT;AAnCS;AAsCT,SAAS,cAAc,YAAwB,IAAW;AACxD,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,SAAS,GAAG,KAAK;AAC1D,QACE;AAAA,MACE,WAAW,YAAY,CAAC;AAAA,MACxB,WAAW,YAAY,IAAI,CAAC;AAAA,MAC5B,GAAG;AAAA,IACL,GACA;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAbS;AAeT,SAAS,aAAa,aAAyB,aAAyB;AACtE,QAAM,mBAAmB,cAAc,aAAa,WAAW;AAC/D,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AANS;AAQT,SAAS,aAAa,SAAkB,YAAwB;AAC9D,aAAW,SAAS,WAAW,aAAa;AAC1C,QAAI,sBAAsB,OAAO,OAAO,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB,cAAc,YAAY,cAAc,OAAO,CAAC;AACzE,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAXS;AAuBT,SAAS,aAAa,UAAmB,UAAmB;AAC1D,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,aAAW,UAAU,SAAS,YAAY,CAAC,GAAG;AAC5C,QAAI,sBAAsB,QAAQ,QAAQ,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,mBAAmB;AAAA,IACvB,cAAc,QAAQ;AAAA,IACtB,cAAc,QAAQ;AAAA,EACxB;AACA,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAnBS;AAqBT,SAAS,qBACP,kBACA,gBACA,IACA;AACA,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACtC,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAClD,QAAM,QAAQ,MAAM,MAAM,MAAM;AAChC,MAAI,UAAU,GAAG;AACf,WAAO;AAAA,EACT;AACA,MAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,QAAI,MAAM,GAAG;AACX,aAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,IAClE,OAAO;AACL,aAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,IAClE;AAAA,EACF,WAAW,MAAM,GAAG;AAClB,WAAO,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC;AAAA,EAClE,OAAO;AACL,WAAO,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,EAClE;AACF;AAxBS;AAkCT,SAAS,cAAc,OAAiB,OAAiB;AACvD,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC;AACtD;AAFS;AAKT,IAAO,gCAAQ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/boolean-disjoint",
-  "version": "7.0.0-alpha.1",
+  "version": "7.0.0-alpha.110+1411d63a7",
   "description": "turf boolean-disjoint module",
   "author": "Turf Authors",
   "contributors": [
@@ -26,48 +26,53 @@
     "boolean",
     "de-9im"
   ],
-  "main": "dist/js/index.js",
-  "module": "dist/es/index.js",
+  "type": "commonjs",
+  "main": "dist/cjs/index.cjs",
+  "module": "dist/esm/index.mjs",
+  "types": "dist/cjs/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.mts",
+        "default": "./dist/esm/index.mjs"
+      },
+      "require": {
+        "types": "./dist/cjs/index.d.ts",
+        "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": "*",
+    "@types/benchmark": "^2.1.5",
+    "@types/tape": "^4.2.32",
+    "benchmark": "^2.1.4",
     "boolean-shapely": "*",
-    "load-json-file": "*",
-    "npm-run-all": "*",
-    "tape": "*",
-    "tslint": "*",
-    "tsx": "*",
-    "typescript": "*"
+    "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"
   },
   "dependencies": {
-    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.1",
-    "@turf/helpers": "^7.0.0-alpha.1",
-    "@turf/line-intersect": "^7.0.0-alpha.1",
-    "@turf/meta": "^7.0.0-alpha.1",
-    "@turf/polygon-to-line": "^7.0.0-alpha.1",
-    "tslib": "^2.3.0"
+    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/helpers": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/line-intersect": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/meta": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/polygon-to-line": "^7.0.0-alpha.110+1411d63a7",
+    "tslib": "^2.6.2"
   },
-  "gitHead": "cf7a0c507b017ca066acffd0ce23bda5b393fb5a"
+  "gitHead": "1411d63a74c275c9216fe48e9d3cb2d48a359068"
 }

package/dist/es/index.js

@@ -1,165 +0,0 @@
-import booleanPointInPolygon from "@turf/boolean-point-in-polygon";
-import lineIntersect from "@turf/line-intersect";
-import { flattenEach } from "@turf/meta";
-import polygonToLine from "@turf/polygon-to-line";
-/**
- * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.
- *
- * @name booleanDisjoint
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var point = turf.point([2, 2]);
- * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- *
- * turf.booleanDisjoint(line, point);
- * //=true
- */
-function booleanDisjoint(feature1, feature2) {
-    let bool = true;
-    flattenEach(feature1, (flatten1) => {
-        flattenEach(feature2, (flatten2) => {
-            if (bool === false) {
-                return false;
-            }
-            bool = disjoint(flatten1.geometry, flatten2.geometry);
-        });
-    });
-    return bool;
-}
-/**
- * Disjoint operation for simple Geometries (Point/LineString/Polygon)
- *
- * @private
- * @param {Geometry<any>} geom1 GeoJSON Geometry
- * @param {Geometry<any>} geom2 GeoJSON Geometry
- * @returns {boolean} true/false
- */
-function disjoint(geom1, geom2) {
-    switch (geom1.type) {
-        case "Point":
-            switch (geom2.type) {
-                case "Point":
-                    return !compareCoords(geom1.coordinates, geom2.coordinates);
-                case "LineString":
-                    return !isPointOnLine(geom2, geom1);
-                case "Polygon":
-                    return !booleanPointInPolygon(geom1, geom2);
-            }
-            /* istanbul ignore next */
-            break;
-        case "LineString":
-            switch (geom2.type) {
-                case "Point":
-                    return !isPointOnLine(geom1, geom2);
-                case "LineString":
-                    return !isLineOnLine(geom1, geom2);
-                case "Polygon":
-                    return !isLineInPoly(geom2, geom1);
-            }
-            /* istanbul ignore next */
-            break;
-        case "Polygon":
-            switch (geom2.type) {
-                case "Point":
-                    return !booleanPointInPolygon(geom2, geom1);
-                case "LineString":
-                    return !isLineInPoly(geom1, geom2);
-                case "Polygon":
-                    return !isPolyInPoly(geom2, geom1);
-            }
-    }
-    return false;
-}
-// http://stackoverflow.com/a/11908158/1979085
-function isPointOnLine(lineString, pt) {
-    for (let i = 0; i < lineString.coordinates.length - 1; i++) {
-        if (isPointOnLineSegment(lineString.coordinates[i], lineString.coordinates[i + 1], pt.coordinates)) {
-            return true;
-        }
-    }
-    return false;
-}
-function isLineOnLine(lineString1, lineString2) {
-    const doLinesIntersect = lineIntersect(lineString1, lineString2);
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function isLineInPoly(polygon, lineString) {
-    for (const coord of lineString.coordinates) {
-        if (booleanPointInPolygon(coord, polygon)) {
-            return true;
-        }
-    }
-    const doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon));
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-/**
- * Is Polygon (geom1) in Polygon (geom2)
- * Only takes into account outer rings
- * See http://stackoverflow.com/a/4833823/1979085
- *
- * @private
- * @param {Geometry|Feature<Polygon>} feature1 Polygon1
- * @param {Geometry|Feature<Polygon>} feature2 Polygon2
- * @returns {boolean} true/false
- */
-function isPolyInPoly(feature1, feature2) {
-    for (const coord1 of feature1.coordinates[0]) {
-        if (booleanPointInPolygon(coord1, feature2)) {
-            return true;
-        }
-    }
-    for (const coord2 of feature2.coordinates[0]) {
-        if (booleanPointInPolygon(coord2, feature1)) {
-            return true;
-        }
-    }
-    const doLinesIntersect = lineIntersect(polygonToLine(feature1), polygonToLine(feature2));
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt) {
-    const dxc = pt[0] - lineSegmentStart[0];
-    const dyc = pt[1] - lineSegmentStart[1];
-    const dxl = lineSegmentEnd[0] - lineSegmentStart[0];
-    const dyl = lineSegmentEnd[1] - lineSegmentStart[1];
-    const cross = dxc * dyl - dyc * dxl;
-    if (cross !== 0) {
-        return false;
-    }
-    if (Math.abs(dxl) >= Math.abs(dyl)) {
-        if (dxl > 0) {
-            return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];
-        }
-        else {
-            return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-        }
-    }
-    else if (dyl > 0) {
-        return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];
-    }
-    else {
-        return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-    }
-}
-/**
- * compareCoords
- *
- * @private
- * @param {Position} pair1 point [x,y]
- * @param {Position} pair2 point [x,y]
- * @returns {boolean} true/false if coord pairs match
- */
-function compareCoords(pair1, pair2) {
-    return pair1[0] === pair2[0] && pair1[1] === pair2[1];
-}
-export default booleanDisjoint;

package/dist/es/package.json

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

package/dist/js/index.js

@@ -1,168 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-const boolean_point_in_polygon_1 = tslib_1.__importDefault(require("@turf/boolean-point-in-polygon"));
-const line_intersect_1 = tslib_1.__importDefault(require("@turf/line-intersect"));
-const meta_1 = require("@turf/meta");
-const polygon_to_line_1 = tslib_1.__importDefault(require("@turf/polygon-to-line"));
-/**
- * Boolean-disjoint returns (TRUE) if the intersection of the two geometries is an empty set.
- *
- * @name booleanDisjoint
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var point = turf.point([2, 2]);
- * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- *
- * turf.booleanDisjoint(line, point);
- * //=true
- */
-function booleanDisjoint(feature1, feature2) {
-    let bool = true;
-    meta_1.flattenEach(feature1, (flatten1) => {
-        meta_1.flattenEach(feature2, (flatten2) => {
-            if (bool === false) {
-                return false;
-            }
-            bool = disjoint(flatten1.geometry, flatten2.geometry);
-        });
-    });
-    return bool;
-}
-/**
- * Disjoint operation for simple Geometries (Point/LineString/Polygon)
- *
- * @private
- * @param {Geometry<any>} geom1 GeoJSON Geometry
- * @param {Geometry<any>} geom2 GeoJSON Geometry
- * @returns {boolean} true/false
- */
-function disjoint(geom1, geom2) {
-    switch (geom1.type) {
-        case "Point":
-            switch (geom2.type) {
-                case "Point":
-                    return !compareCoords(geom1.coordinates, geom2.coordinates);
-                case "LineString":
-                    return !isPointOnLine(geom2, geom1);
-                case "Polygon":
-                    return !boolean_point_in_polygon_1.default(geom1, geom2);
-            }
-            /* istanbul ignore next */
-            break;
-        case "LineString":
-            switch (geom2.type) {
-                case "Point":
-                    return !isPointOnLine(geom1, geom2);
-                case "LineString":
-                    return !isLineOnLine(geom1, geom2);
-                case "Polygon":
-                    return !isLineInPoly(geom2, geom1);
-            }
-            /* istanbul ignore next */
-            break;
-        case "Polygon":
-            switch (geom2.type) {
-                case "Point":
-                    return !boolean_point_in_polygon_1.default(geom2, geom1);
-                case "LineString":
-                    return !isLineInPoly(geom1, geom2);
-                case "Polygon":
-                    return !isPolyInPoly(geom2, geom1);
-            }
-    }
-    return false;
-}
-// http://stackoverflow.com/a/11908158/1979085
-function isPointOnLine(lineString, pt) {
-    for (let i = 0; i < lineString.coordinates.length - 1; i++) {
-        if (isPointOnLineSegment(lineString.coordinates[i], lineString.coordinates[i + 1], pt.coordinates)) {
-            return true;
-        }
-    }
-    return false;
-}
-function isLineOnLine(lineString1, lineString2) {
-    const doLinesIntersect = line_intersect_1.default(lineString1, lineString2);
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function isLineInPoly(polygon, lineString) {
-    for (const coord of lineString.coordinates) {
-        if (boolean_point_in_polygon_1.default(coord, polygon)) {
-            return true;
-        }
-    }
-    const doLinesIntersect = line_intersect_1.default(lineString, polygon_to_line_1.default(polygon));
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-/**
- * Is Polygon (geom1) in Polygon (geom2)
- * Only takes into account outer rings
- * See http://stackoverflow.com/a/4833823/1979085
- *
- * @private
- * @param {Geometry|Feature<Polygon>} feature1 Polygon1
- * @param {Geometry|Feature<Polygon>} feature2 Polygon2
- * @returns {boolean} true/false
- */
-function isPolyInPoly(feature1, feature2) {
-    for (const coord1 of feature1.coordinates[0]) {
-        if (boolean_point_in_polygon_1.default(coord1, feature2)) {
-            return true;
-        }
-    }
-    for (const coord2 of feature2.coordinates[0]) {
-        if (boolean_point_in_polygon_1.default(coord2, feature1)) {
-            return true;
-        }
-    }
-    const doLinesIntersect = line_intersect_1.default(polygon_to_line_1.default(feature1), polygon_to_line_1.default(feature2));
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt) {
-    const dxc = pt[0] - lineSegmentStart[0];
-    const dyc = pt[1] - lineSegmentStart[1];
-    const dxl = lineSegmentEnd[0] - lineSegmentStart[0];
-    const dyl = lineSegmentEnd[1] - lineSegmentStart[1];
-    const cross = dxc * dyl - dyc * dxl;
-    if (cross !== 0) {
-        return false;
-    }
-    if (Math.abs(dxl) >= Math.abs(dyl)) {
-        if (dxl > 0) {
-            return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];
-        }
-        else {
-            return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-        }
-    }
-    else if (dyl > 0) {
-        return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];
-    }
-    else {
-        return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-    }
-}
-/**
- * compareCoords
- *
- * @private
- * @param {Position} pair1 point [x,y]
- * @param {Position} pair2 point [x,y]
- * @returns {boolean} true/false if coord pairs match
- */
-function compareCoords(pair1, pair2) {
-    return pair1[0] === pair2[0] && pair1[1] === pair2[1];
-}
-exports.default = booleanDisjoint;