From d8f99b2e7b08471e640561c6ce693e5e78b7e8e6 Mon Sep 17 00:00:00 2001 From: Piotr Idzik Date: Thu, 31 Aug 2023 19:32:50 +0000 Subject: [PATCH 1/4] style: insert newline at eof --- .../thealgorithms/backtracking/AllPathsFromSourceToTarget.java | 2 +- .../java/com/thealgorithms/backtracking/ArrayCombination.java | 2 +- .../thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java | 2 +- src/main/java/com/thealgorithms/bitmanipulation/IsEven.java | 2 +- .../thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java | 2 +- .../thealgorithms/bitmanipulation/NumbersDifferentSigns.java | 2 +- .../java/com/thealgorithms/bitmanipulation/ReverseBits.java | 2 +- .../com/thealgorithms/datastructures/heaps/LeftistHeap.java | 2 +- .../java/com/thealgorithms/dynamicprogramming/Fibonacci.java | 2 +- .../thealgorithms/dynamicprogramming/OptimalJobScheduling.java | 2 +- src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java | 2 +- .../thealgorithms/scheduling/PreemptivePriorityScheduling.java | 2 +- src/main/java/com/thealgorithms/sorts/DualPivotQuickSort.java | 2 +- src/main/java/com/thealgorithms/strings/StringCompression.java | 2 +- .../backtracking/AllPathsFromSourceToTargetTest.java | 2 +- .../java/com/thealgorithms/backtracking/WordSearchTest.java | 2 +- .../bitmanipulation/IndexOfRightMostSetBitTest.java | 2 +- .../bitmanipulation/NonRepeatingNumberFinderTest.java | 2 +- .../bitmanipulation/NumbersDifferentSignsTest.java | 2 +- .../java/com/thealgorithms/conversions/BinaryToDecimalTest.java | 2 +- .../com/thealgorithms/datastructures/heaps/LeftistHeapTest.java | 2 +- .../thealgorithms/datastructures/queues/LinkedQueueTest.java | 2 +- .../divideandconquer/StrassenMatrixMultiplicationTest.java | 2 +- .../dynamicprogramming/KnapsackMemoizationTest.java | 2 +- .../dynamicprogramming/OptimalJobSchedulingTest.java | 2 +- .../thealgorithms/dynamicprogramming/PartitionProblemTest.java | 2 +- src/test/java/com/thealgorithms/geometry/GrahamScanTest.java | 2 +- src/test/java/com/thealgorithms/maths/AreaTest.java | 2 +- src/test/java/com/thealgorithms/maths/DudeneyNumberTest.java | 2 +- .../java/com/thealgorithms/maths/PowerUsingRecursionTest.java | 2 +- src/test/java/com/thealgorithms/others/CountCharTest.java | 2 +- .../scheduling/PreemptivePrioritySchedulingTest.java | 2 +- .../java/com/thealgorithms/scheduling/RRSchedulingTest.java | 2 +- .../java/com/thealgorithms/scheduling/SJFSchedulingTest.java | 2 +- .../java/com/thealgorithms/searches/BreadthFirstSearchTest.java | 2 +- .../searches/sortOrderAgnosticBinarySearchTest.java | 2 +- src/test/java/com/thealgorithms/sorts/BeadSortTest.java | 2 +- src/test/java/com/thealgorithms/sorts/BucketSortTest.java | 2 +- .../java/com/thealgorithms/sorts/DualPivotQuickSortTest.java | 2 +- src/test/java/com/thealgorithms/strings/HorspoolSearchTest.java | 2 +- 40 files changed, 40 insertions(+), 40 deletions(-) diff --git a/src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java b/src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java index 700a3daa4695..71bf012d2835 100644 --- 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> allPathsFromSourceToTarget(int vertices, int[] return nm; // returns all possible paths from source to destination } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java index d31e09dd7fc1..ed5a0c933226 100644 --- 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> combination(int n, int k) { } return Combination.combination(arr, length); } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java b/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java index 4b1ca51e53ef..dc8a217875f9 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java b/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java index c9129e474d88..ec30eb09168b 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java b/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java index cd3df5aec362..bd4bdb0becae 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java b/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java index bd011f82b22f..ed586296776f 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java b/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java index 58359598266e..e9d1ad61996f 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/datastructures/heaps/LeftistHeap.java b/src/main/java/com/thealgorithms/datastructures/heaps/LeftistHeap.java index f64781f19857..cfec2b3c54bd 100644 --- 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 lst) { lst.add(n.element); in_order_aux(n.right, lst); } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java b/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java index 5d250cd54e3f..f2a3b2b8f542 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/OptimalJobScheduling.java b/src/main/java/com/thealgorithms/dynamicprogramming/OptimalJobScheduling.java index 640985a2e815..5ee3327553d7 100644 --- 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]; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java b/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java index 4d547c25412c..cbb2d6132366 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java b/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java index bf1097fbb1f8..7b058bcee625 100644 --- 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 preemptivePriorityScheduling(List processes) return ganttChart; } -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/sorts/DualPivotQuickSort.java b/src/main/java/com/thealgorithms/sorts/DualPivotQuickSort.java index 31984a15dd18..60cb5aa7aa69 100644 --- 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/ */ -} \ No newline at end of file +} diff --git a/src/main/java/com/thealgorithms/strings/StringCompression.java b/src/main/java/com/thealgorithms/strings/StringCompression.java index 0b4157b5b1e0..28a3df743fc6 100644 --- 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; } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java b/src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java index ca5e2ef899b0..cf702ccadecd 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/backtracking/WordSearchTest.java b/src/test/java/com/thealgorithms/backtracking/WordSearchTest.java index fb224a0b5b23..46f199747322 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBitTest.java b/src/test/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBitTest.java index f377793cfafa..56e9108cbc4b 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinderTest.java b/src/test/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinderTest.java index 330b57dcd6eb..f0f7353a3365 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/bitmanipulation/NumbersDifferentSignsTest.java b/src/test/java/com/thealgorithms/bitmanipulation/NumbersDifferentSignsTest.java index 3ce0f8eee174..31ab24826783 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/conversions/BinaryToDecimalTest.java b/src/test/java/com/thealgorithms/conversions/BinaryToDecimalTest.java index 29265bd9d6e9..2471f919a845 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/datastructures/heaps/LeftistHeapTest.java b/src/test/java/com/thealgorithms/datastructures/heaps/LeftistHeapTest.java index 983444eb5060..dfaba3911d0c 100644 --- 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()); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/datastructures/queues/LinkedQueueTest.java b/src/test/java/com/thealgorithms/datastructures/queues/LinkedQueueTest.java index 5bc90fc06815..faa0d0e952f9 100644 --- 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(); }); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java b/src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java index bbf91cfb5092..8331d8823486 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java index 0a15144feee8..b68e72931e71 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/OptimalJobSchedulingTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/OptimalJobSchedulingTest.java index a00d3e896401..72e1d660028c 100644 --- 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() { } } } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/dynamicprogramming/PartitionProblemTest.java b/src/test/java/com/thealgorithms/dynamicprogramming/PartitionProblemTest.java index ebd6ba12d2a5..d63c634c3969 100644 --- 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})); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/geometry/GrahamScanTest.java b/src/test/java/com/thealgorithms/geometry/GrahamScanTest.java index 57a870005379..e59cd6b860cc 100644 --- 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()); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/maths/AreaTest.java b/src/test/java/com/thealgorithms/maths/AreaTest.java index 42e6f41804d6..91fd03748163 100644 --- 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))); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/maths/DudeneyNumberTest.java b/src/test/java/com/thealgorithms/maths/DudeneyNumberTest.java index e15ab0a589c1..09c8c4b1cc94 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/maths/PowerUsingRecursionTest.java b/src/test/java/com/thealgorithms/maths/PowerUsingRecursionTest.java index a6cd67b02385..14574ab3c1eb 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/others/CountCharTest.java b/src/test/java/com/thealgorithms/others/CountCharTest.java index aae875b7f21e..55e55b8d52f4 100644 --- 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)); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/scheduling/PreemptivePrioritySchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/PreemptivePrioritySchedulingTest.java index aa0b21955028..5cb3c624db42 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java index 81b9abee53ac..700a174f328c 100644 --- a/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java +++ b/src/test/java/com/thealgorithms/scheduling/RRSchedulingTest.java @@ -60,4 +60,4 @@ private List addProcessesForRR() { return processDetails; } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/scheduling/SJFSchedulingTest.java b/src/test/java/com/thealgorithms/scheduling/SJFSchedulingTest.java index 66bfe0957f31..ae31feb9a6b4 100644 --- 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()); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/searches/BreadthFirstSearchTest.java b/src/test/java/com/thealgorithms/searches/BreadthFirstSearchTest.java index 4c9f16d4c41b..77562ecdb87d 100644 --- 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()); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearchTest.java b/src/test/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearchTest.java index e761eb10948d..04ed00ae85b9 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/sorts/BeadSortTest.java b/src/test/java/com/thealgorithms/sorts/BeadSortTest.java index 773eed7ab39a..2ab60b205cd5 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/sorts/BucketSortTest.java b/src/test/java/com/thealgorithms/sorts/BucketSortTest.java index 84efde25fdfe..bd9d2e3d60cf 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/sorts/DualPivotQuickSortTest.java b/src/test/java/com/thealgorithms/sorts/DualPivotQuickSortTest.java index 1edfb5facfc2..112f38277776 100644 --- 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); } -} \ No newline at end of file +} diff --git a/src/test/java/com/thealgorithms/strings/HorspoolSearchTest.java b/src/test/java/com/thealgorithms/strings/HorspoolSearchTest.java index dcbd40fde118..f2faf49cfd3e 100644 --- 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)); } -} \ No newline at end of file +} From a243175b487079e5d0f4848e79c917b2a594e9c7 Mon Sep 17 00:00:00 2001 From: Piotr Idzik Date: Thu, 31 Aug 2023 19:37:06 +0000 Subject: [PATCH 2/4] style: use `InsertNewlineAtEOF` in `clang-format` --- .clang-format | 1 + 1 file changed, 1 insertion(+) diff --git a/.clang-format b/.clang-format index 1ae91b6ba980..3d685994a1aa 100644 --- 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 From 02a2cb88dff4a8fe55fe491049a345ee82cfb0df Mon Sep 17 00:00:00 2001 From: Piotr Idzik <65706193+vil02@users.noreply.github.com> Date: Thu, 31 Aug 2023 21:38:25 +0200 Subject: [PATCH 3/4] fix: use `clang-format-16` --- .github/workflows/clang-format-lint.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/clang-format-lint.yml b/.github/workflows/clang-format-lint.yml index 7e7de57023df..310fac9dd98e 100644 --- a/.github/workflows/clang-format-lint.yml +++ b/.github/workflows/clang-format-lint.yml @@ -13,4 +13,4 @@ jobs: with: source: './src' extensions: 'java' - clangFormatVersion: 12 \ No newline at end of file + clangFormatVersion: 16 From 36ee06afa158f934c19572617f29f7108c689aa5 Mon Sep 17 00:00:00 2001 From: Piotr Idzik <65706193+vil02@users.noreply.github.com> Date: Thu, 31 Aug 2023 21:54:50 +0200 Subject: [PATCH 4/4] chore: update clang-format-lint-action to v0.16.2 --- .github/workflows/clang-format-lint.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/clang-format-lint.yml b/.github/workflows/clang-format-lint.yml index 310fac9dd98e..b3b9dd592df4 100644 --- a/.github/workflows/clang-format-lint.yml +++ b/.github/workflows/clang-format-lint.yml @@ -9,7 +9,7 @@ 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'