mirage2d 1.1.3 → 1.1.4

package/dist/js/_@turf_bbox@6.5.0@@turf/_@turf_bbox@6.5.0@@turf.4c59feee.js

@@ -1,48 +0,0 @@
-import { c as coordEach } from "../_@turf_meta@6.5.0@@turf/_@turf_meta@6.5.0@@turf.1b9d5da5.js";
-var commonjsGlobal = typeof globalThis !== "undefined" ? globalThis : typeof window !== "undefined" ? window : typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : {};
-function getDefaultExportFromCjs(x) {
-  return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, "default") ? x["default"] : x;
-}
-function getAugmentedNamespace(n) {
-  if (n.__esModule)
-    return n;
-  var a = Object.defineProperty({}, "__esModule", { value: true });
-  Object.keys(n).forEach(function(k) {
-    var d = Object.getOwnPropertyDescriptor(n, k);
-    Object.defineProperty(a, k, d.get ? d : {
-      enumerable: true,
-      get: function() {
-        return n[k];
-      }
-    });
-  });
-  return a;
-}
-function commonjsRequire(path) {
-  throw new Error('Could not dynamically require "' + path + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
-}
-function bbox(geojson) {
-  var result = [Infinity, Infinity, -Infinity, -Infinity];
-  coordEach(geojson, function(coord) {
-    if (result[0] > coord[0]) {
-      result[0] = coord[0];
-    }
-    if (result[1] > coord[1]) {
-      result[1] = coord[1];
-    }
-    if (result[2] < coord[0]) {
-      result[2] = coord[0];
-    }
-    if (result[3] < coord[1]) {
-      result[3] = coord[1];
-    }
-  });
-  return result;
-}
-bbox["default"] = bbox;
-var es = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  "default": bbox
-}, Symbol.toStringTag, { value: "Module" }));
-var require$$3 = /* @__PURE__ */ getAugmentedNamespace(es);
-export { commonjsRequire as a, bbox as b, commonjsGlobal as c, getDefaultExportFromCjs as d, getAugmentedNamespace as g, require$$3 as r };

package/dist/js/_@turf_bearing@6.5.0@@turf/_@turf_bearing@6.5.0@@turf.f2555a09.js

@@ -1,25 +0,0 @@
-import { d as degreesToRadians, r as radiansToDegrees } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-import { a as getCoord } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-function bearing(start, end, options) {
-  if (options === void 0) {
-    options = {};
-  }
-  if (options.final === true) {
-    return calculateFinalBearing(start, end);
-  }
-  var coordinates1 = getCoord(start);
-  var coordinates2 = getCoord(end);
-  var lon1 = degreesToRadians(coordinates1[0]);
-  var lon2 = degreesToRadians(coordinates2[0]);
-  var lat1 = degreesToRadians(coordinates1[1]);
-  var lat2 = degreesToRadians(coordinates2[1]);
-  var a = Math.sin(lon2 - lon1) * Math.cos(lat2);
-  var b = Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1) * Math.cos(lat2) * Math.cos(lon2 - lon1);
-  return radiansToDegrees(Math.atan2(a, b));
-}
-function calculateFinalBearing(start, end) {
-  var bear = bearing(end, start);
-  bear = (bear + 180) % 360;
-  return bear;
-}
-export { bearing as b };

package/dist/js/_@turf_bezier-spline@6.5.0@@turf/_@turf_bezier-spline@6.5.0@@turf.fa7991dd.js

@@ -1,137 +0,0 @@
-import { l as lineString } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-import { g as getGeom } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-var Spline = function() {
-  function Spline2(options) {
-    this.points = options.points || [];
-    this.duration = options.duration || 1e4;
-    this.sharpness = options.sharpness || 0.85;
-    this.centers = [];
-    this.controls = [];
-    this.stepLength = options.stepLength || 60;
-    this.length = this.points.length;
-    this.delay = 0;
-    for (var i = 0; i < this.length; i++) {
-      this.points[i].z = this.points[i].z || 0;
-    }
-    for (var i = 0; i < this.length - 1; i++) {
-      var p1 = this.points[i];
-      var p2 = this.points[i + 1];
-      this.centers.push({
-        x: (p1.x + p2.x) / 2,
-        y: (p1.y + p2.y) / 2,
-        z: (p1.z + p2.z) / 2
-      });
-    }
-    this.controls.push([this.points[0], this.points[0]]);
-    for (var i = 0; i < this.centers.length - 1; i++) {
-      var dx = this.points[i + 1].x - (this.centers[i].x + this.centers[i + 1].x) / 2;
-      var dy = this.points[i + 1].y - (this.centers[i].y + this.centers[i + 1].y) / 2;
-      var dz = this.points[i + 1].z - (this.centers[i].y + this.centers[i + 1].z) / 2;
-      this.controls.push([
-        {
-          x: (1 - this.sharpness) * this.points[i + 1].x + this.sharpness * (this.centers[i].x + dx),
-          y: (1 - this.sharpness) * this.points[i + 1].y + this.sharpness * (this.centers[i].y + dy),
-          z: (1 - this.sharpness) * this.points[i + 1].z + this.sharpness * (this.centers[i].z + dz)
-        },
-        {
-          x: (1 - this.sharpness) * this.points[i + 1].x + this.sharpness * (this.centers[i + 1].x + dx),
-          y: (1 - this.sharpness) * this.points[i + 1].y + this.sharpness * (this.centers[i + 1].y + dy),
-          z: (1 - this.sharpness) * this.points[i + 1].z + this.sharpness * (this.centers[i + 1].z + dz)
-        }
-      ]);
-    }
-    this.controls.push([
-      this.points[this.length - 1],
-      this.points[this.length - 1]
-    ]);
-    this.steps = this.cacheSteps(this.stepLength);
-    return this;
-  }
-  Spline2.prototype.cacheSteps = function(mindist) {
-    var steps = [];
-    var laststep = this.pos(0);
-    steps.push(0);
-    for (var t = 0; t < this.duration; t += 10) {
-      var step = this.pos(t);
-      var dist = Math.sqrt((step.x - laststep.x) * (step.x - laststep.x) + (step.y - laststep.y) * (step.y - laststep.y) + (step.z - laststep.z) * (step.z - laststep.z));
-      if (dist > mindist) {
-        steps.push(t);
-        laststep = step;
-      }
-    }
-    return steps;
-  };
-  Spline2.prototype.vector = function(t) {
-    var p1 = this.pos(t + 10);
-    var p2 = this.pos(t - 10);
-    return {
-      angle: 180 * Math.atan2(p1.y - p2.y, p1.x - p2.x) / 3.14,
-      speed: Math.sqrt((p2.x - p1.x) * (p2.x - p1.x) + (p2.y - p1.y) * (p2.y - p1.y) + (p2.z - p1.z) * (p2.z - p1.z))
-    };
-  };
-  Spline2.prototype.pos = function(time) {
-    var t = time - this.delay;
-    if (t < 0) {
-      t = 0;
-    }
-    if (t > this.duration) {
-      t = this.duration - 1;
-    }
-    var t2 = t / this.duration;
-    if (t2 >= 1) {
-      return this.points[this.length - 1];
-    }
-    var n = Math.floor((this.points.length - 1) * t2);
-    var t1 = (this.length - 1) * t2 - n;
-    return bezier$1(t1, this.points[n], this.controls[n][1], this.controls[n + 1][0], this.points[n + 1]);
-  };
-  return Spline2;
-}();
-var Spline$1 = Spline;
-function bezier$1(t, p1, c1, c2, p2) {
-  var b = B(t);
-  var pos = {
-    x: p2.x * b[0] + c2.x * b[1] + c1.x * b[2] + p1.x * b[3],
-    y: p2.y * b[0] + c2.y * b[1] + c1.y * b[2] + p1.y * b[3],
-    z: p2.z * b[0] + c2.z * b[1] + c1.z * b[2] + p1.z * b[3]
-  };
-  return pos;
-}
-function B(t) {
-  var t2 = t * t;
-  var t3 = t2 * t;
-  return [
-    t3,
-    3 * t2 * (1 - t),
-    3 * t * (1 - t) * (1 - t),
-    (1 - t) * (1 - t) * (1 - t)
-  ];
-}
-function bezier(line, options) {
-  if (options === void 0) {
-    options = {};
-  }
-  var resolution = options.resolution || 1e4;
-  var sharpness = options.sharpness || 0.85;
-  var coords = [];
-  var points = getGeom(line).coordinates.map(function(pt) {
-    return { x: pt[0], y: pt[1] };
-  });
-  var spline = new Spline$1({
-    duration: resolution,
-    points,
-    sharpness
-  });
-  var pushCoord = function(time) {
-    var pos = spline.pos(time);
-    if (Math.floor(time / 100) % 2 === 0) {
-      coords.push([pos.x, pos.y]);
-    }
-  };
-  for (var i = 0; i < spline.duration; i += 10) {
-    pushCoord(i);
-  }
-  pushCoord(spline.duration);
-  return lineString(coords, options.properties);
-}
-export { bezier as b };

package/dist/js/_@turf_boolean-clockwise@6.5.0@@turf/_@turf_boolean-clockwise@6.5.0@@turf.4031f280.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_boolean-contains@6.5.0@@turf/_@turf_boolean-contains@6.5.0@@turf.836d55d8.js

@@ -1,191 +0,0 @@
-import { b as bbox } from "../_@turf_bbox@6.5.0@@turf/_@turf_bbox@6.5.0@@turf.4c59feee.js";
-import { b as booleanPointInPolygon } from "../_@turf_boolean-point-in-polygon@6.5.0@@turf/_@turf_boolean-point-in-polygon@6.5.0@@turf.62a2d48a.js";
-import { b as booleanPointOnLine } from "../_@turf_boolean-point-on-line@6.5.0@@turf/_@turf_boolean-point-on-line@6.5.0@@turf.3cf3aaa1.js";
-import { g as getGeom } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-function booleanContains(feature1, feature2) {
-  var geom1 = getGeom(feature1);
-  var geom2 = getGeom(feature2);
-  var type1 = geom1.type;
-  var type2 = geom2.type;
-  var coords1 = geom1.coordinates;
-  var coords2 = geom2.coordinates;
-  switch (type1) {
-    case "Point":
-      switch (type2) {
-        case "Point":
-          return compareCoords(coords1, coords2);
-        default:
-          throw new Error("feature2 " + type2 + " geometry not supported");
-      }
-    case "MultiPoint":
-      switch (type2) {
-        case "Point":
-          return isPointInMultiPoint(geom1, geom2);
-        case "MultiPoint":
-          return isMultiPointInMultiPoint(geom1, geom2);
-        default:
-          throw new Error("feature2 " + type2 + " geometry not supported");
-      }
-    case "LineString":
-      switch (type2) {
-        case "Point":
-          return booleanPointOnLine(geom2, geom1, { ignoreEndVertices: true });
-        case "LineString":
-          return isLineOnLine(geom1, geom2);
-        case "MultiPoint":
-          return isMultiPointOnLine(geom1, geom2);
-        default:
-          throw new Error("feature2 " + type2 + " geometry not supported");
-      }
-    case "Polygon":
-      switch (type2) {
-        case "Point":
-          return booleanPointInPolygon(geom2, geom1, { ignoreBoundary: true });
-        case "LineString":
-          return isLineInPoly(geom1, geom2);
-        case "Polygon":
-          return isPolyInPoly(geom1, geom2);
-        case "MultiPoint":
-          return isMultiPointInPoly(geom1, geom2);
-        default:
-          throw new Error("feature2 " + type2 + " geometry not supported");
-      }
-    default:
-      throw new Error("feature1 " + type1 + " geometry not supported");
-  }
-}
-function isPointInMultiPoint(multiPoint, pt) {
-  var i;
-  var output = false;
-  for (i = 0; i < multiPoint.coordinates.length; i++) {
-    if (compareCoords(multiPoint.coordinates[i], pt.coordinates)) {
-      output = true;
-      break;
-    }
-  }
-  return output;
-}
-function isMultiPointInMultiPoint(multiPoint1, multiPoint2) {
-  for (var _i = 0, _a = multiPoint2.coordinates; _i < _a.length; _i++) {
-    var coord2 = _a[_i];
-    var matchFound = false;
-    for (var _b = 0, _c = multiPoint1.coordinates; _b < _c.length; _b++) {
-      var coord1 = _c[_b];
-      if (compareCoords(coord2, coord1)) {
-        matchFound = true;
-        break;
-      }
-    }
-    if (!matchFound) {
-      return false;
-    }
-  }
-  return true;
-}
-function isMultiPointOnLine(lineString, multiPoint) {
-  var haveFoundInteriorPoint = false;
-  for (var _i = 0, _a = multiPoint.coordinates; _i < _a.length; _i++) {
-    var coord = _a[_i];
-    if (booleanPointOnLine(coord, lineString, { ignoreEndVertices: true })) {
-      haveFoundInteriorPoint = true;
-    }
-    if (!booleanPointOnLine(coord, lineString)) {
-      return false;
-    }
-  }
-  if (haveFoundInteriorPoint) {
-    return true;
-  }
-  return false;
-}
-function isMultiPointInPoly(polygon, multiPoint) {
-  for (var _i = 0, _a = multiPoint.coordinates; _i < _a.length; _i++) {
-    var coord = _a[_i];
-    if (!booleanPointInPolygon(coord, polygon, { ignoreBoundary: true })) {
-      return false;
-    }
-  }
-  return true;
-}
-function isLineOnLine(lineString1, lineString2) {
-  var haveFoundInteriorPoint = false;
-  for (var _i = 0, _a = lineString2.coordinates; _i < _a.length; _i++) {
-    var coords = _a[_i];
-    if (booleanPointOnLine({ type: "Point", coordinates: coords }, lineString1, {
-      ignoreEndVertices: true
-    })) {
-      haveFoundInteriorPoint = true;
-    }
-    if (!booleanPointOnLine({ type: "Point", coordinates: coords }, lineString1, {
-      ignoreEndVertices: false
-    })) {
-      return false;
-    }
-  }
-  return haveFoundInteriorPoint;
-}
-function isLineInPoly(polygon, linestring) {
-  var output = false;
-  var i = 0;
-  var polyBbox = bbox(polygon);
-  var lineBbox = bbox(linestring);
-  if (!doBBoxOverlap(polyBbox, lineBbox)) {
-    return false;
-  }
-  for (i; i < linestring.coordinates.length - 1; i++) {
-    var midPoint = getMidpoint(linestring.coordinates[i], linestring.coordinates[i + 1]);
-    if (booleanPointInPolygon({ type: "Point", coordinates: midPoint }, polygon, {
-      ignoreBoundary: true
-    })) {
-      output = true;
-      break;
-    }
-  }
-  return output;
-}
-function isPolyInPoly(feature1, feature2) {
-  if (feature1.type === "Feature" && feature1.geometry === null) {
-    return false;
-  }
-  if (feature2.type === "Feature" && feature2.geometry === null) {
-    return false;
-  }
-  var poly1Bbox = bbox(feature1);
-  var poly2Bbox = bbox(feature2);
-  if (!doBBoxOverlap(poly1Bbox, poly2Bbox)) {
-    return false;
-  }
-  var coords = getGeom(feature2).coordinates;
-  for (var _i = 0, coords_1 = coords; _i < coords_1.length; _i++) {
-    var ring = coords_1[_i];
-    for (var _a = 0, ring_1 = ring; _a < ring_1.length; _a++) {
-      var coord = ring_1[_a];
-      if (!booleanPointInPolygon(coord, feature1)) {
-        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;
-}
-function compareCoords(pair1, pair2) {
-  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
-}
-function getMidpoint(pair1, pair2) {
-  return [(pair1[0] + pair2[0]) / 2, (pair1[1] + pair2[1]) / 2];
-}
-export { booleanContains as b };

package/dist/js/_@turf_boolean-crosses@6.5.0@@turf/_@turf_boolean-crosses@6.5.0@@turf.c5f65a28.js

@@ -1,125 +0,0 @@
-import { l as lineIntersect } from "../_@turf_line-intersect@6.5.0@@turf/_@turf_line-intersect@6.5.0@@turf.c4d81948.js";
-import { p as polygonToLine } from "../_@turf_polygon-to-line@6.5.0@@turf/_@turf_polygon-to-line@6.5.0@@turf.3177cfb1.js";
-import { b as booleanPointInPolygon } from "../_@turf_boolean-point-in-polygon@6.5.0@@turf/_@turf_boolean-point-in-polygon@6.5.0@@turf.62a2d48a.js";
-import { g as getGeom } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-import { p as point } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-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");
-  }
-}
-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) {
-  var line = polygonToLine(polygon);
-  var 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 (var i = 0; i < pointLength && (!foundIntPoint || !foundExtPoint); i++) {
-    if (booleanPointInPolygon(point(multiPoint.coordinates[i]), polygon)) {
-      foundIntPoint = true;
-    } else {
-      foundExtPoint = true;
-    }
-  }
-  return foundExtPoint && foundIntPoint;
-}
-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 { booleanCrosses as b };

package/dist/js/_@turf_boolean-disjoint@6.5.0@@turf/_@turf_boolean-disjoint@6.5.0@@turf.bbd60872.js

@@ -1,122 +0,0 @@
-import { b as booleanPointInPolygon } from "../_@turf_boolean-point-in-polygon@6.5.0@@turf/_@turf_boolean-point-in-polygon@6.5.0@@turf.62a2d48a.js";
-import { l as lineIntersect } from "../_@turf_line-intersect@6.5.0@@turf/_@turf_line-intersect@6.5.0@@turf.c4d81948.js";
-import { f as flattenEach } from "../_@turf_meta@6.5.0@@turf/_@turf_meta@6.5.0@@turf.1b9d5da5.js";
-import { a as polygonToLine } from "../_@turf_polygon-to-line@6.5.0@@turf/_@turf_polygon-to-line@6.5.0@@turf.3177cfb1.js";
-function booleanDisjoint(feature1, feature2) {
-  var bool = true;
-  flattenEach(feature1, function(flatten1) {
-    flattenEach(feature2, function(flatten2) {
-      if (bool === false) {
-        return false;
-      }
-      bool = disjoint(flatten1.geometry, flatten2.geometry);
-    });
-  });
-  return bool;
-}
-function disjoint(geom1, geom2) {
-  switch (geom1.type) {
-    case "Point":
-      switch (geom2.type) {
-        case "Point":
-          return !compareCoords(geom1.coordinates, geom2.coordinates);
-        case "LineString":
-          return !isPointOnLine(geom2, geom1);
-        case "Polygon":
-          return !booleanPointInPolygon(geom1, geom2);
-      }
-      break;
-    case "LineString":
-      switch (geom2.type) {
-        case "Point":
-          return !isPointOnLine(geom1, geom2);
-        case "LineString":
-          return !isLineOnLine(geom1, geom2);
-        case "Polygon":
-          return !isLineInPoly(geom2, geom1);
-      }
-      break;
-    case "Polygon":
-      switch (geom2.type) {
-        case "Point":
-          return !booleanPointInPolygon(geom2, geom1);
-        case "LineString":
-          return !isLineInPoly(geom1, geom2);
-        case "Polygon":
-          return !isPolyInPoly(geom2, geom1);
-      }
-  }
-  return false;
-}
-function isPointOnLine(lineString, pt) {
-  for (var i = 0; i < lineString.coordinates.length - 1; i++) {
-    if (isPointOnLineSegment(lineString.coordinates[i], lineString.coordinates[i + 1], pt.coordinates)) {
-      return true;
-    }
-  }
-  return false;
-}
-function isLineOnLine(lineString1, lineString2) {
-  var doLinesIntersect = lineIntersect(lineString1, lineString2);
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isLineInPoly(polygon, lineString) {
-  for (var _i = 0, _a = lineString.coordinates; _i < _a.length; _i++) {
-    var coord = _a[_i];
-    if (booleanPointInPolygon(coord, polygon)) {
-      return true;
-    }
-  }
-  var doLinesIntersect = lineIntersect(lineString, polygonToLine(polygon));
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isPolyInPoly(feature1, feature2) {
-  for (var _i = 0, _a = feature1.coordinates[0]; _i < _a.length; _i++) {
-    var coord1 = _a[_i];
-    if (booleanPointInPolygon(coord1, feature2)) {
-      return true;
-    }
-  }
-  for (var _b = 0, _c = feature2.coordinates[0]; _b < _c.length; _b++) {
-    var coord2 = _c[_b];
-    if (booleanPointInPolygon(coord2, feature1)) {
-      return true;
-    }
-  }
-  var doLinesIntersect = lineIntersect(polygonToLine(feature1), polygonToLine(feature2));
-  if (doLinesIntersect.features.length > 0) {
-    return true;
-  }
-  return false;
-}
-function isPointOnLineSegment(lineSegmentStart, lineSegmentEnd, pt) {
-  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 (Math.abs(dxl) >= Math.abs(dyl)) {
-    if (dxl > 0) {
-      return lineSegmentStart[0] <= pt[0] && pt[0] <= lineSegmentEnd[0];
-    } else {
-      return lineSegmentEnd[0] <= pt[0] && pt[0] <= lineSegmentStart[0];
-    }
-  } else if (dyl > 0) {
-    return lineSegmentStart[1] <= pt[1] && pt[1] <= lineSegmentEnd[1];
-  } else {
-    return lineSegmentEnd[1] <= pt[1] && pt[1] <= lineSegmentStart[1];
-  }
-}
-function compareCoords(pair1, pair2) {
-  return pair1[0] === pair2[0] && pair1[1] === pair2[1];
-}
-export { booleanDisjoint as b };

package/dist/js/_@turf_boolean-equal@6.5.0@@turf/_@turf_boolean-equal@6.5.0@@turf.341ffa01.js

@@ -1 +0,0 @@
-import "../_geojson-equality@0.1.6@geojson-equality/_geojson-equality@0.1.6@geojson-equality.09ffa121.js";

package/dist/js/_@turf_boolean-intersects@6.5.0@@turf/_@turf_boolean-intersects@6.5.0@@turf.05fc28b3.js

@@ -1,15 +0,0 @@
-import { b as booleanDisjoint } from "../_@turf_boolean-disjoint@6.5.0@@turf/_@turf_boolean-disjoint@6.5.0@@turf.bbd60872.js";
-import { f as flattenEach } from "../_@turf_meta@6.5.0@@turf/_@turf_meta@6.5.0@@turf.1b9d5da5.js";
-function booleanIntersects(feature1, feature2) {
-  var bool = false;
-  flattenEach(feature1, function(flatten1) {
-    flattenEach(feature2, function(flatten2) {
-      if (bool === true) {
-        return true;
-      }
-      bool = !booleanDisjoint(flatten1.geometry, flatten2.geometry);
-    });
-  });
-  return bool;
-}
-export { booleanIntersects as b };