


import gc
import unittest

from parameterized import parameterized

from diffusers import FlaxUNetaDConditionModel
from diffusers.utils import is_flax_available
from diffusers.utils.testing_utils import load_hf_numpy, require_flax, slow


if is_flax_available():
						import jax
						import jax.numpy as jnp







@slow
@require_flax
class 				snake_case__(							unittest.TestCase							):







						'''simple docstring'''




						def 						lowercase_ (				self   ,						__lowercase   ,						__lowercase							)					->    Tuple:
										return f"""gaussian_noise_s={seed}_shape={"_".join([str(__lowercase							) for s in shape]							)}.npy"""




						def 						lowercase_ (				self							)					->    int:
										# clean up the VRAM after each test
										super().tearDown()
										gc.collect()




						def 						lowercase_ (				self   ,						__lowercase=0   ,						__lowercase=(4, 4, 6_4, 6_4)   ,						__lowercase=False							)					->    Union[str, Any]:
										lowerCAmelCase_ :      Union[str, Any]    				=				jnp.bfloataa if fpaa else jnp.floataa
										lowerCAmelCase_ :      List[str]    				=				jnp.array(load_hf_numpy(self.get_file_format(__lowercase   ,						__lowercase							)							)   ,						dtype=__lowercase							)
										return image




						def 						lowercase_ (				self   ,						__lowercase=False   ,						__lowercase="CompVis/stable-diffusion-v1-4"							)					->    Union[str, Any]:
										lowerCAmelCase_ :      Tuple    				=				jnp.bfloataa if fpaa else jnp.floataa
										lowerCAmelCase_ :      Optional[int]    				=				'''bf16''' if fpaa else None

										lowerCAmelCase_ :      List[str]    				=				FlaxUNetaDConditionModel.from_pretrained(
										    __lowercase   ,						subfolder='''unet'''   ,						dtype=__lowercase   ,						revision=__lowercase							)
										return model, params




						def 						lowercase_ (				self   ,						__lowercase=0   ,						__lowercase=(4, 7_7, 7_6_8)   ,						__lowercase=False							)					->    Union[str, Any]:
										lowerCAmelCase_ :      Union[str, Any]    				=				jnp.bfloataa if fpaa else jnp.floataa
										lowerCAmelCase_ :      List[str]    				=				jnp.array(load_hf_numpy(self.get_file_format(__lowercase   ,						__lowercase							)							)   ,						dtype=__lowercase							)
										return hidden_states




						@parameterized.expand(
						    [
						        # fmt: off
						        [8_3, 4, [-0.23_23, -0.13_04, 0.08_13, -0.30_93, -0.09_19, -0.15_71, -0.11_25, -0.58_06]],
						        [1_7, 0.55, [-0.08_31, -0.24_43, 0.09_01, -0.09_19, 0.33_96, 0.01_03, -0.37_43, 0.07_01]],
						        [8, 0.89, [-0.48_63, 0.08_59, 0.08_75, -0.16_58, 0.91_99, -0.01_14, 0.48_39, 0.46_39]],
						        [3, 1_0_0_0, [-0.56_49, 0.24_02, -0.55_18, 0.12_48, 1.13_28, -0.24_43, -0.03_25, -1.00_78]],
						        # fmt: on
						    ]							)
						def 						lowercase_ (				self   ,						__lowercase   ,						__lowercase   ,						__lowercase							)					->    Any:
										lowerCAmelCase_ :      Dict    				=				self.get_unet_model(model_id='''CompVis/stable-diffusion-v1-4'''   ,						fpaa=__lowercase							)
										lowerCAmelCase_ :      str    				=				self.get_latents(__lowercase   ,						fpaa=__lowercase							)
										lowerCAmelCase_ :      Optional[Any]    				=				self.get_encoder_hidden_states(__lowercase   ,						fpaa=__lowercase							)

										lowerCAmelCase_ :      List[Any]    				=				model.apply(
										    {'''params''': params}   ,						__lowercase   ,						jnp.array(__lowercase   ,						dtype=jnp.intaa							)   ,						encoder_hidden_states=__lowercase   ,						).sample

										assert sample.shape == latents.shape

										lowerCAmelCase_ :      Optional[int]    				=				jnp.asarray(jax.device_get((sample[-1, -2:, -2:, :2].flatten())							)   ,						dtype=jnp.floataa							)
										lowerCAmelCase_ :      str    				=				jnp.array(__lowercase   ,						dtype=jnp.floataa							)

										# Found torch (float16) and flax (bfloat16) outputs to be within this tolerance, in the same hardware
										assert jnp.allclose(__lowercase   ,						__lowercase   ,						atol=1e-2							)




						@parameterized.expand(
						    [
						        # fmt: off
						        [8_3, 4, [0.15_14, 0.08_07, 0.16_24, 0.10_16, -0.18_96, 0.02_63, 0.06_77, 0.23_10]],
						        [1_7, 0.55, [0.11_64, -0.02_16, 0.01_70, 0.15_89, -0.31_20, 0.10_05, -0.05_81, -0.14_58]],
						        [8, 0.89, [-0.17_58, -0.01_69, 0.10_04, -0.14_11, 0.13_12, 0.11_03, -0.19_96, 0.21_39]],
						        [3, 1_0_0_0, [0.12_14, 0.03_52, -0.07_31, -0.15_62, -0.09_94, -0.09_06, -0.23_40, -0.05_39]],
						        # fmt: on
						    ]							)
						def 						lowercase_ (				self   ,						__lowercase   ,						__lowercase   ,						__lowercase							)					->    Any:
										lowerCAmelCase_ :      Dict    				=				self.get_unet_model(model_id='''stabilityai/stable-diffusion-2'''   ,						fpaa=__lowercase							)
										lowerCAmelCase_ :      Optional[Any]    				=				self.get_latents(__lowercase   ,						shape=(4, 4, 9_6, 9_6)   ,						fpaa=__lowercase							)
										lowerCAmelCase_ :      List[str]    				=				self.get_encoder_hidden_states(__lowercase   ,						shape=(4, 7_7, 1_0_2_4)   ,						fpaa=__lowercase							)

										lowerCAmelCase_ :      List[Any]    				=				model.apply(
										    {'''params''': params}   ,						__lowercase   ,						jnp.array(__lowercase   ,						dtype=jnp.intaa							)   ,						encoder_hidden_states=__lowercase   ,						).sample

										assert sample.shape == latents.shape

										lowerCAmelCase_ :      List[Any]    				=				jnp.asarray(jax.device_get((sample[-1, -2:, -2:, :2].flatten())							)   ,						dtype=jnp.floataa							)
										lowerCAmelCase_ :      Tuple    				=				jnp.array(__lowercase   ,						dtype=jnp.floataa							)

										# Found torch (float16) and flax (bfloat16) outputs to be within this tolerance, on the same hardware
										assert jnp.allclose(__lowercase   ,						__lowercase   ,						atol=1e-2							)



from math import sqrt



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

				lowerCAmelCase_ :      str    				=				True

				# 0 and 1 are none primes.
				if number <= 1:
								lowerCAmelCase_ :      List[Any]    				=				False

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

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

				return status



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[str]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n > 2), "'N' must been an int and > 2"

				# beginList: contains all natural numbers from 2 up to N
				lowerCAmelCase_ :      Optional[Any]    				=				list(range(2 ,   n + 1 ) )

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

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

    # filters actual prime numbers.
				lowerCAmelCase_ :      List[str]    				=				[x for x in begin_list if x != 0]

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> int:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n > 2), "'N' must been an int and > 2"

				lowerCAmelCase_ :      List[str]    				=				[]

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

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Optional[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and number >= 0, "'number' must been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				[]  # this list will be returns of the function.

				# potential prime number factors.

				lowerCAmelCase_ :      Any    				=				2

				lowerCAmelCase_ :      List[str]    				=				number

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

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

				else:
								ans.append(lowerCAmelCase_ )

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				0

				# prime factorization of 'number'
				lowerCAmelCase_ :      Optional[int]    				=				prime_factorization(lowerCAmelCase_ )

				lowerCAmelCase_ :      Dict    				=				max(lowerCAmelCase_ )

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> str:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				0

				# prime factorization of 'number'
				lowerCAmelCase_ :      int    				=				prime_factorization(lowerCAmelCase_ )

				lowerCAmelCase_ :      Union[str, Any]    				=				min(lowerCAmelCase_ )

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Dict:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'number' must been an int"
				assert isinstance(number % 2 == 0 ,   lowerCAmelCase_ ), "compare bust been from type bool"

				return number % 2 == 0



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

				return number % 2 != 0



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (number > 2) and is_even(lowerCAmelCase_ )
				), "'number' must been an int, even and > 2"

				lowerCAmelCase_ :      Union[str, Any]    				=				[]  # this list will returned

				# creates a list of prime numbers between 2 up to 'number'
				lowerCAmelCase_ :      List[Any]    				=				get_prime_numbers(lowerCAmelCase_ )
				lowerCAmelCase_ :      Any    				=				len(lowerCAmelCase_ )

				# run variable for while-loops.
				lowerCAmelCase_ :      List[Any]    				=				0
				lowerCAmelCase_ :      List[Any]    				=				None

				# exit variable. for break up the loops
				lowerCAmelCase_ :      int    				=				True

				while i < len_pn and loop:
								lowerCAmelCase_ :      Tuple    				=				i + 1

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

												j += 1

								i += 1

				# precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (len(lowerCAmelCase_ ) == 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 (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Optional[int]:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (numbera >= 0)
				    and (numbera >= 0)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_ :      List[str]    				=				0

				while numbera != 0:
								lowerCAmelCase_ :      int    				=				numbera % numbera
								lowerCAmelCase_ :      Union[str, Any]    				=				numbera
								lowerCAmelCase_ :      Tuple    				=				rest

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

				return numbera



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Any:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (numbera >= 1)
				    and (numbera >= 1)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_ :      Dict    				=				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'
								lowerCAmelCase_ :      Tuple    				=				prime_factorization(lowerCAmelCase_ )
								lowerCAmelCase_ :      str    				=				prime_factorization(lowerCAmelCase_ )

				elif numbera == 1 or numbera == 1:
								lowerCAmelCase_ :      List[Any]    				=				[]
								lowerCAmelCase_ :      List[Any]    				=				[]
								lowerCAmelCase_ :      str    				=				max(lowerCAmelCase_ ,   lowerCAmelCase_ )

				lowerCAmelCase_ :      str    				=				0
				lowerCAmelCase_ :      List[str]    				=				0

				lowerCAmelCase_ :      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:
																lowerCAmelCase_ :      str    				=				prime_fac_a.count(lowerCAmelCase_ )
																lowerCAmelCase_ :      List[str]    				=				prime_fac_a.count(lowerCAmelCase_ )

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

												else:
																lowerCAmelCase_ :      Dict    				=				prime_fac_a.count(lowerCAmelCase_ )

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

												done.append(lowerCAmelCase_ )

    # iterates through primeFac2
				for n in prime_fac_a:
								if n not in done:
												lowerCAmelCase_ :      Optional[int]    				=				prime_fac_a.count(lowerCAmelCase_ )

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

												done.append(lowerCAmelCase_ )

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Dict:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'number' must been a positive int"

				lowerCAmelCase_ :      Optional[int]    				=				0
				lowerCAmelCase_ :      Optional[int]    				=				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(lowerCAmelCase_ ):
												ans += 1

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Dict:
				assert (
				    is_prime(lowerCAmelCase_ ) and is_prime(lowerCAmelCase_ ) and (p_number_a < p_number_a)
				), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

				lowerCAmelCase_ :      str    				=				p_number_a + 1  # jump to the next number

				lowerCAmelCase_ :      Dict    				=				[]  # this list will be returns.

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

				while number < p_number_a:
								ans.append(lowerCAmelCase_ )

								number += 1

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

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

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



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[str]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 1), "'n' must been int and >= 1"

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

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

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

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number > 1
				), "'number' must been an int and >= 1"

				lowerCAmelCase_ :      Tuple    				=				get_divisors(lowerCAmelCase_ )

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

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



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Any:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (denominator != 0)
				), "The arguments must been from type int and 'denominator' != 0"

				# build the greatest common divisor of numerator and denominator.
				lowerCAmelCase_ :      List[str]    				=				gcd(abs(lowerCAmelCase_ ) ,   abs(lowerCAmelCase_ ) )

				# precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    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 (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'n' must been a int and >= 0"

				lowerCAmelCase_ :      Tuple    				=				1  # this will be return.

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

				return ans




def 			lowerCAmelCase (		lowerCAmelCase_ )-> Tuple:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'n' must been an int and >= 0"

				lowerCAmelCase_ :      Tuple    				=				0
				lowerCAmelCase_ :      Optional[Any]    				=				1
				lowerCAmelCase_ :      Tuple    				=				1  # this will be return

				for _ in range(n - 1 ):
								lowerCAmelCase_ :      Any    				=				ans
								ans += fiba
								lowerCAmelCase_ :      Dict    				=				tmp

				return ans