Merge branch 'master' into include_ST_WRITE_TO_STATIC_FROM_INSTANCE_METHOD

Author: vil02

.github/dependabot.yml

@@ -10,4 +10,9 @@ updates:
     directory: "/.github/workflows/"
     schedule:
       interval: "daily"
+
+  - package-ecosystem: "maven"
+    directory: "/"
+    schedule:
+      interval: "daily"
 ...

.gitpod.dockerfile

@@ -1,4 +1,4 @@
-FROM gitpod/workspace-java-17:2024-04-16-12-16-24
+FROM gitpod/workspace-java-17:2024-04-29-07-29-58
 
 ENV LLVM_SCRIPT="tmp_llvm.sh"
 

checkstyle.xml

@@ -147,7 +147,7 @@
 
     <!-- Modifier Checks                                    -->
     <!-- See https://checkstyle.org/checks/modifier/index.html -->
-    <!-- TODO <module name="ModifierOrder"/> -->
+    <module name="ModifierOrder"/>
     <!-- TODO <module name="RedundantModifier"/> -->
 
     <!-- Checks for blocks. You know, those {}'s         -->

spotbugs-exclude.xml

@@ -5,9 +5,6 @@
     <Match>
         <Bug pattern="EI_EXPOSE_REP2" />
     </Match>
-    <Match>
-        <Bug pattern="IM_AVERAGE_COMPUTATION_COULD_OVERFLOW" />
-    </Match>
     <Match>
         <Bug pattern="DMI_RANDOM_USED_ONLY_ONCE" />
     </Match>
@@ -17,9 +14,6 @@
     <Match>
         <Bug pattern="SF_SWITCH_NO_DEFAULT" />
     </Match>
-    <Match>
-        <Bug pattern="UC_USELESS_OBJECT" />
-    </Match>
     <Match>
         <Bug pattern="RV_RETURN_VALUE_IGNORED_NO_SIDE_EFFECT" />
     </Match>

src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java

@@ -12,7 +12,7 @@ public final class HighestSetBit {
     private HighestSetBit() {
     }
 
-    public final static Optional<Integer> findHighestSetBit(int num) {
+    public static Optional<Integer> findHighestSetBit(int num) {
         if (num < 0) {
             throw new IllegalArgumentException("Input cannot be negative");
         }

src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java

@@ -97,7 +97,7 @@ private static int binarySearchBetween(int[] t, int end, int key) {
             return end + 1;
         }
         while (left < right - 1) {
-            int middle = (left + right) / 2;
+            final int middle = (left + right) >>> 1;
             if (t[middle] < key) {
                 left = middle;
             } else {

src/main/java/com/thealgorithms/misc/RangeInSortedArray.java

@@ -26,7 +26,7 @@ public static void alteredBinSearch(int[] nums, int key, int left, int right, in
         if (left > right) {
             return;
         }
-        int mid = (left + right) / 2;
+        int mid = (left + right) >>> 1;
         if (nums[mid] > key) {
             alteredBinSearch(nums, key, left, mid - 1, range, goLeft);
         } else if (nums[mid] < key) {
@@ -52,7 +52,7 @@ public static void alteredBinSearch(int[] nums, int key, int left, int right, in
     // of 'key'
     public static void alteredBinSearchIter(int[] nums, int key, int left, int right, int[] range, boolean goLeft) {
         while (left <= right) {
-            int mid = (left + right) / 2;
+            final int mid = (left + right) >>> 1;
             if (nums[mid] > key) {
                 right = mid - 1;
             } else if (nums[mid] < key) {
@@ -84,7 +84,7 @@ public static int getCountLessThan(int[] nums, int key) {
     public static int getLessThan(int[] nums, int key, int left, int right) {
         int count = 0;
         while (left <= right) {
-            int mid = (left + right) / 2;
+            final int mid = (left + right) >>> 1;
             if (nums[mid] > key) {
                 right = mid - 1;
             } else if (nums[mid] <= key) {

src/main/java/com/thealgorithms/others/CountWords.java

@@ -3,7 +3,7 @@
 /**
  * @author Marcus
  */
-final public class CountWords {
+public final class CountWords {
     private CountWords() {
     }
 

src/main/java/com/thealgorithms/others/EulersFunction.java

@@ -3,7 +3,7 @@
 /**
  * @brief utility class for <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>
  */
-final public class EulersFunction {
+public final class EulersFunction {
     private EulersFunction() {
     }
 

src/main/java/com/thealgorithms/others/LowestBasePalindrome.java

@@ -6,7 +6,7 @@
  * @brief Class for finding the lowest base in which a given integer is a palindrome.
      cf. https://oeis.org/A016026
  */
-final public class LowestBasePalindrome {
+public final class LowestBasePalindrome {
     private LowestBasePalindrome() {
     }
 

src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java

@@ -5,7 +5,7 @@
 /**
  * @brief utility class implementing <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes">Sieve of Eratosthenes</a>
  */
-final public class SieveOfEratosthenes {
+public final class SieveOfEratosthenes {
     private SieveOfEratosthenes() {
     }
 

src/main/java/com/thealgorithms/others/cn/HammingDistance.java

@@ -1,6 +1,6 @@
 package com.thealgorithms.others.cn;
 
-final public class HammingDistance {
+public final class HammingDistance {
     private HammingDistance() {
     }
 

src/main/java/com/thealgorithms/sorts/BinaryInsertionSort.java

@@ -10,7 +10,7 @@ public int[] binaryInsertSort(int[] array) {
             int high = i - 1;
 
             while (low <= high) {
-                int mid = (low + high) / 2;
+                final int mid = (low + high) >>> 1;
                 if (temp < array[mid]) {
                     high = mid - 1;
                 } else {

src/main/java/com/thealgorithms/sorts/MergeSortRecursive.java

@@ -1,7 +1,6 @@
 package com.thealgorithms.sorts;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 
 public class MergeSortRecursive {
@@ -59,11 +58,3 @@ private static List<Integer> sort(List<Integer> unsortedA, List<Integer> unsorte
         }
     }
 }
-
-class App {
-
-    public static void main(String[] args) {
-        MergeSortRecursive sort = new MergeSortRecursive(new ArrayList<>(Arrays.asList(4, 3, 1, 8, 5, 10, 0, 1, 4, 11, 8, 9)));
-        sort.mergeSort();
-    }
-}

src/main/java/com/thealgorithms/sorts/SlowSort.java

@@ -16,7 +16,7 @@ private <T extends Comparable<T>> void sort(T[] array, int i, int j) {
         if (SortUtils.greaterOrEqual(i, j)) {
             return;
         }
-        int m = (i + j) / 2;
+        final int m = (i + j) >>> 1;
         sort(array, i, m);
         sort(array, m + 1, j);
         if (SortUtils.less(array[j], array[m])) {