增强功能，1.44 版本发布

移除  AS 库的所有日志

Author: BeardedManZhao

src_code/.idea/misc.xml

@@ -8,7 +8,7 @@
 
 ### 更新日志
 
-* 框架版本：1.42 - 1.43
+* 框架版本：1.42 - 1.44
 * 移除了日志。增强性能！
 
-### Version update date : 2024-12-25
+### Version update date : 2025-01-17

src_code/README-Chinese.md

@@ -8,7 +8,7 @@
 
 ### Update log:
 
-* Framework version: 1.42-1.43
+* Framework version: 1.42-1.44
 * Removed the log. Enhance performance!
 
-### Version update date : 2024-12-25
+### Version update date : 2025-01-17

src_code/README.md

@@ -5,7 +5,7 @@
 
     <groupId>io.github.BeardedManZhao</groupId>
     <artifactId>algorithmStar</artifactId>
-    <version>1.43</version>
+    <version>1.44</version>
     <packaging>jar</packaging>
     <name>algorithmStar</name>
     <description>algorithmStar-java</description>

src_code/pom.xml

@@ -3,10 +3,7 @@
 import io.github.beardedManZhao.algorithmStar.exception.OperationAlgorithmManagementException;
 import io.github.beardedManZhao.algorithmStar.exception.OperationAlgorithmNotFound;
 import io.github.beardedManZhao.algorithmStar.utils.DependentAlgorithmNameLibrary;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
 
-import java.util.Date;
 import java.util.HashMap;
 
 /**
@@ -21,13 +18,16 @@ public final class OperationAlgorithmManager implements OperationAlgorithm {
     /**
      * AS  version
      */
-    public final static float VERSION = 1.43f;
+    public final static float VERSION = 1.44f;
 
     /**
      * 计算组件的日志打印开关，当此处值为false的时候，计算组件中的日志将不会被打印，logger也不会被调用，一般来说，这里为了减少冗余的字符串实例化操作，会设置为false，当需要调试的时候才需要打开此处的数值。
      * <p>
      * The log printing switch of the calculation component. When the value here is false, the log in the calculation component will not be printed and the logger will not be called. Generally speaking, in order to reduce redundant string instantiation operations, the value here will be set to false. You need to turn on the value here only when debugging is required.
+     *
+     * @deprecated 1.44 以及以后的版本中 将不会使用日志功能，此配置将于 1.45 版本中正式移除。
      */
+    @Deprecated
     public static final boolean PrintCalculationComponentLog = false;
     /**
      * 算法对象存档集合，您可以将算法对象存储到该集合中

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/OperationAlgorithmManager.java

@@ -4,8 +4,6 @@
 import io.github.beardedManZhao.algorithmStar.exception.OperatorOperationException;
 import io.github.beardedManZhao.algorithmStar.operands.vector.DoubleVector;
 import io.github.beardedManZhao.algorithmStar.operands.vector.IntegerVector;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
 
 import java.util.concurrent.CountDownLatch;
 
@@ -27,12 +25,10 @@ public abstract class BatchAggregation implements AggregationAlgorithm {
     protected final static String DOUBLE_VECTOR_FUNCTION_LOG = "run function => double calculation(DoubleVector doubleVector)";
     protected final static String INTS_VECTOR_FUNCTION_LOG = "run function => int[] calculation(boolean Multithreading, IntegerVector... integerVector)";
     protected final static String DOUBLES_VECTOR_FUNCTION_LOG = "run function => double[] calculation(boolean Multithreading, DoubleVector... doubleVector)";
-    protected final Logger logger;
     private final String Name;
 
     protected BatchAggregation(String name) {
         Name = name;
-        logger = LoggerFactory.getLogger(name);
     }
 
     /**
@@ -46,7 +42,6 @@ protected BatchAggregation(String name) {
      * @return 向量中所有元素的聚合结果数值
      */
     public int calculation(IntegerVector integerVector) {
-        logger.info(INT_VECTOR_FUNCTION_LOG);
         return calculation(integerVector.toArray());
     }
 
@@ -61,7 +56,6 @@ public int calculation(IntegerVector integerVector) {
      * @return 向量中所有元素的聚合结果数值
      */
     public double calculation(DoubleVector doubleVector) {
-        logger.info(DOUBLE_VECTOR_FUNCTION_LOG);
         return calculation(doubleVector.toArray());
     }
 
@@ -79,7 +73,6 @@ public double calculation(DoubleVector doubleVector) {
      * @return 向量中所有元素的聚合结果数值
      */
     public int[] calculation(boolean Multithreading, IntegerVector... integerVector) {
-        logger.info(INTS_VECTOR_FUNCTION_LOG);
         final int[] res = new int[integerVector.length];
         if (Multithreading) {
             final CountDownLatch countDownLatch = new CountDownLatch(integerVector.length);
@@ -119,7 +112,6 @@ public int[] calculation(boolean Multithreading, IntegerVector... integerVector)
      * @return 向量中所有元素的聚合结果数值
      */
     public double[] calculation(boolean Multithreading, DoubleVector... doubleVector) {
-        logger.info(DOUBLES_VECTOR_FUNCTION_LOG);
         final double[] res = new double[doubleVector.length];
         if (Multithreading) {
             final CountDownLatch countDownLatch = new CountDownLatch(doubleVector.length);
@@ -160,7 +152,6 @@ public double[] calculation(boolean Multithreading, DoubleVector... doubleVector
      * The result value of the new array after aggregation of each group of data.
      */
     public double[] calculation(boolean Multithreading, double[]... doubles) {
-        logger.info(DOUBLES_FUNCTION_LOG);
         double[] res = new double[doubles.length];
         if (Multithreading) {
             final CountDownLatch countDownLatch = new CountDownLatch(doubles.length);
@@ -202,7 +193,6 @@ public double[] calculation(boolean Multithreading, double[]... doubles) {
      * The result value of the new array after aggregation of each group of data.
      */
     public int[] calculation(boolean Multithreading, int[]... ints) {
-        logger.info(INTS_FUNCTION_LOG);
         int[] res = new int[ints.length];
         if (Multithreading) {
             final CountDownLatch countDownLatch = new CountDownLatch(ints.length);

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/aggregationAlgorithm/BatchAggregation.java

@@ -60,7 +60,6 @@ public static ModularOperation getInstance(String Name) {
      */
     @Override
     public int calculation(IntegerVector integerVector) {
-        logger.info(INT_VECTOR_FUNCTION_LOG);
         return integerVector.moduleLength();
     }
 
@@ -76,7 +75,6 @@ public int calculation(IntegerVector integerVector) {
      */
     @Override
     public double calculation(DoubleVector doubleVector) {
-        logger.info(DOUBLE_VECTOR_FUNCTION_LOG);
         return doubleVector.moduleLength();
     }
 
@@ -92,7 +90,6 @@ public double calculation(DoubleVector doubleVector) {
      */
     @Override
     public double calculation(double... doubles) {
-        logger.info(DOUBLE_FUNCTION_LOG);
         return calculation(DoubleVector.parse(doubles));
     }
 
@@ -108,7 +105,6 @@ public double calculation(double... doubles) {
      */
     @Override
     public int calculation(int... ints) {
-        logger.info(INT_FUNCTION_LOG);
         return calculation(IntegerVector.parse(ints));
     }
 }

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/aggregationAlgorithm/ModularOperation.java

@@ -10,8 +10,6 @@
 import io.github.beardedManZhao.algorithmStar.operands.route.IntegerConsanguinityRoute;
 import io.github.beardedManZhao.algorithmStar.utils.ASClass;
 import io.github.beardedManZhao.algorithmStar.utils.DependentAlgorithmNameLibrary;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
 
 import java.util.HashMap;
 import java.util.LinkedHashMap;
@@ -28,7 +26,6 @@
  */
 public class Dijkstra implements GeneratingAlgorithmMany {
 
-    protected final Logger logger;
     protected final String AlgorithmName;
     // 线路记载容器
     protected final HashMap<String, DoubleConsanguinityRoute> stringDoubleConsanguinityRouteHashMap = new HashMap<>();
@@ -38,11 +35,9 @@ public class Dijkstra implements GeneratingAlgorithmMany {
 
     protected Dijkstra() {
         this.AlgorithmName = "Dijkstra";
-        this.logger = LoggerFactory.getLogger("Dijkstra");
     }
 
     protected Dijkstra(String AlgorithmName) {
-        this.logger = LoggerFactory.getLogger(AlgorithmName);
         this.AlgorithmName = AlgorithmName;
     }
 
@@ -232,9 +227,6 @@ public void addRoute(DoubleConsanguinityRoute doubleConsanguinityRoute) {
         String SEName = startingCoordinateName + " -> " + endPointCoordinateName;
         // 获取终止点到起始点的名称
         String ESName = endPointCoordinateName + " -> " + startingCoordinateName;
-        if (OperationAlgorithmManager.PrintCalculationComponentLog) {
-            logger.info("Insert " + SEName + " AND " + ESName + "=> " + trueDistance);
-        }
         // 第一轮分配起始点的周边
         EstablishTwoPointConnection(startingCoordinateName, endPointCoordinateName, trueDistance, this.hashMap);
         // 第二轮分配终止点的周边，因为该起始点属于终止点的周边

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/generatingAlgorithm/Dijkstra.java

@@ -11,8 +11,6 @@
 import io.github.beardedManZhao.algorithmStar.operands.route.IntegerConsanguinityRoute2D;
 import io.github.beardedManZhao.algorithmStar.utils.ASClass;
 import io.github.beardedManZhao.algorithmStar.utils.DependentAlgorithmNameLibrary;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
 
 import java.util.HashMap;
 import java.util.LinkedHashMap;
@@ -28,7 +26,6 @@
  */
 public class Dijkstra2D implements GeneratingAlgorithm2D {
 
-    protected final Logger logger;
     protected final String AlgorithmName;
     // 线路记载容器
     protected final HashMap<String, DoubleConsanguinityRoute2D> doubleConsanguinityRoute2DHashMap = new HashMap<>();
@@ -38,11 +35,9 @@ public class Dijkstra2D implements GeneratingAlgorithm2D {
 
     protected Dijkstra2D() {
         this.AlgorithmName = "Dijkstra2D";
-        this.logger = LoggerFactory.getLogger("Dijkstra2D");
     }
 
     protected Dijkstra2D(String AlgorithmName) {
-        this.logger = LoggerFactory.getLogger(AlgorithmName);
         this.AlgorithmName = AlgorithmName;
     }
 
@@ -142,9 +137,6 @@ public void addRoute(DoubleConsanguinityRoute2D route) {
         String ESName = endPointCoordinateName + " -> " + startingCoordinateName;
         // 计算该线路的始末坐标距离
         double trueDistance = this.distanceAlgorithm.getTrueDistance(route);
-        if (OperationAlgorithmManager.PrintCalculationComponentLog) {
-            logger.info("Insert " + SEName + " AND " + ESName + "=> " + trueDistance);
-        }
         // 第一轮分配起始点的周边
         extracted(startingCoordinateName, endPointCoordinateName, trueDistance);
         // 第二轮分配终止点的周边，因为该起始点属于终止点的周边

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/generatingAlgorithm/Dijkstra2D.java

@@ -88,17 +88,11 @@ public void addRoute(DoubleConsanguinityRoute2D route) {
         if (isForward()) {
             // 获取起始点到终止点的名称
             String SEName = startingCoordinateName + " -> " + endPointCoordinateName;
-            if (OperationAlgorithmManager.PrintCalculationComponentLog) {
-                logger.info("Insert " + SEName + " => " + trueDistance);
-            }
             extracted(startingCoordinateName, endPointCoordinateName, trueDistance);
             this.doubleConsanguinityRoute2DHashMap.put(SEName, route);
         } else {
             // 获取起始点到终止点的名称
             String ESName = endPointCoordinateName + " -> " + startingCoordinateName;
-            if (OperationAlgorithmManager.PrintCalculationComponentLog) {
-                logger.info("Insert " + ESName + " => " + trueDistance);
-            }
             extracted(endPointCoordinateName, startingCoordinateName, trueDistance);
             this.doubleConsanguinityRoute2DHashMap.put(ESName, route);
         }

src_code/src/main/java/io/github/beardedManZhao/algorithmStar/algorithm/generatingAlgorithm/DirectionalDijkstra2D.java

@@ -5,8 +5,6 @@
 import io.github.beardedManZhao.algorithmStar.exception.TargetNotRealizedException;
 import io.github.beardedManZhao.algorithmStar.operands.route.DoubleConsanguinityRoute;
 import io.github.beardedManZhao.algorithmStar.utils.ASClass;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
 
 import java.util.ArrayList;
 import java.util.HashMap;
@@ -23,17 +21,14 @@
  */
 public class ZhaoCoordinateNet implements GeneratingAlgorithm {
 
-    protected final Logger logger;
     protected final String AlgorithmName;
     private final HashMap<String, DoubleConsanguinityRoute> stringDoubleConsanguinityCoordinateHashMap = new HashMap<>();
 
     protected ZhaoCoordinateNet() {
         this.AlgorithmName = "ZhaoCoordinateNet";
-        this.logger = LoggerFactory.getLogger("ZhaoCoordinateNet");
     }
 
     protected ZhaoCoordinateNet(String AlgorithmName) {
-        this.logger = LoggerFactory.getLogger(AlgorithmName);
         this.AlgorithmName = AlgorithmName;
     }
 
@@ -87,33 +82,16 @@ public void addRoute(DoubleConsanguinityRoute doubleConsanguinityRoute) {
         String endPointCoordinateName = doubleConsanguinityRoute.getEndPointCoordinateName();
         // 判断该路线的结束点 是否有和其它点的依赖关系,如果有就在两点血亲坐标之间建立新血亲
         List<DoubleConsanguinityRoute> start = getConsanguinity(doubleConsanguinityRoute);
-        if (OperationAlgorithmManager.PrintCalculationComponentLog) {
-            for (DoubleConsanguinityRoute consanguinityCoordinate : start) {
-                String startingCoordinateName1 = consanguinityCoordinate.getStartingCoordinateName();
-                if (startingCoordinateName1.equals(startingCoordinateName)) {
-                    // 如果是起始点有关联,就生成一个新血亲坐标,旧结束 -> 新结束
-                    String s = consanguinityCoordinate.getEndPointCoordinateName() + " -> " + endPointCoordinateName;
-                    logger.info("Generate Coordinate Path :  " + s);
-                    stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getEndPointCoordinate(), doubleConsanguinityRoute.getEndPointCoordinate()));
-                } else {
-                    // 如果是结束点有关联,就生成一个新血亲坐标,旧起始 -> 新起始
-                    String s = consanguinityCoordinate.getStartingCoordinateName() + " -> " + startingCoordinateName;
-                    logger.info("Generate Coordinate Path :  " + s);
-                    stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getStartingCoordinate(), doubleConsanguinityRoute.getStartingCoordinate()));
-                }
-            }
-        } else {
-            for (DoubleConsanguinityRoute consanguinityCoordinate : start) {
-                String startingCoordinateName1 = consanguinityCoordinate.getStartingCoordinateName();
-                if (startingCoordinateName1.equals(startingCoordinateName)) {
-                    // 如果是起始点有关联,就生成一个新血亲坐标,旧结束 -> 新结束
-                    String s = consanguinityCoordinate.getEndPointCoordinateName() + " -> " + endPointCoordinateName;
-                    stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getEndPointCoordinate(), doubleConsanguinityRoute.getEndPointCoordinate()));
-                } else {
-                    // 如果是结束点有关联,就生成一个新血亲坐标,旧起始 -> 新起始
-                    String s = consanguinityCoordinate.getStartingCoordinateName() + " -> " + startingCoordinateName;
-                    stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getStartingCoordinate(), doubleConsanguinityRoute.getStartingCoordinate()));
-                }
+        for (DoubleConsanguinityRoute consanguinityCoordinate : start) {
+            String startingCoordinateName1 = consanguinityCoordinate.getStartingCoordinateName();
+            if (startingCoordinateName1.equals(startingCoordinateName)) {
+                // 如果是起始点有关联,就生成一个新血亲坐标,旧结束 -> 新结束
+                String s = consanguinityCoordinate.getEndPointCoordinateName() + " -> " + endPointCoordinateName;
+                stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getEndPointCoordinate(), doubleConsanguinityRoute.getEndPointCoordinate()));
+            } else {
+                // 如果是结束点有关联,就生成一个新血亲坐标,旧起始 -> 新起始
+                String s = consanguinityCoordinate.getStartingCoordinateName() + " -> " + startingCoordinateName;
+                stringDoubleConsanguinityCoordinateHashMap.put(s, DoubleConsanguinityRoute.parse(s, consanguinityCoordinate.getStartingCoordinate(), doubleConsanguinityRoute.getStartingCoordinate()));
             }
         }
         stringDoubleConsanguinityCoordinateHashMap.put(startingCoordinateName + " -> " + endPointCoordinateName, doubleConsanguinityRoute);