"""simple docstring"""
from collections import deque



class 					lowerCAmelCase_      :



				"""simple docstring"""

				def __init__(			self						,      lowerCAmelCase						,      lowerCAmelCase						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     process_name  # process name
										snake_case        =     arrival_time  # arrival time of the process
										# completion time of finished process or last interrupted time
										snake_case        =     arrival_time
										snake_case        =     burst_time  # remaining burst time
										snake_case        =     0  # total time of the process wait in ready queue
										snake_case        =     0  # time from arrival time to completion time





class 					lowerCAmelCase_      :



				"""simple docstring"""

				def __init__(			self						,      lowerCAmelCase						,      lowerCAmelCase						,      lowerCAmelCase						,      lowerCAmelCase						,      ):






										"""simple docstring"""

										snake_case        =     number_of_queues
										# time slice of queues that round robin algorithm applied
										snake_case        =     time_slices
										# unfinished process is in this ready_queue
										snake_case        =     queue
										# current time
										snake_case        =     current_time
										# finished process is in this sequence queue
										snake_case        =     deque()

				def 						snake_case	(			self      ):






										"""simple docstring"""

										snake_case        =     []
										for i in range(len(self.finish_queue      )      ):
																sequence.append(self.finish_queue[i].process_name      )
										return sequence

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     []
										for i in range(len(lowerCAmelCase      )      ):
																waiting_times.append(queue[i].waiting_time      )
										return waiting_times

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     []
										for i in range(len(lowerCAmelCase      )      ):
																turnaround_times.append(queue[i].turnaround_time      )
										return turnaround_times

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     []
										for i in range(len(lowerCAmelCase      )      ):
																completion_times.append(queue[i].stop_time      )
										return completion_times

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										return [q.burst_time for q in queue]

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										process.waiting_time += self.current_time - process.stop_time
										return process.waiting_time

				def 						snake_case	(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     deque()  # sequence deque of finished process
										while len(lowerCAmelCase      ) != 0:
																snake_case        =     ready_queue.popleft()  # current process

																# if process's arrival time is later than current time, update current time
																if self.current_time < cp.arrival_time:
																						self.current_time += cp.arrival_time

																# update waiting time of current process
																self.update_waiting_time(lowerCAmelCase      )
																# update current time
																self.current_time += cp.burst_time
																# finish the process and set the process's burst-time 0
																snake_case        =     0
																# set the process's turnaround time because it is finished
																snake_case        =     self.current_time - cp.arrival_time
																# set the completion time
																snake_case        =     self.current_time
																# add the process to queue that has finished queue
																finished.append(lowerCAmelCase      )

										self.finish_queue.extend(lowerCAmelCase      )  # add finished process to finish queue
										# FCFS will finish all remaining processes
										return finished

				def 						snake_case	(			self						,      lowerCAmelCase						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     deque()  # sequence deque of terminated process
										# just for 1 cycle and unfinished processes will go back to queue
										for _ in range(len(lowerCAmelCase      )      ):
																snake_case        =     ready_queue.popleft()  # current process

																# if process's arrival time is later than current time, update current time
																if self.current_time < cp.arrival_time:
																						self.current_time += cp.arrival_time

																# update waiting time of unfinished processes
																self.update_waiting_time(lowerCAmelCase      )
																# if the burst time of process is bigger than time-slice
																if cp.burst_time > time_slice:
																						# use CPU for only time-slice
																						self.current_time += time_slice
																						# update remaining burst time
																						cp.burst_time -= time_slice
																						# update end point time
																						snake_case        =     self.current_time
																						# locate the process behind the queue because it is not finished
																						ready_queue.append(lowerCAmelCase      )
																else:
																						# use CPU for remaining burst time
																						self.current_time += cp.burst_time
																						# set burst time 0 because the process is finished
																						snake_case        =     0
																						# set the finish time
																						snake_case        =     self.current_time
																						# update the process' turnaround time because it is finished
																						snake_case        =     self.current_time - cp.arrival_time
																						# add the process to queue that has finished queue
																						finished.append(lowerCAmelCase      )

										self.finish_queue.extend(lowerCAmelCase      )  # add finished process to finish queue
										# return finished processes queue and remaining processes queue
										return finished, ready_queue

				def 						snake_case	(			self      ):






										"""simple docstring"""

										for i in range(self.number_of_queues - 1      ):
																snake_case   ,snake_case        =     self.round_robin(
																    self.ready_queue						,      self.time_slices[i]      )
										#  the last queue has first_come_first_served algorithm
										self.first_come_first_served(self.ready_queue      )

										return self.finish_queue


if __name__ == "__main__":
					import doctest

					SCREAMING_SNAKE_CASE__       =					Process("P1", 0, 53)
					SCREAMING_SNAKE_CASE__       =					Process("P2", 0, 17)
					SCREAMING_SNAKE_CASE__       =					Process("P3", 0, 68)
					SCREAMING_SNAKE_CASE__       =					Process("P4", 0, 24)
					SCREAMING_SNAKE_CASE__       =					3
					SCREAMING_SNAKE_CASE__       =					[17, 25]
					SCREAMING_SNAKE_CASE__       =					deque([Pa, Pa, Pa, Pa])

					if len(time_slices) != number_of_queues - 1:
										raise SystemExit(0)

					doctest.testmod(extraglobs={"queue": deque([Pa, Pa, Pa, Pa])})

					SCREAMING_SNAKE_CASE__       =					Process("P1", 0, 53)
					SCREAMING_SNAKE_CASE__       =					Process("P2", 0, 17)
					SCREAMING_SNAKE_CASE__       =					Process("P3", 0, 68)
					SCREAMING_SNAKE_CASE__       =					Process("P4", 0, 24)
					SCREAMING_SNAKE_CASE__       =					3
					SCREAMING_SNAKE_CASE__       =					[17, 25]
					SCREAMING_SNAKE_CASE__       =					deque([Pa, Pa, Pa, Pa])
					SCREAMING_SNAKE_CASE__       =					MLFQ(number_of_queues, time_slices, queue, 0)
					SCREAMING_SNAKE_CASE__       =					mlfq.multi_level_feedback_queue()

					# print total waiting times of processes(P1, P2, P3, P4)
					print(
					    f"""waiting time:\
        \t\t\t{MLFQ.calculate_waiting_time(mlfq, [Pa, Pa, Pa, Pa])}"""
					)
					# print completion times of processes(P1, P2, P3, P4)
					print(
					    f"""completion time:\
        \t\t{MLFQ.calculate_completion_time(mlfq, [Pa, Pa, Pa, Pa])}"""
					)
					# print total turnaround times of processes(P1, P2, P3, P4)
					print(
					    f"""turnaround time:\
        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}"""
					)
					# print sequence of finished processes
					print(
					    f"""sequence of finished processes:\
        {mlfq.calculate_sequence_of_finish_queue()}"""
					)



"""simple docstring"""
from __future__ import annotations

from typing import Any



class 					lowerCAmelCase_      (     lowerCAmelCase   ):



				"""simple docstring"""
				pass





class 					lowerCAmelCase_      :



				"""simple docstring"""

				def __init__(			self						,      lowerCAmelCase      ):






										"""simple docstring"""

										snake_case        =     data
										snake_case        =     None

				def __iter__(			self      ):






										"""simple docstring"""

										snake_case        =     self
										snake_case        =     []
										while node:
																if node in visited:
																						raise ContainsLoopError
																visited.append(lowerCAmelCase      )
																yield node.data
																snake_case        =     node.next_node

				@property
				def 						snake_case	(			self      ):






										"""simple docstring"""

										try:
																list(self      )
																return False
										except ContainsLoopError:
																return True


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE__   =					Node(1)
					SCREAMING_SNAKE_CASE__   =					Node(2)
					SCREAMING_SNAKE_CASE__   =					Node(3)
					SCREAMING_SNAKE_CASE__   =					Node(4)
					print(root_node.has_loop)  # False
					SCREAMING_SNAKE_CASE__   =					root_node.next_node
					print(root_node.has_loop)  # True

					SCREAMING_SNAKE_CASE__   =					Node(5)
					SCREAMING_SNAKE_CASE__   =					Node(6)
					SCREAMING_SNAKE_CASE__   =					Node(5)
					SCREAMING_SNAKE_CASE__   =					Node(6)
					print(root_node.has_loop)  # False

					SCREAMING_SNAKE_CASE__   =					Node(1)
					print(root_node.has_loop)  # False


