microboard-temp 0.5.94 → 0.5.95

package/dist/cjs/browser.js

@@ -36849,15 +36849,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -36866,8 +36866,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/dist/cjs/index.js

@@ -36849,15 +36849,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -36866,8 +36866,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/dist/cjs/node.js

@@ -39322,15 +39322,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -39339,8 +39339,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/dist/esm/browser.js

@@ -36694,15 +36694,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -36711,8 +36711,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/dist/esm/index.js

@@ -36687,15 +36687,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -36704,8 +36704,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/dist/esm/node.js

@@ -39155,15 +39155,15 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
   return;
 }
 function findPathPoints(points, grid, obstacles, newStart, newEnd) {
-  const finalPath = [];
-  const existingPathSegments = new Set;
-  if (points.length > 0) {
-    finalPath.push(points[0]);
-    const startKey = `${points[0].x},${points[0].y}`;
-    existingPathSegments.add(startKey);
+  if (points.length < 2) {
+    return points;
   }
+  const finalPath = [points[0]];
+  const existingPathSegments = new Set([`${points[0].x},${points[0].y}`]);
   for (let i = 0;i < points.length - 1; i += 1) {
-    const segmentPath = findPath(points[i], points[i + 1], grid, obstacles, existingPathSegments, newStart, newEnd);
+    const startSegment = points[i];
+    const endSegment = points[i + 1];
+    const segmentPath = findPath(startSegment, endSegment, grid, obstacles, existingPathSegments, newStart, newEnd);
     if (segmentPath && segmentPath.length > 0) {
       for (let j = 1;j < segmentPath.length; j++) {
         const point5 = segmentPath[j];
@@ -39172,8 +39172,8 @@ function findPathPoints(points, grid, obstacles, newStart, newEnd) {
         existingPathSegments.add(key);
       }
     } else {
-      points.splice(i + 1, 1);
-      i--;
+      console.error(`Could not find path from ${startSegment.x},${startSegment.y} to ${endSegment.x},${endSegment.y}`);
+      return [];
     }
   }
   return finalPath;

package/package.json

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