@turf/boolean-crosses 7.0.0-alpha.0 → 7.0.0-alpha.110

package/README.md

@@ -34,26 +34,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-crosses
 ```
 
-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,150 @@
+"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 _lineintersect = require('@turf/line-intersect');
+var _polygontoline = require('@turf/polygon-to-line');
+var _booleanpointinpolygon = require('@turf/boolean-point-in-polygon');
+var _invariant = require('@turf/invariant');
+var _helpers = require('@turf/helpers');
+function booleanCrosses(feature1, feature2) {
+  var geom1 = _invariant.getGeom.call(void 0, feature1);
+  var geom2 = _invariant.getGeom.call(void 0, feature2);
+  var type1 = geom1.type;
+  var type2 = geom2.type;
+  switch (type1) {
+    case "MultiPoint":
+      switch (type2) {
+        case "LineString":
+          return doMultiPointAndLineStringCross(geom1, geom2);
+        case "Polygon":
+          return doesMultiPointCrossPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "LineString":
+      switch (type2) {
+        case "MultiPoint":
+          return doMultiPointAndLineStringCross(geom2, geom1);
+        case "LineString":
+          return doLineStringsCross(geom1, geom2);
+        case "Polygon":
+          return doLineStringAndPolygonCross(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "Polygon":
+      switch (type2) {
+        case "MultiPoint":
+          return doesMultiPointCrossPoly(geom2, geom1);
+        case "LineString":
+          return doLineStringAndPolygonCross(geom2, geom1);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    default:
+      throw new Error("feature1 " + type1 + " geometry not supported");
+  }
+}
+__name(booleanCrosses, "booleanCrosses");
+function doMultiPointAndLineStringCross(multiPoint, lineString) {
+  var foundIntPoint = false;
+  var foundExtPoint = false;
+  var pointLength = multiPoint.coordinates.length;
+  var i = 0;
+  while (i < pointLength && !foundIntPoint && !foundExtPoint) {
+    for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {
+      var incEndVertices = true;
+      if (i2 === 0 || i2 === lineString.coordinates.length - 2) {
+        incEndVertices = false;
+      }
+      if (isPointOnLineSegment(
+        lineString.coordinates[i2],
+        lineString.coordinates[i2 + 1],
+        multiPoint.coordinates[i],
+        incEndVertices
+      )) {
+        foundIntPoint = true;
+      } else {
+        foundExtPoint = true;
+      }
+    }
+    i++;
+  }
+  return foundIntPoint && foundExtPoint;
+}
+__name(doMultiPointAndLineStringCross, "doMultiPointAndLineStringCross");
+function doLineStringsCross(lineString1, lineString2) {
+  var doLinesIntersect = _lineintersect.lineIntersect.call(void 0, lineString1, lineString2);
+  if (doLinesIntersect.features.length > 0) {
+    for (var i = 0; i < lineString1.coordinates.length - 1; i++) {
+      for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {
+        var incEndVertices = true;
+        if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {
+          incEndVertices = false;
+        }
+        if (isPointOnLineSegment(
+          lineString1.coordinates[i],
+          lineString1.coordinates[i + 1],
+          lineString2.coordinates[i2],
+          incEndVertices
+        )) {
+          return true;
+        }
+      }
+    }
+  }
+  return false;
+}
+__name(doLineStringsCross, "doLineStringsCross");
+function doLineStringAndPolygonCross(lineString, polygon) {
+  const line = _polygontoline.polygonToLine.call(void 0, polygon);
+  const doLinesIntersect = _lineintersect.lineIntersect.call(void 0, lineString, line);
+  if (doLinesIntersect.features.length > 0) {
+    return true;
+  }
+  return false;
+}
+__name(doLineStringAndPolygonCross, "doLineStringAndPolygonCross");
+function doesMultiPointCrossPoly(multiPoint, polygon) {
+  var foundIntPoint = false;
+  var foundExtPoint = false;
+  var pointLength = multiPoint.coordinates.length;
+  for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {
+    if (_booleanpointinpolygon.booleanPointInPolygon.call(void 0, _helpers.point.call(void 0, multiPoint.coordinates[i]), polygon)) {
+      foundIntPoint = true;
+    } else {
+      foundExtPoint = true;
+    }
+  }
+  return foundExtPoint && foundIntPoint;
+}
+__name(doesMultiPointCrossPoly, "doesMultiPointCrossPoly");
+function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt, incEnd) {
+  var dxc = pt[0] - lineSegmentStart[0];
+  var dyc = pt[1] - lineSegmentStart[1];
+  var dxl = lineSegmentEnd[0] - lineSegmentStart[0];
+  var dyl = lineSegmentEnd[1] - lineSegmentStart[1];
+  var cross = dxc * dyl - dyc * dxl;
+  if (cross !== 0) {
+    return false;
+  }
+  if (incEnd) {
+    if (Math.abs(dxl) >= Math.abs(dyl)) {
+      return dxl > 0 ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0] : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
+    }
+    return dyl > 0 ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1] : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
+  } else {
+    if (Math.abs(dxl) >= Math.abs(dyl)) {
+      return dxl > 0 ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0] : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];
+    }
+    return dyl > 0 ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1] : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];
+  }
+}
+__name(isPointOnLineSegment, "isPointOnLineSegment");
+var turf_boolean_crosses_default = booleanCrosses;
+
+
+
+exports.booleanCrosses = booleanCrosses; exports.default = turf_boolean_crosses_default;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"names":[],"mappings":";;;;AACA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,6BAA6B;AACtC,SAAS,eAAe;AACxB,SAAS,aAAa;AAqBtB,SAAS,eACP,UACA,UACS;AACT,MAAI,QAAQ,QAAQ,QAAQ;AAC5B,MAAI,QAAQ,QAAQ,QAAQ;AAC5B,MAAI,QAAQ,MAAM;AAClB,MAAI,QAAQ,MAAM;AAElB,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,+BAA+B,OAAO,KAAK;AAAA,QACpD,KAAK;AACH,iBAAO,wBAAwB,OAAO,KAAK;AAAA,QAC7C;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,+BAA+B,OAAO,KAAK;AAAA,QACpD,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC,KAAK;AACH,iBAAO,4BAA4B,OAAO,KAAK;AAAA,QACjD;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,wBAAwB,OAAO,KAAK;AAAA,QAC7C,KAAK;AACH,iBAAO,4BAA4B,OAAO,KAAK;AAAA,QACjD;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF;AACE,YAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,EACnE;AACF;AA1CS;AA4CT,SAAS,+BACP,YACA,YACA;AACA,MAAI,gBAAgB;AACpB,MAAI,gBAAgB;AACpB,MAAI,cAAc,WAAW,YAAY;AACzC,MAAI,IAAI;AACR,SAAO,IAAI,eAAe,CAAC,iBAAiB,CAAC,eAAe;AAC1D,aAAS,KAAK,GAAG,KAAK,WAAW,YAAY,SAAS,GAAG,MAAM;AAC7D,UAAI,iBAAiB;AACrB,UAAI,OAAO,KAAK,OAAO,WAAW,YAAY,SAAS,GAAG;AACxD,yBAAiB;AAAA,MACnB;AACA,UACE;AAAA,QACE,WAAW,YAAY,EAAE;AAAA,QACzB,WAAW,YAAY,KAAK,CAAC;AAAA,QAC7B,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,MACF,GACA;AACA,wBAAgB;AAAA,MAClB,OAAO;AACL,wBAAgB;AAAA,MAClB;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO,iBAAiB;AAC1B;AA9BS;AAgCT,SAAS,mBAAmB,aAAyB,aAAyB;AAC5E,MAAI,mBAAmB,cAAc,aAAa,WAAW;AAC7D,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,aAAS,IAAI,GAAG,IAAI,YAAY,YAAY,SAAS,GAAG,KAAK;AAC3D,eAAS,KAAK,GAAG,KAAK,YAAY,YAAY,SAAS,GAAG,MAAM;AAC9D,YAAI,iBAAiB;AACrB,YAAI,OAAO,KAAK,OAAO,YAAY,YAAY,SAAS,GAAG;AACzD,2BAAiB;AAAA,QACnB;AACA,YACE;AAAA,UACE,YAAY,YAAY,CAAC;AAAA,UACzB,YAAY,YAAY,IAAI,CAAC;AAAA,UAC7B,YAAY,YAAY,EAAE;AAAA,UAC1B;AAAA,QACF,GACA;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAvBS;AAyBT,SAAS,4BAA4B,YAAwB,SAAkB;AAC7E,QAAM,OAAY,cAAc,OAAO;AACvC,QAAM,mBAAmB,cAAc,YAAY,IAAI;AACvD,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAPS;AAST,SAAS,wBAAwB,YAAwB,SAAkB;AACzE,MAAI,gBAAgB;AACpB,MAAI,gBAAgB;AACpB,MAAI,cAAc,WAAW,YAAY;AACzC,WAAS,IAAI,GAAG,IAAI,gBAAgB,CAAC,iBAAiB,CAAC,gBAAgB,KAAK;AAC1E,QAAI,sBAAsB,MAAM,WAAW,YAAY,CAAC,CAAC,GAAG,OAAO,GAAG;AACpE,sBAAgB;AAAA,IAClB,OAAO;AACL,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,SAAO,iBAAiB;AAC1B;AAbS;AA2BT,SAAS,qBACP,kBACA,gBACA,IACA,QACA;AACA,MAAI,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACpC,MAAI,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACpC,MAAI,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAChD,MAAI,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAChD,MAAI,QAAQ,MAAM,MAAM,MAAM;AAC9B,MAAI,UAAU,GAAG;AACf,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACV,QAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,aAAO,MAAM,IACT,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC,IACzD,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,IAC/D;AACA,WAAO,MAAM,IACT,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC,IACzD,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,EAC/D,OAAO;AACL,QAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,aAAO,MAAM,IACT,iBAAiB,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,eAAe,CAAC,IACvD,eAAe,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,iBAAiB,CAAC;AAAA,IAC7D;AACA,WAAO,MAAM,IACT,iBAAiB,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,eAAe,CAAC,IACvD,eAAe,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,iBAAiB,CAAC;AAAA,EAC7D;AACF;AAjCS;AAoCT,IAAO,+BAAQ","sourcesContent":["import { Feature, Geometry, Polygon, LineString, MultiPoint } from \"geojson\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { polygonToLine } from \"@turf/polygon-to-line\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { getGeom } from \"@turf/invariant\";\nimport { point } from \"@turf/helpers\";\n\n/**\n * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than\n * the maximum dimension of the two source geometries and the intersection set is interior to\n * both source geometries.\n *\n * Boolean-Crosses returns t (TRUE) for only multipoint/polygon, multipoint/linestring, linestring/linestring, linestring/polygon, and linestring/multipolygon comparisons.\n * Other comparisons are not supported as they are outside the OpenGIS Simple Features spec and may give unexpected results.\n *\n * @name booleanCrosses\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 line1 = turf.lineString([[-2, 2], [4, 2]]);\n * var line2 = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n *\n * var cross = turf.booleanCrosses(line1, line2);\n * //=true\n */\nfunction booleanCrosses(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry\n): boolean {\n  var geom1 = getGeom(feature1);\n  var geom2 = getGeom(feature2);\n  var type1 = geom1.type;\n  var type2 = geom2.type;\n\n  switch (type1) {\n    case \"MultiPoint\":\n      switch (type2) {\n        case \"LineString\":\n          return doMultiPointAndLineStringCross(geom1, geom2);\n        case \"Polygon\":\n          return doesMultiPointCrossPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"LineString\":\n      switch (type2) {\n        case \"MultiPoint\": // An inverse operation\n          return doMultiPointAndLineStringCross(geom2, geom1);\n        case \"LineString\":\n          return doLineStringsCross(geom1, geom2);\n        case \"Polygon\":\n          return doLineStringAndPolygonCross(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"Polygon\":\n      switch (type2) {\n        case \"MultiPoint\": // An inverse operation\n          return doesMultiPointCrossPoly(geom2, geom1);\n        case \"LineString\": // An inverse operation\n          return doLineStringAndPolygonCross(geom2, geom1);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    default:\n      throw new Error(\"feature1 \" + type1 + \" geometry not supported\");\n  }\n}\n\nfunction doMultiPointAndLineStringCross(\n  multiPoint: MultiPoint,\n  lineString: LineString\n) {\n  var foundIntPoint = false;\n  var foundExtPoint = false;\n  var pointLength = multiPoint.coordinates.length;\n  var i = 0;\n  while (i < pointLength && !foundIntPoint && !foundExtPoint) {\n    for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {\n      var incEndVertices = true;\n      if (i2 === 0 || i2 === lineString.coordinates.length - 2) {\n        incEndVertices = false;\n      }\n      if (\n        isPointOnLineSegment(\n          lineString.coordinates[i2],\n          lineString.coordinates[i2 + 1],\n          multiPoint.coordinates[i],\n          incEndVertices\n        )\n      ) {\n        foundIntPoint = true;\n      } else {\n        foundExtPoint = true;\n      }\n    }\n    i++;\n  }\n  return foundIntPoint && foundExtPoint;\n}\n\nfunction doLineStringsCross(lineString1: LineString, lineString2: LineString) {\n  var doLinesIntersect = lineIntersect(lineString1, lineString2);\n  if (doLinesIntersect.features.length > 0) {\n    for (var i = 0; i < lineString1.coordinates.length - 1; i++) {\n      for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {\n        var incEndVertices = true;\n        if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {\n          incEndVertices = false;\n        }\n        if (\n          isPointOnLineSegment(\n            lineString1.coordinates[i],\n            lineString1.coordinates[i + 1],\n            lineString2.coordinates[i2],\n            incEndVertices\n          )\n        ) {\n          return true;\n        }\n      }\n    }\n  }\n  return false;\n}\n\nfunction doLineStringAndPolygonCross(lineString: LineString, polygon: Polygon) {\n  const line: any = polygonToLine(polygon);\n  const doLinesIntersect = lineIntersect(lineString, line);\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction doesMultiPointCrossPoly(multiPoint: MultiPoint, polygon: Polygon) {\n  var foundIntPoint = false;\n  var foundExtPoint = false;\n  var pointLength = multiPoint.coordinates.length;\n  for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {\n    if (booleanPointInPolygon(point(multiPoint.coordinates[i]), polygon)) {\n      foundIntPoint = true;\n    } else {\n      foundExtPoint = true;\n    }\n  }\n\n  return foundExtPoint && foundIntPoint;\n}\n\n/**\n * Is a point on a line segment\n * Only takes into account outer rings\n * See http://stackoverflow.com/a/4833823/1979085\n *\n * @private\n * @param {number[]} lineSegmentStart coord pair of start of line\n * @param {number[]} lineSegmentEnd coord pair of end of line\n * @param {number[]} pt coord pair of point to check\n * @param {boolean} incEnd whether the point is allowed to fall on the line ends\n * @returns {boolean} true/false\n */\nfunction isPointOnLineSegment(\n  lineSegmentStart: number[],\n  lineSegmentEnd: number[],\n  pt: number[],\n  incEnd: boolean\n) {\n  var dxc = pt[0] - lineSegmentStart[0];\n  var dyc = pt[1] - lineSegmentStart[1];\n  var dxl = lineSegmentEnd[0] - lineSegmentStart[0];\n  var dyl = lineSegmentEnd[1] - lineSegmentStart[1];\n  var cross = dxc * dyl - dyc * dxl;\n  if (cross !== 0) {\n    return false;\n  }\n  if (incEnd) {\n    if (Math.abs(dxl) >= Math.abs(dyl)) {\n      return dxl > 0\n        ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0]\n        : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];\n    }\n    return dyl > 0\n      ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1]\n      : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];\n  } else {\n    if (Math.abs(dxl) >= Math.abs(dyl)) {\n      return dxl > 0\n        ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0]\n        : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];\n    }\n    return dyl > 0\n      ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1]\n      : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];\n  }\n}\n\nexport { booleanCrosses };\nexport default booleanCrosses;\n"]}

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

@@ -1,4 +1,5 @@
-import { Feature, Geometry } from "geojson";
+import { Feature, Geometry } from 'geojson';
+
 /**
  * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than
  * the maximum dimension of the two source geometries and the intersection set is interior to
@@ -19,4 +20,5 @@ import { Feature, Geometry } from "geojson";
  * //=true
  */
 declare function booleanCrosses(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
-export default booleanCrosses;
+
+export { booleanCrosses, booleanCrosses as default };

package/dist/esm/index.d.mts

@@ -0,0 +1,24 @@
+import { Feature, Geometry } from 'geojson';
+
+/**
+ * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than
+ * the maximum dimension of the two source geometries and the intersection set is interior to
+ * both source geometries.
+ *
+ * Boolean-Crosses returns t (TRUE) for only multipoint/polygon, multipoint/linestring, linestring/linestring, linestring/polygon, and linestring/multipolygon comparisons.
+ * Other comparisons are not supported as they are outside the OpenGIS Simple Features spec and may give unexpected results.
+ *
+ * @name booleanCrosses
+ * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
+ * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
+ * @returns {boolean} true/false
+ * @example
+ * var line1 = turf.lineString([[-2, 2], [4, 2]]);
+ * var line2 = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
+ *
+ * var cross = turf.booleanCrosses(line1, line2);
+ * //=true
+ */
+declare function booleanCrosses(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
+
+export { booleanCrosses, booleanCrosses as default };

package/dist/esm/index.mjs

@@ -0,0 +1,150 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// index.ts
+import { lineIntersect } from "@turf/line-intersect";
+import { polygonToLine } from "@turf/polygon-to-line";
+import { booleanPointInPolygon } from "@turf/boolean-point-in-polygon";
+import { getGeom } from "@turf/invariant";
+import { point } from "@turf/helpers";
+function booleanCrosses(feature1, feature2) {
+  var geom1 = getGeom(feature1);
+  var geom2 = getGeom(feature2);
+  var type1 = geom1.type;
+  var type2 = geom2.type;
+  switch (type1) {
+    case "MultiPoint":
+      switch (type2) {
+        case "LineString":
+          return doMultiPointAndLineStringCross(geom1, geom2);
+        case "Polygon":
+          return doesMultiPointCrossPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "LineString":
+      switch (type2) {
+        case "MultiPoint":
+          return doMultiPointAndLineStringCross(geom2, geom1);
+        case "LineString":
+          return doLineStringsCross(geom1, geom2);
+        case "Polygon":
+          return doLineStringAndPolygonCross(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "Polygon":
+      switch (type2) {
+        case "MultiPoint":
+          return doesMultiPointCrossPoly(geom2, geom1);
+        case "LineString":
+          return doLineStringAndPolygonCross(geom2, geom1);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    default:
+      throw new Error("feature1 " + type1 + " geometry not supported");
+  }
+}
+__name(booleanCrosses, "booleanCrosses");
+function doMultiPointAndLineStringCross(multiPoint, lineString) {
+  var foundIntPoint = false;
+  var foundExtPoint = false;
+  var pointLength = multiPoint.coordinates.length;
+  var i = 0;
+  while (i < pointLength && !foundIntPoint && !foundExtPoint) {
+    for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {
+      var incEndVertices = true;
+      if (i2 === 0 || i2 === lineString.coordinates.length - 2) {
+        incEndVertices = false;
+      }
+      if (isPointOnLineSegment(
+        lineString.coordinates[i2],
+        lineString.coordinates[i2 + 1],
+        multiPoint.coordinates[i],
+        incEndVertices
+      )) {
+        foundIntPoint = true;
+      } else {
+        foundExtPoint = true;
+      }
+    }
+    i++;
+  }
+  return foundIntPoint && foundExtPoint;
+}
+__name(doMultiPointAndLineStringCross, "doMultiPointAndLineStringCross");
+function doLineStringsCross(lineString1, lineString2) {
+  var doLinesIntersect = lineIntersect(lineString1, lineString2);
+  if (doLinesIntersect.features.length > 0) {
+    for (var i = 0; i < lineString1.coordinates.length - 1; i++) {
+      for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {
+        var incEndVertices = true;
+        if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {
+          incEndVertices = false;
+        }
+        if (isPointOnLineSegment(
+          lineString1.coordinates[i],
+          lineString1.coordinates[i + 1],
+          lineString2.coordinates[i2],
+          incEndVertices
+        )) {
+          return true;
+        }
+      }
+    }
+  }
+  return false;
+}
+__name(doLineStringsCross, "doLineStringsCross");
+function doLineStringAndPolygonCross(lineString, polygon) {
+  const line = polygonToLine(polygon);
+  const doLinesIntersect = lineIntersect(lineString, line);
+  if (doLinesIntersect.features.length > 0) {
+    return true;
+  }
+  return false;
+}
+__name(doLineStringAndPolygonCross, "doLineStringAndPolygonCross");
+function doesMultiPointCrossPoly(multiPoint, polygon) {
+  var foundIntPoint = false;
+  var foundExtPoint = false;
+  var pointLength = multiPoint.coordinates.length;
+  for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {
+    if (booleanPointInPolygon(point(multiPoint.coordinates[i]), polygon)) {
+      foundIntPoint = true;
+    } else {
+      foundExtPoint = true;
+    }
+  }
+  return foundExtPoint && foundIntPoint;
+}
+__name(doesMultiPointCrossPoly, "doesMultiPointCrossPoly");
+function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt, incEnd) {
+  var dxc = pt[0] - lineSegmentStart[0];
+  var dyc = pt[1] - lineSegmentStart[1];
+  var dxl = lineSegmentEnd[0] - lineSegmentStart[0];
+  var dyl = lineSegmentEnd[1] - lineSegmentStart[1];
+  var cross = dxc * dyl - dyc * dxl;
+  if (cross !== 0) {
+    return false;
+  }
+  if (incEnd) {
+    if (Math.abs(dxl) >= Math.abs(dyl)) {
+      return dxl > 0 ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0] : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
+    }
+    return dyl > 0 ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1] : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
+  } else {
+    if (Math.abs(dxl) >= Math.abs(dyl)) {
+      return dxl > 0 ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0] : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];
+    }
+    return dyl > 0 ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1] : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];
+  }
+}
+__name(isPointOnLineSegment, "isPointOnLineSegment");
+var turf_boolean_crosses_default = booleanCrosses;
+export {
+  booleanCrosses,
+  turf_boolean_crosses_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, Polygon, LineString, MultiPoint } from \"geojson\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { polygonToLine } from \"@turf/polygon-to-line\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { getGeom } from \"@turf/invariant\";\nimport { point } from \"@turf/helpers\";\n\n/**\n * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than\n * the maximum dimension of the two source geometries and the intersection set is interior to\n * both source geometries.\n *\n * Boolean-Crosses returns t (TRUE) for only multipoint/polygon, multipoint/linestring, linestring/linestring, linestring/polygon, and linestring/multipolygon comparisons.\n * Other comparisons are not supported as they are outside the OpenGIS Simple Features spec and may give unexpected results.\n *\n * @name booleanCrosses\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 line1 = turf.lineString([[-2, 2], [4, 2]]);\n * var line2 = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n *\n * var cross = turf.booleanCrosses(line1, line2);\n * //=true\n */\nfunction booleanCrosses(\n  feature1: Feature<any> | Geometry,\n  feature2: Feature<any> | Geometry\n): boolean {\n  var geom1 = getGeom(feature1);\n  var geom2 = getGeom(feature2);\n  var type1 = geom1.type;\n  var type2 = geom2.type;\n\n  switch (type1) {\n    case \"MultiPoint\":\n      switch (type2) {\n        case \"LineString\":\n          return doMultiPointAndLineStringCross(geom1, geom2);\n        case \"Polygon\":\n          return doesMultiPointCrossPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"LineString\":\n      switch (type2) {\n        case \"MultiPoint\": // An inverse operation\n          return doMultiPointAndLineStringCross(geom2, geom1);\n        case \"LineString\":\n          return doLineStringsCross(geom1, geom2);\n        case \"Polygon\":\n          return doLineStringAndPolygonCross(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"Polygon\":\n      switch (type2) {\n        case \"MultiPoint\": // An inverse operation\n          return doesMultiPointCrossPoly(geom2, geom1);\n        case \"LineString\": // An inverse operation\n          return doLineStringAndPolygonCross(geom2, geom1);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    default:\n      throw new Error(\"feature1 \" + type1 + \" geometry not supported\");\n  }\n}\n\nfunction doMultiPointAndLineStringCross(\n  multiPoint: MultiPoint,\n  lineString: LineString\n) {\n  var foundIntPoint = false;\n  var foundExtPoint = false;\n  var pointLength = multiPoint.coordinates.length;\n  var i = 0;\n  while (i < pointLength && !foundIntPoint && !foundExtPoint) {\n    for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {\n      var incEndVertices = true;\n      if (i2 === 0 || i2 === lineString.coordinates.length - 2) {\n        incEndVertices = false;\n      }\n      if (\n        isPointOnLineSegment(\n          lineString.coordinates[i2],\n          lineString.coordinates[i2 + 1],\n          multiPoint.coordinates[i],\n          incEndVertices\n        )\n      ) {\n        foundIntPoint = true;\n      } else {\n        foundExtPoint = true;\n      }\n    }\n    i++;\n  }\n  return foundIntPoint && foundExtPoint;\n}\n\nfunction doLineStringsCross(lineString1: LineString, lineString2: LineString) {\n  var doLinesIntersect = lineIntersect(lineString1, lineString2);\n  if (doLinesIntersect.features.length > 0) {\n    for (var i = 0; i < lineString1.coordinates.length - 1; i++) {\n      for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {\n        var incEndVertices = true;\n        if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {\n          incEndVertices = false;\n        }\n        if (\n          isPointOnLineSegment(\n            lineString1.coordinates[i],\n            lineString1.coordinates[i + 1],\n            lineString2.coordinates[i2],\n            incEndVertices\n          )\n        ) {\n          return true;\n        }\n      }\n    }\n  }\n  return false;\n}\n\nfunction doLineStringAndPolygonCross(lineString: LineString, polygon: Polygon) {\n  const line: any = polygonToLine(polygon);\n  const doLinesIntersect = lineIntersect(lineString, line);\n  if (doLinesIntersect.features.length > 0) {\n    return true;\n  }\n  return false;\n}\n\nfunction doesMultiPointCrossPoly(multiPoint: MultiPoint, polygon: Polygon) {\n  var foundIntPoint = false;\n  var foundExtPoint = false;\n  var pointLength = multiPoint.coordinates.length;\n  for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {\n    if (booleanPointInPolygon(point(multiPoint.coordinates[i]), polygon)) {\n      foundIntPoint = true;\n    } else {\n      foundExtPoint = true;\n    }\n  }\n\n  return foundExtPoint && foundIntPoint;\n}\n\n/**\n * Is a point on a line segment\n * Only takes into account outer rings\n * See http://stackoverflow.com/a/4833823/1979085\n *\n * @private\n * @param {number[]} lineSegmentStart coord pair of start of line\n * @param {number[]} lineSegmentEnd coord pair of end of line\n * @param {number[]} pt coord pair of point to check\n * @param {boolean} incEnd whether the point is allowed to fall on the line ends\n * @returns {boolean} true/false\n */\nfunction isPointOnLineSegment(\n  lineSegmentStart: number[],\n  lineSegmentEnd: number[],\n  pt: number[],\n  incEnd: boolean\n) {\n  var dxc = pt[0] - lineSegmentStart[0];\n  var dyc = pt[1] - lineSegmentStart[1];\n  var dxl = lineSegmentEnd[0] - lineSegmentStart[0];\n  var dyl = lineSegmentEnd[1] - lineSegmentStart[1];\n  var cross = dxc * dyl - dyc * dxl;\n  if (cross !== 0) {\n    return false;\n  }\n  if (incEnd) {\n    if (Math.abs(dxl) >= Math.abs(dyl)) {\n      return dxl > 0\n        ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0]\n        : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];\n    }\n    return dyl > 0\n      ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1]\n      : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];\n  } else {\n    if (Math.abs(dxl) >= Math.abs(dyl)) {\n      return dxl > 0\n        ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0]\n        : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];\n    }\n    return dyl > 0\n      ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1]\n      : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];\n  }\n}\n\nexport { booleanCrosses };\nexport default booleanCrosses;\n"],"mappings":";;;;AACA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,6BAA6B;AACtC,SAAS,eAAe;AACxB,SAAS,aAAa;AAqBtB,SAAS,eACP,UACA,UACS;AACT,MAAI,QAAQ,QAAQ,QAAQ;AAC5B,MAAI,QAAQ,QAAQ,QAAQ;AAC5B,MAAI,QAAQ,MAAM;AAClB,MAAI,QAAQ,MAAM;AAElB,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,+BAA+B,OAAO,KAAK;AAAA,QACpD,KAAK;AACH,iBAAO,wBAAwB,OAAO,KAAK;AAAA,QAC7C;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,+BAA+B,OAAO,KAAK;AAAA,QACpD,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC,KAAK;AACH,iBAAO,4BAA4B,OAAO,KAAK;AAAA,QACjD;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,wBAAwB,OAAO,KAAK;AAAA,QAC7C,KAAK;AACH,iBAAO,4BAA4B,OAAO,KAAK;AAAA,QACjD;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF;AACE,YAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,EACnE;AACF;AA1CS;AA4CT,SAAS,+BACP,YACA,YACA;AACA,MAAI,gBAAgB;AACpB,MAAI,gBAAgB;AACpB,MAAI,cAAc,WAAW,YAAY;AACzC,MAAI,IAAI;AACR,SAAO,IAAI,eAAe,CAAC,iBAAiB,CAAC,eAAe;AAC1D,aAAS,KAAK,GAAG,KAAK,WAAW,YAAY,SAAS,GAAG,MAAM;AAC7D,UAAI,iBAAiB;AACrB,UAAI,OAAO,KAAK,OAAO,WAAW,YAAY,SAAS,GAAG;AACxD,yBAAiB;AAAA,MACnB;AACA,UACE;AAAA,QACE,WAAW,YAAY,EAAE;AAAA,QACzB,WAAW,YAAY,KAAK,CAAC;AAAA,QAC7B,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,MACF,GACA;AACA,wBAAgB;AAAA,MAClB,OAAO;AACL,wBAAgB;AAAA,MAClB;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO,iBAAiB;AAC1B;AA9BS;AAgCT,SAAS,mBAAmB,aAAyB,aAAyB;AAC5E,MAAI,mBAAmB,cAAc,aAAa,WAAW;AAC7D,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,aAAS,IAAI,GAAG,IAAI,YAAY,YAAY,SAAS,GAAG,KAAK;AAC3D,eAAS,KAAK,GAAG,KAAK,YAAY,YAAY,SAAS,GAAG,MAAM;AAC9D,YAAI,iBAAiB;AACrB,YAAI,OAAO,KAAK,OAAO,YAAY,YAAY,SAAS,GAAG;AACzD,2BAAiB;AAAA,QACnB;AACA,YACE;AAAA,UACE,YAAY,YAAY,CAAC;AAAA,UACzB,YAAY,YAAY,IAAI,CAAC;AAAA,UAC7B,YAAY,YAAY,EAAE;AAAA,UAC1B;AAAA,QACF,GACA;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAvBS;AAyBT,SAAS,4BAA4B,YAAwB,SAAkB;AAC7E,QAAM,OAAY,cAAc,OAAO;AACvC,QAAM,mBAAmB,cAAc,YAAY,IAAI;AACvD,MAAI,iBAAiB,SAAS,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAPS;AAST,SAAS,wBAAwB,YAAwB,SAAkB;AACzE,MAAI,gBAAgB;AACpB,MAAI,gBAAgB;AACpB,MAAI,cAAc,WAAW,YAAY;AACzC,WAAS,IAAI,GAAG,IAAI,gBAAgB,CAAC,iBAAiB,CAAC,gBAAgB,KAAK;AAC1E,QAAI,sBAAsB,MAAM,WAAW,YAAY,CAAC,CAAC,GAAG,OAAO,GAAG;AACpE,sBAAgB;AAAA,IAClB,OAAO;AACL,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,SAAO,iBAAiB;AAC1B;AAbS;AA2BT,SAAS,qBACP,kBACA,gBACA,IACA,QACA;AACA,MAAI,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACpC,MAAI,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC;AACpC,MAAI,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAChD,MAAI,MAAM,eAAe,CAAC,IAAI,iBAAiB,CAAC;AAChD,MAAI,QAAQ,MAAM,MAAM,MAAM;AAC9B,MAAI,UAAU,GAAG;AACf,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACV,QAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,aAAO,MAAM,IACT,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC,IACzD,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,IAC/D;AACA,WAAO,MAAM,IACT,iBAAiB,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC,IACzD,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,iBAAiB,CAAC;AAAA,EAC/D,OAAO;AACL,QAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;AAClC,aAAO,MAAM,IACT,iBAAiB,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,eAAe,CAAC,IACvD,eAAe,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,iBAAiB,CAAC;AAAA,IAC7D;AACA,WAAO,MAAM,IACT,iBAAiB,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,eAAe,CAAC,IACvD,eAAe,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,iBAAiB,CAAC;AAAA,EAC7D;AACF;AAjCS;AAoCT,IAAO,+BAAQ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/boolean-crosses",
-  "version": "7.0.0-alpha.0",
+  "version": "7.0.0-alpha.110+1411d63a7",
   "description": "turf boolean-crosses module",
   "author": "Turf Authors",
   "contributors": [
@@ -26,48 +26,54 @@
     "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",
     ".": {
-      "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": "ts-node 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": "node ../../scripts/generate-readmes",
-    "test": "npm-run-all test:*",
-    "test:tape": "ts-node -r esm 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": "*",
-    "glob": "*",
-    "load-json-file": "*",
-    "npm-run-all": "*",
-    "tape": "*",
-    "ts-node": "*",
-    "tslint": "*",
-    "typescript": "*"
+    "glob": "^10.3.10",
+    "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.0",
-    "@turf/helpers": "^7.0.0-alpha.0",
-    "@turf/invariant": "^7.0.0-alpha.0",
-    "@turf/line-intersect": "^7.0.0-alpha.0",
-    "@turf/polygon-to-line": "^7.0.0-alpha.0",
-    "tslib": "^2.3.0"
+    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/helpers": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/invariant": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/line-intersect": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/polygon-to-line": "^7.0.0-alpha.110+1411d63a7",
+    "tslib": "^2.6.2"
   },
-  "gitHead": "0edc4c491b999e5ace770a61e1cf549f7c004189"
+  "gitHead": "1411d63a74c275c9216fe48e9d3cb2d48a359068"
 }

package/dist/es/index.js

@@ -1,167 +0,0 @@
-import lineIntersect from "@turf/line-intersect";
-import { polygonToLine } from "@turf/polygon-to-line";
-import booleanPointInPolygon from "@turf/boolean-point-in-polygon";
-import { getGeom } from "@turf/invariant";
-import { point } from "@turf/helpers";
-/**
- * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than
- * the maximum dimension of the two source geometries and the intersection set is interior to
- * both source geometries.
- *
- * Boolean-Crosses returns t (TRUE) for only multipoint/polygon, multipoint/linestring, linestring/linestring, linestring/polygon, and linestring/multipolygon comparisons.
- * Other comparisons are not supported as they are outside the OpenGIS Simple Features spec and may give unexpected results.
- *
- * @name booleanCrosses
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var line1 = turf.lineString([[-2, 2], [4, 2]]);
- * var line2 = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- *
- * var cross = turf.booleanCrosses(line1, line2);
- * //=true
- */
-function booleanCrosses(feature1, feature2) {
-    var geom1 = getGeom(feature1);
-    var geom2 = getGeom(feature2);
-    var type1 = geom1.type;
-    var type2 = geom2.type;
-    switch (type1) {
-        case "MultiPoint":
-            switch (type2) {
-                case "LineString":
-                    return doMultiPointAndLineStringCross(geom1, geom2);
-                case "Polygon":
-                    return doesMultiPointCrossPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "LineString":
-            switch (type2) {
-                case "MultiPoint": // An inverse operation
-                    return doMultiPointAndLineStringCross(geom2, geom1);
-                case "LineString":
-                    return doLineStringsCross(geom1, geom2);
-                case "Polygon":
-                    return doLineStringAndPolygonCross(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "Polygon":
-            switch (type2) {
-                case "MultiPoint": // An inverse operation
-                    return doesMultiPointCrossPoly(geom2, geom1);
-                case "LineString": // An inverse operation
-                    return doLineStringAndPolygonCross(geom2, geom1);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        default:
-            throw new Error("feature1 " + type1 + " geometry not supported");
-    }
-}
-function doMultiPointAndLineStringCross(multiPoint, lineString) {
-    var foundIntPoint = false;
-    var foundExtPoint = false;
-    var pointLength = multiPoint.coordinates.length;
-    var i = 0;
-    while (i < pointLength && !foundIntPoint && !foundExtPoint) {
-        for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {
-            var incEndVertices = true;
-            if (i2 === 0 || i2 === lineString.coordinates.length - 2) {
-                incEndVertices = false;
-            }
-            if (isPointOnLineSegment(lineString.coordinates[i2], lineString.coordinates[i2 + 1], multiPoint.coordinates[i], incEndVertices)) {
-                foundIntPoint = true;
-            }
-            else {
-                foundExtPoint = true;
-            }
-        }
-        i++;
-    }
-    return foundIntPoint && foundExtPoint;
-}
-function doLineStringsCross(lineString1, lineString2) {
-    var doLinesIntersect = lineIntersect(lineString1, lineString2);
-    if (doLinesIntersect.features.length > 0) {
-        for (var i = 0; i < lineString1.coordinates.length - 1; i++) {
-            for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {
-                var incEndVertices = true;
-                if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {
-                    incEndVertices = false;
-                }
-                if (isPointOnLineSegment(lineString1.coordinates[i], lineString1.coordinates[i + 1], lineString2.coordinates[i2], incEndVertices)) {
-                    return true;
-                }
-            }
-        }
-    }
-    return false;
-}
-function doLineStringAndPolygonCross(lineString, polygon) {
-    const line = polygonToLine(polygon);
-    const doLinesIntersect = lineIntersect(lineString, line);
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function doesMultiPointCrossPoly(multiPoint, polygon) {
-    var foundIntPoint = false;
-    var foundExtPoint = false;
-    var pointLength = multiPoint.coordinates.length;
-    for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {
-        if (booleanPointInPolygon(point(multiPoint.coordinates[i]), polygon)) {
-            foundIntPoint = true;
-        }
-        else {
-            foundExtPoint = true;
-        }
-    }
-    return foundExtPoint && foundIntPoint;
-}
-/**
- * Is a point on a line segment
- * Only takes into account outer rings
- * See http://stackoverflow.com/a/4833823/1979085
- *
- * @private
- * @param {number[]} lineSegmentStart coord pair of start of line
- * @param {number[]} lineSegmentEnd coord pair of end of line
- * @param {number[]} pt coord pair of point to check
- * @param {boolean} incEnd whether the point is allowed to fall on the line ends
- * @returns {boolean} true/false
- */
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt, incEnd) {
-    var dxc = pt[0] - lineSegmentStart[0];
-    var dyc = pt[1] - lineSegmentStart[1];
-    var dxl = lineSegmentEnd[0] - lineSegmentStart[0];
-    var dyl = lineSegmentEnd[1] - lineSegmentStart[1];
-    var cross = dxc * dyl - dyc * dxl;
-    if (cross !== 0) {
-        return false;
-    }
-    if (incEnd) {
-        if (Math.abs(dxl) >= Math.abs(dyl)) {
-            return dxl > 0
-                ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0]
-                : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-        }
-        return dyl > 0
-            ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1]
-            : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-    }
-    else {
-        if (Math.abs(dxl) >= Math.abs(dyl)) {
-            return dxl > 0
-                ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0]
-                : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];
-        }
-        return dyl > 0
-            ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1]
-            : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];
-    }
-}
-export default booleanCrosses;

package/dist/es/package.json

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

package/dist/js/index.js

@@ -1,170 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-const line_intersect_1 = tslib_1.__importDefault(require("@turf/line-intersect"));
-const polygon_to_line_1 = require("@turf/polygon-to-line");
-const boolean_point_in_polygon_1 = tslib_1.__importDefault(require("@turf/boolean-point-in-polygon"));
-const invariant_1 = require("@turf/invariant");
-const helpers_1 = require("@turf/helpers");
-/**
- * Boolean-Crosses returns True if the intersection results in a geometry whose dimension is one less than
- * the maximum dimension of the two source geometries and the intersection set is interior to
- * both source geometries.
- *
- * Boolean-Crosses returns t (TRUE) for only multipoint/polygon, multipoint/linestring, linestring/linestring, linestring/polygon, and linestring/multipolygon comparisons.
- * Other comparisons are not supported as they are outside the OpenGIS Simple Features spec and may give unexpected results.
- *
- * @name booleanCrosses
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var line1 = turf.lineString([[-2, 2], [4, 2]]);
- * var line2 = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- *
- * var cross = turf.booleanCrosses(line1, line2);
- * //=true
- */
-function booleanCrosses(feature1, feature2) {
-    var geom1 = invariant_1.getGeom(feature1);
-    var geom2 = invariant_1.getGeom(feature2);
-    var type1 = geom1.type;
-    var type2 = geom2.type;
-    switch (type1) {
-        case "MultiPoint":
-            switch (type2) {
-                case "LineString":
-                    return doMultiPointAndLineStringCross(geom1, geom2);
-                case "Polygon":
-                    return doesMultiPointCrossPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "LineString":
-            switch (type2) {
-                case "MultiPoint": // An inverse operation
-                    return doMultiPointAndLineStringCross(geom2, geom1);
-                case "LineString":
-                    return doLineStringsCross(geom1, geom2);
-                case "Polygon":
-                    return doLineStringAndPolygonCross(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "Polygon":
-            switch (type2) {
-                case "MultiPoint": // An inverse operation
-                    return doesMultiPointCrossPoly(geom2, geom1);
-                case "LineString": // An inverse operation
-                    return doLineStringAndPolygonCross(geom2, geom1);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        default:
-            throw new Error("feature1 " + type1 + " geometry not supported");
-    }
-}
-function doMultiPointAndLineStringCross(multiPoint, lineString) {
-    var foundIntPoint = false;
-    var foundExtPoint = false;
-    var pointLength = multiPoint.coordinates.length;
-    var i = 0;
-    while (i < pointLength && !foundIntPoint && !foundExtPoint) {
-        for (var i2 = 0; i2 < lineString.coordinates.length - 1; i2++) {
-            var incEndVertices = true;
-            if (i2 === 0 || i2 === lineString.coordinates.length - 2) {
-                incEndVertices = false;
-            }
-            if (isPointOnLineSegment(lineString.coordinates[i2], lineString.coordinates[i2 + 1], multiPoint.coordinates[i], incEndVertices)) {
-                foundIntPoint = true;
-            }
-            else {
-                foundExtPoint = true;
-            }
-        }
-        i++;
-    }
-    return foundIntPoint && foundExtPoint;
-}
-function doLineStringsCross(lineString1, lineString2) {
-    var doLinesIntersect = line_intersect_1.default(lineString1, lineString2);
-    if (doLinesIntersect.features.length > 0) {
-        for (var i = 0; i < lineString1.coordinates.length - 1; i++) {
-            for (var i2 = 0; i2 < lineString2.coordinates.length - 1; i2++) {
-                var incEndVertices = true;
-                if (i2 === 0 || i2 === lineString2.coordinates.length - 2) {
-                    incEndVertices = false;
-                }
-                if (isPointOnLineSegment(lineString1.coordinates[i], lineString1.coordinates[i + 1], lineString2.coordinates[i2], incEndVertices)) {
-                    return true;
-                }
-            }
-        }
-    }
-    return false;
-}
-function doLineStringAndPolygonCross(lineString, polygon) {
-    const line = polygon_to_line_1.polygonToLine(polygon);
-    const doLinesIntersect = line_intersect_1.default(lineString, line);
-    if (doLinesIntersect.features.length > 0) {
-        return true;
-    }
-    return false;
-}
-function doesMultiPointCrossPoly(multiPoint, polygon) {
-    var foundIntPoint = false;
-    var foundExtPoint = false;
-    var pointLength = multiPoint.coordinates.length;
-    for (let i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {
-        if (boolean_point_in_polygon_1.default(helpers_1.point(multiPoint.coordinates[i]), polygon)) {
-            foundIntPoint = true;
-        }
-        else {
-            foundExtPoint = true;
-        }
-    }
-    return foundExtPoint && foundIntPoint;
-}
-/**
- * Is a point on a line segment
- * Only takes into account outer rings
- * See http://stackoverflow.com/a/4833823/1979085
- *
- * @private
- * @param {number[]} lineSegmentStart coord pair of start of line
- * @param {number[]} lineSegmentEnd coord pair of end of line
- * @param {number[]} pt coord pair of point to check
- * @param {boolean} incEnd whether the point is allowed to fall on the line ends
- * @returns {boolean} true/false
- */
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt, incEnd) {
-    var dxc = pt[0] - lineSegmentStart[0];
-    var dyc = pt[1] - lineSegmentStart[1];
-    var dxl = lineSegmentEnd[0] - lineSegmentStart[0];
-    var dyl = lineSegmentEnd[1] - lineSegmentStart[1];
-    var cross = dxc * dyl - dyc * dxl;
-    if (cross !== 0) {
-        return false;
-    }
-    if (incEnd) {
-        if (Math.abs(dxl) >= Math.abs(dyl)) {
-            return dxl > 0
-                ? lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0]
-                : lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-        }
-        return dyl > 0
-            ? lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1]
-            : lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-    }
-    else {
-        if (Math.abs(dxl) >= Math.abs(dyl)) {
-            return dxl > 0
-                ? lineSegmentStart[0] < pt[0] && pt[0] < lineSegmentEnd[0]
-                : lineSegmentEnd[0] < pt[0] && pt[0] < lineSegmentStart[0];
-        }
-        return dyl > 0
-            ? lineSegmentStart[1] < pt[1] && pt[1] < lineSegmentEnd[1]
-            : lineSegmentEnd[1] < pt[1] && pt[1] < lineSegmentStart[1];
-    }
-}
-exports.default = booleanCrosses;