


'''simple docstring'''



from unittest import TestCase

from datasets import Dataset
from minhash_deduplication import deduplicate_dataset, make_duplicate_clusters




def 			_a			(		)     ->   List[str]:





     '''simple docstring'''






     __UpperCAmelCase			:				Optional[Any]													=    {
         '''repo_name''': ['''test_repo1''', '''test_repo2''', '''test_repo3'''],
         '''path''': ['''test_1.py''', '''test_2.py''', '''unit_test.py'''],
         '''content''': ['''a ''' * 20, '''a ''' * 30, '''b ''' * 7],
     }
     __UpperCAmelCase			:				List[str]													=    Dataset.from_dict(_lowercase						)
     return dataset



class 			a       (	_a ):


     """simple docstring"""






     def 				lowerCamelCase__				(       self  :	int    )		->							Tuple:
          __UpperCAmelCase			:				int													=    get_dataset()
          __UpperCAmelCase			:				int													=    make_duplicate_clusters(snake_case							,				0.85    )
          self.assertEqual(len(duplicate_clusters[0]    )							,				2    )






     def 				lowerCamelCase__				(       self  :	Optional[int]    )		->							List[str]:
          __UpperCAmelCase			:				Optional[Any]													=    get_dataset()
          __UpperCAmelCase			:				Optional[int]													=    deduplicate_dataset(snake_case    )
          self.assertEqual(len(snake_case    )							,				2    )
          print(snake_case    )
          self.assertEqual(duplicate_clusters[0][0]['''copies''']							,				2    )
          self.assertEqual(duplicate_clusters[0][0]['''is_extreme''']							,				snake_case    )



'''simple docstring'''



def 			_a			(		_lowercase      :			List[str]						):





     '''simple docstring'''






     __UpperCAmelCase			:				int													=    len(_lowercase						)
     while cur > 1:
          # Find the maximum number in arr
          __UpperCAmelCase			:				Union[str, Any]													=    arr.index(max(arr[0:cur]						)						)
          # Reverse from 0 to mi
          __UpperCAmelCase			:				Any													=    arr[mi::-1] + arr[mi + 1 : len(_lowercase						)]
          # Reverse whole list
          __UpperCAmelCase			:				List[str]													=    arr[cur - 1 :: -1] + arr[cur : len(_lowercase						)]
          cur -= 1
     return arr


if __name__ == "__main__":
      __UpperCAmelCase    :Any				       =     input("Enter numbers separated by a comma:\n").strip()
      __UpperCAmelCase    :Optional[int]				       =     [int(item) for item in user_input.split(",")]
      print(pancake_sort(unsorted))