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

package/README.md

@@ -32,26 +32,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-within
 ```
 
-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,204 @@
+"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 _bbox = require('@turf/bbox');
+var _booleanpointonline = require('@turf/boolean-point-on-line');
+var _booleanpointinpolygon = require('@turf/boolean-point-in-polygon');
+var _invariant = require('@turf/invariant');
+function booleanWithin(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 "Point":
+      switch (type2) {
+        case "MultiPoint":
+          return isPointInMultiPoint(geom1, geom2);
+        case "LineString":
+          return _booleanpointonline.booleanPointOnLine.call(void 0, geom1, geom2, { ignoreEndVertices: true });
+        case "Polygon":
+        case "MultiPolygon":
+          return _booleanpointinpolygon.booleanPointInPolygon.call(void 0, geom1, geom2, { ignoreBoundary: true });
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "MultiPoint":
+      switch (type2) {
+        case "MultiPoint":
+          return isMultiPointInMultiPoint(geom1, geom2);
+        case "LineString":
+          return isMultiPointOnLine(geom1, geom2);
+        case "Polygon":
+        case "MultiPolygon":
+          return isMultiPointInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "LineString":
+      switch (type2) {
+        case "LineString":
+          return isLineOnLine(geom1, geom2);
+        case "Polygon":
+        case "MultiPolygon":
+          return isLineInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "Polygon":
+      switch (type2) {
+        case "Polygon":
+        case "MultiPolygon":
+          return isPolyInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    default:
+      throw new Error("feature1 " + type1 + " geometry not supported");
+  }
+}
+__name(booleanWithin, "booleanWithin");
+function isPointInMultiPoint(point, multiPoint) {
+  var i;
+  var output = false;
+  for (i = 0; i < multiPoint.coordinates.length; i++) {
+    if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {
+      output = true;
+      break;
+    }
+  }
+  return output;
+}
+__name(isPointInMultiPoint, "isPointInMultiPoint");
+function isMultiPointInMultiPoint(multiPoint1, multiPoint2) {
+  for (var i = 0; i < multiPoint1.coordinates.length; i++) {
+    var anyMatch = false;
+    for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {
+      if (compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])) {
+        anyMatch = true;
+      }
+    }
+    if (!anyMatch) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isMultiPointInMultiPoint, "isMultiPointInMultiPoint");
+function isMultiPointOnLine(multiPoint, lineString) {
+  var foundInsidePoint = false;
+  for (var i = 0; i < multiPoint.coordinates.length; i++) {
+    if (!_booleanpointonline.booleanPointOnLine.call(void 0, multiPoint.coordinates[i], lineString)) {
+      return false;
+    }
+    if (!foundInsidePoint) {
+      foundInsidePoint = _booleanpointonline.booleanPointOnLine.call(void 0, 
+        multiPoint.coordinates[i],
+        lineString,
+        { ignoreEndVertices: true }
+      );
+    }
+  }
+  return foundInsidePoint;
+}
+__name(isMultiPointOnLine, "isMultiPointOnLine");
+function isMultiPointInPoly(multiPoint, polygon) {
+  var output = true;
+  var oneInside = false;
+  var isInside = false;
+  for (var i = 0; i < multiPoint.coordinates.length; i++) {
+    isInside = _booleanpointinpolygon.booleanPointInPolygon.call(void 0, multiPoint.coordinates[i], polygon);
+    if (!isInside) {
+      output = false;
+      break;
+    }
+    if (!oneInside) {
+      isInside = _booleanpointinpolygon.booleanPointInPolygon.call(void 0, multiPoint.coordinates[i], polygon, {
+        ignoreBoundary: true
+      });
+    }
+  }
+  return output && isInside;
+}
+__name(isMultiPointInPoly, "isMultiPointInPoly");
+function isLineOnLine(lineString1, lineString2) {
+  for (var i = 0; i < lineString1.coordinates.length; i++) {
+    if (!_booleanpointonline.booleanPointOnLine.call(void 0, lineString1.coordinates[i], lineString2)) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isLineOnLine, "isLineOnLine");
+function isLineInPoly(linestring, polygon) {
+  var polyBbox = _bbox.bbox.call(void 0, polygon);
+  var lineBbox = _bbox.bbox.call(void 0, linestring);
+  if (!doBBoxOverlap(polyBbox, lineBbox)) {
+    return false;
+  }
+  var foundInsidePoint = false;
+  for (var i = 0; i < linestring.coordinates.length - 1; i++) {
+    if (!_booleanpointinpolygon.booleanPointInPolygon.call(void 0, linestring.coordinates[i], polygon)) {
+      return false;
+    }
+    if (!foundInsidePoint) {
+      foundInsidePoint = _booleanpointinpolygon.booleanPointInPolygon.call(void 0, 
+        linestring.coordinates[i],
+        polygon,
+        { ignoreBoundary: true }
+      );
+    }
+    if (!foundInsidePoint) {
+      var midpoint = getMidpoint(
+        linestring.coordinates[i],
+        linestring.coordinates[i + 1]
+      );
+      foundInsidePoint = _booleanpointinpolygon.booleanPointInPolygon.call(void 0, midpoint, polygon, {
+        ignoreBoundary: true
+      });
+    }
+  }
+  return foundInsidePoint;
+}
+__name(isLineInPoly, "isLineInPoly");
+function isPolyInPoly(geometry1, geometry2) {
+  var poly1Bbox = _bbox.bbox.call(void 0, geometry1);
+  var poly2Bbox = _bbox.bbox.call(void 0, geometry2);
+  if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {
+    return false;
+  }
+  for (var i = 0; i < geometry1.coordinates[0].length; i++) {
+    if (!_booleanpointinpolygon.booleanPointInPolygon.call(void 0, geometry1.coordinates[0][i], geometry2)) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isPolyInPoly, "isPolyInPoly");
+function doBBoxOverlap(bbox1, bbox2) {
+  if (bbox1[0] > bbox2[0])
+    return false;
+  if (bbox1[2] < bbox2[2])
+    return false;
+  if (bbox1[1] > bbox2[1])
+    return false;
+  if (bbox1[3] < bbox2[3])
+    return false;
+  return true;
+}
+__name(doBBoxOverlap, "doBBoxOverlap");
+function compareCoords(pair1, pair2) {
+  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
+}
+__name(compareCoords, "compareCoords");
+function getMidpoint(pair1, pair2) {
+  return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];
+}
+__name(getMidpoint, "getMidpoint");
+var turf_boolean_within_default = booleanWithin;
+
+
+
+exports.booleanWithin = booleanWithin; exports.default = turf_boolean_within_default;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"names":[],"mappings":";;;;AAUA,SAAS,QAAQ,gBAAgB;AACjC,SAAS,0BAA0B;AACnC,SAAS,6BAA6B;AACtC,SAAS,eAAe;AAmBxB,SAAS,cACP,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,oBAAoB,OAAO,KAAK;AAAA,QACzC,KAAK;AACH,iBAAO,mBAAmB,OAAO,OAAO,EAAE,mBAAmB,KAAK,CAAC;AAAA,QACrE,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,sBAAsB,OAAO,OAAO,EAAE,gBAAgB,KAAK,CAAC;AAAA,QACrE;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,yBAAyB,OAAO,KAAK;AAAA,QAC9C,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF;AACE,YAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,EACnE;AACF;AAvDS;AAyDT,SAAS,oBAAoB,OAAc,YAAwB;AACjE,MAAI;AACJ,MAAI,SAAS;AACb,OAAK,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AAClD,QAAI,cAAc,WAAW,YAAY,CAAC,GAAG,MAAM,WAAW,GAAG;AAC/D,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAVS;AAYT,SAAS,yBACP,aACA,aACA;AACA,WAAS,IAAI,GAAG,IAAI,YAAY,YAAY,QAAQ,KAAK;AACvD,QAAI,WAAW;AACf,aAAS,KAAK,GAAG,KAAK,YAAY,YAAY,QAAQ,MAAM;AAC1D,UACE,cAAc,YAAY,YAAY,CAAC,GAAG,YAAY,YAAY,EAAE,CAAC,GACrE;AACA,mBAAW;AAAA,MACb;AAAA,IACF;AACA,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAlBS;AAoBT,SAAS,mBAAmB,YAAwB,YAAwB;AAC1E,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AACtD,QAAI,CAAC,mBAAmB,WAAW,YAAY,CAAC,GAAG,UAAU,GAAG;AAC9D,aAAO;AAAA,IACT;AACA,QAAI,CAAC,kBAAkB;AACrB,yBAAmB;AAAA,QACjB,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,QACA,EAAE,mBAAmB,KAAK;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAhBS;AAkBT,SAAS,mBAAmB,YAAwB,SAAkB;AACpE,MAAI,SAAS;AACb,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AACtD,eAAW,sBAAsB,WAAW,YAAY,CAAC,GAAG,OAAO;AACnE,QAAI,CAAC,UAAU;AACb,eAAS;AACT;AAAA,IACF;AACA,QAAI,CAAC,WAAW;AACd,iBAAW,sBAAsB,WAAW,YAAY,CAAC,GAAG,SAAS;AAAA,QACnE,gBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,UAAU;AACnB;AAjBS;AAmBT,SAAS,aAAa,aAAyB,aAAyB;AACtE,WAAS,IAAI,GAAG,IAAI,YAAY,YAAY,QAAQ,KAAK;AACvD,QAAI,CAAC,mBAAmB,YAAY,YAAY,CAAC,GAAG,WAAW,GAAG;AAChE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAPS;AAST,SAAS,aAAa,YAAwB,SAAkB;AAC9D,MAAI,WAAW,SAAS,OAAO;AAC/B,MAAI,WAAW,SAAS,UAAU;AAClC,MAAI,CAAC,cAAc,UAAU,QAAQ,GAAG;AACtC,WAAO;AAAA,EACT;AACA,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,SAAS,GAAG,KAAK;AAC1D,QAAI,CAAC,sBAAsB,WAAW,YAAY,CAAC,GAAG,OAAO,GAAG;AAC9D,aAAO;AAAA,IACT;AACA,QAAI,CAAC,kBAAkB;AACrB,yBAAmB;AAAA,QACjB,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,QACA,EAAE,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACF;AACA,QAAI,CAAC,kBAAkB;AACrB,UAAI,WAAW;AAAA,QACb,WAAW,YAAY,CAAC;AAAA,QACxB,WAAW,YAAY,IAAI,CAAC;AAAA,MAC9B;AACA,yBAAmB,sBAAsB,UAAU,SAAS;AAAA,QAC1D,gBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AA9BS;AAyCT,SAAS,aAAa,WAAoB,WAAmC;AAC3E,MAAI,YAAY,SAAS,SAAS;AAClC,MAAI,YAAY,SAAS,SAAS;AAClC,MAAI,CAAC,cAAc,WAAW,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,WAAS,IAAI,GAAG,IAAI,UAAU,YAAY,CAAC,EAAE,QAAQ,KAAK;AACxD,QAAI,CAAC,sBAAsB,UAAU,YAAY,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG;AAClE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAZS;AAcT,SAAS,cAAc,OAAa,OAAa;AAC/C,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,SAAO;AACT;AANS;AAgBT,SAAS,cAAc,OAAiB,OAAiB;AACvD,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC;AACtD;AAFS;AAYT,SAAS,YAAY,OAAiB,OAAiB;AACrD,SAAO,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC;AAC9D;AAFS;AAKT,IAAO,8BAAQ","sourcesContent":["import {\n  BBox,\n  Feature,\n  Geometry,\n  LineString,\n  MultiPoint,\n  MultiPolygon,\n  Point,\n  Polygon,\n} from \"geojson\";\nimport { bbox as calcBbox } from \"@turf/bbox\";\nimport { booleanPointOnLine } from \"@turf/boolean-point-on-line\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { getGeom } from \"@turf/invariant\";\n\n/**\n * Boolean-within returns true if the first geometry is completely within the second geometry.\n * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)\n * must not intersect the exterior of the secondary (geometry b).\n * Boolean-within returns the exact opposite result of the `@turf/boolean-contains`.\n *\n * @name booleanWithin\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 line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n * var point = turf.point([1, 2]);\n *\n * turf.booleanWithin(point, line);\n * //=true\n */\nfunction booleanWithin(\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 \"Point\":\n      switch (type2) {\n        case \"MultiPoint\":\n          return isPointInMultiPoint(geom1, geom2);\n        case \"LineString\":\n          return booleanPointOnLine(geom1, geom2, { ignoreEndVertices: true });\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return booleanPointInPolygon(geom1, geom2, { ignoreBoundary: true });\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"MultiPoint\":\n      switch (type2) {\n        case \"MultiPoint\":\n          return isMultiPointInMultiPoint(geom1, geom2);\n        case \"LineString\":\n          return isMultiPointOnLine(geom1, geom2);\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isMultiPointInPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"LineString\":\n      switch (type2) {\n        case \"LineString\":\n          return isLineOnLine(geom1, geom2);\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isLineInPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"Polygon\":\n      switch (type2) {\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isPolyInPoly(geom1, geom2);\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 isPointInMultiPoint(point: Point, multiPoint: MultiPoint) {\n  var i;\n  var output = false;\n  for (i = 0; i < multiPoint.coordinates.length; i++) {\n    if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {\n      output = true;\n      break;\n    }\n  }\n  return output;\n}\n\nfunction isMultiPointInMultiPoint(\n  multiPoint1: MultiPoint,\n  multiPoint2: MultiPoint\n) {\n  for (var i = 0; i < multiPoint1.coordinates.length; i++) {\n    var anyMatch = false;\n    for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {\n      if (\n        compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])\n      ) {\n        anyMatch = true;\n      }\n    }\n    if (!anyMatch) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isMultiPointOnLine(multiPoint: MultiPoint, lineString: LineString) {\n  var foundInsidePoint = false;\n\n  for (var i = 0; i < multiPoint.coordinates.length; i++) {\n    if (!booleanPointOnLine(multiPoint.coordinates[i], lineString)) {\n      return false;\n    }\n    if (!foundInsidePoint) {\n      foundInsidePoint = booleanPointOnLine(\n        multiPoint.coordinates[i],\n        lineString,\n        { ignoreEndVertices: true }\n      );\n    }\n  }\n  return foundInsidePoint;\n}\n\nfunction isMultiPointInPoly(multiPoint: MultiPoint, polygon: Polygon) {\n  var output = true;\n  var oneInside = false;\n  var isInside = false;\n  for (var i = 0; i < multiPoint.coordinates.length; i++) {\n    isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon);\n    if (!isInside) {\n      output = false;\n      break;\n    }\n    if (!oneInside) {\n      isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon, {\n        ignoreBoundary: true,\n      });\n    }\n  }\n  return output && isInside;\n}\n\nfunction isLineOnLine(lineString1: LineString, lineString2: LineString) {\n  for (var i = 0; i < lineString1.coordinates.length; i++) {\n    if (!booleanPointOnLine(lineString1.coordinates[i], lineString2)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isLineInPoly(linestring: LineString, polygon: Polygon) {\n  var polyBbox = calcBbox(polygon);\n  var lineBbox = calcBbox(linestring);\n  if (!doBBoxOverlap(polyBbox, lineBbox)) {\n    return false;\n  }\n  var foundInsidePoint = false;\n\n  for (var i = 0; i < linestring.coordinates.length - 1; i++) {\n    if (!booleanPointInPolygon(linestring.coordinates[i], polygon)) {\n      return false;\n    }\n    if (!foundInsidePoint) {\n      foundInsidePoint = booleanPointInPolygon(\n        linestring.coordinates[i],\n        polygon,\n        { ignoreBoundary: true }\n      );\n    }\n    if (!foundInsidePoint) {\n      var midpoint = getMidpoint(\n        linestring.coordinates[i],\n        linestring.coordinates[i + 1]\n      );\n      foundInsidePoint = booleanPointInPolygon(midpoint, polygon, {\n        ignoreBoundary: true,\n      });\n    }\n  }\n  return foundInsidePoint;\n}\n\n/**\n * Is Polygon2 in Polygon1\n * Only takes into account outer rings\n *\n * @private\n * @param {Polygon} geometry1\n * @param {Polygon|MultiPolygon} geometry2\n * @returns {boolean} true/false\n */\nfunction isPolyInPoly(geometry1: Polygon, geometry2: Polygon | MultiPolygon) {\n  var poly1Bbox = calcBbox(geometry1);\n  var poly2Bbox = calcBbox(geometry2);\n  if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {\n    return false;\n  }\n  for (var i = 0; i < geometry1.coordinates[0].length; i++) {\n    if (!booleanPointInPolygon(geometry1.coordinates[0][i], geometry2)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction doBBoxOverlap(bbox1: BBox, bbox2: BBox) {\n  if (bbox1[0] > bbox2[0]) return false;\n  if (bbox1[2] < bbox2[2]) return false;\n  if (bbox1[1] > bbox2[1]) return false;\n  if (bbox1[3] < bbox2[3]) return false;\n  return true;\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\n/**\n * getMidpoint\n *\n * @private\n * @param {Position} pair1 point [x,y]\n * @param {Position} pair2 point [x,y]\n * @returns {Position} midpoint of pair1 and pair2\n */\nfunction getMidpoint(pair1: number[], pair2: number[]) {\n  return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];\n}\n\nexport { booleanWithin };\nexport default booleanWithin;\n"]}

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

@@ -1,4 +1,5 @@
-import { Feature, Geometry } from "geojson";
+import { Feature, Geometry } from 'geojson';
+
 /**
  * Boolean-within returns true if the first geometry is completely within the second geometry.
  * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)
@@ -17,4 +18,5 @@ import { Feature, Geometry } from "geojson";
  * //=true
  */
 declare function booleanWithin(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
-export default booleanWithin;
+
+export { booleanWithin, booleanWithin as default };

package/dist/esm/index.d.mts

@@ -0,0 +1,22 @@
+import { Feature, Geometry } from 'geojson';
+
+/**
+ * Boolean-within returns true if the first geometry is completely within the second geometry.
+ * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)
+ * must not intersect the exterior of the secondary (geometry b).
+ * Boolean-within returns the exact opposite result of the `@turf/boolean-contains`.
+ *
+ * @name booleanWithin
+ * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
+ * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
+ * @returns {boolean} true/false
+ * @example
+ * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
+ * var point = turf.point([1, 2]);
+ *
+ * turf.booleanWithin(point, line);
+ * //=true
+ */
+declare function booleanWithin(feature1: Feature<any> | Geometry, feature2: Feature<any> | Geometry): boolean;
+
+export { booleanWithin, booleanWithin as default };

package/dist/esm/index.mjs

@@ -0,0 +1,204 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// index.ts
+import { bbox as calcBbox } from "@turf/bbox";
+import { booleanPointOnLine } from "@turf/boolean-point-on-line";
+import { booleanPointInPolygon } from "@turf/boolean-point-in-polygon";
+import { getGeom } from "@turf/invariant";
+function booleanWithin(feature1, feature2) {
+  var geom1 = getGeom(feature1);
+  var geom2 = getGeom(feature2);
+  var type1 = geom1.type;
+  var type2 = geom2.type;
+  switch (type1) {
+    case "Point":
+      switch (type2) {
+        case "MultiPoint":
+          return isPointInMultiPoint(geom1, geom2);
+        case "LineString":
+          return booleanPointOnLine(geom1, geom2, { ignoreEndVertices: true });
+        case "Polygon":
+        case "MultiPolygon":
+          return booleanPointInPolygon(geom1, geom2, { ignoreBoundary: true });
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "MultiPoint":
+      switch (type2) {
+        case "MultiPoint":
+          return isMultiPointInMultiPoint(geom1, geom2);
+        case "LineString":
+          return isMultiPointOnLine(geom1, geom2);
+        case "Polygon":
+        case "MultiPolygon":
+          return isMultiPointInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "LineString":
+      switch (type2) {
+        case "LineString":
+          return isLineOnLine(geom1, geom2);
+        case "Polygon":
+        case "MultiPolygon":
+          return isLineInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    case "Polygon":
+      switch (type2) {
+        case "Polygon":
+        case "MultiPolygon":
+          return isPolyInPoly(geom1, geom2);
+        default:
+          throw new Error("feature2 " + type2 + " geometry not supported");
+      }
+    default:
+      throw new Error("feature1 " + type1 + " geometry not supported");
+  }
+}
+__name(booleanWithin, "booleanWithin");
+function isPointInMultiPoint(point, multiPoint) {
+  var i;
+  var output = false;
+  for (i = 0; i < multiPoint.coordinates.length; i++) {
+    if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {
+      output = true;
+      break;
+    }
+  }
+  return output;
+}
+__name(isPointInMultiPoint, "isPointInMultiPoint");
+function isMultiPointInMultiPoint(multiPoint1, multiPoint2) {
+  for (var i = 0; i < multiPoint1.coordinates.length; i++) {
+    var anyMatch = false;
+    for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {
+      if (compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])) {
+        anyMatch = true;
+      }
+    }
+    if (!anyMatch) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isMultiPointInMultiPoint, "isMultiPointInMultiPoint");
+function isMultiPointOnLine(multiPoint, lineString) {
+  var foundInsidePoint = false;
+  for (var i = 0; i < multiPoint.coordinates.length; i++) {
+    if (!booleanPointOnLine(multiPoint.coordinates[i], lineString)) {
+      return false;
+    }
+    if (!foundInsidePoint) {
+      foundInsidePoint = booleanPointOnLine(
+        multiPoint.coordinates[i],
+        lineString,
+        { ignoreEndVertices: true }
+      );
+    }
+  }
+  return foundInsidePoint;
+}
+__name(isMultiPointOnLine, "isMultiPointOnLine");
+function isMultiPointInPoly(multiPoint, polygon) {
+  var output = true;
+  var oneInside = false;
+  var isInside = false;
+  for (var i = 0; i < multiPoint.coordinates.length; i++) {
+    isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon);
+    if (!isInside) {
+      output = false;
+      break;
+    }
+    if (!oneInside) {
+      isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon, {
+        ignoreBoundary: true
+      });
+    }
+  }
+  return output && isInside;
+}
+__name(isMultiPointInPoly, "isMultiPointInPoly");
+function isLineOnLine(lineString1, lineString2) {
+  for (var i = 0; i < lineString1.coordinates.length; i++) {
+    if (!booleanPointOnLine(lineString1.coordinates[i], lineString2)) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isLineOnLine, "isLineOnLine");
+function isLineInPoly(linestring, polygon) {
+  var polyBbox = calcBbox(polygon);
+  var lineBbox = calcBbox(linestring);
+  if (!doBBoxOverlap(polyBbox, lineBbox)) {
+    return false;
+  }
+  var foundInsidePoint = false;
+  for (var i = 0; i < linestring.coordinates.length - 1; i++) {
+    if (!booleanPointInPolygon(linestring.coordinates[i], polygon)) {
+      return false;
+    }
+    if (!foundInsidePoint) {
+      foundInsidePoint = booleanPointInPolygon(
+        linestring.coordinates[i],
+        polygon,
+        { ignoreBoundary: true }
+      );
+    }
+    if (!foundInsidePoint) {
+      var midpoint = getMidpoint(
+        linestring.coordinates[i],
+        linestring.coordinates[i + 1]
+      );
+      foundInsidePoint = booleanPointInPolygon(midpoint, polygon, {
+        ignoreBoundary: true
+      });
+    }
+  }
+  return foundInsidePoint;
+}
+__name(isLineInPoly, "isLineInPoly");
+function isPolyInPoly(geometry1, geometry2) {
+  var poly1Bbox = calcBbox(geometry1);
+  var poly2Bbox = calcBbox(geometry2);
+  if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {
+    return false;
+  }
+  for (var i = 0; i < geometry1.coordinates[0].length; i++) {
+    if (!booleanPointInPolygon(geometry1.coordinates[0][i], geometry2)) {
+      return false;
+    }
+  }
+  return true;
+}
+__name(isPolyInPoly, "isPolyInPoly");
+function doBBoxOverlap(bbox1, bbox2) {
+  if (bbox1[0] > bbox2[0])
+    return false;
+  if (bbox1[2] < bbox2[2])
+    return false;
+  if (bbox1[1] > bbox2[1])
+    return false;
+  if (bbox1[3] < bbox2[3])
+    return false;
+  return true;
+}
+__name(doBBoxOverlap, "doBBoxOverlap");
+function compareCoords(pair1, pair2) {
+  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
+}
+__name(compareCoords, "compareCoords");
+function getMidpoint(pair1, pair2) {
+  return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];
+}
+__name(getMidpoint, "getMidpoint");
+var turf_boolean_within_default = booleanWithin;
+export {
+  booleanWithin,
+  turf_boolean_within_default as default
+};
+//# sourceMappingURL=index.mjs.map

package/dist/esm/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import {\n  BBox,\n  Feature,\n  Geometry,\n  LineString,\n  MultiPoint,\n  MultiPolygon,\n  Point,\n  Polygon,\n} from \"geojson\";\nimport { bbox as calcBbox } from \"@turf/bbox\";\nimport { booleanPointOnLine } from \"@turf/boolean-point-on-line\";\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { getGeom } from \"@turf/invariant\";\n\n/**\n * Boolean-within returns true if the first geometry is completely within the second geometry.\n * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)\n * must not intersect the exterior of the secondary (geometry b).\n * Boolean-within returns the exact opposite result of the `@turf/boolean-contains`.\n *\n * @name booleanWithin\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 line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);\n * var point = turf.point([1, 2]);\n *\n * turf.booleanWithin(point, line);\n * //=true\n */\nfunction booleanWithin(\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 \"Point\":\n      switch (type2) {\n        case \"MultiPoint\":\n          return isPointInMultiPoint(geom1, geom2);\n        case \"LineString\":\n          return booleanPointOnLine(geom1, geom2, { ignoreEndVertices: true });\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return booleanPointInPolygon(geom1, geom2, { ignoreBoundary: true });\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"MultiPoint\":\n      switch (type2) {\n        case \"MultiPoint\":\n          return isMultiPointInMultiPoint(geom1, geom2);\n        case \"LineString\":\n          return isMultiPointOnLine(geom1, geom2);\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isMultiPointInPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"LineString\":\n      switch (type2) {\n        case \"LineString\":\n          return isLineOnLine(geom1, geom2);\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isLineInPoly(geom1, geom2);\n        default:\n          throw new Error(\"feature2 \" + type2 + \" geometry not supported\");\n      }\n    case \"Polygon\":\n      switch (type2) {\n        case \"Polygon\":\n        case \"MultiPolygon\":\n          return isPolyInPoly(geom1, geom2);\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 isPointInMultiPoint(point: Point, multiPoint: MultiPoint) {\n  var i;\n  var output = false;\n  for (i = 0; i < multiPoint.coordinates.length; i++) {\n    if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {\n      output = true;\n      break;\n    }\n  }\n  return output;\n}\n\nfunction isMultiPointInMultiPoint(\n  multiPoint1: MultiPoint,\n  multiPoint2: MultiPoint\n) {\n  for (var i = 0; i < multiPoint1.coordinates.length; i++) {\n    var anyMatch = false;\n    for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {\n      if (\n        compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])\n      ) {\n        anyMatch = true;\n      }\n    }\n    if (!anyMatch) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isMultiPointOnLine(multiPoint: MultiPoint, lineString: LineString) {\n  var foundInsidePoint = false;\n\n  for (var i = 0; i < multiPoint.coordinates.length; i++) {\n    if (!booleanPointOnLine(multiPoint.coordinates[i], lineString)) {\n      return false;\n    }\n    if (!foundInsidePoint) {\n      foundInsidePoint = booleanPointOnLine(\n        multiPoint.coordinates[i],\n        lineString,\n        { ignoreEndVertices: true }\n      );\n    }\n  }\n  return foundInsidePoint;\n}\n\nfunction isMultiPointInPoly(multiPoint: MultiPoint, polygon: Polygon) {\n  var output = true;\n  var oneInside = false;\n  var isInside = false;\n  for (var i = 0; i < multiPoint.coordinates.length; i++) {\n    isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon);\n    if (!isInside) {\n      output = false;\n      break;\n    }\n    if (!oneInside) {\n      isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon, {\n        ignoreBoundary: true,\n      });\n    }\n  }\n  return output && isInside;\n}\n\nfunction isLineOnLine(lineString1: LineString, lineString2: LineString) {\n  for (var i = 0; i < lineString1.coordinates.length; i++) {\n    if (!booleanPointOnLine(lineString1.coordinates[i], lineString2)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isLineInPoly(linestring: LineString, polygon: Polygon) {\n  var polyBbox = calcBbox(polygon);\n  var lineBbox = calcBbox(linestring);\n  if (!doBBoxOverlap(polyBbox, lineBbox)) {\n    return false;\n  }\n  var foundInsidePoint = false;\n\n  for (var i = 0; i < linestring.coordinates.length - 1; i++) {\n    if (!booleanPointInPolygon(linestring.coordinates[i], polygon)) {\n      return false;\n    }\n    if (!foundInsidePoint) {\n      foundInsidePoint = booleanPointInPolygon(\n        linestring.coordinates[i],\n        polygon,\n        { ignoreBoundary: true }\n      );\n    }\n    if (!foundInsidePoint) {\n      var midpoint = getMidpoint(\n        linestring.coordinates[i],\n        linestring.coordinates[i + 1]\n      );\n      foundInsidePoint = booleanPointInPolygon(midpoint, polygon, {\n        ignoreBoundary: true,\n      });\n    }\n  }\n  return foundInsidePoint;\n}\n\n/**\n * Is Polygon2 in Polygon1\n * Only takes into account outer rings\n *\n * @private\n * @param {Polygon} geometry1\n * @param {Polygon|MultiPolygon} geometry2\n * @returns {boolean} true/false\n */\nfunction isPolyInPoly(geometry1: Polygon, geometry2: Polygon | MultiPolygon) {\n  var poly1Bbox = calcBbox(geometry1);\n  var poly2Bbox = calcBbox(geometry2);\n  if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {\n    return false;\n  }\n  for (var i = 0; i < geometry1.coordinates[0].length; i++) {\n    if (!booleanPointInPolygon(geometry1.coordinates[0][i], geometry2)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction doBBoxOverlap(bbox1: BBox, bbox2: BBox) {\n  if (bbox1[0] > bbox2[0]) return false;\n  if (bbox1[2] < bbox2[2]) return false;\n  if (bbox1[1] > bbox2[1]) return false;\n  if (bbox1[3] < bbox2[3]) return false;\n  return true;\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\n/**\n * getMidpoint\n *\n * @private\n * @param {Position} pair1 point [x,y]\n * @param {Position} pair2 point [x,y]\n * @returns {Position} midpoint of pair1 and pair2\n */\nfunction getMidpoint(pair1: number[], pair2: number[]) {\n  return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];\n}\n\nexport { booleanWithin };\nexport default booleanWithin;\n"],"mappings":";;;;AAUA,SAAS,QAAQ,gBAAgB;AACjC,SAAS,0BAA0B;AACnC,SAAS,6BAA6B;AACtC,SAAS,eAAe;AAmBxB,SAAS,cACP,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,oBAAoB,OAAO,KAAK;AAAA,QACzC,KAAK;AACH,iBAAO,mBAAmB,OAAO,OAAO,EAAE,mBAAmB,KAAK,CAAC;AAAA,QACrE,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,sBAAsB,OAAO,OAAO,EAAE,gBAAgB,KAAK,CAAC;AAAA,QACrE;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,yBAAyB,OAAO,KAAK;AAAA,QAC9C,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,mBAAmB,OAAO,KAAK;AAAA,QACxC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF,KAAK;AACH,cAAQ,OAAO;AAAA,QACb,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,aAAa,OAAO,KAAK;AAAA,QAClC;AACE,gBAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,MACnE;AAAA,IACF;AACE,YAAM,IAAI,MAAM,cAAc,QAAQ,yBAAyB;AAAA,EACnE;AACF;AAvDS;AAyDT,SAAS,oBAAoB,OAAc,YAAwB;AACjE,MAAI;AACJ,MAAI,SAAS;AACb,OAAK,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AAClD,QAAI,cAAc,WAAW,YAAY,CAAC,GAAG,MAAM,WAAW,GAAG;AAC/D,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAVS;AAYT,SAAS,yBACP,aACA,aACA;AACA,WAAS,IAAI,GAAG,IAAI,YAAY,YAAY,QAAQ,KAAK;AACvD,QAAI,WAAW;AACf,aAAS,KAAK,GAAG,KAAK,YAAY,YAAY,QAAQ,MAAM;AAC1D,UACE,cAAc,YAAY,YAAY,CAAC,GAAG,YAAY,YAAY,EAAE,CAAC,GACrE;AACA,mBAAW;AAAA,MACb;AAAA,IACF;AACA,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAlBS;AAoBT,SAAS,mBAAmB,YAAwB,YAAwB;AAC1E,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AACtD,QAAI,CAAC,mBAAmB,WAAW,YAAY,CAAC,GAAG,UAAU,GAAG;AAC9D,aAAO;AAAA,IACT;AACA,QAAI,CAAC,kBAAkB;AACrB,yBAAmB;AAAA,QACjB,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,QACA,EAAE,mBAAmB,KAAK;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAhBS;AAkBT,SAAS,mBAAmB,YAAwB,SAAkB;AACpE,MAAI,SAAS;AACb,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,QAAQ,KAAK;AACtD,eAAW,sBAAsB,WAAW,YAAY,CAAC,GAAG,OAAO;AACnE,QAAI,CAAC,UAAU;AACb,eAAS;AACT;AAAA,IACF;AACA,QAAI,CAAC,WAAW;AACd,iBAAW,sBAAsB,WAAW,YAAY,CAAC,GAAG,SAAS;AAAA,QACnE,gBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,UAAU;AACnB;AAjBS;AAmBT,SAAS,aAAa,aAAyB,aAAyB;AACtE,WAAS,IAAI,GAAG,IAAI,YAAY,YAAY,QAAQ,KAAK;AACvD,QAAI,CAAC,mBAAmB,YAAY,YAAY,CAAC,GAAG,WAAW,GAAG;AAChE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAPS;AAST,SAAS,aAAa,YAAwB,SAAkB;AAC9D,MAAI,WAAW,SAAS,OAAO;AAC/B,MAAI,WAAW,SAAS,UAAU;AAClC,MAAI,CAAC,cAAc,UAAU,QAAQ,GAAG;AACtC,WAAO;AAAA,EACT;AACA,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,WAAW,YAAY,SAAS,GAAG,KAAK;AAC1D,QAAI,CAAC,sBAAsB,WAAW,YAAY,CAAC,GAAG,OAAO,GAAG;AAC9D,aAAO;AAAA,IACT;AACA,QAAI,CAAC,kBAAkB;AACrB,yBAAmB;AAAA,QACjB,WAAW,YAAY,CAAC;AAAA,QACxB;AAAA,QACA,EAAE,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACF;AACA,QAAI,CAAC,kBAAkB;AACrB,UAAI,WAAW;AAAA,QACb,WAAW,YAAY,CAAC;AAAA,QACxB,WAAW,YAAY,IAAI,CAAC;AAAA,MAC9B;AACA,yBAAmB,sBAAsB,UAAU,SAAS;AAAA,QAC1D,gBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AA9BS;AAyCT,SAAS,aAAa,WAAoB,WAAmC;AAC3E,MAAI,YAAY,SAAS,SAAS;AAClC,MAAI,YAAY,SAAS,SAAS;AAClC,MAAI,CAAC,cAAc,WAAW,SAAS,GAAG;AACxC,WAAO;AAAA,EACT;AACA,WAAS,IAAI,GAAG,IAAI,UAAU,YAAY,CAAC,EAAE,QAAQ,KAAK;AACxD,QAAI,CAAC,sBAAsB,UAAU,YAAY,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG;AAClE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAZS;AAcT,SAAS,cAAc,OAAa,OAAa;AAC/C,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,MAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAG,WAAO;AAChC,SAAO;AACT;AANS;AAgBT,SAAS,cAAc,OAAiB,OAAiB;AACvD,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC;AACtD;AAFS;AAYT,SAAS,YAAY,OAAiB,OAAiB;AACrD,SAAO,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC;AAC9D;AAFS;AAKT,IAAO,8BAAQ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/boolean-within",
-  "version": "7.0.0-alpha.0",
+  "version": "7.0.0-alpha.110+1411d63a7",
   "description": "turf boolean-within module",
   "author": "Turf Authors",
   "contributors": [
@@ -27,50 +27,56 @@
     "within",
     "boolean-within"
   ],
-  "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",
     "test:types": "tsc --esModuleInterop --noEmit --strict types.ts"
   },
   "devDependencies": {
-    "@types/tape": "*",
-    "benchmark": "*",
+    "@types/benchmark": "^2.1.5",
+    "@types/tape": "^4.2.32",
+    "benchmark": "^2.1.4",
     "boolean-jsts": "*",
     "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/bbox": "^7.0.0-alpha.0",
-    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.0",
-    "@turf/boolean-point-on-line": "^7.0.0-alpha.0",
-    "@turf/helpers": "^7.0.0-alpha.0",
-    "@turf/invariant": "^7.0.0-alpha.0",
-    "tslib": "^2.3.0"
+    "@turf/bbox": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/boolean-point-on-line": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/helpers": "^7.0.0-alpha.110+1411d63a7",
+    "@turf/invariant": "^7.0.0-alpha.110+1411d63a7",
+    "tslib": "^2.6.2"
   },
-  "gitHead": "0edc4c491b999e5ace770a61e1cf549f7c004189"
+  "gitHead": "1411d63a74c275c9216fe48e9d3cb2d48a359068"
 }

package/dist/es/index.js

@@ -1,215 +0,0 @@
-import calcBbox from "@turf/bbox";
-import booleanPointOnLine from "@turf/boolean-point-on-line";
-import booleanPointInPolygon from "@turf/boolean-point-in-polygon";
-import { getGeom } from "@turf/invariant";
-/**
- * Boolean-within returns true if the first geometry is completely within the second geometry.
- * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)
- * must not intersect the exterior of the secondary (geometry b).
- * Boolean-within returns the exact opposite result of the `@turf/boolean-contains`.
- *
- * @name booleanWithin
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- * var point = turf.point([1, 2]);
- *
- * turf.booleanWithin(point, line);
- * //=true
- */
-function booleanWithin(feature1, feature2) {
-    var geom1 = getGeom(feature1);
-    var geom2 = getGeom(feature2);
-    var type1 = geom1.type;
-    var type2 = geom2.type;
-    switch (type1) {
-        case "Point":
-            switch (type2) {
-                case "MultiPoint":
-                    return isPointInMultiPoint(geom1, geom2);
-                case "LineString":
-                    return booleanPointOnLine(geom1, geom2, { ignoreEndVertices: true });
-                case "Polygon":
-                case "MultiPolygon":
-                    return booleanPointInPolygon(geom1, geom2, { ignoreBoundary: true });
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "MultiPoint":
-            switch (type2) {
-                case "MultiPoint":
-                    return isMultiPointInMultiPoint(geom1, geom2);
-                case "LineString":
-                    return isMultiPointOnLine(geom1, geom2);
-                case "Polygon":
-                case "MultiPolygon":
-                    return isMultiPointInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "LineString":
-            switch (type2) {
-                case "LineString":
-                    return isLineOnLine(geom1, geom2);
-                case "Polygon":
-                case "MultiPolygon":
-                    return isLineInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "Polygon":
-            switch (type2) {
-                case "Polygon":
-                case "MultiPolygon":
-                    return isPolyInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        default:
-            throw new Error("feature1 " + type1 + " geometry not supported");
-    }
-}
-function isPointInMultiPoint(point, multiPoint) {
-    var i;
-    var output = false;
-    for (i = 0; i < multiPoint.coordinates.length; i++) {
-        if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {
-            output = true;
-            break;
-        }
-    }
-    return output;
-}
-function isMultiPointInMultiPoint(multiPoint1, multiPoint2) {
-    for (var i = 0; i < multiPoint1.coordinates.length; i++) {
-        var anyMatch = false;
-        for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {
-            if (compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])) {
-                anyMatch = true;
-            }
-        }
-        if (!anyMatch) {
-            return false;
-        }
-    }
-    return true;
-}
-function isMultiPointOnLine(multiPoint, lineString) {
-    var foundInsidePoint = false;
-    for (var i = 0; i < multiPoint.coordinates.length; i++) {
-        if (!booleanPointOnLine(multiPoint.coordinates[i], lineString)) {
-            return false;
-        }
-        if (!foundInsidePoint) {
-            foundInsidePoint = booleanPointOnLine(multiPoint.coordinates[i], lineString, { ignoreEndVertices: true });
-        }
-    }
-    return foundInsidePoint;
-}
-function isMultiPointInPoly(multiPoint, polygon) {
-    var output = true;
-    var oneInside = false;
-    var isInside = false;
-    for (var i = 0; i < multiPoint.coordinates.length; i++) {
-        isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon);
-        if (!isInside) {
-            output = false;
-            break;
-        }
-        if (!oneInside) {
-            isInside = booleanPointInPolygon(multiPoint.coordinates[i], polygon, {
-                ignoreBoundary: true,
-            });
-        }
-    }
-    return output && isInside;
-}
-function isLineOnLine(lineString1, lineString2) {
-    for (var i = 0; i < lineString1.coordinates.length; i++) {
-        if (!booleanPointOnLine(lineString1.coordinates[i], lineString2)) {
-            return false;
-        }
-    }
-    return true;
-}
-function isLineInPoly(linestring, polygon) {
-    var polyBbox = calcBbox(polygon);
-    var lineBbox = calcBbox(linestring);
-    if (!doBBoxOverlap(polyBbox, lineBbox)) {
-        return false;
-    }
-    var foundInsidePoint = false;
-    for (var i = 0; i < linestring.coordinates.length - 1; i++) {
-        if (!booleanPointInPolygon(linestring.coordinates[i], polygon)) {
-            return false;
-        }
-        if (!foundInsidePoint) {
-            foundInsidePoint = booleanPointInPolygon(linestring.coordinates[i], polygon, { ignoreBoundary: true });
-        }
-        if (!foundInsidePoint) {
-            var midpoint = getMidpoint(linestring.coordinates[i], linestring.coordinates[i + 1]);
-            foundInsidePoint = booleanPointInPolygon(midpoint, polygon, {
-                ignoreBoundary: true,
-            });
-        }
-    }
-    return foundInsidePoint;
-}
-/**
- * Is Polygon2 in Polygon1
- * Only takes into account outer rings
- *
- * @private
- * @param {Polygon} geometry1
- * @param {Polygon|MultiPolygon} geometry2
- * @returns {boolean} true/false
- */
-function isPolyInPoly(geometry1, geometry2) {
-    var poly1Bbox = calcBbox(geometry1);
-    var poly2Bbox = calcBbox(geometry2);
-    if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {
-        return false;
-    }
-    for (var i = 0; i < geometry1.coordinates[0].length; i++) {
-        if (!booleanPointInPolygon(geometry1.coordinates[0][i], geometry2)) {
-            return false;
-        }
-    }
-    return true;
-}
-function doBBoxOverlap(bbox1, bbox2) {
-    if (bbox1[0] > bbox2[0])
-        return false;
-    if (bbox1[2] < bbox2[2])
-        return false;
-    if (bbox1[1] > bbox2[1])
-        return false;
-    if (bbox1[3] < bbox2[3])
-        return false;
-    return true;
-}
-/**
- * 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];
-}
-/**
- * getMidpoint
- *
- * @private
- * @param {Position} pair1 point [x,y]
- * @param {Position} pair2 point [x,y]
- * @returns {Position} midpoint of pair1 and pair2
- */
-function getMidpoint(pair1, pair2) {
-    return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];
-}
-export default booleanWithin;

package/dist/es/package.json

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

package/dist/js/index.js

@@ -1,218 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-const bbox_1 = tslib_1.__importDefault(require("@turf/bbox"));
-const boolean_point_on_line_1 = tslib_1.__importDefault(require("@turf/boolean-point-on-line"));
-const boolean_point_in_polygon_1 = tslib_1.__importDefault(require("@turf/boolean-point-in-polygon"));
-const invariant_1 = require("@turf/invariant");
-/**
- * Boolean-within returns true if the first geometry is completely within the second geometry.
- * The interiors of both geometries must intersect and, the interior and boundary of the primary (geometry a)
- * must not intersect the exterior of the secondary (geometry b).
- * Boolean-within returns the exact opposite result of the `@turf/boolean-contains`.
- *
- * @name booleanWithin
- * @param {Geometry|Feature<any>} feature1 GeoJSON Feature or Geometry
- * @param {Geometry|Feature<any>} feature2 GeoJSON Feature or Geometry
- * @returns {boolean} true/false
- * @example
- * var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
- * var point = turf.point([1, 2]);
- *
- * turf.booleanWithin(point, line);
- * //=true
- */
-function booleanWithin(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 "Point":
-            switch (type2) {
-                case "MultiPoint":
-                    return isPointInMultiPoint(geom1, geom2);
-                case "LineString":
-                    return boolean_point_on_line_1.default(geom1, geom2, { ignoreEndVertices: true });
-                case "Polygon":
-                case "MultiPolygon":
-                    return boolean_point_in_polygon_1.default(geom1, geom2, { ignoreBoundary: true });
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "MultiPoint":
-            switch (type2) {
-                case "MultiPoint":
-                    return isMultiPointInMultiPoint(geom1, geom2);
-                case "LineString":
-                    return isMultiPointOnLine(geom1, geom2);
-                case "Polygon":
-                case "MultiPolygon":
-                    return isMultiPointInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "LineString":
-            switch (type2) {
-                case "LineString":
-                    return isLineOnLine(geom1, geom2);
-                case "Polygon":
-                case "MultiPolygon":
-                    return isLineInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        case "Polygon":
-            switch (type2) {
-                case "Polygon":
-                case "MultiPolygon":
-                    return isPolyInPoly(geom1, geom2);
-                default:
-                    throw new Error("feature2 " + type2 + " geometry not supported");
-            }
-        default:
-            throw new Error("feature1 " + type1 + " geometry not supported");
-    }
-}
-function isPointInMultiPoint(point, multiPoint) {
-    var i;
-    var output = false;
-    for (i = 0; i < multiPoint.coordinates.length; i++) {
-        if (compareCoords(multiPoint.coordinates[i], point.coordinates)) {
-            output = true;
-            break;
-        }
-    }
-    return output;
-}
-function isMultiPointInMultiPoint(multiPoint1, multiPoint2) {
-    for (var i = 0; i < multiPoint1.coordinates.length; i++) {
-        var anyMatch = false;
-        for (var i2 = 0; i2 < multiPoint2.coordinates.length; i2++) {
-            if (compareCoords(multiPoint1.coordinates[i], multiPoint2.coordinates[i2])) {
-                anyMatch = true;
-            }
-        }
-        if (!anyMatch) {
-            return false;
-        }
-    }
-    return true;
-}
-function isMultiPointOnLine(multiPoint, lineString) {
-    var foundInsidePoint = false;
-    for (var i = 0; i < multiPoint.coordinates.length; i++) {
-        if (!boolean_point_on_line_1.default(multiPoint.coordinates[i], lineString)) {
-            return false;
-        }
-        if (!foundInsidePoint) {
-            foundInsidePoint = boolean_point_on_line_1.default(multiPoint.coordinates[i], lineString, { ignoreEndVertices: true });
-        }
-    }
-    return foundInsidePoint;
-}
-function isMultiPointInPoly(multiPoint, polygon) {
-    var output = true;
-    var oneInside = false;
-    var isInside = false;
-    for (var i = 0; i < multiPoint.coordinates.length; i++) {
-        isInside = boolean_point_in_polygon_1.default(multiPoint.coordinates[i], polygon);
-        if (!isInside) {
-            output = false;
-            break;
-        }
-        if (!oneInside) {
-            isInside = boolean_point_in_polygon_1.default(multiPoint.coordinates[i], polygon, {
-                ignoreBoundary: true,
-            });
-        }
-    }
-    return output && isInside;
-}
-function isLineOnLine(lineString1, lineString2) {
-    for (var i = 0; i < lineString1.coordinates.length; i++) {
-        if (!boolean_point_on_line_1.default(lineString1.coordinates[i], lineString2)) {
-            return false;
-        }
-    }
-    return true;
-}
-function isLineInPoly(linestring, polygon) {
-    var polyBbox = bbox_1.default(polygon);
-    var lineBbox = bbox_1.default(linestring);
-    if (!doBBoxOverlap(polyBbox, lineBbox)) {
-        return false;
-    }
-    var foundInsidePoint = false;
-    for (var i = 0; i < linestring.coordinates.length - 1; i++) {
-        if (!boolean_point_in_polygon_1.default(linestring.coordinates[i], polygon)) {
-            return false;
-        }
-        if (!foundInsidePoint) {
-            foundInsidePoint = boolean_point_in_polygon_1.default(linestring.coordinates[i], polygon, { ignoreBoundary: true });
-        }
-        if (!foundInsidePoint) {
-            var midpoint = getMidpoint(linestring.coordinates[i], linestring.coordinates[i + 1]);
-            foundInsidePoint = boolean_point_in_polygon_1.default(midpoint, polygon, {
-                ignoreBoundary: true,
-            });
-        }
-    }
-    return foundInsidePoint;
-}
-/**
- * Is Polygon2 in Polygon1
- * Only takes into account outer rings
- *
- * @private
- * @param {Polygon} geometry1
- * @param {Polygon|MultiPolygon} geometry2
- * @returns {boolean} true/false
- */
-function isPolyInPoly(geometry1, geometry2) {
-    var poly1Bbox = bbox_1.default(geometry1);
-    var poly2Bbox = bbox_1.default(geometry2);
-    if (!doBBoxOverlap(poly2Bbox, poly1Bbox)) {
-        return false;
-    }
-    for (var i = 0; i < geometry1.coordinates[0].length; i++) {
-        if (!boolean_point_in_polygon_1.default(geometry1.coordinates[0][i], geometry2)) {
-            return false;
-        }
-    }
-    return true;
-}
-function doBBoxOverlap(bbox1, bbox2) {
-    if (bbox1[0] > bbox2[0])
-        return false;
-    if (bbox1[2] < bbox2[2])
-        return false;
-    if (bbox1[1] > bbox2[1])
-        return false;
-    if (bbox1[3] < bbox2[3])
-        return false;
-    return true;
-}
-/**
- * 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];
-}
-/**
- * getMidpoint
- *
- * @private
- * @param {Position} pair1 point [x,y]
- * @param {Position} pair2 point [x,y]
- * @returns {Position} midpoint of pair1 and pair2
- */
-function getMidpoint(pair1, pair2) {
-    return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];
-}
-exports.default = booleanWithin;