


import unittest

from transformers import load_tool
from transformers.utils import is_torch_available


if is_torch_available():
   import torch

from transformers.testing_utils import require_torch

from .test_tools_common import ToolTesterMixin






@require_torch
class    UpperCAmelCase__	( unittest.TestCase       ,  A_		):



    """simple docstring"""






    def _a (      self   )  ->	List[str]:
         __UpperCamelCase   							=load_tool('text-to-speech'   )
         self.tool.setup()






    def _a (      self   )  ->	List[Any]:
         # SpeechT5 isn't deterministic
         torch.manual_seed(0   )
         __UpperCamelCase   							=self.tool('hey'   )
         __UpperCamelCase   							=result.to_raw()
         self.assertTrue(
             torch.allclose(
                 resulting_tensor[:3] ,       torch.tensor([-0.000_5966_6688_3211_5829, -0.000_3657_6401_9079_5064, -0.0001_3439_5027_9988_3485]   ) ,       )   )






    def _a (      self   )  ->	Optional[int]:
         # SpeechT5 isn't deterministic
         torch.manual_seed(0   )
         __UpperCamelCase   							=self.tool('hey'   )
         __UpperCamelCase   							=result.to_raw()
         self.assertTrue(
             torch.allclose(
                 resulting_tensor[:3] ,       torch.tensor([-0.000_5966_6688_3211_5829, -0.000_3657_6401_9079_5064, -0.0001_3439_5027_9988_3485]   ) ,       )   )









import os
import random
import sys

from . import cryptomath_module as cryptoMath  # noqa: N812
from . import rabin_miller as rabinMiller  # noqa: N812

def 						_UpperCAmelCase    (      ):
     print('Making key files...'    )
     make_key_files('rsa'      ,					10_24    )
     print('Key files generation successful.'    )

def 						_UpperCAmelCase    (      SCREAMING_SNAKE_CASE__      : int    ):
     print('Generating prime p...'    )
     __UpperCamelCase   							=rabinMiller.generate_large_prime(SCREAMING_SNAKE_CASE__    )
     print('Generating prime q...'    )
     __UpperCamelCase   							=rabinMiller.generate_large_prime(SCREAMING_SNAKE_CASE__    )
     __UpperCamelCase   							=p * q

     print('Generating e that is relatively prime to (p - 1) * (q - 1)...'    )
     while True:
          __UpperCamelCase   							=random.randrange(2 ** (key_size - 1)      ,					2 ** (key_size)    )
          if cryptoMath.gcd(SCREAMING_SNAKE_CASE__      ,					(p - 1) * (q - 1)    ) == 1:
               break

     print('Calculating d that is mod inverse of e...'    )
     __UpperCamelCase   							=cryptoMath.find_mod_inverse(SCREAMING_SNAKE_CASE__      ,					(p - 1) * (q - 1)    )

     __UpperCamelCase   							=(n, e)
     __UpperCamelCase   							=(n, d)
     return (public_key, private_key)

def 						_UpperCAmelCase    (      SCREAMING_SNAKE_CASE__      : str      ,					SCREAMING_SNAKE_CASE__      : int    ):
     if os.path.exists(F'{name}_pubkey.txt'    ) or os.path.exists(F'{name}_privkey.txt'    ):
          print('\nWARNING:'    )
          print(
              F'"{name}_pubkey.txt" or "{name}_privkey.txt" already exists. \n'
              'Use a different name or delete these files and re-run this program.'    )
          sys.exit()

     __UpperCamelCase							,				__UpperCamelCase   							=generate_key(SCREAMING_SNAKE_CASE__    )
     print(F'\nWriting public key to file {name}_pubkey.txt...'    )
     with open(F'{name}_pubkey.txt'      ,					'w'    ) as out_file:
          out_file.write(F'{key_size},{public_key[0]},{public_key[1]}'    )

     print(F'Writing private key to file {name}_privkey.txt...'    )
     with open(F'{name}_privkey.txt'      ,					'w'    ) as out_file:
          out_file.write(F'{key_size},{private_key[0]},{private_key[1]}'    )


if __name__ == "__main__":
   main()





