npm - microboard-temp - Versions diffs - 0.5.98 → 0.5.99 - Mend

microboard-temp 0.5.98 → 0.5.99

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

@@ -36703,7 +36703,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -36831,9 +36831,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/dist/cjs/index.js CHANGED Viewed

@@ -36703,7 +36703,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -36831,9 +36831,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/dist/cjs/node.js CHANGED Viewed

@@ -39176,7 +39176,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -39304,9 +39304,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/dist/esm/browser.js CHANGED Viewed

@@ -36548,7 +36548,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -36676,9 +36676,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/dist/esm/index.js CHANGED Viewed

@@ -36541,7 +36541,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -36669,9 +36669,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/dist/esm/node.js CHANGED Viewed

@@ -39009,7 +39009,7 @@ function isChangingDirection(current, neighbor, newStart, newEnd) {
   return 0;
 }
 function heuristic(start, end) {
-  return Math.abs(start.xGrid - end.xGrid) + Math.abs(start.yGrid - end.yGrid);
+  return Math.abs(start.point.x - end.point.x) + Math.abs(start.point.y - end.point.y);
 }
 function getNeighbors(node2, grid, obstacles) {
   const neighbors = [];
@@ -39137,9 +39137,11 @@ function findPath(start, end, grid, obstacles, existingPath, newStart, newEnd) {
       if (closedSet.has(neighborKey) || existingPath.has(neighborKey) && !neighbor.point.barelyEqual(end)) {
         continue;
       }
-      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd);
+      const TURN_PENALTY = 500;
+      const extraCost = isChangingDirection(current, neighbor, newStart, newEnd) ? TURN_PENALTY : 0;
+      const movementCost = Math.abs(current.point.x - neighbor.point.x) + Math.abs(current.point.y - neighbor.point.y);
       const pathOverlapCost = existingPath.has(neighborKey) ? 1000 : 0;
-      const tentativeCost = current.costSoFar + 1 + pathOverlapCost;
+      const tentativeCost = current.costSoFar + movementCost + pathOverlapCost;
       let existingNodeInOpenSet = openSet.find((node2) => node2.point.barelyEqual(neighbor.point));
       if (!existingNodeInOpenSet || tentativeCost < existingNodeInOpenSet.costSoFar) {
         if (existingNodeInOpenSet) {

package/package.json CHANGED Viewed

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