mirage2d 1.1.2 → 1.1.4

package/dist/js/_@turf_shortest-path@6.5.0@@turf/_@turf_shortest-path@6.5.0@@turf.0c1b62a8.js

@@ -1,367 +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 { d as distance } from "../_@turf_distance@6.5.0@@turf/_@turf_distance@6.5.0@@turf.0c7b8aea.js";
-import { t as transformScale } from "../_@turf_transform-scale@6.5.0@@turf/_@turf_transform-scale@6.5.0@@turf.d6f65671.js";
-import { c as cleanCoords } from "../_@turf_clean-coords@6.5.0@@turf/_@turf_clean-coords@6.5.0@@turf.8c76bd63.js";
-import { b as bboxPolygon } from "../_@turf_bbox-polygon@6.5.0@@turf/_@turf_bbox-polygon@6.5.0@@turf.523f1c20.js";
-import { a as getCoord, c as getType, g as getGeom } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-import { i as isObject, f as featureCollection, o as isNumber, p as point, e as feature, l as lineString } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-function pathTo(node) {
-  var curr = node, path = [];
-  while (curr.parent) {
-    path.unshift(curr);
-    curr = curr.parent;
-  }
-  return path;
-}
-function getHeap() {
-  return new BinaryHeap(function(node) {
-    return node.f;
-  });
-}
-var astar = {
-  search: function(graph, start, end, options) {
-    graph.cleanDirty();
-    options = options || {};
-    var heuristic = options.heuristic || astar.heuristics.manhattan, closest = options.closest || false;
-    var openHeap = getHeap(), closestNode = start;
-    start.h = heuristic(start, end);
-    openHeap.push(start);
-    while (openHeap.size() > 0) {
-      var currentNode = openHeap.pop();
-      if (currentNode === end) {
-        return pathTo(currentNode);
-      }
-      currentNode.closed = true;
-      var neighbors = graph.neighbors(currentNode);
-      for (var i = 0, il = neighbors.length; i < il; ++i) {
-        var neighbor = neighbors[i];
-        if (neighbor.closed || neighbor.isWall()) {
-          continue;
-        }
-        var gScore = currentNode.g + neighbor.getCost(currentNode), beenVisited = neighbor.visited;
-        if (!beenVisited || gScore < neighbor.g) {
-          neighbor.visited = true;
-          neighbor.parent = currentNode;
-          neighbor.h = neighbor.h || heuristic(neighbor, end);
-          neighbor.g = gScore;
-          neighbor.f = neighbor.g + neighbor.h;
-          graph.markDirty(neighbor);
-          if (closest) {
-            if (neighbor.h < closestNode.h || neighbor.h === closestNode.h && neighbor.g < closestNode.g) {
-              closestNode = neighbor;
-            }
-          }
-          if (!beenVisited) {
-            openHeap.push(neighbor);
-          } else {
-            openHeap.rescoreElement(neighbor);
-          }
-        }
-      }
-    }
-    if (closest) {
-      return pathTo(closestNode);
-    }
-    return [];
-  },
-  heuristics: {
-    manhattan: function(pos0, pos1) {
-      var d1 = Math.abs(pos1.x - pos0.x);
-      var d2 = Math.abs(pos1.y - pos0.y);
-      return d1 + d2;
-    },
-    diagonal: function(pos0, pos1) {
-      var D = 1;
-      var D2 = Math.sqrt(2);
-      var d1 = Math.abs(pos1.x - pos0.x);
-      var d2 = Math.abs(pos1.y - pos0.y);
-      return D * (d1 + d2) + (D2 - 2 * D) * Math.min(d1, d2);
-    }
-  },
-  cleanNode: function(node) {
-    node.f = 0;
-    node.g = 0;
-    node.h = 0;
-    node.visited = false;
-    node.closed = false;
-    node.parent = null;
-  }
-};
-function Graph(gridIn, options) {
-  options = options || {};
-  this.nodes = [];
-  this.diagonal = !!options.diagonal;
-  this.grid = [];
-  for (var x = 0; x < gridIn.length; x++) {
-    this.grid[x] = [];
-    for (var y = 0, row = gridIn[x]; y < row.length; y++) {
-      var node = new GridNode(x, y, row[y]);
-      this.grid[x][y] = node;
-      this.nodes.push(node);
-    }
-  }
-  this.init();
-}
-Graph.prototype.init = function() {
-  this.dirtyNodes = [];
-  for (var i = 0; i < this.nodes.length; i++) {
-    astar.cleanNode(this.nodes[i]);
-  }
-};
-Graph.prototype.cleanDirty = function() {
-  for (var i = 0; i < this.dirtyNodes.length; i++) {
-    astar.cleanNode(this.dirtyNodes[i]);
-  }
-  this.dirtyNodes = [];
-};
-Graph.prototype.markDirty = function(node) {
-  this.dirtyNodes.push(node);
-};
-Graph.prototype.neighbors = function(node) {
-  var ret = [], x = node.x, y = node.y, grid = this.grid;
-  if (grid[x - 1] && grid[x - 1][y]) {
-    ret.push(grid[x - 1][y]);
-  }
-  if (grid[x + 1] && grid[x + 1][y]) {
-    ret.push(grid[x + 1][y]);
-  }
-  if (grid[x] && grid[x][y - 1]) {
-    ret.push(grid[x][y - 1]);
-  }
-  if (grid[x] && grid[x][y + 1]) {
-    ret.push(grid[x][y + 1]);
-  }
-  if (this.diagonal) {
-    if (grid[x - 1] && grid[x - 1][y - 1]) {
-      ret.push(grid[x - 1][y - 1]);
-    }
-    if (grid[x + 1] && grid[x + 1][y - 1]) {
-      ret.push(grid[x + 1][y - 1]);
-    }
-    if (grid[x - 1] && grid[x - 1][y + 1]) {
-      ret.push(grid[x - 1][y + 1]);
-    }
-    if (grid[x + 1] && grid[x + 1][y + 1]) {
-      ret.push(grid[x + 1][y + 1]);
-    }
-  }
-  return ret;
-};
-Graph.prototype.toString = function() {
-  var graphString = [], nodes = this.grid, rowDebug, row, y, l;
-  for (var x = 0, len = nodes.length; x < len; x++) {
-    rowDebug = [];
-    row = nodes[x];
-    for (y = 0, l = row.length; y < l; y++) {
-      rowDebug.push(row[y].weight);
-    }
-    graphString.push(rowDebug.join(" "));
-  }
-  return graphString.join("\n");
-};
-function GridNode(x, y, weight) {
-  this.x = x;
-  this.y = y;
-  this.weight = weight;
-}
-GridNode.prototype.toString = function() {
-  return "[" + this.x + " " + this.y + "]";
-};
-GridNode.prototype.getCost = function(fromNeighbor) {
-  if (fromNeighbor && fromNeighbor.x !== this.x && fromNeighbor.y !== this.y) {
-    return this.weight * 1.41421;
-  }
-  return this.weight;
-};
-GridNode.prototype.isWall = function() {
-  return this.weight === 0;
-};
-function BinaryHeap(scoreFunction) {
-  this.content = [];
-  this.scoreFunction = scoreFunction;
-}
-BinaryHeap.prototype = {
-  push: function(element) {
-    this.content.push(element);
-    this.sinkDown(this.content.length - 1);
-  },
-  pop: function() {
-    var result = this.content[0];
-    var end = this.content.pop();
-    if (this.content.length > 0) {
-      this.content[0] = end;
-      this.bubbleUp(0);
-    }
-    return result;
-  },
-  remove: function(node) {
-    var i = this.content.indexOf(node);
-    var end = this.content.pop();
-    if (i !== this.content.length - 1) {
-      this.content[i] = end;
-      if (this.scoreFunction(end) < this.scoreFunction(node)) {
-        this.sinkDown(i);
-      } else {
-        this.bubbleUp(i);
-      }
-    }
-  },
-  size: function() {
-    return this.content.length;
-  },
-  rescoreElement: function(node) {
-    this.sinkDown(this.content.indexOf(node));
-  },
-  sinkDown: function(n) {
-    var element = this.content[n];
-    while (n > 0) {
-      var parentN = (n + 1 >> 1) - 1, parent = this.content[parentN];
-      if (this.scoreFunction(element) < this.scoreFunction(parent)) {
-        this.content[parentN] = element;
-        this.content[n] = parent;
-        n = parentN;
-      } else {
-        break;
-      }
-    }
-  },
-  bubbleUp: function(n) {
-    var length = this.content.length, element = this.content[n], elemScore = this.scoreFunction(element);
-    while (true) {
-      var child2N = n + 1 << 1, child1N = child2N - 1;
-      var swap = null, child1Score;
-      if (child1N < length) {
-        var child1 = this.content[child1N];
-        child1Score = this.scoreFunction(child1);
-        if (child1Score < elemScore) {
-          swap = child1N;
-        }
-      }
-      if (child2N < length) {
-        var child2 = this.content[child2N], child2Score = this.scoreFunction(child2);
-        if (child2Score < (swap === null ? elemScore : child1Score)) {
-          swap = child2N;
-        }
-      }
-      if (swap !== null) {
-        this.content[n] = this.content[swap];
-        this.content[swap] = element;
-        n = swap;
-      } else {
-        break;
-      }
-    }
-  }
-};
-function shortestPath(start, end, options) {
-  options = options || {};
-  if (!isObject(options))
-    throw new Error("options is invalid");
-  var resolution = options.resolution;
-  var minDistance = options.minDistance;
-  var obstacles = options.obstacles || featureCollection([]);
-  if (!start)
-    throw new Error("start is required");
-  if (!end)
-    throw new Error("end is required");
-  if (resolution && !isNumber(resolution) || resolution <= 0)
-    throw new Error("options.resolution must be a number, greater than 0");
-  if (minDistance)
-    throw new Error("options.minDistance is not yet implemented");
-  var startCoord = getCoord(start);
-  var endCoord = getCoord(end);
-  start = point(startCoord);
-  end = point(endCoord);
-  switch (getType(obstacles)) {
-    case "FeatureCollection":
-      if (obstacles.features.length === 0)
-        return lineString([startCoord, endCoord]);
-      break;
-    case "Polygon":
-      obstacles = featureCollection([feature(getGeom(obstacles))]);
-      break;
-    default:
-      throw new Error("invalid obstacles");
-  }
-  var collection = obstacles;
-  collection.features.push(start);
-  collection.features.push(end);
-  var box = bbox(transformScale(bboxPolygon(bbox(collection)), 1.15));
-  if (!resolution) {
-    var width = distance([box[0], box[1]], [box[2], box[1]], options);
-    resolution = width / 100;
-  }
-  collection.features.pop();
-  collection.features.pop();
-  var west = box[0];
-  var south = box[1];
-  var east = box[2];
-  var north = box[3];
-  var xFraction = resolution / distance([west, south], [east, south], options);
-  var cellWidth = xFraction * (east - west);
-  var yFraction = resolution / distance([west, south], [west, north], options);
-  var cellHeight = yFraction * (north - south);
-  var bboxHorizontalSide = east - west;
-  var bboxVerticalSide = north - south;
-  var columns = Math.floor(bboxHorizontalSide / cellWidth);
-  var rows = Math.floor(bboxVerticalSide / cellHeight);
-  var deltaX = (bboxHorizontalSide - columns * cellWidth) / 2;
-  var deltaY = (bboxVerticalSide - rows * cellHeight) / 2;
-  var pointMatrix = [];
-  var matrix = [];
-  var closestToStart = [];
-  var closestToEnd = [];
-  var minDistStart = Infinity;
-  var minDistEnd = Infinity;
-  var currentY = north - deltaY;
-  var r = 0;
-  while (currentY >= south) {
-    var matrixRow = [];
-    var pointMatrixRow = [];
-    var currentX = west + deltaX;
-    var c = 0;
-    while (currentX <= east) {
-      var pt = point([currentX, currentY]);
-      var isInsideObstacle = isInside(pt, obstacles);
-      matrixRow.push(isInsideObstacle ? 0 : 1);
-      pointMatrixRow.push(currentX + "|" + currentY);
-      var distStart = distance(pt, start);
-      if (!isInsideObstacle && distStart < minDistStart) {
-        minDistStart = distStart;
-        closestToStart = { x: c, y: r };
-      }
-      var distEnd = distance(pt, end);
-      if (!isInsideObstacle && distEnd < minDistEnd) {
-        minDistEnd = distEnd;
-        closestToEnd = { x: c, y: r };
-      }
-      currentX += cellWidth;
-      c++;
-    }
-    matrix.push(matrixRow);
-    pointMatrix.push(pointMatrixRow);
-    currentY -= cellHeight;
-    r++;
-  }
-  var graph = new Graph(matrix, { diagonal: true });
-  var startOnMatrix = graph.grid[closestToStart.y][closestToStart.x];
-  var endOnMatrix = graph.grid[closestToEnd.y][closestToEnd.x];
-  var result = astar.search(graph, startOnMatrix, endOnMatrix);
-  var path = [startCoord];
-  result.forEach(function(coord) {
-    var coords = pointMatrix[coord.x][coord.y].split("|");
-    path.push([+coords[0], +coords[1]]);
-  });
-  path.push(endCoord);
-  return cleanCoords(lineString(path));
-}
-function isInside(pt, polygons) {
-  for (var i = 0; i < polygons.features.length; i++) {
-    if (booleanPointInPolygon(pt, polygons.features[i])) {
-      return true;
-    }
-  }
-  return false;
-}
-export { shortestPath as s };

package/dist/js/_@turf_simplify@6.5.0@@turf/_@turf_simplify@6.5.0@@turf.46703d2e.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_square-grid@6.5.0@@turf/_@turf_square-grid@6.5.0@@turf.38bd2eaa.js

@@ -1,8 +0,0 @@
-import { r as rectangleGrid } from "../_@turf_rectangle-grid@6.5.0@@turf/_@turf_rectangle-grid@6.5.0@@turf.7e8b1a1f.js";
-function squareGrid(bbox, cellSide, options) {
-  if (options === void 0) {
-    options = {};
-  }
-  return rectangleGrid(bbox, cellSide, cellSide, options);
-}
-export { squareGrid as s };

package/dist/js/_@turf_square@6.5.0@@turf/_@turf_square@6.5.0@@turf.2705289a.js

@@ -1,27 +0,0 @@
-import { d as distance } from "../_@turf_distance@6.5.0@@turf/_@turf_distance@6.5.0@@turf.0c7b8aea.js";
-function square(bbox) {
-  var west = bbox[0];
-  var south = bbox[1];
-  var east = bbox[2];
-  var north = bbox[3];
-  var horizontalDistance = distance(bbox.slice(0, 2), [east, south]);
-  var verticalDistance = distance(bbox.slice(0, 2), [west, north]);
-  if (horizontalDistance >= verticalDistance) {
-    var verticalMidpoint = (south + north) / 2;
-    return [
-      west,
-      verticalMidpoint - (east - west) / 2,
-      east,
-      verticalMidpoint + (east - west) / 2
-    ];
-  } else {
-    var horizontalMidpoint = (west + east) / 2;
-    return [
-      horizontalMidpoint - (north - south) / 2,
-      south,
-      horizontalMidpoint + (north - south) / 2,
-      north
-    ];
-  }
-}
-export { square as s };

package/dist/js/_@turf_standard-deviational-ellipse@6.5.0@@turf/_@turf_standard-deviational-ellipse@6.5.0@@turf.7094e432.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_tag@6.5.0@@turf/_@turf_tag@6.5.0@@turf.cb60b0c1.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_tesselate@6.5.0@@turf/_@turf_tesselate@6.5.0@@turf.330e4aae.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_tin@6.5.0@@turf/_@turf_tin@6.5.0@@turf.077204c4.js

@@ -1,173 +0,0 @@
-import { f as featureCollection, a as polygon } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-function tin(points, z) {
-  var isPointZ = false;
-  return featureCollection(triangulate(points.features.map(function(p) {
-    var point = {
-      x: p.geometry.coordinates[0],
-      y: p.geometry.coordinates[1]
-    };
-    if (z) {
-      point.z = p.properties[z];
-    } else if (p.geometry.coordinates.length === 3) {
-      isPointZ = true;
-      point.z = p.geometry.coordinates[2];
-    }
-    return point;
-  })).map(function(triangle) {
-    var a = [triangle.a.x, triangle.a.y];
-    var b = [triangle.b.x, triangle.b.y];
-    var c = [triangle.c.x, triangle.c.y];
-    var properties = {};
-    if (isPointZ) {
-      a.push(triangle.a.z);
-      b.push(triangle.b.z);
-      c.push(triangle.c.z);
-    } else {
-      properties = {
-        a: triangle.a.z,
-        b: triangle.b.z,
-        c: triangle.c.z
-      };
-    }
-    return polygon([[a, b, c, a]], properties);
-  }));
-}
-var Triangle = function() {
-  function Triangle2(a, b, c) {
-    this.a = a;
-    this.b = b;
-    this.c = c;
-    var A = b.x - a.x;
-    var B = b.y - a.y;
-    var C = c.x - a.x;
-    var D = c.y - a.y;
-    var E = A * (a.x + b.x) + B * (a.y + b.y);
-    var F = C * (a.x + c.x) + D * (a.y + c.y);
-    var G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));
-    var dx;
-    var dy;
-    this.x = (D * E - B * F) / G;
-    this.y = (A * F - C * E) / G;
-    dx = this.x - a.x;
-    dy = this.y - a.y;
-    this.r = dx * dx + dy * dy;
-  }
-  return Triangle2;
-}();
-function byX(a, b) {
-  return b.x - a.x;
-}
-function dedup(edges) {
-  var j = edges.length;
-  var a;
-  var b;
-  var i;
-  var m;
-  var n;
-  outer:
-    while (j) {
-      b = edges[--j];
-      a = edges[--j];
-      i = j;
-      while (i) {
-        n = edges[--i];
-        m = edges[--i];
-        if (a === m && b === n || a === n && b === m) {
-          edges.splice(j, 2);
-          edges.splice(i, 2);
-          j -= 2;
-          continue outer;
-        }
-      }
-    }
-}
-function triangulate(vertices) {
-  if (vertices.length < 3) {
-    return [];
-  }
-  vertices.sort(byX);
-  var i = vertices.length - 1;
-  var xmin = vertices[i].x;
-  var xmax = vertices[0].x;
-  var ymin = vertices[i].y;
-  var ymax = ymin;
-  var epsilon = 1e-12;
-  var a;
-  var b;
-  var c;
-  var A;
-  var B;
-  var G;
-  while (i--) {
-    if (vertices[i].y < ymin) {
-      ymin = vertices[i].y;
-    }
-    if (vertices[i].y > ymax) {
-      ymax = vertices[i].y;
-    }
-  }
-  var dx = xmax - xmin;
-  var dy = ymax - ymin;
-  var dmax = dx > dy ? dx : dy;
-  var xmid = (xmax + xmin) * 0.5;
-  var ymid = (ymax + ymin) * 0.5;
-  var open = [
-    new Triangle({
-      __sentinel: true,
-      x: xmid - 20 * dmax,
-      y: ymid - dmax
-    }, {
-      __sentinel: true,
-      x: xmid,
-      y: ymid + 20 * dmax
-    }, {
-      __sentinel: true,
-      x: xmid + 20 * dmax,
-      y: ymid - dmax
-    })
-  ];
-  var closed = [];
-  var edges = [];
-  var j;
-  i = vertices.length;
-  while (i--) {
-    edges.length = 0;
-    j = open.length;
-    while (j--) {
-      dx = vertices[i].x - open[j].x;
-      if (dx > 0 && dx * dx > open[j].r) {
-        closed.push(open[j]);
-        open.splice(j, 1);
-        continue;
-      }
-      dy = vertices[i].y - open[j].y;
-      if (dx * dx + dy * dy > open[j].r) {
-        continue;
-      }
-      edges.push(open[j].a, open[j].b, open[j].b, open[j].c, open[j].c, open[j].a);
-      open.splice(j, 1);
-    }
-    dedup(edges);
-    j = edges.length;
-    while (j) {
-      b = edges[--j];
-      a = edges[--j];
-      c = vertices[i];
-      A = b.x - a.x;
-      B = b.y - a.y;
-      G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));
-      if (Math.abs(G) > epsilon) {
-        open.push(new Triangle(a, b, c));
-      }
-    }
-  }
-  Array.prototype.push.apply(closed, open);
-  i = closed.length;
-  while (i--) {
-    if (closed[i].a.__sentinel || closed[i].b.__sentinel || closed[i].c.__sentinel) {
-      closed.splice(i, 1);
-    }
-  }
-  return closed;
-}
-export { tin as t };

package/dist/js/_@turf_transform-rotate@6.5.0@@turf/_@turf_transform-rotate@6.5.0@@turf.6d350d36.js

@@ -1 +0,0 @@
-

package/dist/js/_@turf_transform-scale@6.5.0@@turf/_@turf_transform-scale@6.5.0@@turf.d6f65671.js

@@ -1,90 +0,0 @@
-import { c as clone } from "../_@turf_clone@6.5.0@@turf/_@turf_clone@6.5.0@@turf.cd05b1f8.js";
-import { c as center } from "../_@turf_center@6.5.0@@turf/_@turf_center@6.5.0@@turf.a45495b5.js";
-import { c as centroid } from "../_@turf_centroid@6.5.0@@turf/_@turf_centroid@6.5.0@@turf.0a5be869.js";
-import { b as bbox } from "../_@turf_bbox@6.5.0@@turf/_@turf_bbox@6.5.0@@turf.4c59feee.js";
-import { r as rhumbBearing } from "../_@turf_rhumb-bearing@6.5.0@@turf/_@turf_rhumb-bearing@6.5.0@@turf.fb8f6ade.js";
-import { r as rhumbDistance } from "../_@turf_rhumb-distance@6.5.0@@turf/_@turf_rhumb-distance@6.5.0@@turf.94e475b8.js";
-import { r as rhumbDestination } from "../_@turf_rhumb-destination@6.5.0@@turf/_@turf_rhumb-destination@6.5.0@@turf.dc0e4753.js";
-import { a as featureEach, c as coordEach } from "../_@turf_meta@6.5.0@@turf/_@turf_meta@6.5.0@@turf.1b9d5da5.js";
-import { i as isObject, p as point } from "../_@turf_helpers@6.5.0@@turf/_@turf_helpers@6.5.0@@turf.f1480aa1.js";
-import { c as getType, b as getCoords, a as getCoord } from "../_@turf_invariant@6.5.0@@turf/_@turf_invariant@6.5.0@@turf.0ef69f8c.js";
-function transformScale(geojson, factor, options) {
-  options = options || {};
-  if (!isObject(options))
-    throw new Error("options is invalid");
-  var origin = options.origin;
-  var mutate = options.mutate;
-  if (!geojson)
-    throw new Error("geojson required");
-  if (typeof factor !== "number" || factor === 0)
-    throw new Error("invalid factor");
-  var originIsPoint = Array.isArray(origin) || typeof origin === "object";
-  if (mutate !== true)
-    geojson = clone(geojson);
-  if (geojson.type === "FeatureCollection" && !originIsPoint) {
-    featureEach(geojson, function(feature, index) {
-      geojson.features[index] = scale(feature, factor, origin);
-    });
-    return geojson;
-  }
-  return scale(geojson, factor, origin);
-}
-function scale(feature, factor, origin) {
-  var isPoint = getType(feature) === "Point";
-  origin = defineOrigin(feature, origin);
-  if (factor === 1 || isPoint)
-    return feature;
-  coordEach(feature, function(coord) {
-    var originalDistance = rhumbDistance(origin, coord);
-    var bearing = rhumbBearing(origin, coord);
-    var newDistance = originalDistance * factor;
-    var newCoord = getCoords(rhumbDestination(origin, newDistance, bearing));
-    coord[0] = newCoord[0];
-    coord[1] = newCoord[1];
-    if (coord.length === 3)
-      coord[2] *= factor;
-  });
-  return feature;
-}
-function defineOrigin(geojson, origin) {
-  if (origin === void 0 || origin === null)
-    origin = "centroid";
-  if (Array.isArray(origin) || typeof origin === "object")
-    return getCoord(origin);
-  var bbox$1 = geojson.bbox ? geojson.bbox : bbox(geojson);
-  var west = bbox$1[0];
-  var south = bbox$1[1];
-  var east = bbox$1[2];
-  var north = bbox$1[3];
-  switch (origin) {
-    case "sw":
-    case "southwest":
-    case "westsouth":
-    case "bottomleft":
-      return point([west, south]);
-    case "se":
-    case "southeast":
-    case "eastsouth":
-    case "bottomright":
-      return point([east, south]);
-    case "nw":
-    case "northwest":
-    case "westnorth":
-    case "topleft":
-      return point([west, north]);
-    case "ne":
-    case "northeast":
-    case "eastnorth":
-    case "topright":
-      return point([east, north]);
-    case "center":
-      return center(geojson);
-    case void 0:
-    case null:
-    case "centroid":
-      return centroid(geojson);
-    default:
-      throw new Error("invalid origin");
-  }
-}
-export { transformScale as t };

package/dist/js/_@turf_transform-translate@6.5.0@@turf/_@turf_transform-translate@6.5.0@@turf.9296b81a.js

@@ -1 +0,0 @@
-