style: include VA_FORMAT_STRING_USES_NEWLINE (TheAlgorithms#5151)

vil02 · web-flow · commit 27c097885186 · 2024-05-09T17:21:04.000+02:00
diff --git a/spotbugs-exclude.xml b/spotbugs-exclude.xml
@@ -8,9 +8,6 @@
     <Match>
         <Bug pattern="DMI_RANDOM_USED_ONLY_ONCE" />
     </Match>
-    <Match>
-        <Bug pattern="VA_FORMAT_STRING_USES_NEWLINE" />
-    </Match>
     <Match>
         <Bug pattern="SF_SWITCH_NO_DEFAULT" />
     </Match>
diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapCuckooHashing.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapCuckooHashing.java
@@ -213,7 +213,7 @@ public boolean checkTableContainsKey(int key) {
     public double checkLoadFactor() {
         double factor = (double) size / tableSize;
         if (factor > .7) {
-            System.out.printf("Load factor is %.2f , rehashing table\n", factor);
+            System.out.printf("Load factor is %.2f , rehashing table%n", factor);
             reHashTableIncreasesTableSize();
         }
         return factor;
diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java
@@ -54,7 +54,7 @@ public static void main(String[] args) {
                 break;
             }
             case 6: {
-                System.out.printf("Load factor is: %.2f\n", h.checkLoadFactor());
+                System.out.printf("Load factor is: %.2f%n", h.checkLoadFactor());
                 break;
             }
             case 7: {
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java b/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java
@@ -81,7 +81,7 @@ public static void main(String[] args) {
 
         System.out.println("Enter the number of elements to be inserted: ");
         int n = sc.nextInt();
-        System.out.printf("Enter the %d elements: \n", n);
+        System.out.printf("Enter the %d elements: %n", n);
         while (n-- > 0) {
             singlyLinkedList.insert(sc.nextInt());
         }
diff --git a/src/main/java/com/thealgorithms/others/TowerOfHanoi.java b/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
@@ -12,7 +12,7 @@ public static void shift(int n, String startPole, String intermediatePole, Strin
             // Shift function is called in recursion for swapping the n-1 disc from the startPole to
             // the intermediatePole
             shift(n - 1, startPole, endPole, intermediatePole);
-            System.out.format("Move %d from %s to %s\n", n, startPole, endPole); // Result Printing
+            System.out.format("Move %d from %s to %s%n", n, startPole, endPole); // Result Printing
             // Shift function is called in recursion for swapping the n-1 disc from the
             // intermediatePole to the endPole
             shift(n - 1, intermediatePole, startPole, endPole);
diff --git a/src/main/java/com/thealgorithms/searches/MonteCarloTreeSearch.java b/src/main/java/com/thealgorithms/searches/MonteCarloTreeSearch.java
@@ -78,7 +78,7 @@ public Node monteCarloTreeSearch(Node rootNode) {
 
         winnerNode = getWinnerNode(rootNode);
         printScores(rootNode);
-        System.out.format("\nThe optimal node is: %02d\n", rootNode.childNodes.indexOf(winnerNode) + 1);
+        System.out.format("%nThe optimal node is: %02d%n", rootNode.childNodes.indexOf(winnerNode) + 1);
 
         return winnerNode;
     }
diff --git a/src/main/java/com/thealgorithms/sorts/InsertionSort.java b/src/main/java/com/thealgorithms/sorts/InsertionSort.java
@@ -71,13 +71,13 @@ public static void main(String[] args) {
 
         InsertionSort insertionSort = new InsertionSort();
         double insertionTime = measureApproxExecTime(insertionSort::sort, randomArray);
-        System.out.printf("Original insertion time: %5.2f  sec.\n", insertionTime);
+        System.out.printf("Original insertion time: %5.2f  sec.%n", insertionTime);
 
         double insertionSentinelTime = measureApproxExecTime(insertionSort::sentinelSort, copyRandomArray);
-        System.out.printf("Sentinel insertion time: %5.2f  sec.\n", insertionSentinelTime);
+        System.out.printf("Sentinel insertion time: %5.2f  sec.%n", insertionSentinelTime);
 
         // ~ 1.5 time sentinel sort is faster, then classical Insertion sort implementation.
-        System.out.printf("Sentinel insertion is %f3.2 time faster than Original insertion sort\n", insertionTime / insertionSentinelTime);
+        System.out.printf("Sentinel insertion is %f3.2 time faster than Original insertion sort%n", insertionTime / insertionSentinelTime);
     }
 
     private static double measureApproxExecTime(Function<Double[], Double[]> sortAlgorithm, Double[] randomArray) {

Original file line number	Diff line number	Diff line change
`@@ -213,7 +213,7 @@ public boolean checkTableContainsKey(int key) {`
`213`	`213`	`public double checkLoadFactor() {`
`214`	`214`	`double factor = (double) size / tableSize;`
`215`	`215`	`if (factor > .7) {`
`216`		`- System.out.printf("Load factor is %.2f , rehashing table\n", factor);`
	`216`	`+ System.out.printf("Load factor is %.2f , rehashing table%n", factor);`
`217`	`217`	`reHashTableIncreasesTableSize();`
`218`	`218`	`}`
`219`	`219`	`return factor;`
Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ public static void main(String[] args) {`
`54`	`54`	`break;`
`55`	`55`	`}`
`56`	`56`	`case 6: {`
`57`		`- System.out.printf("Load factor is: %.2f\n", h.checkLoadFactor());`
	`57`	`+ System.out.printf("Load factor is: %.2f%n", h.checkLoadFactor());`
`58`	`58`	`break;`
`59`	`59`	`}`
`60`	`60`	`case 7: {`
Original file line number	Diff line number	Diff line change
`@@ -81,7 +81,7 @@ public static void main(String[] args) {`
`81`	`81`
`82`	`82`	`System.out.println("Enter the number of elements to be inserted: ");`
`83`	`83`	`int n = sc.nextInt();`
`84`		`- System.out.printf("Enter the %d elements: \n", n);`
	`84`	`+ System.out.printf("Enter the %d elements: %n", n);`
`85`	`85`	`while (n-- > 0) {`
`86`	`86`	`singlyLinkedList.insert(sc.nextInt());`
`87`	`87`	`}`
Original file line number	Diff line number	Diff line change
`@@ -78,7 +78,7 @@ public Node monteCarloTreeSearch(Node rootNode) {`
`78`	`78`
`79`	`79`	`winnerNode = getWinnerNode(rootNode);`
`80`	`80`	`printScores(rootNode);`
`81`		`- System.out.format("\nThe optimal node is: %02d\n", rootNode.childNodes.indexOf(winnerNode) + 1);`
	`81`	`+ System.out.format("%nThe optimal node is: %02d%n", rootNode.childNodes.indexOf(winnerNode) + 1);`
`82`	`82`
`83`	`83`	`return winnerNode;`
`84`	`84`	`}`