



'''simple docstring'''





def      A (       A_							:					Tuple    ,							A_							:					Any       ):
						return (pointa[0] - pointa[0]) ** 2 + (pointa[1] - pointa[1]) ** 2

def      A (       A_							:					Tuple    ,							A_							:					List[Any]=0       ):
						return sorted(A_    ,							key=lambda A_       : x[column]       )

def      A (       A_							:					Optional[int]    ,							A_							:					int    ,							A_							:					List[str]=float('''inf'''       )       ):

						for i in range(points_counts - 1       ):
												for j in range(i + 1    ,							A_       ):
																		snake_case       :     Optional[int] =    euclidean_distance_sqr(points[i]    ,							points[j]       )
																		if current_dis < min_dis:
																								snake_case       :     Tuple =    current_dis
						return min_dis

def      A (       A_							:					Any    ,							A_							:					List[Any]    ,							A_							:					Any=float('''inf'''       )       ):

						for i in range(min(6    ,							points_counts - 1       )    ,							A_       ):
												for j in range(max(0    ,							i - 6       )    ,							A_       ):
																		snake_case       :     Union[str, Any] =    euclidean_distance_sqr(points[i]    ,							points[j]       )
																		if current_dis < min_dis:
																								snake_case       :     Any =    current_dis
						return min_dis

def      A (       A_							:					Tuple    ,							A_							:					str    ,							A_							:					Optional[Any]       ):

						# base case
						if points_counts <= 3:
												return dis_between_closest_pair(A_    ,							A_       )

						# recursion
						snake_case       :     str =    points_counts // 2
						snake_case       :     str =    closest_pair_of_points_sqr(
						    A_    ,							points_sorted_on_y[:mid]    ,							A_       )
						snake_case       :     List[Any] =    closest_pair_of_points_sqr(
						    A_    ,							points_sorted_on_y[mid:]    ,							points_counts - mid       )
						snake_case       :     Any =    min(A_    ,							A_       )
						snake_case       :     Union[str, Any] =    []
						for point in points_sorted_on_x:
												if abs(point[0] - points_sorted_on_x[mid][0]       ) < closest_pair_dis:
																		cross_strip.append(A_       )

						snake_case       :     Any =    dis_between_closest_in_strip(
						    A_    ,							len(A_       )    ,							A_       )
						return min(A_    ,							A_       )

def      A (       A_							:					Optional[int]    ,							A_							:					int       ):
						snake_case       :     List[str] =    column_based_sort(A_    ,							column=0       )
						snake_case       :     Optional[Any] =    column_based_sort(A_    ,							column=1       )
						return (
						    closest_pair_of_points_sqr(
						        A_    ,							A_    ,							A_       )
						) ** 0.5


if __name__ == "__main__":
						UpperCAmelCase    					=   [(2, 3), (12, 30), (40, 50), (5, 1), (12, 10), (3, 4)]
						print("Distance:", closest_pair_of_points(points, len(points)))



'''simple docstring'''





import inspect
import re

from transformers.utils import direct_transformers_import


# All paths are set with the intent you should run this script from the root of the repo with the command
# python utils/check_config_docstrings.py
UpperCAmelCase    					=   "src/transformers"


# This is to make sure the transformers module imported is the one in the repo.
UpperCAmelCase    					=   direct_transformers_import(PATH_TO_TRANSFORMERS)

UpperCAmelCase    					=   transformers.models.auto.configuration_auto.CONFIG_MAPPING

# Regex pattern used to find the checkpoint mentioned in the docstring of `config_class`.
# For example, `[bert-base-uncased](https://huggingface.co/bert-base-uncased)`
UpperCAmelCase    					=   re.compile(r"\[(.+?)\]\((https://huggingface\.co/.+?)\)")


UpperCAmelCase    					=   {
    "DecisionTransformerConfig",
    "EncoderDecoderConfig",
    "MusicgenConfig",
    "RagConfig",
    "SpeechEncoderDecoderConfig",
    "TimmBackboneConfig",
    "VisionEncoderDecoderConfig",
    "VisionTextDualEncoderConfig",
    "LlamaConfig",
}

def      A (       A_							:					Union[str, Any]       ):
						snake_case       :     Tuple =    None

						# source code of `config_class`
						snake_case       :     Union[str, Any] =    inspect.getsource(A_       )
						snake_case       :     List[Any] =    _re_checkpoint.findall(A_       )

						# Each `checkpoint` is a tuple of a checkpoint name and a checkpoint link.
						# For example, `('bert-base-uncased', 'https://huggingface.co/bert-base-uncased')`
						for ckpt_name, ckpt_link in checkpoints:
												# allow the link to end with `/`
												if ckpt_link.endswith('''/'''       ):
																		snake_case       :     Optional[int] =    ckpt_link[:-1]

												# verify the checkpoint name corresponds to the checkpoint link
												snake_case       :     Dict =    F"""https://huggingface.co/{ckpt_name}"""
												if ckpt_link == ckpt_link_from_name:
																		snake_case       :     Dict =    ckpt_name
																		break

						return checkpoint

def      A (       ):
						snake_case       :     List[str] =    []

						for config_class in list(CONFIG_MAPPING.values()       ):
												# Skip deprecated models
												if "models.deprecated" in config_class.__module__:
																		continue
												snake_case       :     Tuple =    get_checkpoint_from_config_class(A_       )

												snake_case       :     Optional[Any] =    config_class.__name__
												if checkpoint is None and name not in CONFIG_CLASSES_TO_IGNORE_FOR_DOCSTRING_CHECKPOINT_CHECK:
																		configs_without_checkpoint.append(A_       )

						if len(A_       ) > 0:
												snake_case       :     Optional[int] =    '''\n'''.join(sorted(A_       )       )
												raise ValueError(F"""The following configurations don't contain any valid checkpoint:\n{message}"""       )


if __name__ == "__main__":
						check_config_docstrings_have_checkpoints()

