

'''simple docstring'''





from collections import deque





class     snake_case_			:


							"""simple docstring"""





							def __init__( self					,						_A					,						_A					,						_A							):
												__lowerCAmelCase					=							process_name  # process name
												__lowerCAmelCase					=							arrival_time  # arrival time of the process
												# completion time of finished process or last interrupted time
												__lowerCAmelCase					=							arrival_time
												__lowerCAmelCase					=							burst_time  # remaining burst time
												__lowerCAmelCase					=							0  # total time of the process wait in ready queue
												__lowerCAmelCase					=							0  # time from arrival time to completion time





class     snake_case_			:


							"""simple docstring"""





							def __init__( self					,						_A					,						_A					,						_A					,						_A					,						):
												# total number of mlfq's queues
												__lowerCAmelCase					=							number_of_queues
												# time slice of queues that round robin algorithm applied
												__lowerCAmelCase					=							time_slices
												# unfinished process is in this ready_queue
												__lowerCAmelCase					=							queue
												# current time
												__lowerCAmelCase					=							current_time
												# finished process is in this sequence queue
												__lowerCAmelCase					=							deque()




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




							def        A__  ( self					,						_A							):
												__lowerCAmelCase					=							[]
												for i in range(len(_A							)							):
																	waiting_times.append(queue[i].waiting_time							)
												return waiting_times




							def        A__  ( self					,						_A							):
												__lowerCAmelCase					=							[]
												for i in range(len(_A							)							):
																	turnaround_times.append(queue[i].turnaround_time							)
												return turnaround_times




							def        A__  ( self					,						_A							):
												__lowerCAmelCase					=							[]
												for i in range(len(_A							)							):
																	completion_times.append(queue[i].stop_time							)
												return completion_times




							def        A__  ( self					,						_A							):
												return [q.burst_time for q in queue]




							def        A__  ( self					,						_A							):
												process.waiting_time += self.current_time - process.stop_time
												return process.waiting_time




							def        A__  ( self					,						_A							):
												__lowerCAmelCase					=							deque()  # sequence deque of finished process
												while len(_A							) != 0:
																	__lowerCAmelCase					=							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(_A							)
																	# update current time
																	self.current_time += cp.burst_time
																	# finish the process and set the process's burst-time 0
																	__lowerCAmelCase					=							0
																	# set the process's turnaround time because it is finished
																	__lowerCAmelCase					=							self.current_time - cp.arrival_time
																	# set the completion time
																	__lowerCAmelCase					=							self.current_time
																	# add the process to queue that has finished queue
																	finished.append(_A							)

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




							def        A__  ( self					,						_A					,						_A							):
												__lowerCAmelCase					=							deque()  # sequence deque of terminated process
												# just for 1 cycle and unfinished processes will go back to queue
												for _ in range(len(_A							)							):
																	__lowerCAmelCase					=							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(_A							)
																	# 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
																						__lowerCAmelCase					=							self.current_time
																						# locate the process behind the queue because it is not finished
																						ready_queue.append(_A							)
																	else:
																						# use CPU for remaining burst time
																						self.current_time += cp.burst_time
																						# set burst time 0 because the process is finished
																						__lowerCAmelCase					=							0
																						# set the finish time
																						__lowerCAmelCase					=							self.current_time
																						# update the process' turnaround time because it is finished
																						__lowerCAmelCase					=							self.current_time - cp.arrival_time
																						# add the process to queue that has finished queue
																						finished.append(_A							)

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




							def        A__  ( self							):

												#  all queues except last one have round_robin algorithm
												for i in range(self.number_of_queues - 1							):
																	__lowerCAmelCase,	__lowerCAmelCase					=							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

		lowerCamelCase      				=     Process('''P1''', 0, 5_3)
		lowerCamelCase      				=     Process('''P2''', 0, 1_7)
		lowerCamelCase      				=     Process('''P3''', 0, 6_8)
		lowerCamelCase      				=     Process('''P4''', 0, 2_4)
		lowerCamelCase      				=     3
		lowerCamelCase      				=     [1_7, 2_5]
		lowerCamelCase      				=     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])})

		lowerCamelCase      				=     Process('''P1''', 0, 5_3)
		lowerCamelCase      				=     Process('''P2''', 0, 1_7)
		lowerCamelCase      				=     Process('''P3''', 0, 6_8)
		lowerCamelCase      				=     Process('''P4''', 0, 2_4)
		lowerCamelCase      				=     3
		lowerCamelCase      				=     [1_7, 2_5]
		lowerCamelCase      				=     deque([Pa, Pa, Pa, Pa])
		lowerCamelCase      				=     MLFQ(number_of_queues, time_slices, queue, 0)
		lowerCamelCase      				=     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()}'''
		)









def        __lowercase    (  UpperCAmelCase__ = 10		,					UpperCAmelCase__ = 1_000		,					UpperCAmelCase__ = True      ):

					"""simple docstring"""






					assert (
					    isinstance(UpperCAmelCase__		,					UpperCAmelCase__      )
					    and isinstance(UpperCAmelCase__		,					UpperCAmelCase__      )
					    and isinstance(UpperCAmelCase__		,					UpperCAmelCase__      )
					), "Invalid type of value(s) specified to function!"

					if min_val > max_val:
										raise ValueError('Invalid value for min_val or max_val (min_value < max_value)'      )
					return min_val if option else max_val


def        __lowercase    (  UpperCAmelCase__		,					UpperCAmelCase__      ):

					"""simple docstring"""






					return int((number_a + number_a) / 2      )


def        __lowercase    (  UpperCAmelCase__		,					UpperCAmelCase__		,					UpperCAmelCase__      ):

					"""simple docstring"""






					assert (
					    isinstance(UpperCAmelCase__		,					UpperCAmelCase__      ) and isinstance(UpperCAmelCase__		,					UpperCAmelCase__      ) and isinstance(UpperCAmelCase__		,					UpperCAmelCase__      )
					), 'argument values must be type of "int"'

					if lower > higher:
										raise ValueError('argument value for lower and higher must be(lower > higher)'      )

					if not lower < to_guess < higher:
										raise ValueError(
										    'guess value must be within the range of lower and higher value'      )

					def answer(UpperCAmelCase__      ) -> str:
										if number > to_guess:
															return "high"
										elif number < to_guess:
															return "low"
										else:
															return "same"

					print('started...'      )

					__lowerCAmelCase					=							lower
					__lowerCAmelCase					=							higher

					__lowerCAmelCase					=							[]

					while True:
										__lowerCAmelCase					=							get_avg(UpperCAmelCase__		,					UpperCAmelCase__      )
										last_numbers.append(UpperCAmelCase__      )

										if answer(UpperCAmelCase__      ) == "low":
															__lowerCAmelCase					=							number
										elif answer(UpperCAmelCase__      ) == "high":
															__lowerCAmelCase					=							number
										else:
															break

					print(F"""guess the number : {last_numbers[-1]}"""      )
					print(F"""details : {last_numbers!s}"""      )


def        __lowercase    (  ):

					"""simple docstring"""






					__lowerCAmelCase					=							int(input('Enter lower value : '      ).strip()      )
					__lowerCAmelCase					=							int(input('Enter high value : '      ).strip()      )
					__lowerCAmelCase					=							int(input('Enter value to guess : '      ).strip()      )
					guess_the_number(UpperCAmelCase__		,					UpperCAmelCase__		,					UpperCAmelCase__      )


if __name__ == "__main__":
		main()






