style: include VA_FORMAT_STRING_USES_NEWLINE (#5151)

TheAlgorithms · May 9, 2024 · 27c0978 · 27c0978
1 parent 7bff82f
commit 27c0978
Show file tree

Hide file tree

Showing 7 changed files with 8 additions and 11 deletions.
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) {