





"""simple docstring"""






from math import sqrt

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Union[str, Any]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (
           number >= 0
       ), "'number' must been an int and positive"

       _UpperCAmelCase     =     True

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

       for divisor in range(2,int(round(sqrt(SCREAMING_SNAKE_CASE							)							)							) + 1							):
              # if 'number' divisible by 'divisor' then sets 'status'
              # of false and break up the loop.
              if number % divisor == 0:
                     _UpperCAmelCase     =     False
                     break

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

       return status

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Optional[int]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n > 2), "'N' must been an int and > 2"

       # beginList: contains all natural numbers from 2 up to N
       _UpperCAmelCase     =     list(range(2,n + 1							)							)

       _UpperCAmelCase     =     []  # this list will be returns.

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

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

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       List[str]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n > 2), "'N' must been an int and > 2"

       _UpperCAmelCase     =     []

       # 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(SCREAMING_SNAKE_CASE							):
                     ans.append(SCREAMING_SNAKE_CASE							)

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       List[str]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and number >= 0, "'number' must been an int and >= 0"

       _UpperCAmelCase     =     []  # this list will be returns of the function.

       # potential prime number factors.

       _UpperCAmelCase     =     2

       _UpperCAmelCase     =     number

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

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

       else:
              ans.append(SCREAMING_SNAKE_CASE							)

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Optional[int]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (
           number >= 0
       ), "'number' bust been an int and >= 0"

       _UpperCAmelCase     =     0

       # prime factorization of 'number'
       _UpperCAmelCase     =     prime_factorization(SCREAMING_SNAKE_CASE							)

       _UpperCAmelCase     =     max(SCREAMING_SNAKE_CASE							)

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       List[str]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (
           number >= 0
       ), "'number' bust been an int and >= 0"

       _UpperCAmelCase     =     0

       # prime factorization of 'number'
       _UpperCAmelCase     =     prime_factorization(SCREAMING_SNAKE_CASE							)

       _UpperCAmelCase     =     min(SCREAMING_SNAKE_CASE							)

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Optional[int]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							), "'number' must been an int"
       assert isinstance(number % 2 == 0,SCREAMING_SNAKE_CASE							), "compare bust been from type bool"

       return number % 2 == 0

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Union[str, Any]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							), "'number' must been an int"
       assert isinstance(number % 2 != 0,SCREAMING_SNAKE_CASE							), "compare bust been from type bool"

       return number % 2 != 0

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       List[Any]:






       """simple docstring"""




       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (number > 2) and is_even(SCREAMING_SNAKE_CASE							)
       ), "'number' must been an int, even and > 2"

       _UpperCAmelCase     =     []  # this list will returned

       # creates a list of prime numbers between 2 up to 'number'
       _UpperCAmelCase     =     get_prime_numbers(SCREAMING_SNAKE_CASE							)
       _UpperCAmelCase     =     len(SCREAMING_SNAKE_CASE							)

       # run variable for while-loops.
       _UpperCAmelCase     =     0
       _UpperCAmelCase     =     None

       # exit variable. for break up the loops
       _UpperCAmelCase     =     True

       while i < len_pn and loop:
              _UpperCAmelCase     =     i + 1

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

                     j += 1

              i += 1

       # precondition
       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and (len(SCREAMING_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    (       SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)		->       Optional[int]:






       """simple docstring"""




       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and (numbera >= 0)
           and (numbera >= 0)
       ), "'number1' and 'number2' must been positive integer."

       _UpperCAmelCase     =     0

       while numbera != 0:
              _UpperCAmelCase     =     numbera % numbera
              _UpperCAmelCase     =     numbera
              _UpperCAmelCase     =     rest

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

       return numbera

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)		->       List[Any]:






       """simple docstring"""




       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and (numbera >= 1)
           and (numbera >= 1)
       ), "'number1' and 'number2' must been positive integer."

       _UpperCAmelCase     =     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'
              _UpperCAmelCase     =     prime_factorization(SCREAMING_SNAKE_CASE							)
              _UpperCAmelCase     =     prime_factorization(SCREAMING_SNAKE_CASE							)

       elif numbera == 1 or numbera == 1:
              _UpperCAmelCase     =     []
              _UpperCAmelCase     =     []
              _UpperCAmelCase     =     max(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)

       _UpperCAmelCase     =     0
       _UpperCAmelCase     =     0

       _UpperCAmelCase     =     []  # 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:
                            _UpperCAmelCase     =     prime_fac_a.count(SCREAMING_SNAKE_CASE							)
                            _UpperCAmelCase     =     prime_fac_a.count(SCREAMING_SNAKE_CASE							)

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

                     else:
                            _UpperCAmelCase     =     prime_fac_a.count(SCREAMING_SNAKE_CASE							)

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

                     done.append(SCREAMING_SNAKE_CASE							)

                      # iterates through primeFac2
       for n in prime_fac_a:
              if n not in done:
                     _UpperCAmelCase     =     prime_fac_a.count(SCREAMING_SNAKE_CASE							)

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

                     done.append(SCREAMING_SNAKE_CASE							)

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Any:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n >= 0), "'number' must been a positive int"

       _UpperCAmelCase     =     0
       _UpperCAmelCase     =     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(SCREAMING_SNAKE_CASE							):
                     ans += 1

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)		->       Optional[int]:






       """simple docstring"""




       assert (
           is_prime(SCREAMING_SNAKE_CASE							) and is_prime(SCREAMING_SNAKE_CASE							) and (p_number_a < p_number_a)
       ), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

       _UpperCAmelCase     =     p_number_a + 1  # jump to the next number

       _UpperCAmelCase     =     []  # this list will be returns.

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

       while number < p_number_a:
              ans.append(SCREAMING_SNAKE_CASE							)

              number += 1

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

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

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

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Optional[Any]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n >= 1), "'n' must been int and >= 1"

       _UpperCAmelCase     =     []  # will be returned.

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

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

       return ans

def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       Optional[Any]:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (
           number > 1
       ), "'number' must been an int and >= 1"

       _UpperCAmelCase     =     get_divisors(SCREAMING_SNAKE_CASE							)

       # precondition
       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and (divisors[0] == 1)
           and (divisors[len(SCREAMING_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    (       SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)		->       List[str]:






       """simple docstring"""




       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							)
           and (denominator != 0)
       ), "The arguments must been from type int and 'denominator' != 0"

       # build the greatest common divisor of numerator and denominator.
       _UpperCAmelCase     =     gcd(abs(SCREAMING_SNAKE_CASE							),abs(SCREAMING_SNAKE_CASE							)							)

       # precondition
       assert (
           isinstance(SCREAMING_SNAKE_CASE,SCREAMING_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    (       SCREAMING_SNAKE_CASE							)		->       Any:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n >= 0), "'n' must been a int and >= 0"

       _UpperCAmelCase     =     1  # this will be return.

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

       return ans


def       __lowerCamelCase    (       SCREAMING_SNAKE_CASE							)		->       int:






       """simple docstring"""




       assert isinstance(SCREAMING_SNAKE_CASE,SCREAMING_SNAKE_CASE							) and (n >= 0), "'n' must been an int and >= 0"

       _UpperCAmelCase     =     0
       _UpperCAmelCase     =     1
       _UpperCAmelCase     =     1  # this will be return

       for _ in range(n - 1							):
              _UpperCAmelCase     =     ans
              ans += fiba
              _UpperCAmelCase     =     tmp

       return ans













"""simple docstring"""






import unittest

from transformers import RoFormerTokenizer, RoFormerTokenizerFast
from transformers.testing_utils import require_rjieba, require_tokenizers

from ...test_tokenization_common import TokenizerTesterMixin



@require_rjieba
@require_tokenizers
class 	lowerCAmelCase					(      snake_case			,	unittest.TestCase							):
       lowerCAmelCase__						 =  RoFormerTokenizer
       lowerCAmelCase__						 =  RoFormerTokenizerFast
       lowerCAmelCase__						 =  True
       lowerCAmelCase__						 =  True






       def 							__A (   self     ):
              super().setUp()






       def 							__A (   self    ,  **a__     ):
              return self.tokenizer_class.from_pretrained('junnyu/roformer_chinese_base'    ,  **a__     )






       def 							__A (   self    ,  **a__     ):
              return self.rust_tokenizer_class.from_pretrained('junnyu/roformer_chinese_base'    ,  **a__     )






       def 							__A (   self     ):
              _UpperCAmelCase     =     '永和服装饰品有限公司,今天天气非常好'
              _UpperCAmelCase     =     '永和 服装 饰品 有限公司 , 今 天 天 气 非常 好'
              return input_text, output_text






       def 							__A (   self     ):
              _UpperCAmelCase     =     self.get_tokenizer()
              _UpperCAmelCase    ,							_UpperCAmelCase     =     self.get_chinese_input_output_texts()
              _UpperCAmelCase     =     tokenizer.tokenize(a__     )

              self.assertListEqual(a__    ,  output_text.split()     )

              _UpperCAmelCase     =     tokens + [tokenizer.unk_token]
              _UpperCAmelCase     =     [2_29_43, 2_13_32, 3_44_31, 4_59_04, 1_17, 3_06, 12_31, 12_31, 26_53, 3_39_94, 12_66, 1_00]
              self.assertListEqual(tokenizer.convert_tokens_to_ids(a__     )    ,  a__     )






       def 							__A (   self     ):
              _UpperCAmelCase     =     self.get_rust_tokenizer()
              _UpperCAmelCase    ,							_UpperCAmelCase     =     self.get_chinese_input_output_texts()
              _UpperCAmelCase     =     tokenizer.tokenize(a__     )
              self.assertListEqual(a__    ,  output_text.split()     )
              _UpperCAmelCase     =     tokens + [tokenizer.unk_token]
              _UpperCAmelCase     =     [2_29_43, 2_13_32, 3_44_31, 4_59_04, 1_17, 3_06, 12_31, 12_31, 26_53, 3_39_94, 12_66, 1_00]
              self.assertListEqual(tokenizer.convert_tokens_to_ids(a__     )    ,  a__     )






       def 							__A (   self     ):
              pass






       def 							__A (   self     ):
              pass






       def 							__A (   self     ):
              pass






