npm - microboard-temp - Versions diffs - 0.5.77 → 0.5.78 - Mend

microboard-temp 0.5.77 → 0.5.78

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (7) hide show

package/dist/cjs/browser.js CHANGED Viewed

@@ -36727,38 +36727,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -36967,16 +36935,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/dist/cjs/index.js CHANGED Viewed

@@ -36727,38 +36727,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -36967,16 +36935,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/dist/cjs/node.js CHANGED Viewed

@@ -39200,38 +39200,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -39440,16 +39408,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/dist/esm/browser.js CHANGED Viewed

@@ -36572,38 +36572,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -36812,16 +36780,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/dist/esm/index.js CHANGED Viewed

@@ -36565,38 +36565,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -36805,16 +36773,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/dist/esm/node.js CHANGED Viewed

@@ -39033,38 +39033,6 @@ function getNeighbors(node2, grid, obstacles) {
   }
   return neighbors;
 }
-function findCenterLine(grid, start, end, middle) {
-  const centerLine = [];
-  const middlePoint = middle ? middle : new Point((start.x + end.x) / 2, (start.y + end.y) / 2);
-  const min2 = new Point(Math.min(start.x, end.x), Math.min(start.y, end.y));
-  const max2 = new Point(Math.max(start.x, end.x), Math.max(start.y, end.y));
-  const width = max2.x - min2.x;
-  const height = max2.y - min2.y;
-  if (start.pointType !== "Board" && end.pointType !== "Board") {
-    const isInGrid = grid.some((row2) => row2.some((point5) => point5.barelyEqual(middlePoint)));
-    return isInGrid ? [middlePoint] : [];
-  }
-  if (width > height) {
-    const centerIdx = grid.findIndex((row2) => row2[0].x === middlePoint.x || Math.abs(row2[0].x - middlePoint.x) < 0.01);
-    if (centerIdx !== -1) {
-      for (let y = 0;y < grid[0].length; y++) {
-        if (grid[centerIdx][y] && grid[centerIdx][y].x >= min2.x - 0.01 && grid[centerIdx][y].x <= max2.x + 0.01 && grid[centerIdx][y].y >= min2.y - 0.01 && grid[centerIdx][y].y <= max2.y + 0.01) {
-          centerLine.push(grid[centerIdx][y]);
-        }
-      }
-    }
-  } else {
-    const centerIdx = grid[0].findIndex((point5) => point5.y === middlePoint.y || Math.abs(point5.y - middlePoint.y) < 0.01);
-    if (centerIdx !== -1) {
-      for (let x = 0;x < grid.length; x++) {
-        if (grid[x][centerIdx] && grid[x][centerIdx].x >= min2.x - 0.01 && grid[x][centerIdx].x <= max2.x + 0.01 && grid[x][centerIdx].y >= min2.y - 0.01 && grid[x][centerIdx].y <= max2.y + 0.01) {
-          centerLine.push(grid[x][centerIdx]);
-        }
-      }
-    }
-  }
-  return centerLine;
-}
 function createGrid(start, end, toVisitPoints = []) {
   const startDir = getPointerDirection(start);
   const endDir = getPointerDirection(end);
@@ -39273,16 +39241,10 @@ function reconstructPath(node2) {
   return path2.reverse();
 }
 function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
-  const { grid, newStart, newEnd, middlePoint } = createGrid(start, end, toVisitPoints);
-  const startPoint = newStart ? newStart : start;
-  const endPoint = newEnd ? newEnd : end;
-  const centerLine = findCenterLine(grid, startPoint, endPoint, middlePoint);
-  const adjustedCenterLine = centerLine.length > 0 ? startPoint.getDistance(centerLine[0]) < startPoint.getDistance(centerLine[centerLine.length - 1]) ? centerLine : centerLine.reverse() : centerLine;
-  const points = [
-    startPoint,
-    ...toVisitPoints.length > 0 ? toVisitPoints : adjustedCenterLine,
-    endPoint
-  ];
+  const { grid, newStart, newEnd } = createGrid(start, end, toVisitPoints);
+  const startPoint = newStart || start;
+  const endPoint = newEnd || end;
+  const points = [startPoint, ...toVisitPoints, endPoint];
   const pathPoints = findPathPoints(points, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "microboard-temp",
-  "version": "0.5.77",
+  "version": "0.5.78",
   "description": "A flexible interactive whiteboard library",
   "main": "dist/cjs/index.js",
   "module": "dist/esm/index.js",