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

Add automatic linter (#4214)

Browse Source
This commit is contained in:
acbin
2023-06-09 20:05:14 +08:00
committed by GitHub
parent 00282efd8b
commit 415a04ea7f
188 changed files with 661 additions and 1133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/scheduling/FCFSScheduling.java
View File

@ -30,8 +30,7 @@ public class FCFSScheduling {
int waitingTime = 0;
int burstTime = processes.get(0).getBurstTime();
processes.get(0).setWaitingTime(
waitingTime); // for the first process, waiting time will be 0.
processes.get(0).setWaitingTime(waitingTime); // for the first process, waiting time will be 0.
for (int i = 1; i < processesNumber; i++) {
processes.get(i).setWaitingTime(waitingTime + burstTime);
@ -42,8 +41,7 @@ public class FCFSScheduling {
private void evaluateTurnAroundTime() {
for (int i = 0; i < processes.size(); i++) {
processes.get(i).setTurnAroundTimeTime(
processes.get(i).getBurstTime() + processes.get(i).getWaitingTime());
processes.get(i).setTurnAroundTimeTime(processes.get(i).getBurstTime() + processes.get(i).getWaitingTime());
}
}
}

10
src/main/java/com/thealgorithms/scheduling/RRScheduling.java
View File

@ -63,8 +63,7 @@ public class RRScheduling {
currentTime += quantumTime;
} else {
currentTime += remainingBurstTime[index];
processes.get(index).setTurnAroundTimeTime(
currentTime - processes.get(index).getArrivalTime());
processes.get(index).setTurnAroundTimeTime(currentTime - processes.get(index).getArrivalTime());
completed++;
remainingBurstTime[index] = 0;
}
@ -72,8 +71,7 @@ public class RRScheduling {
// If some process has arrived when this process was executing, insert them into the
// queue.
for (int i = 1; i < processesNumber; i++) {
if (remainingBurstTime[i] > 0 && processes.get(i).getArrivalTime() <= currentTime
&& mark[i] == 0) {
if (remainingBurstTime[i] > 0 && processes.get(i).getArrivalTime() <= currentTime && mark[i] == 0) {
mark[i] = 1;
queue.add(i);
}
@ -97,8 +95,6 @@ public class RRScheduling {
}
private void evaluateWaitingTime() {
for (int i = 0; i < processes.size(); i++)
processes.get(i).setWaitingTime(
processes.get(i).getTurnAroundTimeTime() - processes.get(i).getBurstTime());
for (int i = 0; i < processes.size(); i++) processes.get(i).setWaitingTime(processes.get(i).getTurnAroundTimeTime() - processes.get(i).getBurstTime());
}
}

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

@ -53,9 +53,7 @@ public class SJFScheduling {
}
while (executed < size) {
while (k < size
&& processes.get(k).getArrivalTime()
<= time) // here we find the processes that have arrived.
while (k < size && processes.get(k).getArrivalTime() <= time) // here we find the processes that have arrived.
{
ready.add(processes.get(k));
k++;