Skip to content

style: include MAC_MANUAL_ARRAY_COPY #5199

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
vil02 merged 1 commit into from
Jun 4, 2024
Merged

style: include MAC_MANUAL_ARRAY_COPY #5199

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 0 additions & 3 deletions spotbugs-exclude.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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>
Expand Down
4 changes: 1 addition & 3 deletions src/main/java/com/thealgorithms/others/BFPRT.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -34,9 +34,7 @@ public static int getMinKthByBFPRT(int[] arr, int k) {

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;
}

Expand Down
5 changes: 1 addition & 4 deletions src/main/java/com/thealgorithms/others/BankersAlgorithm.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,10 +60,7 @@ static boolean checkSafeSystem(int[] processes, int[] availableArray, int[][] ma
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;

Expand Down
6 changes: 2 additions & 4 deletions src/main/java/com/thealgorithms/others/ReturnSubsequence.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -34,10 +34,8 @@ private static String[] returnSubsequence(String givenString) {
// 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
Expand Down
4 changes: 1 addition & 3 deletions src/main/java/com/thealgorithms/sorts/RadixSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,9 +35,7 @@ private static void countSort(int[] arr, int n, int exp) {
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) {
Expand Down