

from collections import deque

class   _a					:




      """simple docstring"""

      def __init__(   self							:				int						,			UpperCAmelCase							:				Any						,			UpperCAmelCase							:				Optional[Any]						,			UpperCAmelCase							:				Optional[Any]	):
            A_						  =				process_name  # process name
            A_						  =				arrival_time  # arrival time of the process
            # completion time of finished process or last interrupted time
            A_						  =				arrival_time
            A_						  =				burst_time  # remaining burst time
            A_						  =				0  # total time of the process wait in ready queue
            A_						  =				0  # time from arrival time to completion time




class   _a					:




      """simple docstring"""

      def __init__(   self							:				Union[str, Any]						,			UpperCAmelCase							:				Tuple						,			UpperCAmelCase							:				Optional[int]						,			UpperCAmelCase							:				str						,			UpperCAmelCase							:				Optional[int]						,			):
            A_						  =				number_of_queues
            # time slice of queues that round robin algorithm applied
            A_						  =				time_slices
            # unfinished process is in this ready_queue
            A_						  =				queue
            # current time
            A_						  =				current_time
            # finished process is in this sequence queue
            A_						  =				deque()





      def 		__A	(   self							:				Union[str, Any]	):
            A_						  =				[]
            for i in range(len(self.finish_queue	)	):
                  sequence.append(self.finish_queue[i].process_name	)
            return sequence





      def 		__A	(   self							:				List[str]						,			UpperCAmelCase							:				Dict	):
            A_						  =				[]
            for i in range(len(a__	)	):
                  waiting_times.append(queue[i].waiting_time	)
            return waiting_times





      def 		__A	(   self							:				List[str]						,			UpperCAmelCase							:				Dict	):
            A_						  =				[]
            for i in range(len(a__	)	):
                  turnaround_times.append(queue[i].turnaround_time	)
            return turnaround_times





      def 		__A	(   self							:				List[str]						,			UpperCAmelCase							:				int	):
            A_						  =				[]
            for i in range(len(a__	)	):
                  completion_times.append(queue[i].stop_time	)
            return completion_times





      def 		__A	(   self							:				Optional[Any]						,			UpperCAmelCase							:				str	):
            return [q.burst_time for q in queue]





      def 		__A	(   self							:				Optional[int]						,			UpperCAmelCase							:				List[Any]	):
            process.waiting_time += self.current_time - process.stop_time
            return process.waiting_time





      def 		__A	(   self							:				Dict						,			UpperCAmelCase							:				Union[str, Any]	):
            A_						  =				deque()  # sequence deque of finished process
            while len(a__	) != 0:
                  A_						  =				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
                  A_						  =				0
                  # set the process's turnaround time because it is finished
                  A_						  =				self.current_time - cp.arrival_time
                  # set the completion time
                  A_						  =				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							:				Optional[Any]						,			UpperCAmelCase							:				Dict						,			UpperCAmelCase							:				Tuple	):
            A_						  =				deque()  # sequence deque of terminated process
            # just for 1 cycle and unfinished processes will go back to queue
            for _ in range(len(a__	)	):
                  A_						  =				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
                        A_						  =				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
                        A_						  =				0
                        # set the finish time
                        A_						  =				self.current_time
                        # update the process' turnaround time because it is finished
                        A_						  =				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							:				str	):





            for i in range(self.number_of_queues - 1	):
                  A_						  =				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

      __a    :Optional[Any]      =			Process('P1', 0, 53)
      __a    :Union[str, Any]      =			Process('P2', 0, 17)
      __a    :str      =			Process('P3', 0, 68)
      __a    :List[Any]      =			Process('P4', 0, 24)
      __a    :Union[str, Any]      =			3
      __a    :Union[str, Any]      =			[17, 25]
      __a    :Tuple      =			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])})

      __a    :Optional[Any]      =			Process('P1', 0, 53)
      __a    :Optional[Any]      =			Process('P2', 0, 17)
      __a    :Dict      =			Process('P3', 0, 68)
      __a    :Any      =			Process('P4', 0, 24)
      __a    :Optional[int]      =			3
      __a    :Tuple      =			[17, 25]
      __a    :Optional[Any]      =			deque([Pa, Pa, Pa, Pa])
      __a    :List[Any]      =			MLFQ(number_of_queues, time_slices, queue, 0)
      __a    :Any      =			mlfq.multi_level_feedback_queue()

      # print total waiting times of processes(P1, P2, P3, P4)
      print(
          F"waiting time:\\n        \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:\\n        \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:\\n        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}"
      )
      # print sequence of finished processes
      print(
          F"sequence of finished processes:\\n        {mlfq.calculate_sequence_of_finish_queue()}"
      )







lowerCamelCase__       		=  8.3_1_4_4_5_9_8






def 	UpperCamelCase	(							snake_case__  : float						,snake_case__  : float	):




     '''simple docstring'''






     if temperature < 0:
          raise Exception("""Temperature cannot be less than 0 K"""	)
     if molar_mass <= 0:
          raise Exception("""Molar mass cannot be less than or equal to 0 kg/mol"""	)
     else:
          return (3 * UNIVERSAL_GAS_CONSTANT * temperature / molar_mass) ** 0.5


if __name__ == "__main__":
     import doctest

     # run doctest
     doctest.testmod()

     # example
     lowerCamelCase__       		=  300
     lowerCamelCase__       		=  28
     lowerCamelCase__       		=  rms_speed_of_molecule(temperature, molar_mass)
     print(f'''Vrms of Nitrogen gas at 300 K is {vrms} m/s''')


