algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-08 02:04:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: include MAC_MANUAL_ARRAY_COPY (#5199)

Browse Source
This commit is contained in:
Piotr Idzik
2024-06-04 23:02:38 +02:00
committed by GitHub
parent 493942e319
commit 440f3ce18b
5 changed files with 5 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
spotbugs-exclude.xml
View File

@ -138,9 +138,6 @@
<Match>
<Bug pattern="USBR_UNNECESSARY_STORE_BEFORE_RETURN" />
</Match>
<Match>
<Bug pattern="MAC_MANUAL_ARRAY_COPY" />
</Match>
<Match>
<Bug pattern="SPP_USE_ISEMPTY" />
</Match>

4
src/main/java/com/thealgorithms/others/BFPRT.java
View File

@ -34,9 +34,7 @@ public final class BFPRT {
public static int[] copyArray(int[] arr) {
int[] copyArr = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
copyArr[i] = arr[i];
}
System.arraycopy(arr, 0, copyArr, 0, arr.length);
return copyArr;
}

5
src/main/java/com/thealgorithms/others/BankersAlgorithm.java
View File

@ -60,10 +60,7 @@ public final class BankersAlgorithm {
int[] safeSequenceArray = new int[totalProcess];
int[] workArray = new int[totalResources];
for (int i = 0; i < totalResources; i++) {
workArray[i] = availableArray[i];
}
System.arraycopy(availableArray, 0, workArray, 0, totalResources);
int count = 0;

6
src/main/java/com/thealgorithms/others/ReturnSubsequence.java
View File

@ -34,10 +34,8 @@ public final class ReturnSubsequence {
// position=1
String[] ans = new String[2 * smallAns.length]; // Our answer will be an array off string of size=2*smallAns
int i = 0;
for (; i < smallAns.length; i++) {
ans[i] = smallAns[i]; // Copying all the strings present in smallAns to ans string array
}
System.arraycopy(smallAns, 0, ans, 0, smallAns.length);
for (int k = 0; k < smallAns.length; k++) {
ans[k + smallAns.length] = givenString.charAt(0) + smallAns[k]; // Insert character at index=0 of the given
// substring in front of every string

4
src/main/java/com/thealgorithms/sorts/RadixSort.java
View File

@ -35,9 +35,7 @@ final class RadixSort {
count[(arr[i] / exp) % 10]--;
}
for (i = 0; i < n; i++) {
arr[i] = output[i];
}
System.arraycopy(output, 0, arr, 0, n);
}
private static void radixsort(int[] arr, int n) {