refactor: 优化日志输出级别并简化工具加载逻辑 (#957)

- 将部分info级别日志降级为debug级别
- 重构工具文件加载逻辑
- 修改部分错误提示信息

repo/js/AutoLeyLineOutcrop/utils/attemptReward.js

@@ -12,7 +12,7 @@ async function () {
         throw new Error("超过最大重试次数，领取奖励失败");
     }
 
-    log.info("领取奖励，优先使用浓缩树脂");
+    log.info("开始领取地脉奖励");
     keyPress("F");
     await sleep(500);
 
@@ -62,12 +62,6 @@ async function () {
             log.info("切换回战斗队伍");
             await sleep(500);
             const switchSuccess = await switchTeam(settings.team);
-            // if (!switchSuccess) {
-            //     log.warn("切换队伍失败，返回七天神像切换");
-            //     await genshin.tpToStatueOfTheSeven();
-            //     await genshin.switchParty(settings.team);
-            //     throw new Error("切换队伍失败");
-            // }
         }
     }
 

repo/js/AutoLeyLineOutcrop/utils/breadthFirstPathSearch.js

@@ -12,7 +12,7 @@ function (nodeData, targetNode, nodeMap) {
 
     // 获取所有传送点作为起点
     const teleportNodes = nodeData.node.filter(node => node.type === "teleport");
-    //log.info(`找到 ${teleportNodes.length} 个传送点作为可能的起点`);
+    log.debug(`找到 ${teleportNodes.length} 个传送点作为可能的起点`);
 
     // 对每个传送点，尝试查找到目标的路径
     for (const startNode of teleportNodes) {
@@ -70,6 +70,6 @@ function (nodeData, targetNode, nodeMap) {
     const reversePaths = findReversePathsIfNeeded(nodeData, targetNode, nodeMap, validPaths);
     validPaths.push(...reversePaths);
 
-    log.info(`共找到 ${validPaths.length} 条有效路径`);
+    log.debug(`共找到 ${validPaths.length} 条有效路径`);
     return validPaths;
 }

repo/js/AutoLeyLineOutcrop/utils/executePathsUsingNodeData.js

@@ -14,7 +14,7 @@ async function (position) {
             log.error(`未找到与坐标(${currentNodePosition.x}, ${currentNodePosition.y})匹配的目标节点`);
             return;
         }
-        // log.info(`找到目标节点: ID ${targetNode.id}, 位置(${targetNode.position.x}, ${targetNode.position.y})`);
+        log.debug(`找到目标节点: ID ${targetNode.id}, 位置(${targetNode.position.x}, ${targetNode.position.y})`);
         const paths = findPathsToTarget(nodeData, targetNode);
 
         if (paths.length === 0) {
@@ -24,7 +24,7 @@ async function (position) {
 
         // 选择最短的路径执行
         const optimalPath = selectOptimalPath(paths);
-        // log.info(`选择了含有 ${optimalPath.routes.length} 个路径点的最优路径`);
+        log.debug(`选择了含有 ${optimalPath.routes.length} 个路径点的最优路径`);
 
         // 执行路径
         await executePath(optimalPath);

repo/js/AutoLeyLineOutcrop/utils/processLeyLineOutcrop.js

@@ -12,9 +12,9 @@ async function (timeout, targetPath, retries = 0) {
 
     // 如果超过最大重试次数，记录错误并返回，避免死循环
     if (retries >= MAX_RETRIES) {
-        log.error(`打开地脉花失败，已重试${MAX_RETRIES}次，终止处理`);
+        log.error(`开启地脉花失败，已重试${MAX_RETRIES}次，终止处理`);
         log.error("我辣么大一个地脉花哪去了？");
-        throw new Error("我辣么大一个地脉花哪去了？");
+        throw new Error("开启地脉花失败");
     }
 
     let captureRegion = captureGameRegion();

repo/js/AutoLeyLineOutcrop/utils/recognizeTextInRegion.js

@@ -23,7 +23,7 @@ async function (timeout) {
                         // 检查成功关键词
                         for (let keyword of successKeywords) {
                             if (text.includes(keyword)) {
-                                log.info("检测到战斗成功关键词: {0}", keyword);
+                                log.debug("检测到战斗成功关键词: {0}", keyword);
                                 resolve(true);
                                 return;
                             }
@@ -32,7 +32,7 @@ async function (timeout) {
                         // 检查失败关键词
                         for (let keyword of failureKeywords) {
                             if (text.includes(keyword)) {
-                                log.warn("检测到战斗失败关键词: {0}", keyword);
+                                log.debug("检测到战斗失败关键词: {0}", keyword);
                                 resolve(false);
                                 return;
                             }