microboard-temp 0.5.91 → 0.5.92

package/dist/cjs/browser.js

@@ -36924,6 +36924,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -36978,19 +36992,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/dist/cjs/index.js

@@ -36924,6 +36924,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -36978,19 +36992,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/dist/cjs/node.js

@@ -39397,6 +39397,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -39451,19 +39465,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/dist/esm/browser.js

@@ -36769,6 +36769,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -36823,19 +36837,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/dist/esm/index.js

@@ -36762,6 +36762,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -36816,19 +36830,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/dist/esm/node.js

@@ -39230,6 +39230,20 @@ function reconstructPath(node2) {
   }
   return path2.reverse();
 }
+function findClosestPointInGrid(point5, grid) {
+  let closestPoint = grid[0][0];
+  let minDistance = Infinity;
+  for (const row2 of grid) {
+    for (const gridPoint of row2) {
+      const distance = Math.abs(point5.x - gridPoint.x) + Math.abs(point5.y - gridPoint.y);
+      if (distance < minDistance) {
+        minDistance = distance;
+        closestPoint = gridPoint;
+      }
+    }
+  }
+  return closestPoint;
+}
 function createHookWaypoints(startPoint, endPoint, startDir, endDir) {
   if (startDir === "right" && endDir === "left" && startPoint.x > endPoint.x) {
     const midY = (startPoint.y + endPoint.y) / 2;
@@ -39284,19 +39298,15 @@ function findOrthogonalPath(start, end, obstacles, toVisitPoints = []) {
   const { grid, newStart, newEnd } = createGrid(start, end, allWaypoints);
   const finalStart = newStart || start;
   const finalEnd = newEnd || end;
-  const points = [finalStart, ...allWaypoints, finalEnd];
-  const uniquePoints = points.reduce((acc, p3) => {
+  const pointsToVisit = [finalStart, ...allWaypoints, finalEnd];
+  const uniquePoints = pointsToVisit.reduce((acc, p3) => {
     if (!acc.some((existing) => existing.barelyEqual(p3))) {
       acc.push(p3);
     }
     return acc;
   }, []);
-  const pathPoints = findPathPoints(uniquePoints, grid, obstacles, newStart, newEnd);
-  console.log("RESULT", {
-    lines: getLines(pathPoints),
-    newStart,
-    newEnd
-  });
+  const snappedPoints = uniquePoints.map((p3) => findClosestPointInGrid(p3, grid));
+  const pathPoints = findPathPoints(snappedPoints, grid, obstacles, newStart, newEnd);
   return {
     lines: getLines(pathPoints),
     newStart,

package/package.json

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