sudkoko

src/main.rs

@@ -2,40 +2,41 @@ use std::io;
 fn main() {
     // Take user input
     let proc_num: i32;
-    print!("Enter process number!");
     let mut processes: Vec<Process> = vec![];
 
     let mut input: String = String::from("");
+    println!("Enter process number!");
     _ = io::stdin().read_line(&mut input);
     proc_num = input.trim().parse().expect("NOT NUMBER");
 
     let mut num: i32 = 0;
     while num < proc_num {
-        print!("Enter arrival for process");
+        println!("Enter arrival for process");
         let mut temp_arrival = String::new();
         _ = io::stdin().read_line(&mut temp_arrival);
         let temp_arrival: i32 = temp_arrival.trim().parse().expect("AAAAAA");
 
-        print!("Enter burst for process");
+        println!("Enter burst for process");
         let mut temp_burst = String::new();
         _ = io::stdin().read_line(&mut temp_burst);
         let temp_burst: i32 = temp_burst.trim().parse().expect("AAAAAA");
 
-        let mut temp_proc = Process {
+        let temp_proc = Process {
             arrival: temp_arrival,
             burst: temp_burst,
             turnaround: 0,
             waiting: 0,
             remaining: temp_burst,
-            completion: 0,
+            completion_time: 0,
             completed: false,
         };
         processes.push(temp_proc);
         num += 1;
     }
+    println!("sorting!");
+    let sorted = fifo(processes);
     println!("You've entered: ");
-    srt(&processes, 1);
-    for proc in processes {
+    for proc in sorted {
         println!("{:#?}", proc)
     }
 }
@@ -47,7 +48,7 @@ pub struct Process {
     turnaround: i32,
     waiting: i32,
     remaining: i32,
-    completion: i32,
+    completion_time: i32,
     completed: bool,
 }
 impl Process {
@@ -55,29 +56,45 @@ impl Process {
         self.remaining -= q;
         if self.remaining == 0 {
             self.completed = true;
-            self.completion = current + q;
+            self.completion_time = current + q;
         }
         current + q
     }
-    pub fn calc_turn(mut self) {
-        self.turnaround = self.completion - self.arrival
+    pub fn calc_turn(self) -> i32 {
+        self.completion_time - self.arrival
     }
-    pub fn calc_wait(mut self) {
-        self.waiting = self.turnaround - self.burst
+    pub fn calc_wait(self) -> i32 {
+        self.turnaround - self.burst
+    }
+    pub fn one_shot(mut self, current: i32) -> (Process, i32) {
+        self.completion_time = current + self.remaining;
+        self.completed = true;
+        self.remaining = 0;
+        self.calc_turn();
+        self.calc_wait();
+        (self, self.completion_time)
     }
 }
 
-pub fn srt(procs: &Vec<Process>, q: i32) {
-    let mut smallest = &procs[0];
-    let mut current = 0;
-    for value in procs {
-        if value.arrival <= current && value.remaining < smallest.remaining && !value.completed {
-            smallest = value;
-            current = value.proc(q, current);
-        }
-        if value.completed {
-            value.calc_turn();
-            value.calc_wait();
+// pub fn srt(procs: Vec<Process>, q: i32) -> Vec<Process> {
+//     let mut smallest = procs[0];
+//     let mut current = 0;
+//     let mut completed: Vec<Process> = vec![];
+//     todo!()
+// }
+pub fn fifo(mut procs: Vec<Process>) -> Vec<Process> {
+    procs.sort_by(|a, b| a.arrival.cmp(&b.arrival));
+    let mut clock = procs[0].arrival;
+    let mut completed: Vec<Process> = vec![];
+    for proc in procs {
+        if proc.arrival <= clock {
+            let mut done_proc: Process;
+            (done_proc, clock) = proc.one_shot(clock);
+            done_proc.turnaround = done_proc.calc_turn();
+            done_proc.waiting = done_proc.calc_wait();
+            println!("{}", proc.remaining);
+            completed.push(done_proc);
         }
     }
+    completed
 }