chore: enforce InsertNewlineAtEOF in clang-format (TheAlgorithms#4343)

vil02 · debasishbsws · web-flow · commit f010a4760860 · 2023-09-01T04:10:46.000Z
* style: insert newline at eof

* style: use `InsertNewlineAtEOF` in `clang-format`

* fix: use `clang-format-16`

* chore: update clang-format-lint-action to v0.16.2

---------

Co-authored-by: Debasish Biswas &lt;debasishbsws.dev@gmail.com&gt;
diff --git a/.clang-format b/.clang-format
@@ -83,6 +83,7 @@ IndentGotoLabels: true
 IndentPPDirectives: None
 IndentWidth:     4
 IndentWrappedFunctionNames: false
+InsertNewlineAtEOF: true
 JavaScriptQuotes: Leave
 JavaScriptWrapImports: true
 KeepEmptyLinesAtTheStartOfBlocks: true
diff --git a/.github/workflows/clang-format-lint.yml b/.github/workflows/clang-format-lint.yml
@@ -9,8 +9,8 @@ jobs:
 
     steps:
     - uses: actions/checkout@v3
-    - uses: DoozyX/clang-format-lint-action@v0.13
+    - uses: DoozyX/clang-format-lint-action@v0.16.2
       with:
         source: './src'
         extensions: 'java'
-        clangFormatVersion: 12
+        clangFormatVersion: 16
diff --git a/src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java b/src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java
@@ -98,4 +98,4 @@ public static List<List<Integer>> allPathsFromSourceToTarget(int vertices, int[]
         return nm;
         // returns all possible paths from source to destination
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java
@@ -26,4 +26,4 @@ public static List<TreeSet<Integer>> combination(int n, int k) {
         }
         return Combination.combination(arr, length);
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java b/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java
@@ -25,4 +25,4 @@ public static int indexOfRightMostSetBit(int n) {
 
         return index;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java b/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java
@@ -9,4 +9,4 @@ public class IsEven {
     public static boolean isEven(int number) {
         return (number & 1) == 0;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java b/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java
@@ -14,4 +14,4 @@ public static int findNonRepeatingNumber(int[] arr) {
         }
         return result;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java b/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java
@@ -10,4 +10,4 @@ public class NumbersDifferentSigns {
     public static boolean differentSigns(int num1, int num2) {
         return (num1 ^ num2) < 0;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java b/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java
@@ -17,4 +17,4 @@ public static int reverseBits(int n) {
         }
         return result;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/datastructures/heaps/LeftistHeap.java b/src/main/java/com/thealgorithms/datastructures/heaps/LeftistHeap.java
@@ -111,4 +111,4 @@ private void in_order_aux(Node n, ArrayList<Integer> lst) {
         lst.add(n.element);
         in_order_aux(n.right, lst);
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java b/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java
@@ -109,4 +109,4 @@ public static int fibBinet(int n) {
         int nthTerm = (int) ((Math.pow(phi, n) - Math.pow(-phi, -n)) / squareRootOf5);
         return nthTerm;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/OptimalJobScheduling.java b/src/main/java/com/thealgorithms/dynamicprogramming/OptimalJobScheduling.java
@@ -126,4 +126,4 @@ private void showResults() {
     public int getCost(int process, int machine) {
         return Cost[process][machine];
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java b/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java
@@ -17,4 +17,4 @@ public static double power(double base, int exponent) {
         // Recurse with a smaller exponent and multiply with base
         return base * power(base, exponent - 1);
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java b/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java
@@ -51,4 +51,4 @@ public static List<String> preemptivePriorityScheduling(List<Process> processes)
 
         return ganttChart;
     }
-}
+}
diff --git a/src/main/java/com/thealgorithms/sorts/DualPivotQuickSort.java b/src/main/java/com/thealgorithms/sorts/DualPivotQuickSort.java
@@ -103,4 +103,4 @@ public static void main(String[] args) {
     /*
      * References: https://www.geeksforgeeks.org/dual-pivot-quicksort/
      */
-}
+}
diff --git a/src/main/java/com/thealgorithms/strings/StringCompression.java b/src/main/java/com/thealgorithms/strings/StringCompression.java
@@ -58,4 +58,4 @@ public static String appendCount(String res, int count, char ch) {
         }
         return res;
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java b/src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java
@@ -54,4 +54,4 @@ void testForFourthcase() {
         list2 = list1;
         assertIterableEquals(list1, list2);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/backtracking/WordSearchTest.java b/src/test/java/com/thealgorithms/backtracking/WordSearchTest.java
@@ -29,4 +29,4 @@ void test3() {
         String word = "ABCB";
         Assertions.assertFalse(ws.exist(board, word));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBitTest.java b/src/test/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBitTest.java
@@ -17,4 +17,4 @@ void testIndexOfRightMostSetBit() {
         assertEquals(-1, IndexOfRightMostSetBit.indexOfRightMostSetBit(0));
         assertEquals(3, IndexOfRightMostSetBit.indexOfRightMostSetBit(-40));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinderTest.java b/src/test/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinderTest.java
@@ -20,4 +20,4 @@ void testNonRepeatingNumberFinder() {
         int arr2[] = {12};
         assertEquals(12, NonRepeatingNumberFinder.findNonRepeatingNumber(arr2));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/bitmanipulation/NumbersDifferentSignsTest.java b/src/test/java/com/thealgorithms/bitmanipulation/NumbersDifferentSignsTest.java
@@ -30,4 +30,4 @@ void testSameSignsPositive() {
     void testSameSignsNegative() {
         assertFalse(NumbersDifferentSigns.differentSigns(-5, -8));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/conversions/BinaryToDecimalTest.java b/src/test/java/com/thealgorithms/conversions/BinaryToDecimalTest.java
@@ -30,4 +30,4 @@ public void testLargeBinaryToDecimal() {
         assertEquals(262144L, BinaryToDecimal.binaryToDecimal(1000000000000000000L));
         assertEquals(524287L, BinaryToDecimal.binaryToDecimal(1111111111111111111L));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/datastructures/heaps/LeftistHeapTest.java b/src/test/java/com/thealgorithms/datastructures/heaps/LeftistHeapTest.java
@@ -25,4 +25,4 @@ void testLeftistHeap() {
         heap.clear();
         Assertions.assertTrue(heap.isEmpty());
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/datastructures/queues/LinkedQueueTest.java b/src/test/java/com/thealgorithms/datastructures/queues/LinkedQueueTest.java
@@ -23,4 +23,4 @@ public void testQue() {
             if (element[0]++ != integer) throw new AssertionError();
         });
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java b/src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java
@@ -37,4 +37,4 @@ void StrassenMatrixMultiplicationTestNegetiveNumber4x4() {
         int[][] actResult = SMM.multiply(A, B);
         assertArrayEquals(expResult, actResult);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java
@@ -31,4 +31,4 @@ void Test3() {
         int capacity = 50;
         assertEquals(220, knapsackMemoization.knapSack(capacity, weight, value, weight.length));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/OptimalJobSchedulingTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/OptimalJobSchedulingTest.java
@@ -95,4 +95,4 @@ public void testOptimalJobScheduling3() {
             }
         }
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/PartitionProblemTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/PartitionProblemTest.java
@@ -21,4 +21,4 @@ public void testIfSumOfTheArrayIsEven1() {
     public void testIfSumOfTheArrayIsEven2() {
         assertFalse(PartitionProblem.partition(new int[] {1, 2, 3, 8}));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/geometry/GrahamScanTest.java b/src/test/java/com/thealgorithms/geometry/GrahamScanTest.java
@@ -13,4 +13,4 @@ void testGrahamScan() {
         GrahamScan graham = new GrahamScan(points);
         assertEquals(expectedResult, graham.hull().toString());
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/maths/AreaTest.java b/src/test/java/com/thealgorithms/maths/AreaTest.java
@@ -98,4 +98,4 @@ void testAllIllegalInput() {
                 -> assertThrows(IllegalArgumentException.class, () -> Area.surfaceAreaCircle(0)),
             () -> assertThrows(IllegalArgumentException.class, () -> Area.surfaceAreaHemisphere(0)), () -> assertThrows(IllegalArgumentException.class, () -> Area.surfaceAreaCone(1, 0)), () -> assertThrows(IllegalArgumentException.class, () -> Area.surfaceAreaCone(0, 1)));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/maths/DudeneyNumberTest.java b/src/test/java/com/thealgorithms/maths/DudeneyNumberTest.java
@@ -14,4 +14,4 @@ void isDudeney() {
         assertTrue(() -> DudeneyNumber.isDudeney(validDudeneyNumber));
         assertFalse(() -> DudeneyNumber.isDudeney(invalidDudeneyNumber));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/maths/PowerUsingRecursionTest.java b/src/test/java/com/thealgorithms/maths/PowerUsingRecursionTest.java
@@ -17,4 +17,4 @@ void testPowerUsingRecursion() {
         assertEquals(97.65625, PowerUsingRecursion.power(2.5, 5));
         assertEquals(81, PowerUsingRecursion.power(3, 4));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/others/CountCharTest.java b/src/test/java/com/thealgorithms/others/CountCharTest.java
@@ -13,4 +13,4 @@ void testCountCharacters() {
 
         assertEquals(expectedValue, CountChar.CountCharacters(input));
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/scheduling/PreemptivePrioritySchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/PreemptivePrioritySchedulingTest.java
@@ -29,4 +29,4 @@ void testPreemptivePriorityScheduling() {
         // Assert
         assertEquals(expectedGanttChart, actualGanttChart);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java
@@ -60,4 +60,4 @@ private List<ProcessDetails> addProcessesForRR() {
 
         return processDetails;
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/scheduling/SJFSchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/SJFSchedulingTest.java
@@ -106,4 +106,4 @@ void schedulingOf_nothing() {
         a.scheduleProcesses();
         assertTrue(a.schedule.isEmpty());
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/searches/BreadthFirstSearchTest.java b/src/test/java/com/thealgorithms/searches/BreadthFirstSearchTest.java
@@ -99,4 +99,4 @@ void testSearchValueThatNotExists() {
         // check path is the whole list
         assertArrayEquals(expectedPath.toArray(), bfs.getVisited().toArray());
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearchTest.java b/src/test/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearchTest.java
@@ -23,4 +23,4 @@ public void testDescending() {
         int excepted = 3;
         assertEquals(excepted, ans);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/sorts/BeadSortTest.java b/src/test/java/com/thealgorithms/sorts/BeadSortTest.java
@@ -39,4 +39,4 @@ public void bogoSortDuplicateIntegerArray() {
         int[] expectedOutput = {1, 6, 15, 23, 23, 27, 27, 36};
         assertArrayEquals(outputArray, expectedOutput);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/sorts/BucketSortTest.java b/src/test/java/com/thealgorithms/sorts/BucketSortTest.java
@@ -45,4 +45,4 @@ public void bucketSortDuplicateIntegerArrayWithNegativeNum() {
         int[] expectedOutput = {-36, -15, -1, 6, 23, 23, 27, 27};
         assertArrayEquals(outputArray, expectedOutput);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/sorts/DualPivotQuickSortTest.java b/src/test/java/com/thealgorithms/sorts/DualPivotQuickSortTest.java
@@ -59,4 +59,4 @@ void quickSortWithStringArrayShouldPass() {
         String[] expected = {"ant", "apple", "boss", "cat", "dog", "eat"};
         assertArrayEquals(expected, sorted);
     }
-}
+}
diff --git a/src/test/java/com/thealgorithms/strings/HorspoolSearchTest.java b/src/test/java/com/thealgorithms/strings/HorspoolSearchTest.java
@@ -83,4 +83,4 @@ void testFindFirstPatternNull() {
     void testFindFirstTextNull() {
         assertThrows(NullPointerException.class, () -> HorspoolSearch.findFirst("Hello", null));
     }
-}
+}
