DZR/bettergi-scripts-list
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix: branch path.

Browse Source
This commit is contained in:
秋云
2025-06-12 17:03:13 +08:00
parent 8b39b06e26
commit 7558a9ac4a
1 changed files with 10 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
repo/js/AutoLeyLineOutcrop/utils/executePathsUsingNodeData.js
View File

@@ -34,14 +34,15 @@ async function (position) {
if (currentRunTimes >= settings.timesValue) { if (currentRunTimes >= settings.timesValue) {
return; return;
} }
// 循环检查并执行当前节点的单一next路径，直到遇到没有next或有多个next的情况
let currentNode = targetNode; let currentNode = targetNode;
log.debug(`开始处理节点链，目标节点ID: ${targetNode.id}, next数量: ${targetNode.next ? targetNode.next.length : 'undefined'}`);
while (currentNode.next && currentRunTimes < settings.timesValue) { while (currentNode.next && currentRunTimes < settings.timesValue) {
log.debug(`当前节点ID: ${currentNode.id}, next数量: ${currentNode.next.length}`);
if (currentNode.next.length === 1) { // 获取下一个节点的ID 和 路径，并在节点数据中找到下一个节点 if (currentNode.next.length === 1) { // 获取下一个节点的ID 和 路径，并在节点数据中找到下一个节点
const nextNodeId = currentNode.next[0].target; const nextNodeId = currentNode.next[0].target;
const nextRoute = currentNode.next[0].route; const nextRoute = currentNode.next[0].route;
log.debug(`单一路径: 从节点${currentNode.id}到节点${nextNodeId}, 路径: ${nextRoute}`);
const nextNode = nodeData.node.find(node => node.id === nextNodeId); const nextNode = nodeData.node.find(node => node.id === nextNodeId);
if (!nextNode) { if (!nextNode) {
@@ -89,24 +90,23 @@ async function (position) {
let selectedRoute = null; let selectedRoute = null;
let selectedNodeId = null; let selectedNodeId = null;
let closestDistance = Infinity; let closestDistance = Infinity;
for (const nextRoute of currentNode.next) { for (const nextRoute of currentNode.next) {
const nextNodeId = nextRoute.target; const branchNodeId = nextRoute.target;
const nextNode = nodeData.node.find(node => node.id === nextNodeId); const branchNode = nodeData.node.find(node => node.id === branchNodeId);
if (!nextNode) continue; if (!branchNode) continue;
const distance = calculate2DDistance( const distance = calculate2DDistance(
leyLineX, leyLineY, leyLineX, leyLineY,
nextNode.position.x, nextNode.position.y branchNode.position.x, branchNode.position.y
); );
log.info(`分支节点ID ${nextNodeId} 到地脉花距离: ${distance.toFixed(2)}`); log.info(`分支节点ID ${branchNodeId} 到地脉花距离: ${distance.toFixed(2)}`);
if (distance < closestDistance) { if (distance < closestDistance) {
closestDistance = distance; closestDistance = distance;
selectedRoute = nextRoute.route; selectedRoute = nextRoute.route;
selectedNodeId = nextNodeId; selectedNodeId = branchNodeId;
} }
} }
@@ -134,10 +134,9 @@ async function (position) {
targetNode: nextNode, targetNode: nextNode,
routes: [selectedRoute] routes: [selectedRoute]
}; };
await executePath(pathObject); await executePath(pathObject);
currentRunTimes++; currentRunTimes++;
log.info(`完成节点 ID ${nextNodeId}, 已执行 ${currentRunTimes}/${settings.timesValue} 次`); log.info(`完成节点 ID ${selectedNodeId}, 已执行 ${currentRunTimes}/${settings.timesValue} 次`);
// 更新当前节点为下一个节点，继续检查 // 更新当前节点为下一个节点，继续检查
currentNode = nextNode; currentNode = nextNode;
currentNodePosition = { x: nextNode.position.x, y: nextNode.position.y }; currentNodePosition = { x: nextNode.position.x, y: nextNode.position.y };