





'''simple docstring'''




from math import sqrt






def 			_lowerCAmelCase     (    __snake_case    :					int     )	->	bool:
     assert isinstance(__snake_case					,				__snake_case     ) and (
         number >= 0
     ), "'number' must been an int and positive"

     __A		:					Optional[int]						=			True

     # 0 and 1 are none primes.
     if number <= 1:
          __A		:					Tuple						=			False

     for divisor in range(2					,				int(round(sqrt(__snake_case     )     )     ) + 1     ):
          # if 'number' divisible by 'divisor' then sets 'status'
          # of false and break up the loop.
          if number % divisor == 0:
               __A		:					Union[str, Any]						=			False
               break

    # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'status' must been from type bool"

     return status






def 			_lowerCAmelCase     (    __snake_case    :					Tuple     )	->	Optional[int]:
     assert isinstance(__snake_case					,				__snake_case     ) and (n > 2), "'N' must been an int and > 2"

     # beginList: contains all natural numbers from 2 up to N
     __A		:					List[str]						=			list(range(2					,				n + 1     )     )

     __A		:					Any						=			[]  # this list will be returns.

     # actual sieve of erathostenes
     for i in range(len(__snake_case     )     ):
          for j in range(i + 1					,				len(__snake_case     )     ):
               if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
                    __A		:					Any						=			0

    # filters actual prime numbers.
     __A		:					Dict						=			[x for x in begin_list if x != 0]

     # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'ans' must been from type list"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					str     )	->	Union[str, Any]:
     assert isinstance(__snake_case					,				__snake_case     ) and (n > 2), "'N' must been an int and > 2"

     __A		:					List[Any]						=			[]

     # iterates over all numbers between 2 up to N+1
     # if a number is prime then appends to list 'ans'
     for number in range(2					,				n + 1     ):
          if is_prime(__snake_case     ):
               ans.append(__snake_case     )

    # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'ans' must been from type list"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					List[Any]     )	->	List[str]:
     assert isinstance(__snake_case					,				__snake_case     ) and number >= 0, "'number' must been an int and >= 0"

     __A		:					Optional[int]						=			[]  # this list will be returns of the function.

     # potential prime number factors.

     __A		:					int						=			2

     __A		:					Tuple						=			number

     if number == 0 or number == 1:
          ans.append(__snake_case     )

     # if 'number' not prime then builds the prime factorization of 'number'
     elif not is_prime(__snake_case     ):
          while quotient != 1:
               if is_prime(__snake_case     ) and (quotient % factor == 0):
                    ans.append(__snake_case     )
                    quotient /= factor
               else:
                    factor += 1

     else:
          ans.append(__snake_case     )

     # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'ans' must been from type list"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					str     )	->	Optional[int]:
     assert isinstance(__snake_case					,				__snake_case     ) and (
         number >= 0
     ), "'number' bust been an int and >= 0"

     __A		:					Any						=			0

     # prime factorization of 'number'
     __A		:					Dict						=			prime_factorization(__snake_case     )

     __A		:					Union[str, Any]						=			max(__snake_case     )

     # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'ans' must been from type int"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Optional[Any]     )	->	str:
     assert isinstance(__snake_case					,				__snake_case     ) and (
         number >= 0
     ), "'number' bust been an int and >= 0"

     __A		:					Tuple						=			0

     # prime factorization of 'number'
     __A		:					Any						=			prime_factorization(__snake_case     )

     __A		:					Any						=			min(__snake_case     )

     # precondition
     assert isinstance(__snake_case					,				__snake_case     ), "'ans' must been from type int"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Union[str, Any]     )	->	Optional[int]:
     assert isinstance(__snake_case					,				__snake_case     ), "'number' must been an int"
     assert isinstance(number % 2 == 0					,				__snake_case     ), "compare bust been from type bool"

     return number % 2 == 0






def 			_lowerCAmelCase     (    __snake_case    :					List[str]     )	->	str:
     assert isinstance(__snake_case					,				__snake_case     ), "'number' must been an int"
     assert isinstance(number % 2 != 0					,				__snake_case     ), "compare bust been from type bool"

     return number % 2 != 0






def 			_lowerCAmelCase     (    __snake_case    :					Union[str, Any]     )	->	Optional[int]:
     assert (
         isinstance(__snake_case					,				__snake_case     ) and (number > 2) and is_even(__snake_case     )
     ), "'number' must been an int, even and > 2"

     __A		:					List[Any]						=			[]  # this list will returned

     # creates a list of prime numbers between 2 up to 'number'
     __A		:					List[str]						=			get_prime_numbers(__snake_case     )
     __A		:					Tuple						=			len(__snake_case     )

     # run variable for while-loops.
     __A		:					Optional[int]						=			0
     __A		:					Union[str, Any]						=			None

     # exit variable. for break up the loops
     __A		:					str						=			True

     while i < len_pn and loop:
          __A		:					int						=			i + 1

          while j < len_pn and loop:
               if prime_numbers[i] + prime_numbers[j] == number:
                    __A		:					Any						=			False
                    ans.append(prime_numbers[i]     )
                    ans.append(prime_numbers[j]     )

               j += 1

          i += 1

     # precondition
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and (len(__snake_case     ) == 2)
         and (ans[0] + ans[1] == number)
         and is_prime(ans[0]     )
         and is_prime(ans[1]     )
     ), "'ans' must contains two primes. And sum of elements must been eq 'number'"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Union[str, Any]					,				__snake_case    :					int     )	->	Any:
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and isinstance(__snake_case					,				__snake_case     )
         and (numbera >= 0)
         and (numbera >= 0)
     ), "'number1' and 'number2' must been positive integer."

     __A		:					List[str]						=			0

     while numbera != 0:
          __A		:					Optional[int]						=			numbera % numbera
          __A		:					Dict						=			numbera
          __A		:					List[Any]						=			rest

     # precondition
     assert isinstance(__snake_case					,				__snake_case     ) and (
         numbera >= 0
     ), "'number' must been from type int and positive"

     return numbera






def 			_lowerCAmelCase     (    __snake_case    :					Optional[int]					,				__snake_case    :					List[Any]     )	->	List[Any]:
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and isinstance(__snake_case					,				__snake_case     )
         and (numbera >= 1)
         and (numbera >= 1)
     ), "'number1' and 'number2' must been positive integer."

     __A		:					Union[str, Any]						=			1  # actual answer that will be return.

     # for kgV (x,1)
     if numbera > 1 and numbera > 1:
          # builds the prime factorization of 'number1' and 'number2'
          __A		:					Optional[Any]						=			prime_factorization(__snake_case     )
          __A		:					Union[str, Any]						=			prime_factorization(__snake_case     )

     elif numbera == 1 or numbera == 1:
          __A		:					str						=			[]
          __A		:					Union[str, Any]						=			[]
          __A		:					Union[str, Any]						=			max(__snake_case					,				__snake_case     )

     __A		:					Union[str, Any]						=			0
     __A		:					Tuple						=			0

     __A		:					List[Any]						=			[]  # captured numbers int both 'primeFac1' and 'primeFac2'

     # iterates through primeFac1
     for n in prime_fac_a:
          if n not in done:
               if n in prime_fac_a:
                    __A		:					Dict						=			prime_fac_a.count(__snake_case     )
                    __A		:					List[str]						=			prime_fac_a.count(__snake_case     )

                    for _ in range(max(__snake_case					,				__snake_case     )     ):
                         ans *= n

               else:
                    __A		:					int						=			prime_fac_a.count(__snake_case     )

                    for _ in range(__snake_case     ):
                         ans *= n

               done.append(__snake_case     )

    # iterates through primeFac2
     for n in prime_fac_a:
          if n not in done:
               __A		:					str						=			prime_fac_a.count(__snake_case     )

               for _ in range(__snake_case     ):
                    ans *= n

               done.append(__snake_case     )

    # precondition
     assert isinstance(__snake_case					,				__snake_case     ) and (
         ans >= 0
     ), "'ans' must been from type int and positive"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Optional[Any]     )	->	List[Any]:
     assert isinstance(__snake_case					,				__snake_case     ) and (n >= 0), "'number' must been a positive int"

     __A		:					List[Any]						=			0
     __A		:					str						=			2  # this variable holds the answer

     while index < n:
          index += 1

          ans += 1  # counts to the next number

          # if ans not prime then
          # runs to the next prime number.
          while not is_prime(__snake_case     ):
               ans += 1

    # precondition
     assert isinstance(__snake_case					,				__snake_case     ) and is_prime(
         __snake_case     ), "'ans' must been a prime number and from type int"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Optional[int]					,				__snake_case    :					Optional[int]     )	->	Dict:
     assert (
         is_prime(__snake_case     ) and is_prime(__snake_case     ) and (p_number_a < p_number_a)
     ), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

     __A		:					Any						=			p_number_a + 1  # jump to the next number

     __A		:					List[Any]						=			[]  # this list will be returns.

     # if number is not prime then
     # fetch the next prime number.
     while not is_prime(__snake_case     ):
          number += 1

     while number < p_number_a:
          ans.append(__snake_case     )

          number += 1

          # fetch the next prime number.
          while not is_prime(__snake_case     ):
               number += 1

    # precondition
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and ans[0] != p_number_a
         and ans[len(__snake_case     ) - 1] != p_number_a
     ), "'ans' must been a list without the arguments"

     # 'ans' contains not 'pNumber1' and 'pNumber2' !
     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Dict     )	->	str:
     assert isinstance(__snake_case					,				__snake_case     ) and (n >= 1), "'n' must been int and >= 1"

     __A		:					List[str]						=			[]  # will be returned.

     for divisor in range(1					,				n + 1     ):
          if n % divisor == 0:
               ans.append(__snake_case     )

    # precondition
     assert ans[0] == 1 and ans[len(__snake_case     ) - 1] == n, "Error in function getDivisiors(...)"

     return ans






def 			_lowerCAmelCase     (    __snake_case    :					Union[str, Any]     )	->	Dict:
     assert isinstance(__snake_case					,				__snake_case     ) and (
         number > 1
     ), "'number' must been an int and >= 1"

     __A		:					Optional[Any]						=			get_divisors(__snake_case     )

     # precondition
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and (divisors[0] == 1)
         and (divisors[len(__snake_case     ) - 1] == number)
     ), "Error in help-function getDivisiors(...)"

     # summed all divisors up to 'number' (exclusive), hence [:-1]
     return sum(divisors[:-1]     ) == number






def 			_lowerCAmelCase     (    __snake_case    :					Any					,				__snake_case    :					int     )	->	List[Any]:
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and isinstance(__snake_case					,				__snake_case     )
         and (denominator != 0)
     ), "The arguments must been from type int and 'denominator' != 0"

     # build the greatest common divisor of numerator and denominator.
     __A		:					Optional[int]						=			gcd(abs(__snake_case     )					,				abs(__snake_case     )     )

     # precondition
     assert (
         isinstance(__snake_case					,				__snake_case     )
         and (numerator % gcd_of_fraction == 0)
         and (denominator % gcd_of_fraction == 0)
     ), "Error in function gcd(...,...)"

     return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)






def 			_lowerCAmelCase     (    __snake_case    :					Tuple     )	->	int:
     assert isinstance(__snake_case					,				__snake_case     ) and (n >= 0), "'n' must been a int and >= 0"

     __A		:					Optional[int]						=			1  # this will be return.

     for factor in range(1					,				n + 1     ):
          ans *= factor

     return ans







def 			_lowerCAmelCase     (    __snake_case    :					str     )	->	Dict:
     assert isinstance(__snake_case					,				__snake_case     ) and (n >= 0), "'n' must been an int and >= 0"

     __A		:					Union[str, Any]						=			0
     __A		:					List[str]						=			1
     __A		:					Dict						=			1  # this will be return

     for _ in range(n - 1     ):
          __A		:					str						=			ans
          ans += fiba
          __A		:					List[Any]						=			tmp

     return ans






'''simple docstring'''




import json
import os
import tempfile
import unittest
import unittest.mock as mock
from pathlib import Path

from requests.exceptions import HTTPError

from transformers.utils import (
    CONFIG_NAME,
    FLAX_WEIGHTS_NAME,
    TF2_WEIGHTS_NAME,
    TRANSFORMERS_CACHE,
    WEIGHTS_NAME,
    cached_file,
    get_file_from_repo,
    has_file,
)


lowercase__       : Any         =       '''hf-internal-testing/tiny-random-bert'''
lowercase__       : Optional[Any]         =       os.path.join(TRANSFORMERS_CACHE, '''models--hf-internal-testing--tiny-random-bert''')
lowercase__       : List[Any]         =       '''9b8c223d42b2188cb49d29af482996f9d0f3e5a6'''


class 					SCREAMING_SNAKE_CASE       (unittest.TestCase				):


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          __A		:					List[Any]						=			cached_file(_UpperCAmelCase		,      _UpperCAmelCase)
          # Should have downloaded the file in here
          self.assertTrue(os.path.isdir(_UpperCAmelCase))
          # Cache should contain at least those three subfolders:
          for subfolder in ["blobs", "refs", "snapshots"]:
               self.assertTrue(os.path.isdir(os.path.join(_UpperCAmelCase		,      _UpperCAmelCase)))
          with open(os.path.join(_UpperCAmelCase		,      'refs'		,      'main')) as f:
               __A		:					Any						=			f.read()
          self.assertEqual(_UpperCAmelCase		,      os.path.join(_UpperCAmelCase		,      'snapshots'		,      _UpperCAmelCase		,      _UpperCAmelCase))
          self.assertTrue(os.path.isfile(_UpperCAmelCase))

          # File is cached at the same place the second time.
          __A		:					Tuple						=			cached_file(_UpperCAmelCase		,      _UpperCAmelCase)
          self.assertEqual(_UpperCAmelCase		,      _UpperCAmelCase)

          # Using a specific revision to test the full commit hash.
          __A		:					List[Any]						=			cached_file(_UpperCAmelCase		,      _UpperCAmelCase		,      revision='9b8c223')
          self.assertEqual(_UpperCAmelCase		,      os.path.join(_UpperCAmelCase		,      'snapshots'		,      _UpperCAmelCase		,      _UpperCAmelCase))


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          with self.assertRaisesRegex(_UpperCAmelCase		,      'is not a valid model identifier'):
               __A		:					Dict						=			cached_file('tiny-random-bert'		,      _UpperCAmelCase)

          with self.assertRaisesRegex(_UpperCAmelCase		,      'is not a valid git identifier'):
               __A		:					Optional[int]						=			cached_file(_UpperCAmelCase		,      _UpperCAmelCase		,      revision='aaaa')

          with self.assertRaisesRegex(_UpperCAmelCase		,      'does not appear to have a file named'):
               __A		:					int						=			cached_file(_UpperCAmelCase		,      'conf')


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          with self.assertRaisesRegex(_UpperCAmelCase		,      'does not appear to have a file named'):
               __A		:					Any						=			cached_file(_UpperCAmelCase		,      'conf')

          with open(os.path.join(_UpperCAmelCase		,      'refs'		,      'main')) as f:
               __A		:					Dict						=			f.read()
          self.assertTrue(os.path.isfile(os.path.join(_UpperCAmelCase		,      '.no_exist'		,      _UpperCAmelCase		,      'conf')))

          __A		:					List[Any]						=			cached_file(_UpperCAmelCase		,      'conf'		,      _raise_exceptions_for_missing_entries=_UpperCAmelCase)
          self.assertIsNone(_UpperCAmelCase)

          __A		:					str						=			cached_file(_UpperCAmelCase		,      'conf'		,      local_files_only=_UpperCAmelCase		,      _raise_exceptions_for_missing_entries=_UpperCAmelCase)
          self.assertIsNone(_UpperCAmelCase)

          __A		:					List[str]						=			mock.Mock()
          __A		:					Dict						=			500
          __A		:					List[str]						=			{}
          __A		:					List[Any]						=			HTTPError
          __A		:					Optional[Any]						=			{}

          # Under the mock environment we get a 500 error when trying to reach the tokenizer.
          with mock.patch('requests.Session.request'		,      return_value=_UpperCAmelCase) as mock_head:
               __A		:					Dict						=			cached_file(_UpperCAmelCase		,      'conf'		,      _raise_exceptions_for_connection_errors=_UpperCAmelCase)
               self.assertIsNone(_UpperCAmelCase)
               # This check we did call the fake head request
               mock_head.assert_called()


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          self.assertTrue(has_file('hf-internal-testing/tiny-bert-pt-only'		,      _UpperCAmelCase))
          self.assertFalse(has_file('hf-internal-testing/tiny-bert-pt-only'		,      _UpperCAmelCase))
          self.assertFalse(has_file('hf-internal-testing/tiny-bert-pt-only'		,      _UpperCAmelCase))


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          self.assertIsNone(get_file_from_repo('bert-base-cased'		,      'ahah.txt'))

          # The function raises if the repository does not exist.
          with self.assertRaisesRegex(_UpperCAmelCase		,      'is not a valid model identifier'):
               get_file_from_repo('bert-base-case'		,      _UpperCAmelCase)

          # The function raises if the revision does not exist.
          with self.assertRaisesRegex(_UpperCAmelCase		,      'is not a valid git identifier'):
               get_file_from_repo('bert-base-cased'		,      _UpperCAmelCase		,      revision='ahaha')

          __A		:					List[str]						=			get_file_from_repo('bert-base-cased'		,      _UpperCAmelCase)
          # The name is the cached name which is not very easy to test, so instead we load the content.
          __A		:					List[str]						=			json.loads(open(_UpperCAmelCase		,      'r').read())
          self.assertEqual(config['hidden_size']		,      768)


     def 				SCREAMING_SNAKE_CASE    (		self):

          '''simple docstring'''






          with tempfile.TemporaryDirectory() as tmp_dir:
               __A		:					Tuple						=			Path(_UpperCAmelCase) / 'a.txt'
               filename.touch()
               self.assertEqual(get_file_from_repo(_UpperCAmelCase		,      'a.txt')		,      str(_UpperCAmelCase))

               self.assertIsNone(get_file_from_repo(_UpperCAmelCase		,      'b.txt'))