From 27c0978851864e4d5581aecc79e0ca2631a62310 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Thu, 9 May 2024 17:21:04 +0200
Subject: [PATCH] style: include `VA_FORMAT_STRING_USES_NEWLINE` (#5151)
---
spotbugs-exclude.xml | 3 ---
.../hashmap/hashing/HashMapCuckooHashing.java | 2 +-
.../datastructures/hashmap/hashing/MainCuckooHashing.java | 2 +-
.../datastructures/lists/CreateAndDetectLoop.java | 2 +-
src/main/java/com/thealgorithms/others/TowerOfHanoi.java | 2 +-
.../com/thealgorithms/searches/MonteCarloTreeSearch.java | 2 +-
src/main/java/com/thealgorithms/sorts/InsertionSort.java | 6 +++---
7 files changed, 8 insertions(+), 11 deletions(-)
diff --git a/spotbugs-exclude.xml b/spotbugs-exclude.xml
index d8c83fb7b..3f87cfef8 100644
--- a/spotbugs-exclude.xml
+++ b/spotbugs-exclude.xml
@@ -8,9 +8,6 @@
-
-
-
diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapCuckooHashing.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapCuckooHashing.java
index 053751ebb..3fa6a812e 100644
--- 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 class HashMapCuckooHashing {
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
index f4e0f594d..6681253d7 100644
--- 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 final class MainCuckooHashing {
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
index 38133ad34..441c95702 100644
--- 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 final class CreateAndDetectLoop {
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
index 8969c002c..2216799b9 100644
--- a/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
+++ b/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
@@ -12,7 +12,7 @@ final class TowerOfHanoi {
// 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
index 58afc8dfc..268c33cef 100644
--- a/src/main/java/com/thealgorithms/searches/MonteCarloTreeSearch.java
+++ b/src/main/java/com/thealgorithms/searches/MonteCarloTreeSearch.java
@@ -78,7 +78,7 @@ public class MonteCarloTreeSearch {
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
index 285755c3f..3b8c28651 100644
--- a/src/main/java/com/thealgorithms/sorts/InsertionSort.java
+++ b/src/main/java/com/thealgorithms/sorts/InsertionSort.java
@@ -71,13 +71,13 @@ class InsertionSort implements SortAlgorithm {
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 sortAlgorithm, Double[] randomArray) {