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

style: include PCOA_PARTIALLY_CONSTRUCTED_OBJECT_ACCESS (#6133)

Browse Source
This commit is contained in:
Piotr Idzik
2025-01-13 17:56:43 +01:00
committed by GitHub
parent 779381f902
commit 39122a9ac7
2 changed files with 14 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
spotbugs-exclude.xml
View File

@ -114,9 +114,6 @@
<Match> <Match>
<Bug pattern="BL_BURYING_LOGIC" /> <Bug pattern="BL_BURYING_LOGIC" />
</Match> </Match>
<Match>
<Bug pattern="PCOA_PARTIALLY_CONSTRUCTED_OBJECT_ACCESS" />
</Match>
<Match> <Match>
<Bug pattern="UTWR_USE_TRY_WITH_RESOURCES" /> <Bug pattern="UTWR_USE_TRY_WITH_RESOURCES" />
</Match> </Match>

28
src/main/java/com/thealgorithms/scheduling/SJFScheduling.java
View File

@ -14,6 +14,18 @@ public class SJFScheduling {
protected ArrayList<ProcessDetails> processes; protected ArrayList<ProcessDetails> processes;
protected ArrayList<String> schedule; protected ArrayList<String> schedule;
private static void sortProcessesByArrivalTime(List<ProcessDetails> processes) {
for (int i = 0; i < processes.size(); i++) {
for (int j = i + 1; j < processes.size() - 1; j++) {
if (processes.get(j).getArrivalTime() > processes.get(j + 1).getArrivalTime()) {
final var temp = processes.get(j);
processes.set(j, processes.get(j + 1));
processes.set(j + 1, temp);
}
}
}
}
/** /**
* a simple constructor * a simple constructor
* @param processes a list of processes the user wants to schedule * @param processes a list of processes the user wants to schedule
@ -22,22 +34,10 @@ public class SJFScheduling {
SJFScheduling(final ArrayList<ProcessDetails> processes) { SJFScheduling(final ArrayList<ProcessDetails> processes) {
this.processes = processes; this.processes = processes;
schedule = new ArrayList<>(); schedule = new ArrayList<>();
sortByArrivalTime(); sortProcessesByArrivalTime(this.processes);
} }
protected void sortByArrivalTime() { protected void sortByArrivalTime() {
int size = processes.size(); sortProcessesByArrivalTime(processes);
int i;
int j;
ProcessDetails temp;
for (i = 0; i < size; i++) {
for (j = i + 1; j < size - 1; j++) {
if (processes.get(j).getArrivalTime() > processes.get(j + 1).getArrivalTime()) {
temp = processes.get(j);
processes.set(j, processes.get(j + 1));
processes.set(j + 1, temp);
}
}
}
} }
/** /**