



from __future__ import annotations

class 	lowerCamelCase_    :






						'''simple docstring'''







						def __init__(	self      :			int	,	__lowerCamelCase      :			list[list[int]] )      ->				List[Any]:
									A							:					Optional[int]              =						TypeError(
									    "Matrices must be formed from a list of zero or more lists containing at "
									    "least one and the same number of values, each of which must be of type "
									    "int or float." )
									if len(__lowerCamelCase ) != 0:
												A							:					Optional[Any]              =						len(rows[0] )
												if cols == 0:
															raise error
												for row in rows:
															if len(__lowerCamelCase ) != cols:
																		raise error
															for value in row:
																		if not isinstance(__lowerCamelCase	,	(int, float) ):
																					raise error
												A							:					Tuple              =						rows
									else:
												A							:					Dict              =						[]







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Dict )      ->				list[list[int]]:
									return [[row[i] for row in self.rows] for i in range(len(self.rows[0] ) )]







						@property
						def 			SCREAMING_SNAKE_CASE__		(	self      :			str )      ->				int:
									return len(self.rows )







						@property
						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[int] )      ->				int:
									return len(self.rows[0] )







						@property
						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[int] )      ->				tuple[int, int]:
									return (self.num_rows, self.num_columns)







						@property
						def 			SCREAMING_SNAKE_CASE__		(	self      :			Union[str, Any] )      ->				bool:
									return self.order[0] == self.order[1]







						def 			SCREAMING_SNAKE_CASE__		(	self      :			str )      ->				Matrix:
									A							:					int              =						[
									    [0 if column_num != row_num else 1 for column_num in range(self.num_rows )]
									    for row_num in range(self.num_rows )
									]
									return Matrix(__lowerCamelCase )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			List[str] )      ->				int:
									if not self.is_square:
												return 0
									if self.order == (0, 0):
												return 1
									if self.order == (1, 1):
												return int(self.rows[0][0] )
									if self.order == (2, 2):
												return int(
												    (self.rows[0][0] * self.rows[1][1])
												    - (self.rows[0][1] * self.rows[1][0]) )
									else:
												return sum(
												    self.rows[0][column] * self.cofactors().rows[0][column]
												    for column in range(self.num_columns ) )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Dict )      ->				bool:
									return bool(self.determinant() )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Tuple	,	__lowerCamelCase      :			int	,	__lowerCamelCase      :			int )      ->				int:
									A							:					Optional[Any]              =						[
									    [
									        self.rows[other_row][other_column]
									        for other_column in range(self.num_columns )
									        if other_column != column
									    ]
									    for other_row in range(self.num_rows )
									    if other_row != row
									]
									return Matrix(__lowerCamelCase ).determinant()







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Any	,	__lowerCamelCase      :			int	,	__lowerCamelCase      :			int )      ->				int:
									if (row + column) % 2 == 0:
												return self.get_minor(__lowerCamelCase	,	__lowerCamelCase )
									return -1 * self.get_minor(__lowerCamelCase	,	__lowerCamelCase )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[int] )      ->				Matrix:
									return Matrix(
									    [
									        [self.get_minor(__lowerCamelCase	,	__lowerCamelCase ) for column in range(self.num_columns )]
									        for row in range(self.num_rows )
									    ] )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			List[str] )      ->				Matrix:
									return Matrix(
									    [
									        [
									            self.minors().rows[row][column]
									            if (row + column) % 2 == 0
									            else self.minors().rows[row][column] * -1
									            for column in range(self.minors().num_columns )
									        ]
									        for row in range(self.minors().num_rows )
									    ] )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[int] )      ->				Matrix:
									A							:					Tuple              =						[
									    [self.cofactors().rows[column][row] for column in range(self.num_columns )]
									    for row in range(self.num_rows )
									]
									return Matrix(__lowerCamelCase )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[Any] )      ->				Matrix:
									A							:					List[str]              =						self.determinant()
									if not determinant:
												raise TypeError("Only matrices with a non-zero determinant have an inverse" )
									return self.adjugate() * (1 / determinant)







						def __repr__(	self      :			Optional[Any] )      ->				str:
									return str(self.rows )







						def __str__(	self      :			str )      ->				str:
									if self.num_rows == 0:
												return "[]"
									if self.num_rows == 1:
												return "[[" + ". ".join(str(self.rows[0] ) ) + "]]"
									return (
									    "["
									    + "\n ".join(
									        [
									            "[" + ". ".join([str(__lowerCamelCase ) for value in row] ) + ".]"
									            for row in self.rows
									        ] )
									    + "]"
									)







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[Any]	,	__lowerCamelCase      :			list[int]	,	__lowerCamelCase      :			int | None = None )      ->				None:
									A							:					Dict              =						TypeError("Row must be a list containing all ints and/or floats" )
									if not isinstance(__lowerCamelCase	,	__lowerCamelCase ):
												raise type_error
									for value in row:
												if not isinstance(__lowerCamelCase	,	(int, float) ):
															raise type_error
									if len(__lowerCamelCase ) != self.num_columns:
												raise ValueError(
												    "Row must be equal in length to the other rows in the matrix" )
									if position is None:
												self.rows.append(__lowerCamelCase )
									else:
												A							:					List[str]              =						self.rows[0:position] + [row] + self.rows[position:]







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[Any]	,	__lowerCamelCase      :			list[int]	,	__lowerCamelCase      :			int | None = None )      ->				None:
									A							:					List[Any]              =						TypeError(
									    "Column must be a list containing all ints and/or floats" )
									if not isinstance(__lowerCamelCase	,	__lowerCamelCase ):
												raise type_error
									for value in column:
												if not isinstance(__lowerCamelCase	,	(int, float) ):
															raise type_error
									if len(__lowerCamelCase ) != self.num_rows:
												raise ValueError(
												    "Column must be equal in length to the other columns in the matrix" )
									if position is None:
												A							:					List[Any]              =						[self.rows[i] + [column[i]] for i in range(self.num_rows )]
									else:
												A							:					str              =						[
												    self.rows[i][0:position] + [column[i]] + self.rows[i][position:]
												    for i in range(self.num_rows )
												]







						def __eq__(	self      :			Tuple	,	__lowerCamelCase      :			object )      ->				bool:
									if not isinstance(__lowerCamelCase	,	__lowerCamelCase ):
												return NotImplemented
									return self.rows == other.rows







						def __ne__(	self      :			List[Any]	,	__lowerCamelCase      :			object )      ->				bool:
									return not self == other







						def __neg__(	self      :			List[str] )      ->				Matrix:
									return self * -1







						def __add__(	self      :			Union[str, Any]	,	__lowerCamelCase      :			Matrix )      ->				Matrix:
									if self.order != other.order:
												raise ValueError("Addition requires matrices of the same order" )
									return Matrix(
									    [
									        [self.rows[i][j] + other.rows[i][j] for j in range(self.num_columns )]
									        for i in range(self.num_rows )
									    ] )







						def __sub__(	self      :			Optional[Any]	,	__lowerCamelCase      :			Matrix )      ->				Matrix:
									if self.order != other.order:
												raise ValueError("Subtraction requires matrices of the same order" )
									return Matrix(
									    [
									        [self.rows[i][j] - other.rows[i][j] for j in range(self.num_columns )]
									        for i in range(self.num_rows )
									    ] )







						def __mul__(	self      :			Tuple	,	__lowerCamelCase      :			Matrix | int | float )      ->				Matrix:
									if isinstance(__lowerCamelCase	,	(int, float) ):
												return Matrix(
												    [[int(element * other ) for element in row] for row in self.rows] )
									elif isinstance(__lowerCamelCase	,	__lowerCamelCase ):
												if self.num_columns != other.num_rows:
															raise ValueError(
															    "The number of columns in the first matrix must "
															    "be equal to the number of rows in the second" )
												return Matrix(
												    [
												        [Matrix.dot_product(__lowerCamelCase	,	__lowerCamelCase ) for column in other.columns()]
												        for row in self.rows
												    ] )
									else:
												raise TypeError(
												    "A Matrix can only be multiplied by an int, float, or another matrix" )







						def __pow__(	self      :			List[Any]	,	__lowerCamelCase      :			int )      ->				Matrix:
									if not isinstance(__lowerCamelCase	,	__lowerCamelCase ):
												raise TypeError("A Matrix can only be raised to the power of an int" )
									if not self.is_square:
												raise ValueError("Only square matrices can be raised to a power" )
									if other == 0:
												return self.identity()
									if other < 0:
												if self.is_invertable():
															return self.inverse() ** (-other)
												raise ValueError(
												    "Only invertable matrices can be raised to a negative power" )
									A							:					Union[str, Any]              =						self
									for _ in range(other - 1 ):
												result *= self
									return result







						@classmethod
						def 			SCREAMING_SNAKE_CASE__		(	cls      :			List[Any]	,	__lowerCamelCase      :			list[int]	,	__lowerCamelCase      :			list[int] )      ->				int:
									return sum(row[i] * column[i] for i in range(len(__lowerCamelCase ) ) )


if __name__ == "__main__":
							import doctest

							doctest.testmod()




import importlib
import inspect
import json
import os
import re
import shutil
import sys
from pathlib import Path
from typing import Dict, Optional, Union
from urllib import request

from huggingface_hub import HfFolder, cached_download, hf_hub_download, model_info
from packaging import version

from .. import __version__
from . import DIFFUSERS_DYNAMIC_MODULE_NAME, HF_MODULES_CACHE, logging


__SCREAMING_SNAKE_CASE           =  (
    """https://raw.githubusercontent.com/huggingface/diffusers/{revision}/examples/community/{pipeline}.py"""
)


__SCREAMING_SNAKE_CASE           =  logging.get_logger(__name__)  # pylint: disable=invalid-name




def 	UpperCAmelCase   (						):
			A							:					Union[str, Any]              =						"https://pypi.org/pypi/diffusers/json"
			A							:					List[Any]              =						json.loads(request.urlopen(_lowerCamelCase    ).read()    )["releases"].keys()
			return sorted(_lowerCamelCase ,    key=lambda _lowerCamelCase    : version.Version(_lowerCamelCase    )    )




def 	UpperCAmelCase   (						):
			# This function has already been executed if HF_MODULES_CACHE already is in the Python path.
			if HF_MODULES_CACHE in sys.path:
						return

			sys.path.append(_lowerCamelCase    )
			os.makedirs(_lowerCamelCase ,    exist_ok=_lowerCamelCase    )
			A							:					List[Any]              =						Path(_lowerCamelCase    ) / "__init__.py"
			if not init_path.exists():
						init_path.touch()




def 	UpperCAmelCase   (						_lowerCamelCase    ):
			init_hf_modules()
			A							:					Tuple              =						Path(_lowerCamelCase    ) / name
			# If the parent module does not exist yet, recursively create it.
			if not dynamic_module_path.parent.exists():
						create_dynamic_module(dynamic_module_path.parent    )
			os.makedirs(_lowerCamelCase ,    exist_ok=_lowerCamelCase    )
			A							:					Optional[int]              =						dynamic_module_path / "__init__.py"
			if not init_path.exists():
						init_path.touch()




def 	UpperCAmelCase   (						_lowerCamelCase    ):
			with open(_lowerCamelCase ,    "r" ,    encoding="utf-8"    ) as f:
						A							:					Union[str, Any]              =						f.read()

			# Imports of the form `import .xxx`
			A							:					Union[str, Any]              =						re.findall("^\s*import\s+\.(\S+)\s*$" ,    _lowerCamelCase ,    flags=re.MULTILINE    )
			# Imports of the form `from .xxx import yyy`
			relative_imports += re.findall("^\s*from\s+\.(\S+)\s+import" ,    _lowerCamelCase ,    flags=re.MULTILINE    )
			# Unique-ify
			return list(set(_lowerCamelCase    )    )




def 	UpperCAmelCase   (						_lowerCamelCase    ):
			A							:					Optional[int]              =						False
			A							:					Tuple              =						[module_file]
			A							:					Optional[int]              =						[]

			# Let's recurse through all relative imports
			while not no_change:
						A							:					Optional[Any]              =						[]
						for f in files_to_check:
									new_imports.extend(get_relative_imports(_lowerCamelCase    )    )

						A							:					Optional[Any]              =						Path(_lowerCamelCase    ).parent
						A							:					List[str]              =						[str(module_path / m    ) for m in new_imports]
						A							:					Optional[Any]              =						[f for f in new_import_files if f not in all_relative_imports]
						A							:					Union[str, Any]              =						[f"""{f}.py""" for f in new_import_files]

						A							:					Tuple              =						len(_lowerCamelCase    ) == 0
						all_relative_imports.extend(_lowerCamelCase    )

			return all_relative_imports




def 	UpperCAmelCase   (						_lowerCamelCase    ):
			with open(_lowerCamelCase ,    "r" ,    encoding="utf-8"    ) as f:
						A							:					Dict              =						f.read()

			# Imports of the form `import xxx`
			A							:					List[str]              =						re.findall("^\s*import\s+(\S+)\s*$" ,    _lowerCamelCase ,    flags=re.MULTILINE    )
			# Imports of the form `from xxx import yyy`
			imports += re.findall("^\s*from\s+(\S+)\s+import" ,    _lowerCamelCase ,    flags=re.MULTILINE    )
			# Only keep the top-level module
			A							:					Optional[int]              =						[imp.split("."    )[0] for imp in imports if not imp.startswith("."    )]

			# Unique-ify and test we got them all
			A							:					Any              =						list(set(_lowerCamelCase    )    )
			A							:					Tuple              =						[]
			for imp in imports:
						try:
									importlib.import_module(_lowerCamelCase    )
						except ImportError:
									missing_packages.append(_lowerCamelCase    )

			if len(_lowerCamelCase    ) > 0:
						raise ImportError(
						    "This modeling file requires the following packages that were not found in your environment: "
						    f"""{", ".join(_lowerCamelCase    )}. Run `pip install {" ".join(_lowerCamelCase    )}`"""    )

			return get_relative_imports(_lowerCamelCase    )




def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase    ):
			A							:					int              =						module_path.replace(os.path.sep ,    "."    )
			A							:					Optional[Any]              =						importlib.import_module(_lowerCamelCase    )

			if class_name is None:
						return find_pipeline_class(_lowerCamelCase    )
			return getattr(_lowerCamelCase ,    _lowerCamelCase    )




def 	UpperCAmelCase   (						_lowerCamelCase    ):
			from ..pipelines import DiffusionPipeline

			A							:					int              =						dict(inspect.getmembers(_lowerCamelCase ,    inspect.isclass    )    )

			A							:					Union[str, Any]              =						None
			for cls_name, cls in cls_members.items():
						if (
						    cls_name != DiffusionPipeline.__name__
						    and issubclass(cls ,    _lowerCamelCase    )
						    and cls.__module__.split("."    )[0] != "diffusers"
						):
									if pipeline_class is not None:
												raise ValueError(
												    f"""Multiple classes that inherit from {DiffusionPipeline.__name__} have been found:"""
												    f""" {pipeline_class.__name__}, and {cls_name}. Please make sure to define only one in"""
												    f""" {loaded_module}."""    )
									A							:					Any              =						cls

			return pipeline_class




def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase ,    _lowerCamelCase = None ,    _lowerCamelCase = False ,    _lowerCamelCase = False ,    _lowerCamelCase = None ,    _lowerCamelCase = None ,    _lowerCamelCase = None ,    _lowerCamelCase = False ,    ):
			A							:					List[Any]              =						str(_lowerCamelCase    )

			A							:					Any              =						os.path.join(_lowerCamelCase ,    _lowerCamelCase    )

			if os.path.isfile(_lowerCamelCase    ):
						A							:					Union[str, Any]              =						module_file_or_url
						A							:					Any              =						"local"
			elif pretrained_model_name_or_path.count("/"    ) == 0:
						A							:					Optional[Any]              =						get_diffusers_versions()
						# cut ".dev0"
						A							:					Union[str, Any]              =						"v" + ".".join(__version__.split("."    )[:3]    )

						# retrieve github version that matches
						if revision is None:
									A							:					List[Any]              =						latest_version if latest_version[1:] in available_versions else "main"
									logger.info(f"""Defaulting to latest_version: {revision}."""    )
						elif revision in available_versions:
									A							:					Optional[Any]              =						f"""v{revision}"""
						elif revision == "main":
									A							:					Dict              =						revision
						else:
									raise ValueError(
									    f"""`custom_revision`: {revision} does not exist. Please make sure to choose one of"""
									    f""" {", ".join(available_versions + ["main"]    )}."""    )

						# community pipeline on GitHub
						A							:					Dict              =						COMMUNITY_PIPELINES_URL.format(revision=_lowerCamelCase ,    pipeline=_lowerCamelCase    )
						try:
									A							:					Optional[int]              =						cached_download(
									    _lowerCamelCase ,    cache_dir=_lowerCamelCase ,    force_download=_lowerCamelCase ,    proxies=_lowerCamelCase ,    resume_download=_lowerCamelCase ,    local_files_only=_lowerCamelCase ,    use_auth_token=_lowerCamelCase ,    )
									A							:					Optional[Any]              =						"git"
									A							:					Any              =						pretrained_model_name_or_path + ".py"
						except EnvironmentError:
									logger.error(f"""Could not locate the {module_file} inside {pretrained_model_name_or_path}."""    )
									raise
			else:
						try:
									# Load from URL or cache if already cached
									A							:					Any              =						hf_hub_download(
									    _lowerCamelCase ,    _lowerCamelCase ,    cache_dir=_lowerCamelCase ,    force_download=_lowerCamelCase ,    proxies=_lowerCamelCase ,    resume_download=_lowerCamelCase ,    local_files_only=_lowerCamelCase ,    use_auth_token=_lowerCamelCase ,    )
									A							:					Optional[Any]              =						os.path.join("local" ,    "--".join(pretrained_model_name_or_path.split("/"    )    )    )
						except EnvironmentError:
									logger.error(f"""Could not locate the {module_file} inside {pretrained_model_name_or_path}."""    )
									raise

    # Check we have all the requirements in our environment
			A							:					List[str]              =						check_imports(_lowerCamelCase    )

			# Now we move the module inside our cached dynamic modules.
			A							:					List[str]              =						DIFFUSERS_DYNAMIC_MODULE_NAME + os.path.sep + submodule
			create_dynamic_module(_lowerCamelCase    )
			A							:					Optional[int]              =						Path(_lowerCamelCase    ) / full_submodule
			if submodule == "local" or submodule == "git":
						# We always copy local files (we could hash the file to see if there was a change, and give them the name of
						# that hash, to only copy when there is a modification but it seems overkill for now).
						# The only reason we do the copy is to avoid putting too many folders in sys.path.
						shutil.copy(_lowerCamelCase ,    submodule_path / module_file    )
						for module_needed in modules_needed:
									A							:					int              =						f"""{module_needed}.py"""
									shutil.copy(os.path.join(_lowerCamelCase ,    _lowerCamelCase    ) ,    submodule_path / module_needed    )
			else:
						# Get the commit hash
						# TODO: we will get this info in the etag soon, so retrieve it from there and not here.
						if isinstance(_lowerCamelCase ,    _lowerCamelCase    ):
									A							:					Optional[Any]              =						use_auth_token
						elif use_auth_token is True:
									A							:					Dict              =						HfFolder.get_token()
						else:
									A							:					Tuple              =						None

						A							:					List[str]              =						model_info(_lowerCamelCase ,    revision=_lowerCamelCase ,    token=_lowerCamelCase    ).sha

						# The module file will end up being placed in a subfolder with the git hash of the repo. This way we get the
						# benefit of versioning.
						A							:					str              =						submodule_path / commit_hash
						A							:					List[str]              =						full_submodule + os.path.sep + commit_hash
						create_dynamic_module(_lowerCamelCase    )

						if not (submodule_path / module_file).exists():
									shutil.copy(_lowerCamelCase ,    submodule_path / module_file    )
						# Make sure we also have every file with relative
						for module_needed in modules_needed:
									if not (submodule_path / module_needed).exists():
												get_cached_module_file(
												    _lowerCamelCase ,    f"""{module_needed}.py""" ,    cache_dir=_lowerCamelCase ,    force_download=_lowerCamelCase ,    resume_download=_lowerCamelCase ,    proxies=_lowerCamelCase ,    use_auth_token=_lowerCamelCase ,    revision=_lowerCamelCase ,    local_files_only=_lowerCamelCase ,    )
			return os.path.join(_lowerCamelCase ,    _lowerCamelCase    )






def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase ,    _lowerCamelCase = None ,    _lowerCamelCase = None ,    _lowerCamelCase = False ,    _lowerCamelCase = False ,    _lowerCamelCase = None ,    _lowerCamelCase = None ,    _lowerCamelCase = None ,    _lowerCamelCase = False ,    **_lowerCamelCase ,    ):
			A							:					int              =						get_cached_module_file(
			    _lowerCamelCase ,    _lowerCamelCase ,    cache_dir=_lowerCamelCase ,    force_download=_lowerCamelCase ,    resume_download=_lowerCamelCase ,    proxies=_lowerCamelCase ,    use_auth_token=_lowerCamelCase ,    revision=_lowerCamelCase ,    local_files_only=_lowerCamelCase ,    )
			return get_class_in_module(_lowerCamelCase ,    final_module.replace(".py" ,    ""    )    )