


"""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
snake_case__						:   Optional[Any]			 = '''src/transformers'''


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

snake_case__						:   Optional[int]			 = 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)`
snake_case__						:   Optional[int]			 = re.compile(R'''\[(.+?)\]\((https://huggingface\.co/.+?)\)''')


snake_case__						:   int			 = {
    '''DecisionTransformerConfig''',
    '''EncoderDecoderConfig''',
    '''MusicgenConfig''',
    '''RagConfig''',
    '''SpeechEncoderDecoderConfig''',
    '''TimmBackboneConfig''',
    '''VisionEncoderDecoderConfig''',
    '''VisionTextDualEncoderConfig''',
    '''LlamaConfig''',
}


def    _snake_case  (  _snake_case :	List[str]	):
      lowerCAmelCase    :		Dict				=      None

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

      # 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('''/'''	):
                  lowerCAmelCase    :		List[str]				=      ckpt_link[:-1]

            # verify the checkpoint name corresponds to the checkpoint link
            lowerCAmelCase    :		Optional[int]				=      f'''https://huggingface.co/{ckpt_name}'''
            if ckpt_link == ckpt_link_from_name:
                  lowerCAmelCase    :		List[str]				=      ckpt_name
                  break

      return checkpoint


def    _snake_case  (  ):
      lowerCAmelCase    :		List[Any]				=      []

      for config_class in list(CONFIG_MAPPING.values()	):
            # Skip deprecated models
            if "models.deprecated" in config_class.__module__:
                  continue
            lowerCAmelCase    :		int				=      get_checkpoint_from_config_class(_snake_case	)

            lowerCAmelCase    :		int				=      config_class.__name__
            if checkpoint is None and name not in CONFIG_CLASSES_TO_IGNORE_FOR_DOCSTRING_CHECKPOINT_CHECK:
                  configs_without_checkpoint.append(_snake_case	)

      if len(_snake_case	) > 0:
            lowerCAmelCase    :		Dict				=      '''\n'''.join(sorted(_snake_case	)	)
            raise ValueError(f'''The following configurations don\'t contain any valid checkpoint:\n{message}'''	)


if __name__ == "__main__":
 check_config_docstrings_have_checkpoints()






"""simple docstring"""





from __future__ import annotations

from decimal import Decimal

from numpy import array


def    _snake_case  (  _snake_case :	list[list[float]]	):
      lowerCAmelCase    :		str				=      Decimal

      # Check if the provided matrix has 2 rows and 2 columns
      # since this implementation only works for 2x2 matrices
      if len(_snake_case	) == 2 and len(matrix[0]	) == 2 and len(matrix[1]	) == 2:
            # Calculate the determinant of the matrix
            lowerCAmelCase    :		int				=      float(
                d(matrix[0][0]	) * d(matrix[1][1]	) - d(matrix[1][0]	) * d(matrix[0][1]	)	)
            if determinant == 0:
                  raise ValueError('''This matrix has no inverse.'''	)

            # Creates a copy of the matrix with swapped positions of the elements
            lowerCAmelCase    :		Optional[int]				=      [[0.0, 0.0], [0.0, 0.0]]
            lowerCAmelCase,					lowerCAmelCase    :		List[Any]				=      matrix[1][1], matrix[0][0]
            lowerCAmelCase,					lowerCAmelCase    :		Union[str, Any]				=      -matrix[1][0], -matrix[0][1]

            # Calculate the inverse of the matrix
            return [
                [(float(d(_snake_case	)	) / determinant) or 0.0 for n in row] for row in swapped_matrix
            ]
      elif (
          len(_snake_case	) == 3
          and len(matrix[0]	) == 3
          and len(matrix[1]	) == 3
          and len(matrix[2]	) == 3
      ):
            # Calculate the determinant of the matrix using Sarrus rule
            lowerCAmelCase    :		int				=      float(
                (
                    (d(matrix[0][0]	) * d(matrix[1][1]	) * d(matrix[2][2]	))
                    + (d(matrix[0][1]	) * d(matrix[1][2]	) * d(matrix[2][0]	))
                    + (d(matrix[0][2]	) * d(matrix[1][0]	) * d(matrix[2][1]	))
                )
                - (
                    (d(matrix[0][2]	) * d(matrix[1][1]	) * d(matrix[2][0]	))
                    + (d(matrix[0][1]	) * d(matrix[1][0]	) * d(matrix[2][2]	))
                    + (d(matrix[0][0]	) * d(matrix[1][2]	) * d(matrix[2][1]	))
                )	)
            if determinant == 0:
                  raise ValueError('''This matrix has no inverse.'''	)

            # Creating cofactor matrix
            lowerCAmelCase    :		Dict				=      [
                [d(0.0	), d(0.0	), d(0.0	)],
                [d(0.0	), d(0.0	), d(0.0	)],
                [d(0.0	), d(0.0	), d(0.0	)],
            ]
            lowerCAmelCase    :		List[str]				=      (d(matrix[1][1]	) * d(matrix[2][2]	)) - (
                d(matrix[1][2]	) * d(matrix[2][1]	)
            )
            lowerCAmelCase    :		Dict				=      -(
                (d(matrix[1][0]	) * d(matrix[2][2]	)) - (d(matrix[1][2]	) * d(matrix[2][0]	))
            )
            lowerCAmelCase    :		str				=      (d(matrix[1][0]	) * d(matrix[2][1]	)) - (
                d(matrix[1][1]	) * d(matrix[2][0]	)
            )
            lowerCAmelCase    :		Any				=      -(
                (d(matrix[0][1]	) * d(matrix[2][2]	)) - (d(matrix[0][2]	) * d(matrix[2][1]	))
            )
            lowerCAmelCase    :		Any				=      (d(matrix[0][0]	) * d(matrix[2][2]	)) - (
                d(matrix[0][2]	) * d(matrix[2][0]	)
            )
            lowerCAmelCase    :		Optional[int]				=      -(
                (d(matrix[0][0]	) * d(matrix[2][1]	)) - (d(matrix[0][1]	) * d(matrix[2][0]	))
            )
            lowerCAmelCase    :		Optional[int]				=      (d(matrix[0][1]	) * d(matrix[1][2]	)) - (
                d(matrix[0][2]	) * d(matrix[1][1]	)
            )
            lowerCAmelCase    :		Dict				=      -(
                (d(matrix[0][0]	) * d(matrix[1][2]	)) - (d(matrix[0][2]	) * d(matrix[1][0]	))
            )
            lowerCAmelCase    :		List[Any]				=      (d(matrix[0][0]	) * d(matrix[1][1]	)) - (
                d(matrix[0][1]	) * d(matrix[1][0]	)
            )

            # Transpose the cofactor matrix (Adjoint matrix)
            lowerCAmelCase    :		str				=      array(_snake_case	)
            for i in range(3	):
                  for j in range(3	):
                        lowerCAmelCase    :		Optional[Any]				=      cofactor_matrix[j][i]

        # Inverse of the matrix using the formula (1/determinant) * adjoint matrix
            lowerCAmelCase    :		Tuple				=      array(_snake_case	)
            for i in range(3	):
                  for j in range(3	):
                        inverse_matrix[i][j] /= d(_snake_case	)

        # Calculate the inverse of the matrix
            return [[float(d(_snake_case	)	) or 0.0 for n in row] for row in inverse_matrix]
      raise ValueError('''Please provide a matrix of size 2x2 or 3x3.'''	)


